Gadget-based Masking of Streamlined NTRU Prime Decapsulation in Hardware
Abstract: Streamlined NTRU Prime is a lattice-based Key Encapsulation Mechanism (KEM) that is, together with X25519, the default algorithm in OpenSSH 9. Based on lattice assumptions, it is assumed to be secure also against attackers with access to< large-scale quantum computers. While Post-Quantum Cryptography (PQC) schemes have been subject to extensive research in recent years, challenges remain with respect to protection mechanisms against attackers that have additional side-channel information, such as the power consumption of a device processing secret data. As a countermeasure to such attacks, masking has been shown to be a promising and effective approach. For public-key schemes, including any recent PQC schemes, usually, a mixture of Boolean and arithmetic techniques is applied on an algorithmic level. Our generic hardware implementation of Streamlined NTRU Prime decapsulation, however, follows an idea that until now was assumed to be solely applicable efficiently to symmetric crypto.... https://tches.iacr.org/index.php/TCHES/article/view/11238
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Gadget-based Masking of Streamlined NTRU Prime Decapsulation in Hardware ; volume:2024 ; number:1 ; year:2023
IACR transactions on cryptographic hardware and embedded systems ; 2024, Heft 1 (2023)
- Creator
-
Land, Georg
Marotzke, Adrian
Richter-Brockmann, Jan
Güneysu, Tim
- DOI
-
10.46586/tches.v2024.i1.1-26
- URN
-
urn:nbn:de:101:1-2023120617570901426529
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:37 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Land, Georg
- Marotzke, Adrian
- Richter-Brockmann, Jan
- Güneysu, Tim
Other Objects (12)
Streamlined NTRU Prime on FPGA
Hardware masking, revisited
Prime-field masking in hardware and its soundness against low-noise SCA attacks
Generic low-latency masking in hardware
Consolidating security notions in hardware masking
Multiplicative masking for AES in hardware
Low-latency hardware masking with application to AES
Formal verification and automated masking of cryptographic hardware
Masking FALCON’s Floating-Point Multiplication in Hardware
Boolean masking for arithmetic additions at arbitrary order in hardware
Riding the waves towards generic single-cycle masking in hardware
ModuloNET: neural networks meet modular arithmetic for efficient hardware masking
Streamlined NTRU Prime on FPGA
Hardware masking, revisited
Prime-field masking in hardware and its soundness against low-noise SCA attacks
Generic low-latency masking in hardware
Consolidating security notions in hardware masking
Multiplicative masking for AES in hardware
Low-latency hardware masking with application to AES
Formal verification and automated masking of cryptographic hardware
Masking FALCON’s Floating-Point Multiplication in Hardware
Boolean masking for arithmetic additions at arbitrary order in hardware
Riding the waves towards generic single-cycle masking in hardware
ModuloNET: neural networks meet modular arithmetic for efficient hardware masking
Streamlined NTRU Prime on FPGA
Hardware masking, revisited
Prime-field masking in hardware and its soundness against low-noise SCA attacks
Generic low-latency masking in hardware
Consolidating security notions in hardware masking
Multiplicative masking for AES in hardware
Low-latency hardware masking with application to AES
Formal verification and automated masking of cryptographic hardware
Masking FALCON’s Floating-Point Multiplication in Hardware
Boolean masking for arithmetic additions at arbitrary order in hardware
Riding the waves towards generic single-cycle masking in hardware