Gabrielle De Micheli

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

• 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, starting September 2021.

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

1. Faster Amortized FHEW bootstrapping using Ring Automorphisms. Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio and Adam Suhl. 2023 (In submission)
2. A fully classical LLL algorithm for modules. Gabrielle De Micheli and Daniele Micciancio. 2022 (In submission)
3. Recovering cryptographic keys from partial information, by example. Gabrielle De Micheli and Nadia Heninger. 2020

Publications

1. 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).
2. Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. Gabrielle De Micheli, Pierrick Gaudry, and Cecile Pierrot. Crypto 2020 [eprint-long version]
3. A Tale of Three Signatures: practical attack of ECDSA with wNAF. Gabrielle De Micheli, Remi Piau, and Cecile Pierrot. Africacrypt 2020 [eprint-long version]
4. 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.
5. 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. Faster Amortized FHEW Bootstrapping using Ring Automorphisms, FHE.org seminar, joint talk with Duhyeong Kim, February 2023.
2. Faster amortized FHEW bootstrapping. Intel Frontier Workshop, Portland, USA, September 2022.
3. Cryptanalyses de logarithmes discrets. Journées nationales du GDR Sécurité Informatique, Paris, France, June 2022.
4. Énumération de réseaux pour Tower NFS : un calcul de logarithme discret de 521 bits. Séminaire ECO, Montpellier, France, April 2022.
5. Discrete logarithm cryptanalysis. Stanford University, USA, April 2022.
6. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. AWM seminar, UC San Diego, USA, March 2022.
7. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Number Theory seminar, UC San Diego, USA, February 2022.
8. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Asiacrypt, virtual conference December 2021 [video]
9. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. Theory seminar, UC San Diego, USA, November 2021
10. Key recovery from partial information. Séminaire de Cryptographie, Rennes, France, October 2021 [Slides]
11. Discrete logarithm algorithms in pairing-relevant finite fields. Journées Codage et Cryptographie C2 2020, virtual conference [Slides]
12. Discrete logarithm algorithms in pairing-relevant finite fields. Crypto 2020, virtual conference [Slides][video]
13. A Tale of Three Signatures: Practical Attack of ECDSA with wNAF. Africacrypt 2020, virtual conference [Slides][video]
14. Discrete logarithm algorithms in pairing-relevant finite fields. Security seminar, Boston University, Boston, USA, February 2020 [Slides]
15. Discrete logarithm algorithms in pairing-relevant finite fields. Theory seminar, Northeastern University, Boston, USA, February 2020 [Slides]
16. A Tale of Three Signatures: Practical Attack of ECDSA with wNAF. 17th IMA International Conference on Cryptography and Coding, Oxford, UK, December 2019 [Slides]
17. CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. CHES, September 2018 [Slides][video]
18. CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. Security Seminar, MIT, September 2018 [Slides]
19. CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. Security Seminar, University of Pennsylvania, September 2018 [Slides]
20. 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