Results 1 to 10 of about 2,293 (163)
Polynomial Multiplication in NTRU Prime [PDF]
Transactions on Cryptographic Hardware and Embedded Systems, 2020 This paper proposes two different methods to perform NTT-based polynomial multiplication in polynomial rings that do not naturally support such a multiplication. We demonstrate these methods on the NTRU Prime key-encapsulation mechanism (KEM) proposed by
Erdem Alkim +10 more
doaj +8 more sources
Multi-Parameter Support with NTTs for NTRU and NTRU Prime on Cortex-M4
Transactions on Cryptographic Hardware and Embedded Systems, 2022 We propose NTT implementations with each supporting at least one parameter of NTRU and one parameter of NTRU Prime. Our implementations are based on size-1440, size-1536, and size-1728 convolutions without algebraic assumptions on the target polynomial ...
Erdem Alkim, Vincent Hwang, Bo-Yin Yang
doaj +7 more sources
Transactions on Cryptographic Hardware and Embedded Systems, 2019 This paper applies a variety of power analysis techniques to several implementations of NTRU Prime, a Round 2 submission to the NIST PQC Standardization Project.
Wei-Lun Huang +2 more
doaj +5 more sources
Gadget-based Masking of Streamlined NTRU Prime Decapsulation in Hardware
Transactions on Cryptographic Hardware and Embedded Systems, 2023 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 ...
Georg Land +3 more
doaj +4 more sources
Streamlined NTRU Prime on FPGA [PDF]
Journal of Cryptographic Engineering, 2022 AbstractWe present a novel full hardware implementation of Streamlined NTRU Prime, with two variants: a high-speed, high-area implementation and a slower, low-area implementation. We introduce several new techniques that improve performance, including a batch inversion for key generation, a high-speed schoolbook polynomial multiplier, an NTT polynomial
Bo-Yuan Peng +4 more
openalex +2 more sources
A Lightweight Implementation of NTRU Prime for the Post-Quantum Internet of Things [PDF]
, 2020 The dawning era of quantum computing has initiated various initiatives for the standardization of post-quantum cryptosystems with the goal of (eventually) replacing RSA and ECC. NTRU Prime is a variant of the classical NTRU cryptosystem that comes with a couple of tweaks to minimize the attack surface; most notably, it avoids rings with “worrisome ...
H. Cheng +4 more
+7 more sources
NTRU Prime: Reducing Attack Surface at Low Cost [PDF]
, 2017 Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems.
Daniel J. Bernstein +3 more
openalex +6 more sources
Provably Secure NTRU Instances over Prime Cyclotomic Rings [PDF]
, 2017 Due to its remarkable performance and potential resistance to quantum attacks, \(\mathsf {NTRUEncrypt}\) has drawn much attention recently; it also has been standardized by IEEE. However, classical \(\mathsf {NTRUEncrypt}\) lacks a strong security guarantee and its security still relies on heuristic arguments.
Yang Yu, Guangwu Xu, Xiaoyun Wang
openalex +3 more sources
NTRU Type Fully Homomorphic Encryption Scheme over Prime Power Cyclotomic Rings [PDF]
Jisuanji kexue, 2022 Full homomorphic encryption (FHE) supports arbitrary computation on the ciphertext without the requirement of decryption,which provides protection for privacy security in cloud computing.However,the current FHE scheme constructed using the approximate ...
QIN Xiao-yue, HUANG Ru-wei, YANG Bo
doaj +2 more sources
Optimization of NTRU Prime asymmetric encryption algorithm
Radiotekhnika, 2017 The results of algorithms optimization for the post-quantum mechanism of asymmetric encryption NTRU Prime are given. Namely: module reduction, blinding polynomial calculation, encryption and decryption algorithms. A comparative analysis of different polynomials multiplications is also given.
О.Г. Качко +3 more
openalex +3 more sources