Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes. - Pierre-Louis Cayrel; Gerhard Hoffmann; Edoardo Persichetti (Public Key Cryptography, 2012)

On a CCA2-secure variant of McEliece in the standard model. - Edoardo Persichetti (IACR Cryptol. ePrint Arch., 2012)

Compact McEliece keys based on quasi-dyadic Srivastava codes. - Edoardo Persichetti (J. Math. Cryptol., 2012)

Code-Based Public-Key Encryption Resistant to Key Leakage. - Edoardo Persichetti (CD-ARES Workshops, 2013)

Secure and Anonymous Hybrid Encryption from Coding Theory. - Edoardo Persichetti (PQCrypto, 2013)

Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice. - Marcin Andrychowicz; Daniel Masny; Edoardo Persichetti (IACR Cryptol. ePrint Arch., 2015)

Efficient Implementation of Hybrid Encryption from Coding Theory. - Pierre-Louis Cayrel; Cheikh Thiecoumba Gueye; El Hadji Modou Mboup; Ousmane Ndiaye; Edoardo Persichetti (C2SI, 2017)

Code-Based Key Encapsulation from McEliece's Cryptosystem. - Edoardo Persichetti (MACIS, 2017)

CAKE: Code-based Algorithm for Key Encapsulation. - Paulo S. L. M. Barreto; Shay Gueron; Tim Güneysu; Rafael Misoczki; Edoardo Persichetti; Nicolas Sendrier; Jean-Pierre Tillich (IACR Cryptol. ePrint Arch., 2017)

Efficient Digital Signatures From Coding Theory. - Edoardo Persichetti (IACR Cryptol. ePrint Arch., 2017)

On lower bounds for information set decoding over q and on the effect of partial knowledge. - Robert Niebuhr; Edoardo Persichetti; Pierre-Louis Cayrel; Stanislav Bulygin; Johannes Buchmann 001 (Int. J. Inf. Coding Theory, 2017)

On the CCA2 Security of McEliece in the Standard Model. - Edoardo Persichetti (ProvSec, 2018)

On the Performance and Security of Multiplication in GF(2N). - Jean-Luc Danger; Youssef El Housni; Adrien Facon; Cheikh Thiecoumba Gueye; Sylvain Guilley; Sylvie Herbel; Ousmane Ndiaye; Edoardo Persichetti; Alexander Schaub 001 (Cryptogr., 2018)

Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment. - Edoardo Persichetti (Cryptogr., 2018)

DAGS: Reloaded Revisiting Dyadic Key Encapsulation. - Gustavo Banegas; Paulo S. L. M. Barreto; Brice Odilon Boidje; Pierre-Louis Cayrel; Gilbert Ndollane Dione; Kris Gaj; Cheikh Thiecoumba Gueye; Richard Haeussler; Jean Belo Klamti; Ousmane Ndiaye; Duc Tri Nguyen; Edoardo Persichetti; et al. (IACR Cryptol. ePrint Arch., 2018)

Towards KEM Unification. - Daniel J. Bernstein; Edoardo Persichetti (IACR Cryptol. ePrint Arch., 2018)

Reproducible Codes and Cryptographic Applications. - Paolo Santini; Edoardo Persichetti; Marco Baldi (IACR Cryptol. ePrint Arch., 2018)

DAGS: Key encapsulation using dyadic GS codes. - Gustavo Banegas; Paulo S. L. M. Barreto; Brice Odilon Boidje; Pierre-Louis Cayrel; Gilbert Ndollane Dione; Kris Gaj; Cheikh Thiécoumba Gueye; Richard Haeussler; Jean Belo Klamti; Ousmane Ndiaye; Duc Tri Nguyen; Edoardo Persichetti; et al. (J. Math. Cryptol., 2018)

Improvement of Binary and Non Binary Statistical Decoding Algorithm. - Pierre-Louis Cayrel; Cheikh Thiécoumba Gueye; Junaid Ahmad Khan; Jean Belo Klamti; Edoardo Persichetti (ICISC, 2019)

