Edoardo Persichetti

1.1k total citations
23 papers, 110 citations indexed

About

Edoardo Persichetti is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Edoardo Persichetti has authored 23 papers receiving a total of 110 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Artificial Intelligence, 11 papers in Electrical and Electronic Engineering and 5 papers in Computer Networks and Communications. Recurrent topics in Edoardo Persichetti's work include Coding theory and cryptography (18 papers), Cryptography and Data Security (10 papers) and graph theory and CDMA systems (10 papers). Edoardo Persichetti is often cited by papers focused on Coding theory and cryptography (18 papers), Cryptography and Data Security (10 papers) and graph theory and CDMA systems (10 papers). Edoardo Persichetti collaborates with scholars based in United States, Italy and France. Edoardo Persichetti's co-authors include Paolo Santini, Shay Gueron, Marco Baldi, Jean‐François Biasse, Alessandro Barenghi, P. Santini, Franco Chiaraluce, Rainer Steinwandt, Giovanni Cancellieri and Pierre-Louis Cayrel and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Communications Letters and Lecture notes in computer science.

In The Last Decade

Edoardo Persichetti

21 papers receiving 105 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Edoardo Persichetti United States 7 94 50 33 17 15 23 110
Valérie Gauthier–Umaña Colombia 4 76 0.8× 42 0.8× 15 0.5× 9 0.5× 17 1.1× 5 87
Ignacio Cascudo Netherlands 7 102 1.1× 47 0.9× 31 0.9× 14 0.8× 7 0.5× 12 115
Jean-Christophe Deneuville France 4 66 0.7× 34 0.7× 24 0.7× 10 0.6× 23 1.5× 13 91
Nathaniel Wesley Filardo United States 7 148 1.6× 44 0.9× 20 0.6× 13 0.8× 4 0.3× 17 168
Carlos Aguilar-Melchor France 4 155 1.6× 31 0.6× 29 0.9× 34 2.0× 17 1.1× 8 166
Pierre Loidreau France 7 126 1.3× 79 1.6× 40 1.2× 7 0.4× 18 1.2× 17 137
Julien Schrek France 3 70 0.7× 34 0.7× 14 0.4× 5 0.3× 6 0.4× 4 75
Ludovic Perret France 6 101 1.1× 32 0.6× 10 0.3× 29 1.7× 13 0.9× 14 111
Satoshi Obana Japan 5 44 0.5× 18 0.4× 13 0.4× 18 1.1× 9 0.6× 17 57
Hiroki Shizuya Japan 5 99 1.1× 52 1.0× 28 0.8× 22 1.3× 7 0.5× 26 112

Countries citing papers authored by Edoardo Persichetti

Since Specialization
Citations

This map shows the geographic impact of Edoardo Persichetti's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Edoardo Persichetti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Edoardo Persichetti more than expected).

Fields of papers citing papers by Edoardo Persichetti

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Edoardo Persichetti. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Edoardo Persichetti. The network helps show where Edoardo Persichetti may publish in the future.

Co-authorship network of co-authors of Edoardo Persichetti

This figure shows the co-authorship network connecting the top 25 collaborators of Edoardo Persichetti. A scholar is included among the top collaborators of Edoardo Persichetti based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Edoardo Persichetti. Edoardo Persichetti is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chou, Tung, Edoardo Persichetti, & Paolo Santini. (2025). On linear equivalence, canonical forms, and digital signatures. Designs Codes and Cryptography. 93(7). 2415–2457. 1 indexed citations
2.
Baldi, Marco, et al.. (2025). A new path to code-based signatures via identification schemes with restricted errors. Advances in Mathematics of Communications. 19(5). 1360–1381. 1 indexed citations
3.
Barenghi, Alessandro, et al.. (2022). Advanced signature functionalities from the code equivalence problem. IRIS Research product catalog (Sapienza University of Rome). 7(2). 112–128. 4 indexed citations
4.
Gueron, Shay, Edoardo Persichetti, & Paolo Santini. (2022). Designing a Practical Code-Based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup. Cryptography. 6(1). 5–5. 15 indexed citations
5.
Trautmann, Anna-Lena, et al.. (2022). On the hardness of the Lee syndrome decoding problem. Advances in Mathematics of Communications. 18(1). 233–266. 6 indexed citations
6.
Barenghi, Alessandro, Jean‐François Biasse, Edoardo Persichetti, & Paolo Santini. (2022). On the computational hardness of the code equivalence problem in cryptography. Advances in Mathematics of Communications. 17(1). 23–55. 7 indexed citations
7.
Drucker, Nir, et al.. (2021). On the applicability of the Fujisaki–Okamoto transformation to the BIKE KEM. IRIS Research product catalog (Sapienza University of Rome). 4 indexed citations
8.
Baldi, Marco, Jean-Christophe Deneuville, Edoardo Persichetti, & Paolo Santini. (2021). Cryptanalysis of a Code-Based Signature Scheme Based on the Schnorr-Lyubashevsky Framework. IEEE Communications Letters. 25(9). 2829–2833. 1 indexed citations
9.
Santini, Paolo, Edoardo Persichetti, & Marco Baldi. (2021). Reproducible families of codes and cryptographic applications. SHILAP Revista de lepidopterología. 16(1). 20–48. 3 indexed citations
10.
Aragon, Nicolas, et al.. (2021). Cryptanalysis of a code-based full-time signature. Designs Codes and Cryptography. 89(9). 2097–2112. 3 indexed citations
11.
Barreto, Paulo S. L. M., et al.. (2020). Designing Efficient Dyadic Operations for Cryptographic Applications. SHILAP Revista de lepidopterología. 3 indexed citations
12.
Santini, Paolo, et al.. (2020). Low-Lee-Density Parity-Check Codes. IRIS Research product catalog (Sapienza University of Rome). 15. 1–6. 5 indexed citations
13.
Baldi, Marco, Edoardo Persichetti, & P. Santini. (2020). Code-Based Cryptography. Lecture notes in computer science. 2 indexed citations
14.
Persichetti, Edoardo, et al.. (2019). From Key Encapsulation to Authenticated Group Key Establishment—A Compiler for Post-Quantum Primitives †. Entropy. 21(12). 1183–1183. 6 indexed citations
15.
Baldi, Marco, Giovanni Cancellieri, Franco Chiaraluce, Edoardo Persichetti, & Paolo Santini. (2019). Using Non-Binary LDPC and MDPC Codes in the McEliece Cryptosystem. IRIS Research product catalog (Sapienza University of Rome). 1–6. 4 indexed citations
16.
Barreto, Paulo S. L. M., et al.. (2018). DAGS: Key encapsulation using dyadic GS codes. Journal of Mathematical Cryptology. 12(4). 221–239. 6 indexed citations
17.
Persichetti, Edoardo. (2018). Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment. Cryptography. 2(4). 30–30. 12 indexed citations
18.
Danger, Jean‐Luc, et al.. (2018). On the Performance and Security of Multiplication in GF(2N). Cryptography. 2(3). 25–25. 4 indexed citations
19.
20.
Persichetti, Edoardo. (2012). Compact McEliece keys based on quasi-dyadic Srivastava codes. Journal of Mathematical Cryptology. 6(2). 149–169. 17 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026