Results 161 to 170 of about 4,957 (182)
Some of the next articles are maybe not open access.
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, Hao Lei, Yupu Hu
openaire +2 more sources
Vulnerable Public Keys in NTRU Cryptosystem
Chinese Annals of Mathematics, Series B, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Liqing +3 more
openaire +2 more sources
BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU
2019NTRU is one of the first public key cryptosystems not based on factorization or discrete logarithmic problems and is also considered secure even against quantum computer attacks. In 2011, Stehle and Steinfeld proposed a variant of the classical NTRU that is IND-CPA secure but for the key generation algorithm, they use Gaussian distribution with a large
Michel Seck, Djiby Sow
openaire +1 more source
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 +2 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 +2 more sources
NTRU over rings beyond $${\mathbb{Z}}$$
Designs, Codes and Cryptography, 2009NTRU is a public-key cryptosystem introduced by [\textit{J. Hoffstein, J. Pipher} and \textit{J. H. Silverman}, NTRU: A ring-based public key cryptosystem. Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21--25, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1423, 267--288 (1998; Zbl 1067.94538)]
Nevins, Monica +2 more
openaire +2 more sources
2023
?????????????? ?????????? ???? ????????????, ???????????????????????? ?? 2008 ??. ??. ??????????????????????, ???? ?????????????????????? ?????????????????? ???????????????????? ?????????????????? ??(f), ???????????????????????????????? ???????????????? sup-?????????? ???????????????????????? ?????????????????? ???????????? ?????????????????? ??????????
openaire +1 more source
?????????????? ?????????? ???? ????????????, ???????????????????????? ?? 2008 ??. ??. ??????????????????????, ???? ?????????????????????? ?????????????????? ???????????????????? ?????????????????? ??(f), ???????????????????????????????? ???????????????? sup-?????????? ???????????????????????? ?????????????????? ???????????? ?????????????????? ??????????
openaire +1 more source
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.
Bernstein, Daniel J. +3 more
openaire +1 more source
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 +1 more source
NTRU+: Compact Construction of NTRU Using Simple Encoding Method
IEEE Transactions on Information Forensics and Security, 2023Jonghyun Kim, Jong Hwan Park
openaire +1 more source
2003
We recall that in theNTRU cryptosystem[267, 269], one selects integer parameters(N q)and four setsG f Gg L: Lof polynomialsf gcp, m in the ring . The coefficients of these polynomials are constrained by the choice of an additional parameter, p, a small integer or polynomial. In the original presentation of NTRU, see [267], the choicep =3 is considered,
openaire +1 more source
We recall that in theNTRU cryptosystem[267, 269], one selects integer parameters(N q)and four setsG f Gg L: Lof polynomialsf gcp, m in the ring . The coefficients of these polynomials are constrained by the choice of an additional parameter, p, a small integer or polynomial. In the original presentation of NTRU, see [267], the choicep =3 is considered,
openaire +1 more source