Tighter Proofs of CCA Security in the Quantum Random Oracle Model. - Nina Bindel; Mike Hamburg; Kathrin Hövelmanns; Andreas Hülsing; Edoardo Persichetti (TCC (2), 2019)

From Key Encapsulation to Authenticated Group Key Establishment - A Compiler for Post-Quantum Primitives †. - Edoardo Persichetti; Rainer Steinwandt; Adriana Suárez Corona (Entropy, 2019)

Tighter proofs of CCA security in the quantum random oracle model. - Nina Bindel; Mike Hamburg; Andreas Hülsing; Edoardo Persichetti (IACR Cryptol. ePrint Arch., 2019)

A Reaction Attack against Cryptosystems based on LRPC Codes. - Simona Samardjiska; Paolo Santini; Edoardo Persichetti; Gustavo Banegas (IACR Cryptol. ePrint Arch., 2019)

Low-Lee-Density Parity-Check Codes. - Paolo Santini; Massimo Battaglioni; Franco Chiaraluce; Marco Baldi; Edoardo Persichetti (ICC, 2020)

On the Hardness of the Lee Syndrome Decoding Problem. - Violetta Weger; Massimo Battaglioni; Paolo Santini; Anna-Lena Horlemann-Trautmann; Edoardo Persichetti (CoRR, 2020)

A New Path to Code-based Signatures via Identification Schemes with Restricted Errors. - Marco Baldi; Massimo Battaglioni; Franco Chiaraluce; Anna-Lena Horlemann-Trautmann; Edoardo Persichetti; Paolo Santini; Violetta Weger (CoRR, 2020)

Cryptanalysis of a Code-Based Signature Scheme Based on the Lyubashevsky Framework. - Marco Baldi; Karan Khathuria; Edoardo Persichetti; Paolo Santini (IACR Cryptol. ePrint Arch., 2020)

LESS is More: Code-Based Signatures without Syndromes. - Jean-François Biasse; Giacomo Micheli; Edoardo Persichetti; Paolo Santini (IACR Cryptol. ePrint Arch., 2020)

Designing Efficient Dyadic Operations for Cryptographic Applications. - Gustavo Banegas; Paulo S. L. M. Barreto; Edoardo Persichetti; Paolo Santini (J. Math. Cryptol., 2020)

Security Analysis of a Cryptosystem Based on Subspace Subcodes. - Thierry P. Berger; Anta Niane Gueye; Cheikh Thiecoumba Gueye; M. Anwarul Hasan; Jean Belo Klamti; Edoardo Persichetti; Tovohery Hajatiana Randrianarisoa; Olivier Ruatta (CBCrypto, 2021)

LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem. - Alessandro Barenghi; Jean-François Biasse; Edoardo Persichetti; Paolo Santini (PQCrypto, 2021)

Cryptanalysis of a code-based full-time signature. - Nicolas Aragon; Marco Baldi; Jean-Christophe Deneuville; Karan Khathuria; Edoardo Persichetti; Paolo Santini (Des. Codes Cryptogr., 2021)

Cryptanalysis of a code-based signature scheme without trapdoors. - Marco Baldi; Jean-Christophe Deneuville; Edoardo Persichetti; Paolo Santini (IACR Cryptol. ePrint Arch., 2021)

LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action. - Alessandro Barenghi; Jean-François Biasse; Edoardo Persichetti; Paolo Santini (IACR Cryptol. ePrint Arch., 2021)

A Note on Non-Interactive Key Exchange from Code Equivalence. - Lindsey M. Knowles; Edoardo Persichetti; Tovohery Randrianarisoa; Paolo Santini (IACR Cryptol. ePrint Arch., 2021)

Cryptanalysis of a Code-Based Signature Scheme Based on the Schnorr-Lyubashevsky Framework. - Marco Baldi; Jean-Christophe Deneuville; Edoardo Persichetti; Paolo Santini (IEEE Commun. Lett., 2021)

On the applicability of the Fujisaki-Okamoto transformation to the BIKE KEM. - Nir Drucker; Shay Gueron; Dusan Kostic; Edoardo Persichetti (Int. J. Comput. Math. Comput. Syst. Theory, 2021)

