Dr. Edoardo Persichetti
Associate Professor
Department of Mathematics and Statistics
Boca Raton Campus - SE43, Room 218
epersichetti@fau.edu
I first approached mathematical cryptography while working on my Master's thesis in Rome under the supervision of. M. J. de Resmini. I subsequently moved to New Zealand in late 2009 where I undertook my PhD program in Mathematics under the supervision of Dr. Steven Galbraith.
The initial research focused mainly on cryptography related to algebraic coding theory, namely the famous McEliece cryptosystem and its variants. My post-doctoral work in the Cryptography Group of University of Warsaw was centered on leakage-resilient cryptography, that is, cryptographic primitives that resist attacks of a physical nature (timing attacks, power consumption measurement etc.).
Recently, my attention has returned to topics more closely connected to mathematics. I am interested in all aspects of Public-key Cryptography, especially in the Post-Quantum area and Cryptography based on Coding Theory.
1. C. Battarbee, G. Borin, R. Cartor, N. Heninger, D. Jao, L. Maddison, E. Persichetti, A. Robinson, D. Smith-Tone, R. Steinwandt: On the Semidirect Discrete Logarithm Problem in Finite Groups. ASIACRYPT 2024.
2. V. Weger, K. Khathuria, A.-L. Horlemann, M. Battaglioni, P. Santini, E. Persichetti: On the hardness of the Lee syndrome decoding problem. Adv. Math. Commun. 18(1).
3. M. Battagliola, G. Borin, A. Meneghetti, E. Persichetti: Cutting the GRASS: Threshold GRoup Action Signature Schemes. CT-RSA 2024.
4. A. Barenghi, J.-F. Biasse, E. Persichetti, P. Santini: On the computational hardness of the code equivalence problem in cryptography. Adv. Math. Commun. 17(1).
5. E. Persichetti, P. Santini: A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures. ASIACRYPT 2023.
Full list of publications available at https://www.persichetti.me/publications
