Andrea Lesavourey

Research   Teaching   Contact

I am currently a post-doctoral researcher at Univ Rennes, CNRS, IRISA, working within the CAPSULE team under the supervision of Adeline Roux-Langlois. Previously, I was a Ph.D. student at University of Wollongong, Australia under the supervision of Willy Susilo and Thomas Plantard.

Contact

• Mail: andrea(dot)lesavourey(at)irisa(dot)fr

---

Research

I am currently working on lattice-based cryptography with a focus on algebraic lattices and their underlying number theoretical structure. More generally, I am interested by computer algebra, algebraic number theory and their applications to cryptography.

PhD thesis

My Ph.D. thesis can be found here.
Please, feel free to contact me if you have any question, remark or if you spot any error/typo.

Preprints

1. Computing roots of polynomials over number fields using complex embeddings, Willy Susilo and Thomas Plantard.
   Code available here


2. Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP, with Olivier Bernard, Tuong-Huy Nguyen, and Adeline Roux-Langlois.
   Code available here


3. On the Short Principal Ideal Problem over some real Kummer fields, with Willy Susilo and Thomas Plantard.
   Code available here


4. A note on the discriminant and prime ramification of some real Kummer extensions.

Journal Papers

1. Short Principal Ideal Problem in multicubic fields, Journal of Mathematical Cryptology, 14(1), 359-392, with Willy Susilo and Thomas Plantard
   Journal version of the paper below, presented at NutMic 2019.

Conference Papers

1. Covering Radius and First Minima Bound on Diagonally Dominant Lattices in the l$_\infty$-norm, with Thomas Plantard and Arnaud Sipasseuth.
   Number-Theoretic Methods in Cryptology (Nutmic) 2021.


2. On ideal lattices in multicubic fields, with Willy Susilo and Thomas Plantard.
   Number-Theoretic Methods in Cryptology 2019
   Slides


3. Efficient Leak Resistant Modular Exponentiation in RNS, with C. Negre and T. Plantard.
   Proceedings of ARITH 24. 24th IEEE Symposium on Computer Arithmetic. London, England, July 24-26, 2017, pages 156-163.


4. Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications, with C. Negre and T. Plantard.
   SECRYPT 2016. The 13th International Conference on Security and Cryptography. Lisbon, Portugal, July 26-28, 2016, pages 368-375.

Summer schools

1. School for young reaserchers by the GDR-IM in France, EJCIM
   Slides

Organisation

I helped organise and took part to the First Workshop On Mathematics and Algorithms for Cryptographic Advanced Objects, MACAO.

---

Curriculum Vitae

Here is my CV.

---

Teaching

Second semester 2021-2022

• Tutoring at Université Rennes 1, France.
  Cryptography (Master 1 Mathématiques de l'information, cryptographie)

First semester 2021-2022

• Tutoring at Université Rennes 1, France.
  Introduction to programming (Inf1).


• Tutoring at Université Rennes 1, France.
  Introduction to algorithmic (M1 Meef, Préparation au CAPES-NSI).

Autumn Session 2020 and 2021

• Tutoring at University of Wollongong, Australia.
  Knowledge and Information Engineering (ISIT219).

Autumn Session 2019

• Tutoring at University of Wollongong, Australia.
  Problem Solving (CSIT113).

2016-2017

• Highschool Mathematics Teacher at Lycée Malherbe in Caen, France.