default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Espitau
- > Home > Persons > Thomas Espitau
Publications
- 2024
[j6]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi:
Masking the GLP Lattice-Based Signature Scheme at Any Order. J. Cryptol. 37(1): 5 (2024)- 2022
- [c17]Thomas Espitau
, Pierre-Alain Fouque, François Gérard, Mélissa Rossi, Akira Takahashi, Mehdi Tibouchi, Alexandre Wallet, Yang Yu:
Mitaka: A Simpler, Parallelizable, Maskable Variant of Falcon. EUROCRYPT (3) 2022: 222-253 - 2021
- [c15]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Towards Faster Polynomial-Time Lattice Reduction. CRYPTO (2) 2021: 760-790 - [i22]Thomas Espitau, Pierre-Alain Fouque, François Gérard, Mélissa Rossi, Akira Takahashi, Mehdi Tibouchi, Alexandre Wallet, Yang Yu:
Mitaka: a simpler, parallelizable, maskable variant of Falcon. IACR Cryptol. ePrint Arch. 2021: 1486 (2021) - 2020
- [c14]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Fast Reduction of Algebraic Lattices over Cyclotomic Fields. CRYPTO (2) 2020: 155-185 - 2019
- [c12]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Mélissa Rossi, Mehdi Tibouchi:
GALACTICS: Gaussian Sampling for Lattice-Based Constant- Time Implementation of Cryptographic Signatures, Revisited. CCS 2019: 2147-2164 - [i17]Thomas Espitau, Paul Kirchner, Pierre-Alain Fouque:
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond. CoRR abs/1912.04586 (2019) - [i16]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Mélissa Rossi, Mehdi Tibouchi:
GALACTICS: Gaussian Sampling for Lattice-Based Constant-Time Implementation of Cryptographic Signatures, Revisited. IACR Cryptol. ePrint Arch. 2019: 511 (2019) - [i15]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond. IACR Cryptol. ePrint Arch. 2019: 1436 (2019) - 2018
- [j1]Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi:
Loop-Abort Faults on Lattice-Based Signature Schemes and Key Exchange Protocols. IEEE Trans. Computers 67(11): 1535-1549 (2018) - [c11]Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, Mehdi Tibouchi:
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. ASIACRYPT (1) 2018: 494-524 - [c9]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi:
Masking the GLP Lattice-Based Signature Scheme at Any Order. EUROCRYPT (2) 2018: 354-384 - [i13]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi:
Masking the GLP Lattice-Based Signature Scheme at Any Order. IACR Cryptol. ePrint Arch. 2018: 381 (2018) - [i12]Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, Mehdi Tibouchi:
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. IACR Cryptol. ePrint Arch. 2018: 822 (2018) - 2017
- [c8]Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi:
Side-Channel Attacks on BLISS Lattice-Based Signatures: Exploiting Branch Tracing against strongSwan and Electromagnetic Emanations in Microcontrollers. CCS 2017: 1857-1874 - [c7]Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme. EUROCRYPT (1) 2017: 60-88 - [i8]Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing generator in cyclotomic integer rings, A subfield algorithm for the Principal Ideal Problem in L(1/2) and application to cryptanalysis of a FHE scheme. IACR Cryptol. ePrint Arch. 2017: 142 (2017) - [i7]Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi:
Side-Channel Attacks on BLISS Lattice-Based Signatures - Exploiting Branch Tracing Against strongSwan and Electromagnetic Emanations in Microcontrollers. IACR Cryptol. ePrint Arch. 2017: 505 (2017) - 2016
- [c3]Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi:
Loop-Abort Faults on Lattice-Based Fiat-Shamir and Hash-and-Sign Signatures. SAC 2016: 140-158 - [i5]Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi:
Loop abort Faults on Lattice-Based Fiat-Shamir & Hash'n Sign signatures. IACR Cryptol. ePrint Arch. 2016: 449 (2016) - [i3]Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing generator in cyclotomic integer rings. IACR Cryptol. ePrint Arch. 2016: 957 (2016) - 2015
- [c2]Thomas Espitau, Pierre-Alain Fouque, Pierre Karpman:
Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE. CRYPTO (1) 2015: 683-701 - [i1]Thomas Espitau, Pierre-Alain Fouque, Pierre Karpman:
Higher-Order Differential Meet-in-The-Middle Preimage Attacks on SHA-1 and BLAKE. IACR Cryptol. ePrint Arch. 2015: 515 (2015)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
