Fabrizio De Santis
Research Subjects
Fabrizio De Santis has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Georg Sigl
Technical University of Munich
3 shared publications Georg Sigl
Technische Universität München (TUM)
2 shared publications- Malek Safieh
Siemens AG
2 shared publications - Shivam Bhasin
Nanyang technological university, Singapore, Singapore
2 shared publications - Stefan Mangard
Graz University of Technology, Graz, Austria
2 shared publications - Sven Bauer
Siemens AG
2 shared publications
Latest Publications
- 18 August 2026
- Published by Springer Nature
- p. 308-326
fRE: A TEE-Based Firmware Resilience Engine with Efficient Local Detection and Recovery
- 18 August 2026
- Published by Springer Nature
- p. 308-326
fRE: A TEE-Based Firmware Resilience Engine with Efficient Local Detection and Recovery
- 15 October 2025
- Published by Springer Nature
- p. 211-231
A Fault-Resistant NTT by Polynomial Evaluation and Interpolation
- 15 October 2025
- Published by Springer Nature
- p. 211-231
A Fault-Resistant NTT by Polynomial Evaluation and Interpolation
- Open Access
- 12 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5) , 1-3
Special Issue on Open Hardware for Embedded System Security and Cryptography
- 12 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5) , 1-3
Open AccessSpecial Issue on Open Hardware for Embedded System Security and Cryptography
- 10 August 2025
- Published by Springer Nature
- p. 74-91
A Cyber-Resilient DICE Architecture for Resource-Constrained Devices
- 10 August 2025
- Published by Springer Nature
- p. 74-91
A Cyber-Resilient DICE Architecture for Resource-Constrained Devices
- Open Access
- 29 March 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 23 (2) , 1-3
Special Issue on Post-Quantum Cryptography for Embedded Systems
- 29 March 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 23 (2) , 1-3
Open AccessSpecial Issue on Post-Quantum Cryptography for Embedded Systems
- 23 February 2024
- Published by Springer Nature
- p. 43-61
A Differential Fault Attack Against Deterministic Falcon Signatures
- 23 February 2024
- Published by Springer Nature
- p. 43-61
A Differential Fault Attack Against Deterministic Falcon Signatures
- 4 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 76-83
An Efficient Barrett Reduction Algorithm for Gaussian Integer Moduli
Gaussian integers are a subset of complex numbers that have integer numbers in both their real and imaginary parts. Similar to ordinary integer numbers, they can be equipped with modulo operations, which creates Gaussian integer rings and fields. Depending on the chosen modulus, these structures can be isomorphic to corresponding algebraic structures over integer numbers. However, computing modulo reduction for Gaussian integers can be computationally expensive, especially when the modulus itself is a Gaussian integer.In this work, we present a novel and efficient reduction algorithm for Gaussian integer moduli of arbitrary form based on the ideas of Barrett reduction for integer numbers. We show that the computational complexity of our proposed reduction algorithm is equivalent to previously known Montgomery reduction over Gaussian integers. However, unlike Montgomery’s approach, our algorithm does not require domain transformations and can be more advantageous in various circumstances.
- 4 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 76-83
An Efficient Barrett Reduction Algorithm for Gaussian Integer Moduli
Gaussian integers are a subset of complex numbers that have integer numbers in both their real and imaginary parts. Similar to ordinary integer numbers, they can be equipped with modulo operations, which creates Gaussian integer rings and fields. Depending on the chosen modulus, these structures can be isomorphic to corresponding algebraic structures over integer numbers. However, computing modulo reduction for Gaussian integers can be computationally expensive, especially when the modulus itself is a Gaussian integer.In this work, we present a novel and efficient reduction algorithm for Gaussian integer moduli of arbitrary form based on the ideas of Barrett reduction for integer numbers. We show that the computational complexity of our proposed reduction algorithm is equivalent to previously known Montgomery reduction over Gaussian integers. However, unlike Montgomery’s approach, our algorithm does not require domain transformations and can be more advantageous in various circumstances.
- 7 March 2018
- Published by Springer Nature
- p. 413-434
High-Resolution EM Attacks Against Leakage-Resilient PRFs Explained
- 7 March 2018
- Published by Springer Nature
- p. 413-434
High-Resolution EM Attacks Against Leakage-Resilient PRFs Explained
- 14 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 67 (11) , 1651-1662
Post-Quantum Key Exchange on ARMv8-A: A New Hope for NEON Made Simple
NewHope and NewHope-Simple are two recently proposed post-quantum key exchange protocols based on the hardness of the Ring-LWE problem. Due to their high security margins and performance, there have already been discussions and proposals for integrating them into Internet standards and anonymity network protocols. In this work, we present constant-time and vector-optimized implementations of NewHope and NewHope-Simple for ARMv8-A 64-bit processors which target high-speed applications. This architecture is implemented in a growing number of smart phone and tablet processors, and features powerful 128-bit SIMD operations provided by the NEON engine. In particular, we propose the use of three alternative modular reduction methods. They allow to better exploit NEON parallelism by avoiding larger data types during the NTT. Furthermore, they remove the need to transform input coefficients into Montgomery domain during pointwise multiplications. The NEON vectorized NTT uses a 16-bit unsigned integer representation and executes in only 18,909 clock cycles on an ARM Cortex-A53 core. Our implementation improves previous assembly-optimized results on ARM NEON platforms and outperforms the C reference implementation on the same platform by a factor of 8.3. The total time spent on the key exchange was reduced by more than a factor of 3.5 for both protocols.
- 14 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 67 (11) , 1651-1662
Post-Quantum Key Exchange on ARMv8-A: A New Hope for NEON Made Simple
NewHope and NewHope-Simple are two recently proposed post-quantum key exchange protocols based on the hardness of the Ring-LWE problem. Due to their high security margins and performance, there have already been discussions and proposals for integrating them into Internet standards and anonymity network protocols. In this work, we present constant-time and vector-optimized implementations of NewHope and NewHope-Simple for ARMv8-A 64-bit processors which target high-speed applications. This architecture is implemented in a growing number of smart phone and tablet processors, and features powerful 128-bit SIMD operations provided by the NEON engine. In particular, we propose the use of three alternative modular reduction methods. They allow to better exploit NEON parallelism by avoiding larger data types during the NTT. Furthermore, they remove the need to transform input coefficients into Montgomery domain during pointwise multiplications. The NEON vectorized NTT uses a 16-bit unsigned integer representation and executes in only 18,909 clock cycles on an ARM Cortex-A53 core. Our implementation improves previous assembly-optimized results on ARM NEON platforms and outperforms the C reference implementation on the same platform by a factor of 8.3. The total time spent on the key exchange was reduced by more than a factor of 3.5 for both protocols.