Gabrielle De Micheli

About Me

I am a postdoctoral scholar at the University of California, San Diego, working with Daniele Micciancio.

Currently, I am focusing on the mathematical aspects of applied cryptography. My work lies at the intersection of Mathematics and Cryptography, with particular research interests for discrete logarithm computations in finite fields, lattice-based cryptography and computational number theory. I am interested in both attacks and defenses with a particular interest in using mathematical techniques for obtaining a better understanding of the security properties of commonly used cryptographic primitives in real-world applications.

Prior to this, I completed my PhD at the University of Lorraine, France, funded by INRIA working in the LORIA's team CARAMBA under the supervision of Pierrick Gaudry and Cécile Pierrot.

I also worked at the University of Pennsylvania under the supervision of Nadia Heninger from 2016 to 2018.

Curriculum vitae

Contact Information

Address Office 4132, Computer Science and Engineering Building
University of California, San Diego
La Jolla, CA 92093
USA
Email gdemicheli[at]eng.ucsd.edu

Fields of Interest

Applied Cryptography, Security, Algebra, Geometry (Riemannian Geometry), General Relativity

Academic distinctions and Fellowships

Record computation

Papers

  1. Efficient Machine Learning on Encrypted Data using Hyperdimensional Computing. Yujin Nam, Minxuan Zhou, Saransh Gupta, Gabrielle De Micheli, Rosario Cammarota, Chris Wilkerson, Daniele Micciancio and Tajana Rosing. ISLPED 2023.
  2. Faster Amortized FHEW bootstrapping using Ring Automorphisms. Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio and Adam Suhl. 2023 (In submission)
  3. Reductions from module lattices to free module lattices, and application to dequantizing module-LLL. Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary and Nam Tran. Crypto 2023.
  4. A fully classical LLL algorithm for modules. Gabrielle De Micheli and Daniele Micciancio. 2022 (merged paper).
  5. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Gabrielle De Micheli, Pierrick Gaudry and Cécile Pierrot. Asiacrypt 2021, Award paper (invitation to Journal of Cryptology).
  6. Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. Gabrielle De Micheli, Pierrick Gaudry, and Cecile Pierrot. Crypto 2020 [eprint-long version]
  7. A Tale of Three Signatures: practical attack of ECDSA with wNAF. Gabrielle De Micheli, Remi Piau, and Cecile Pierrot. Africacrypt 2020 [eprint-long version]
  8. Recovering cryptographic keys from partial information, by example. Gabrielle De Micheli and Nadia Heninger. 2020
  9. CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. Fergus Dall, Gabrielle De Micheli, Thomas Eisenbarth, Daniel Genkin, Nadia Heninger, Ahmad Moghimi, and Yuval Yarom. CHES 2018.
  10. Characterizing overstretched NTRU attacks. Gabrielle De Micheli, Nadia Heninger, and Barak Shani. Mathcrypt 2018, published in Journal of Mathematical Cryptology 2020 [eprint-long version]

Talks

  1. To come : Algebraically structured lattices in Cryptography. AWM Research Symposium, Atlanta, 2023. [Abstract]
  2. Reductions from module lattices to free module lattices, and application to dequantizing module-LLL. Crypto, Santa Barbara, August 2023. [Slides] [Video]
  3. Algebraically structured lattices in Cryptography, Theory Seminar, UCSD, May 2023.
  4. Faster Amortized FHEW Bootstrapping using Ring Automorphisms, FHE.org seminar, joint talk with Duhyeong Kim, February 2023.
  5. Faster amortized FHEW bootstrapping. Intel Frontier Workshop, Portland, USA, September 2022.
  6. Cryptanalyses de logarithmes discrets. Journées nationales du GDR Sécurité Informatique, Paris, France, June 2022.
  7. Énumération de réseaux pour Tower NFS : un calcul de logarithme discret de 521 bits. Séminaire ECO, Montpellier, France, April 2022.
  8. Discrete logarithm cryptanalysis. Stanford University, USA, April 2022.
  9. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. AWM seminar, UC San Diego, USA, March 2022.
  10. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Number Theory seminar, UC San Diego, USA, February 2022.
  11. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Asiacrypt, virtual conference December 2021. [video]
  12. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Theory seminar, UC San Diego, USA, November 2021
  13. Key recovery from partial information. Séminaire de Cryptographie, Rennes, France, October 2021 [Slides]
  14. Discrete logarithm algorithms in pairing-relevant finite fields. Journées Codage et Cryptographie C2 2020, virtual conference [Slides]
  15. Discrete logarithm algorithms in pairing-relevant finite fields. Crypto 2020, virtual conference [Slides][video]
  16. A Tale of Three Signatures: Practical Attack of ECDSA with wNAF. Africacrypt 2020, virtual conference [Slides][video]
  17. Discrete logarithm algorithms in pairing-relevant finite fields. Security seminar, Boston University, Boston, USA, February 2020 [Slides]
  18. Discrete logarithm algorithms in pairing-relevant finite fields. Theory seminar, Northeastern University, Boston, USA, February 2020 [Slides]
  19. A Tale of Three Signatures: Practical Attack of ECDSA with wNAF. 17th IMA International Conference on Cryptography and Coding, Oxford, UK, December 2019 [Slides]
  20. CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. CHES, September 2018 [Slides][video]
  21. CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. Security Seminar, MIT, September 2018 [Slides]
  22. CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. Security Seminar, University of Pennsylvania, September 2018 [Slides]
  23. Characterizing overstretched NTRU attacks. Mathcrypt, August 2018 [slides]

Program committees, Reviews and other

Outreach

Teaching/TAing

  • 2020-2021 Fall Semester (École des Mines, Nancy) - Introduction à l'apprentissage automatique, Exercise sessions, 2nd year
  • 2020 Fall Semester (École des Mines, Nancy) - Introduction to Programming and Algorithms, Exercise sessions, 1rt year
  • 2020 Spring Semester (Télécom Nancy (Esial)) - Cryptography and Authentication, Lectures and exercises, 2nd year ISS
  • 2020 Spring Semester (Télécom Nancy (Esial)) - Introduction to Cryptography, Lectures and exercises, 2nd year Formation par apprentissage
  • 2019 Summer (Inria Nancy) - Co-advising undergraduate research internship
  • 2013 Spring Semester (EPFL) - General Phyiscs II, Exercise sessions

Education

May 2021 PhD in Computer Science, Inria, University of Lorraine, Nancy, France
May 2018 Master of Science in Computer Science, University of Pennsylvania, Philadelphia, USA
October 2016 Master of Science in Mathematics, EPFL, Lausanne, Switzerland
Sept 2015 - Jan 2016 Master Thesis, Imperial College, London, UK
July 2014 Bachelor of Science in Mathematics, EPFL, Lausanne, Switzerland

Other interest