• SIDH Proof of Knowledge
    Luca De Feo, Samuel Dobson, Steven Galbraith, Lukas Zobernig.
    preprint, iacr:2021/1023. 2021.
  • On the (in)security of ElGamal in OpenPGP
    Luca De Feo, Bertram Poettering, Alessandro Sorniotti.
    The 28th ACM Conference on Computer and Communications Security, . Association for Computing Machinery, 2021.
  • Resistance of Isogeny-Based Cryptographic Implementations to a Fault Attack
    Élise Tasso, Luca De Feo, Nadia El Mrabet, Simon Pontié.
    COSADE 2021, . 2021.
  • Delay Encryption
    Jeffrey Burdges, Luca De Feo.
    EUROCRYPT 2021, LNCS, . Springer, 2021.
  • SQISign: Compact Post-quantum Signatures from Quaternions and Isogenies
    ASIACRYPT 2020, Part I, volume 12491 of LNCS, pages 64–93. Springer, 2020.
  • Cryptographic Group Actions and Applications
    Navid Alamati, Luca De Feo, Hart Montgomery, Sikhar Patranabis.
    ASIACRYPT 2020, Part II, volume 12492 of LNCS, pages 411–439. Springer, 2020.
  • Faster computation of isogenies of large prime degree
    ANTS XIV, The Open Book Series, 4(1):39–55. Mathematical Sciences Publishers, 2020.
  • Threshold schemes from isogeny assumptions
    Luca De Feo, Michael Meyer.
    PKC 2020, Part II, volume 12111 of LNCS, pages 187–212. Springer, 2020.
  • Verifiable Delay Functions from Supersingular Isogenies and Pairings
    ASIACRYPT 2019, Part I, volume 11921 of LNCS, pages 248–277. Springer, 2019.
  • Stronger and Faster Side-Channel Protections for CSIDH
    Daniel Cervantes-Váquez, Mathilde Chenu, Jesús-Javier Chi-Dominguez, Luca De Feo, Francisco Rodríguez-Henriquez, Benjamin Smith.
    LATINCRYPT 2019, volume 11774 of LNCS, pages 173–193. Springer, 2019.
  • Standard Lattices of Compatibly Embedded Finite Fields
    ISSAC '19: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, pages 122–130. Association for Computing Machinery, 2019.
  • SeaSign: Compact isogeny signatures from class group actions
    Luca De Feo, Steven Galbraith.
    EUROCRYPT 2019, Part III, volume 11478 of LNCS, pages 759–789. Springer, 2019.
  • Exploring Isogeny Graphs
    Luca De Feo.
    Habilitation thesis220 pages. Université de Versailles, 2010.
  • Towards practical key exchange from ordinary isogeny graphs
    Luca De Feo, Jean Kieffer, Benjamin Smith.
    ASIACRYPT 2018, Part III, volume 11274 of LNCS, pages 365–394. Springer, 2018.
  • Computing isomorphisms and embeddings of finite fields
    Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost.
    Mathematics of Computation, 88:1391–1426. American Mathematical Society, 2018.
  • Mathematics of Isogeny Based Cryptography
    Luca De Feo.
    preprint, arXiv:1711.04062, 44 pages. Lecture notes. 2017.
  • SIKE: Supersingular Isogeny Key Encapsulation
    R. Azarderakhsh, M. Campagna, C. Costello, B. Hess, A. Hutchinson, A. Jalali, D. Jao, K. Karabina, B. Koziel, B. LaMacchia, P. Longa, M. Naehrig, G. Pereira, J. Renes, V. Soukharev, D. Urbanik.
    Post-Quantum Cryptography Standardization, National Institute of Standards and Technology (NIST), 2020.
  • Knowledge-Based Interoperability for Mathematical Software Systems
    Michael Kohlhase, Luca De Feo, Dennis Müller, Markus Pfeiffer, Florian Rabe, Nicolas M. Thiéry, Victor Vasilyev, Tom Wiesing.
    MACIS 2017: Mathematical Aspects of Computer and Information Sciences, volume 10693 of LNCS, pages 195–210. Springer, 2017.
  • Explicit isogenies in quadratic time in any characteristic
    Luca De Feo, Cyril Hugounenq, Jérôme Plût, Éric Schost.
    ANTS XII, LMS Journal of Computation and Mathematics, 19(A):267–282. Oxford University Press, 2016.
  • Applications of the affine geometry of GF(qn) to root finding
    Luca De Feo, Christophe Petit, Michaël Quisquater.
    preprint. In preparation. 2015.
  • Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
    Luca De Feo, David Jao, Jérôme Plût.
    Journal of Mathematical Cryptology, 8(3):209–247. De Gruyter, 2014.
  • Fast arithmetic for the algebraic closure of finite fields
    Luca De Feo, Éric Schost, Javad Doliskani.
    ISSAC '14: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pages 122–129. Association for Computing Machinery, 2014.
  • Fast algorithms for ℓ-adic towers over finite fields
    Luca De Feo, Éric Schost, Javad Doliskani.
    ISSAC '13: Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, pages 165–172. Association for Computing Machinery, 2013.
  • Fast Arithmetics in Artin-Schreier Towers over Finite Fields
    Luca De Feo, Éric Schost.
    Journal of Symbolic Computation, 47(7):771–792. Elsevier, 2012.
  • Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
    Luca De Feo.
    Journal of Number Theory, 131(5):873–893. Elsevier, 2011.
  • Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
    David Jao, Luca De Feo.
    Post-Quantum Cryptography - 4th International Workshop, PQCrypto 2011, volume 7071 of LNCS, pages 19–34. Springer, 2011.
  • transalpyne: a Language for Automatic Transposition
    Luca De Feo, Éric Schost.
    SIGSAM Bulletin, 44(1/2):59–71. Association for Computing Machinery, 2010.
  • Fast Algorithms for Towers of Finite Fields and Isogenies
    Luca De Feo.
    PhD thesis191 pages. Advisors: François Morain, Éric Schost. École Polytechnique, 2010.
  • Fast Arithmetics in Artin-Schreier Towers over Finite Fields
    Luca De Feo, Éric Schost.
    ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, pages 127–134. Association for Computing Machinery, 2009.