Pubblicazioni

Reproducible families of codes and cryptographic applications

2022 - JOURNAL OF MATHEMATICAL CRYPTOLOGY
Santini, P; Persichetti, E; Baldi, M

Designing Efficient Dyadic Operations for Cryptographic Applications

2020 - JOURNAL OF MATHEMATICAL CRYPTOLOGY
Banegas, G; Barreto, Pslm; Persichetti, E; Santini, P

On the performance and security of multiplication in gf(2n)

2018 - CRYPTOGRAPHY
Danger, J. -L.; Housni, Y. E.; Facon, A.; Gueye, C. T.; Guilley, S.; Herbel, S.; Ndiaye, O.; Persichetti, E.; Schaub, A.

Efficient one-time signatures from quasi-cyclic codes: A full treatment

2018 - CRYPTOGRAPHY
Persichetti, E.

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma