Ruggero Susella
Research Subjects
Ruggero Susella has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Barenghi
Politecnico di Milano
3 shared publications - Gerardo Pelosi
Politecnico di Milano
3 shared publications - Francesco Antognazza
Department of Electronics, Information and Bioengineering, Politecnico di Milano, Milan, Italy
2 shared publications - Isabella Piacentini
Politecnico di Milano
1 shared publication - Silvia Mella
Radboud University
1 shared publication Sofia Montrasio
Università degli Studi di Milano
1 shared publication
Latest Publications
- 9 May 2025
- Published by Springer Nature
- p. 71-83
An Unprofiled Single Trace Side-Channel Attack for Asymmetric Cryptosystems
- 9 May 2025
- Published by Springer Nature
- p. 71-83
An Unprofiled Single Trace Side-Channel Attack for Asymmetric Cryptosystems
- Open Access
- 20 January 2024
- Published by Springer Nature in SN Computer Science
- Vol. 5 (2) , 1-19
Performance and Efficiency Exploration of Hardware Polynomial Multipliers for Post-Quantum Lattice-Based Cryptosystems
The significant effort in the research and design of large-scale quantum computers has spurred a transition to post-quantum cryptographic primitives worldwide. The post-quantum cryptographic primitive standardization effort led by the US NIST has recently selected the asymmetric encryption primitive Kyber as its candidate for standardization and indicated NTRU, as a valid alternative if intellectual property issues are not solved. Finally, a more conservative alternative to NTRU, NTRUPrime was also considered as an alternate candidate, due to its design choices that remove the possibility for a large set of attacks preemptively. All the aforementioned asymmetric primitives provide good performances, and are prime choices to provide IoT devices with post-quantum confidentiality services. In this work, we present a comprehensive exploration of hardware designs for the computation of polynomial multiplications, the workhorse operation in all the aforementioned cryptosystems, with a thorough analysis of performance, compactness and efficiency. The presented designs cope with the differences in the arithmetics of polynomial rings employed by distinct cryptosystems, benefiting from configurations and optimizations that are applicable at synthesis time and/or run time. In this context, we target a use case scenario where long-term key pairs are used, such as the ones for VPNs (e.g., over IPSec), secure shell protocols and instant messaging applications. Our high-performance design variants exhibit figures of latency comparable to the ones needed for the execution of the symmetric cryptographic primitives also included in the Post-Quantum schemes. Notably, the performance figures of the designs proposed for NTRU and NTRU Prime surpass the ones described in the related literature.
- 20 January 2024
- Published by Springer Nature in SN Computer Science
- Vol. 5 (2) , 1-19
Open AccessPerformance and Efficiency Exploration of Hardware Polynomial Multipliers for Post-Quantum Lattice-Based Cryptosystems
The significant effort in the research and design of large-scale quantum computers has spurred a transition to post-quantum cryptographic primitives worldwide. The post-quantum cryptographic primitive standardization effort led by the US NIST has recently selected the asymmetric encryption primitive Kyber as its candidate for standardization and indicated NTRU, as a valid alternative if intellectual property issues are not solved. Finally, a more conservative alternative to NTRU, NTRUPrime was also considered as an alternate candidate, due to its design choices that remove the possibility for a large set of attacks preemptively. All the aforementioned asymmetric primitives provide good performances, and are prime choices to provide IoT devices with post-quantum confidentiality services. In this work, we present a comprehensive exploration of hardware designs for the computation of polynomial multiplications, the workhorse operation in all the aforementioned cryptosystems, with a thorough analysis of performance, compactness and efficiency. The presented designs cope with the differences in the arithmetics of polynomial rings employed by distinct cryptosystems, benefiting from configurations and optimizations that are applicable at synthesis time and/or run time. In this context, we target a use case scenario where long-term key pairs are used, such as the ones for VPNs (e.g., over IPSec), secure shell protocols and instant messaging applications. Our high-performance design variants exhibit figures of latency comparable to the ones needed for the execution of the symmetric cryptographic primitives also included in the Post-Quantum schemes. Notably, the performance figures of the designs proposed for NTRU and NTRU Prime surpass the ones described in the related literature.
- 7 March 2017
- Published by Springer Nature
- p. 156-173
A Compact and Exception-Free Ladder for All Short Weierstrass Elliptic Curves
- 7 March 2017
- Published by Springer Nature
- p. 156-173
A Compact and Exception-Free Ladder for All Short Weierstrass Elliptic Curves
- 1 March 2016
- Published by Springer Nature
- p. 364-385
Partial Key Exposure Attacks on RSA with Exponent Blinding
- 1 March 2016
- Published by Springer Nature
- p. 364-385
Partial Key Exposure Attacks on RSA with Exponent Blinding