Results 131 to 140 of about 343 (170)
Some of the next articles are maybe not open access.
2022
The NTRU problem can be viewed as an instance of finding a short non-zero vector in a lattice, under the promise that it contains an exceptionally short vector. Further, the lattice under scope has the structure of a rank-2 module over the ring of integers of a number field.
Felderhoff, Joël +2 more
openaire +3 more sources
The NTRU problem can be viewed as an instance of finding a short non-zero vector in a lattice, under the promise that it contains an exceptionally short vector. Further, the lattice under scope has the structure of a rank-2 module over the ring of integers of a number field.
Felderhoff, Joël +2 more
openaire +3 more sources
D-NTRU: More efficient and average-case IND-CPA secure NTRU variant
Information Sciences, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baocang Wang, Yupu Hu
exaly +3 more sources
Cryptanalysis on “NTRU+: Compact Construction of NTRU Using Simple Encoding Method”
IEEE Transactions on Information Forensics and SecurityJaewook Lee, Hansol Ryu, Jaehui Park
exaly +2 more sources
IACR Cryptol. ePrint Arch., 2016
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.
Bernstein, Daniel J. +3 more
openaire +2 more sources
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.
Bernstein, Daniel J. +3 more
openaire +2 more sources
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022
NTRUEncrypt is one of the first lattice-based encryption schemes. Furthermore, the earliest fully homomorphic encryption (FHE) schemes rely on the NTRU problem. Currently, NTRU is one of the leading candidates in the NIST post-quantum standardization competition. What makes NTRU appealing is the age of the cryptosystem and relatively good performance.
openaire +2 more sources
NTRUEncrypt is one of the first lattice-based encryption schemes. Furthermore, the earliest fully homomorphic encryption (FHE) schemes rely on the NTRU problem. Currently, NTRU is one of the leading candidates in the NIST post-quantum standardization competition. What makes NTRU appealing is the age of the cryptosystem and relatively good performance.
openaire +2 more sources
A matrix formulation for NTRU cryptosystem
2008 16th IEEE International Conference on Networks, 2008In many business sectors sending secure information over public channels has become a challenging task. Data encryption is not the most efficient method to counteract attacks by adversaries. One form of encryption is to use the same key by the sender for encryption as well as the receiver for decryption.
Rakesh Nayak +2 more
openaire +1 more source
Achieving NTRU with montgomery multiplication
IEEE Transactions on Computers, 2003We propose a new unified architecture that utilizes the Montgomery multiplication algorithm to perform a modular multiplication for both integers and binary polynomials and NTRU's polynomial multiplications. The unified design is capable of supporting a majority of public-key cryptosystems such as NTRU, RSA, Diffie-Hellman key exchange, and elliptic ...
Colleen O'Rourke, Berk Sunar
openaire +1 more source
Study on NTRU Decryption Failures
Third International Conference on Information Technology and Applications (ICITA'05), 2005NTRU is a new public key encryption scheme based on hard problems in lattice. Due to the linear operations, both encryption and decryption of NTRU are very fast. However, decryption of this scheme may be failed even for recommended parameters. In this paper, NTRU decryption failures are analyzed.
Weichi Yu, Dake He, Shixiong Zhu
openaire +1 more source
On the Efficiency of Provably Secure NTRU
2014It is still a challenge to find a lattice-based public-key encryption scheme that combines efficiency (as e.g. NTRUEncrypt) with a very strong security guarantee (as e.g. the ring-LWE based scheme of Lyubashevsky, Peikert, and Regev LPR-LWE). Stehle and Steinfeld (EUROCRYPT 11) presented a provably secure variant of NTRUEncrypt (pNE), perhaps the first
Daniel Cabarcas +2 more
openaire +1 more source
2017
Cold boot attacks target memory remanence effects in hardware to secret key material. Such attacks were first explored in the scientific literature by Halderman et al. (USENIX Security Symposium 2008) and, since then, different attacks have been developed against a range of asymmetric key and symmetric key algorithms. Such attacks in general receive as
Kenneth G. Paterson +1 more
openaire +1 more source
Cold boot attacks target memory remanence effects in hardware to secret key material. Such attacks were first explored in the scientific literature by Halderman et al. (USENIX Security Symposium 2008) and, since then, different attacks have been developed against a range of asymmetric key and symmetric key algorithms. Such attacks in general receive as
Kenneth G. Paterson +1 more
openaire +1 more source