Designing a Practical Code-Based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup. - Shay Gueron; Edoardo Persichetti; Paolo Santini (Cryptogr., 2022)

Take your MEDS: Digital Signatures from Matrix Code Equivalence. - Tung Chou; Ruben Niederhagen; Edoardo Persichetti; Tovohery Hajatiana Randrianarisoa; Krijn Reijnders; Simona Samardjiska; Monika Trimoska (IACR Cryptol. ePrint Arch., 2022)

On Linear Complexity of Finite Sequences : Coding Theory and Applications to Cryptography. - Edoardo Persichetti; Tovohery Randrianarisoa (IACR Cryptol. ePrint Arch., 2022)

Advanced signature functionalities from the code equivalence problem. - Alessandro Barenghi; Jean-François Biasse; Tran Ngo; Edoardo Persichetti; Paolo Santini (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

Reproducible families of codes and cryptographic applications. - Paolo Santini; Edoardo Persichetti; Marco Baldi (J. Math. Cryptol., 2022)

On the computational hardness of the code equivalence problem in cryptography. - Alessandro Barenghi; Jean-François Biasse; Edoardo Persichetti; Paolo Santini (Adv. Math. Commun., 2023)

Cutting the GRASS: Threshold GRoup Action Signature Schemes. - Michele Battagliola; Giacomo Borin; Alessio Meneghetti; Edoardo Persichetti (IACR Cryptol. ePrint Arch., 2023)

Zero-Knowledge Proofs from the Action Subgraph. - Giacomo Borin; Edoardo Persichetti; Paolo Santini (IACR Cryptol. ePrint Arch., 2023)

A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures. - Edoardo Persichetti; Paolo Santini (IACR Cryptol. ePrint Arch., 2023)

On the Semidirect Discrete Logarithm Problem in Finite Groups. - Christopher Battarbee; Giacomo Borin; Julian Brough; Ryann Cartor; Tobias Hemmert; Nadia Heninger; David Jao; Delaram Kahrobaei; Laura Maddison; Edoardo Persichetti; Angela Robinson; Daniel Smith-Tone; et al. (ASIACRYPT (8), 2024)

On the hardness of the Lee syndrome decoding problem. - Violetta Weger; Karan Khathuria; Anna-Lena Horlemann; Massimo Battaglioni; Paolo Santini; Edoardo Persichetti (Adv. Math. Commun., 2024)

On the Semidirect Discrete Logarithm Problem in Finite Groups. - Christopher Battarbee; Giacomo Borin; Ryann Cartor; Nadia Heninger; David Jao; Laura Maddison; Edoardo Persichetti; Angela Robinson; Daniel Smith-Tone; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2024)

Enhancing Threshold Group Action Signature Schemes: Adaptive Security and Scalability Improvements. - Michele Battagliola; Giacomo Borin; Giovanni Di Crescenzo; Alessio Meneghetti; Edoardo Persichetti (IACR Cryptol. ePrint Arch., 2025)

LESS is Even More: Optimizing Digital Signatures from Code Equivalence. - Luke Beckwith; Andre Esser 001; Edoardo Persichetti; Paolo Santini; Floyd Zweydinger (IACR Cryptol. ePrint Arch., 2025)

Polynomial Inversion Algorithms in Constant Time for Post-Quantum Cryptography. - Abhraneel Dutta; Emrah Karagoz; Edoardo Persichetti; Pakize Sanal (IACR Cryptol. ePrint Arch., 2025)

Post-Quantum Blind Signatures from Matrix Code Equivalence. - Veronika Kuchta; Jason T. LeGrow; Edoardo Persichetti (IACR Cryptol. ePrint Arch., 2025)

On linear equivalence, canonical forms, and digital signatures. - Tung Chou; Edoardo Persichetti; Paolo Santini (Des. Codes Cryptogr., 2025)

A Guide to the Design of Digital Signatures based on Cryptographic Group Actions. - Giacomo Borin; Edoardo Persichetti; Federico Pintore; Krijn Reijnders; Paolo Santini (J. Cryptol., 2025)