default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Pornin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Thomas Pornin
:
A Prime-Order Group with Complete Formulas from Even-Order Elliptic Curves. IACR Commun. Cryptol. 1(1): 10 (2024)- 2023
- [i23]Thomas Pornin:
Improved Key Pair Generation for Falcon, BAT and Hawk. IACR Cryptol. ePrint Arch. 2023: 290 (2023) - [i22]Thomas Pornin:
Optimized Discrete Logarithm Computation for Faster Square Roots in Finite Fields. IACR Cryptol. ePrint Arch. 2023: 828 (2023) - [i21]Thomas Pornin:
Faster Complete Formulas for the GLS254 Binary Curve. IACR Cryptol. ePrint Arch. 2023: 1688 (2023) - 2022
- [j4]Pierre-Alain Fouque, Paul Kirchner, Thomas Pornin, Yang Yu:
BAT: Small and Fast KEM over NTRU Lattices. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(2): 240-265 (2022) - [i20]Pierre-Alain Fouque, Paul Kirchner, Thomas Pornin, Yang Yu:
BAT: Small and Fast KEM over NTRU Lattices. IACR Cryptol. ePrint Arch. 2022: 31 (2022) - [i19]Thomas Pornin:
EcGFp5: a Specialized Elliptic Curve. IACR Cryptol. ePrint Arch. 2022: 274 (2022) - [i18]Thomas Pornin:
Truncated EdDSA/ECDSA Signatures. IACR Cryptol. ePrint Arch. 2022: 938 (2022) - [i17]Thomas Pornin:
Double-Odd Jacobi Quartic. IACR Cryptol. ePrint Arch. 2022: 1052 (2022) - [i16]Thomas Pornin:
Point-Halving and Subgroup Membership in Twisted Edwards Curves. IACR Cryptol. ePrint Arch. 2022: 1164 (2022) - [i15]Thomas Pornin:
Efficient and Complete Formulas for Binary Curves. IACR Cryptol. ePrint Arch. 2022: 1325 (2022) - 2021
- [i14]Thomas Pornin:
Paradoxical Compression with Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2021: 1333 (2021) - 2020
- [j3]Anne Canteaut, Sébastien Duval, Gaëtan Leurent, María Naya-Plasencia, Léo Perrin, Thomas Pornin, André Schrottenloher:
Saturnin: a suite of lightweight symmetric algorithms for post-quantum security. IACR Trans. Symmetric Cryptol. 2020(S1): 160-207 (2020) - [i13]Thomas Pornin:
Efficient Elliptic Curve Operations On Microcontrollers With Finite Field Extensions. IACR Cryptol. ePrint Arch. 2020: 9 (2020) - [i12]Thomas Pornin:
Optimized Lattice Basis Reduction In Dimension 2, and Fast Schnorr and EdDSA Signature Verification. IACR Cryptol. ePrint Arch. 2020: 454 (2020) - [i11]Thomas Pornin:
Optimized Binary GCD for Modular Inversion. IACR Cryptol. ePrint Arch. 2020: 972 (2020) - [i10]Thomas Pornin:
Double-Odd Elliptic Curves. IACR Cryptol. ePrint Arch. 2020: 1558 (2020)
2010 – 2019
- 2019
- [c7]Thomas Pornin, Thomas Prest:
More Efficient Algorithms for the NTRU Key Generation Using the Field Norm. Public Key Cryptography (2) 2019: 504-533 - [i9]Thomas Pornin, Thomas Prest:
More Efficient Algorithms for the NTRU Key Generation using the Field Norm. IACR Cryptol. ePrint Arch. 2019: 15 (2019) - [i8]Thomas Pornin:
New Efficient, Constant-Time Implementations of Falcon. IACR Cryptol. ePrint Arch. 2019: 893 (2019) - 2015
- [i7]Thomas Pornin:
Optimizing MAKWA on GPU and CPU. IACR Cryptol. ePrint Arch. 2015: 678 (2015) - 2014
- [j2]Romain Alléaume, Cyril Branciard, Jan Bouda, Thierry Debuisschert, Mehrdad Dianati, Nicolas Gisin, Mark Godfrey, Philippe Grangier, Thomas Länger, Norbert Lütkenhaus, Christian Monyk, Philippe Painchault, Momtchil Peev, Andreas Poppe, Thomas Pornin, John G. Rarity, Renato Renner, Gregoire Ribordy, Michel Riguidel, Louis Salvail, Andrew J. Shields, Harald Weinfurter, Anton Zeilinger:
Using quantum key distribution for cryptographic purposes: A survey. Theor. Comput. Sci. 560: 62-81 (2014) - 2013
- [i6]Thomas Pornin:
Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA). RFC 6979: 1-79 (2013)
2000 – 2009
- 2009
- [i5]Romain Alléaume, Norbert Lütkenhaus, Renato Renner, Philippe Grangier, Thierry Debuisschert, Gregoire Ribordy, Nicolas Gisin, Philippe Painchault, Thomas Pornin, Louis Salvail, Michel Riguidel, Andrew J. Shields, Thomas Länger, Momtchil Peev, Mehrdad Dianati, Anthony Leverrier, Andreas Poppe, Jan Bouda, Cyril Branciard, Mark Godfrey, John G. Rarity, Harald Weinfurter, Anton Zeilinger, Christian Monyk:
Quantum key distribution and cryptography: a survey. Classical and Quantum Information Assurance Foundations and Practice 2009 - [i4]Emmanuel Bresson, Anne Canteaut, Benoît Chevallier-Mames, Christophe Clavier, Thomas Fuhr, Aline Gouget, Thomas Icart, Jean-François Misarsky, María Naya-Plasencia, Pascal Paillier, Thomas Pornin, Jean-René Reinhard, Céline Thuillet, Marion Videau:
Indifferentiability with Distinguishers: Why Shabal Does Not Require Ideal Ciphers. IACR Cryptol. ePrint Arch. 2009: 199 (2009) - 2008
- [p2]Côme Berbain, Olivier Billet, Anne Canteaut, Nicolas T. Courtois, Henri Gilbert, Louis Goubin, Aline Gouget, Louis Granboulan, Cédric Lauradoux, Marine Minier, Thomas Pornin, Hervé Sibert:
Sosemanuk, a Fast Software-Oriented Stream Cipher. The eSTREAM Finalists 2008: 98-118 - [p1]Côme Berbain, Olivier Billet, Anne Canteaut, Nicolas T. Courtois, Blandine Debraize, Henri Gilbert, Louis Goubin, Aline Gouget, Louis Granboulan, Cédric Lauradoux, Marine Minier, Thomas Pornin, Hervé Sibert:
Decimv2. The eSTREAM Finalists 2008: 140-151 - [i3]Côme Berbain, Olivier Billet, Anne Canteaut, Nicolas T. Courtois, Henri Gilbert, Louis Goubin, Aline Gouget, Louis Granboulan, Cédric Lauradoux, Marine Minier, Thomas Pornin, Hervé Sibert:
SOSEMANUK: a fast software-oriented stream cipher. CoRR abs/0810.1858 (2008) - 2007
- [j1]Dario Catalano, David Pointcheval, Thomas Pornin:
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication. J. Cryptol. 20(1): 115-149 (2007) - [c6]Louis Granboulan, Thomas Pornin:
Perfect Block Ciphers with Small Blocks. FSE 2007: 452-465 - [i2]Romain Alléaume, Jan Bouda, Cyril Branciard, Thierry Debuisschert, Mehrdad Dianati, Nicolas Gisin, Mark Godfrey, Philippe Grangier, Thomas Länger, Anthony Leverrier, Norbert Lütkenhaus, Philippe Painchault, Momtchil Peev, Andreas Poppe, Thomas Pornin, John G. Rarity, Renato Renner, Gregoire Ribordy, Michel Riguidel, Louis Salvail, Andrew J. Shields, Harald Weinfurter, Anton Zeilinger:
SECOQC White Paper on Quantum Key Distribution and Cryptography. CoRR abs/quant-ph/0701168 (2007) - 2005
- [c5]Thomas Pornin, Julien P. Stern:
Digital Signatures Do Not Guarantee Exclusive Ownership. ACNS 2005: 138-150 - 2004
- [c4]Dario Catalano, David Pointcheval, Thomas Pornin:
IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange. CRYPTO 2004: 477-493 - 2003
- [i1]Nicolas T. Courtois, Robert T. Johnson, Pascal Junod, Thomas Pornin, Michael Scott:
Did Filiol Break AES ? IACR Cryptol. ePrint Arch. 2003: 22 (2003) - 2001
- [c3]Thomas Pornin:
Transparent Harddisk Encryption. CHES 2001: 273-285 - 2000
- [c2]Thomas Pornin, Jacques Stern:
Software-Hardware Trade-Offs: Application to A5/1 Cryptanalysis. CHES 2000: 318-327
1990 – 1999
- 1998
- [c1]Thomas Pornin:
Optimal Resistance Against the Davies and Murphy Attack. ASIACRYPT 1998: 148-159
Coauthor Index
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-10-23 20:34 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:
