Gabrielle De Micheli
Postdoctoral scholar
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.
Contact Information
| Address | Office 4132, Computer Science and Engineering Building University of California, San Diego La Jolla, CA 92093 USA |
| gdemicheli[at]eng.ucsd.edu |
Fields of Interest
Applied Cryptography, Security, Algebra, Geometry (Riemannian Geometry), General Relativity
Academic distinctions and Fellowships
- UCSD CSE Fellowship from the CSE Fellows Program, Starting March 2023.
- Finalist of the ERCIM Cor Baayen Young Researcher Award, 2022
- Thesis prize Gilles Kahn from the Société informatique de France (SIF), 2021.
- Young Talent for Women in Science prize from the Foundation l'Oréal-UNESCO, 2021.
- Early Postdoc.Mobility Fellowship from the Swiss National Science Foundation, September 2021-February 2023.
Record computation
- Discrete logarithm in GF(p^6) with Tower NFS. Gabrielle De Micheli, Pierrick Gaudry and Cécile Pierrot. February 2021 [Verification script]
Preprints
- Faster Amortized FHEW bootstrapping using Ring Automorphisms. Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio and Adam Suhl. 2023 (In submission)
- A fully classical LLL algorithm for modules. Gabrielle De Micheli and Daniele Micciancio. 2022 (In submission)
- Recovering cryptographic keys from partial information, by example. Gabrielle De Micheli and Nadia Heninger. 2020
Publications
- 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).
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. Gabrielle De Micheli, Pierrick Gaudry, and Cecile Pierrot. Crypto 2020 [eprint-long version]
- A Tale of Three Signatures: practical attack of ECDSA with wNAF. Gabrielle De Micheli, Remi Piau, and Cecile Pierrot. Africacrypt 2020 [eprint-long version]
- 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.
- 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
- Faster Amortized FHEW Bootstrapping using Ring Automorphisms, FHE.org seminar, joint talk with Duhyeong Kim, February 2023.
- Faster amortized FHEW bootstrapping. Intel Frontier Workshop, Portland, USA, September 2022.
- Cryptanalyses de logarithmes discrets. Journées nationales du GDR Sécurité Informatique, Paris, France, June 2022.
- Énumération de réseaux pour Tower NFS : un calcul de logarithme discret de 521 bits. Séminaire ECO, Montpellier, France, April 2022.
- Discrete logarithm cryptanalysis. Stanford University, USA, April 2022.
- Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. AWM seminar, UC San Diego, USA, March 2022.
- Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Number Theory seminar, UC San Diego, USA, February 2022.
- Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Asiacrypt, virtual conference December 2021 [video]
- Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Theory seminar, UC San Diego, USA, November 2021
- Key recovery from partial information. Séminaire de Cryptographie, Rennes, France, October 2021 [Slides]
- Discrete logarithm algorithms in pairing-relevant finite fields. Journées Codage et Cryptographie C2 2020, virtual conference [Slides]
- Discrete logarithm algorithms in pairing-relevant finite fields. Crypto 2020, virtual conference [Slides][video]
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF. Africacrypt 2020, virtual conference [Slides][video]
- Discrete logarithm algorithms in pairing-relevant finite fields. Security seminar, Boston University, Boston, USA, February 2020 [Slides]
- Discrete logarithm algorithms in pairing-relevant finite fields. Theory seminar, Northeastern University, Boston, USA, February 2020 [Slides]
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF. 17th IMA International Conference on Cryptography and Coding, Oxford, UK, December 2019 [Slides]
- CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. CHES, September 2018 [Slides][video]
- CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. Security Seminar, MIT, September 2018 [Slides]
- CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. Security Seminar, University of Pennsylvania, September 2018 [Slides]
- Characterizing overstretched NTRU attacks. Mathcrypt, August 2018 [slides]
Program committees, Reviews and other
- Co-Organizing: Workshop on Attacks in Cryptography 5 (WAC5), Crypto 2022 affiliated event
- Program committees: ACM CCS 2022, Prix de thèse Gilles Kahn 2022, IACR Crypto 2023, ACM CCS 2023
- External reviewing: Crypto 17’/22', Asiacrypt 18’/19'/22', CHES 18’, Designs, Codes and Cryptography (Journal), Eurocrypt 20’/22'
Outreach
- Television report, Arte journal: Cybersécurité: la science des codes secrets.
- Panel on Women in CS, École Polytechnique (France) - Université de Yaoundé I (Cameroon): Science Events Cameroon.
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
- I play the piano.
- I enjoy mountaineering and traveling the world.
