Results 171 to 180 of about 1,865 (197)
Some of the next articles are maybe not open access.
2023
?????????????? ?????????? ???? ????????????, ???????????????????????? ?? 2008 ??. ??. ??????????????????????, ???? ?????????????????????? ?????????????????? ???????????????????? ?????????????????? ??(f), ???????????????????????????????? ???????????????? sup-?????????? ???????????????????????? ?????????????????? ???????????? ?????????????????? ??????????
openaire +1 more source
?????????????? ?????????? ???? ????????????, ???????????????????????? ?? 2008 ??. ??. ??????????????????????, ???? ?????????????????????? ?????????????????? ???????????????????? ?????????????????? ??(f), ???????????????????????????????? ???????????????? sup-?????????? ???????????????????????? ?????????????????? ???????????? ?????????????????? ??????????
openaire +1 more source
2018
Researched a new class of parameters such NTRU algorithm optimized basic algorithmic operations.
openaire +1 more source
Researched a new class of parameters such NTRU algorithm optimized basic algorithmic operations.
openaire +1 more source
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
A Multiple Birthday Attack on NTRU.
2008In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem (Wagner, 2002) allowed to speed-up several combinatorial attacks. However, in the case of NTRU we can not hope to to apply Wagner's algorithm directly, as the search space does not behave ...
openaire +3 more sources
A Key Encapsulation Mechanism for NTRU
2005In this article we present a key encapsulation mechanism (KEM) for NTRU. The KEM is more efficient than a naive approach based on NAEP and resistant against the decryption failures that may occur when using NTRU. We also introduce plaintext awareness for KEMs and use it to tighten a security result by Dent.
openaire +1 more source
A Lattice-Based Key Exchange Protocol Over NTRU-NIP
Algorithms for Intelligent Systems, 2023Sahadeo Padhye, Sonika Singh
exaly
A comparative analysis between NTRU and its some NTRU-Like cryptosystems
AIP Conference Proceedings, 2023Hassan Rashed Yassein +1 more
openaire +1 more source
A polynomial time algorithm for breaking NTRU encryption with multiple keys
Designs, Codes, and Cryptography, 2023Changmin Lee, Jiseung Kim
exaly

