نتایج جستجو برای: ntru

تعداد نتایج: 255  

2007
Narasimham Challa Jayaram Pradhan

In many business sectors secure and efficient data transfer is essential. To ensure the security to the applications of business, the business sectors use Public Key Cryptographic Systems (PKCS). An RSA and NTRU system generally belongs to the category of PKCS. The efficiency of a public key cryptographic system is mainly measured in computational overheads, key size and bandwidth. In particula...

2011
Xu-Ren Luo Chen-Hui Jerry Lin

In recent years the study of cryptosystem has shifted noticeably from symmetric to asymmetric key encryptions. One of the more intriguing issues of the research is NTRU encryption system, which is based on ring theory. The security of NTRU always depends on the lattices. Several studies have suggested that it is very difficult to know whether a polynomial is invertible or not. Nayak et al. intr...

2000
Jeffrey Hoffstein Joseph H. Silverman

This report describes how the Fujisaki-Okamoto SelfReferential Technique (FOSRT) can be used to make the NTRU Public Key Cryptosystem resistant to adaptive chosen ciphertext attacks and to reaction attacks. Many asymmetric ciphers are susceptible to (adaptive) chosen ciphertext attacks. An attacker sends a series of purported ciphertexts e1, e2, . . . and uses the decryptions to deduce informat...

Journal: :IACR Cryptology ePrint Archive 2005
Nick Howgrave-Graham Jeffrey Hoffstein Jill Pipher William Whyte

This report explicitly refutes the analysis behind a recent claim that NTRUEncrypt has a bit security of at most 74 bits. We also sum up some existing literature on NTRU and lattices, in order to help explain what should and what should not be classed as an improved attack against the hard problem underlying NTRUEncrypt. We also show a connection between Schnorr’s RSR technique and exhaustively...

Journal: :Applied Mathematics and Nonlinear Sciences 2020

Journal: :IACR Cryptology ePrint Archive 2002
Daewan Han Jin Hong Jae Woo Han Daesung Kwon

NTRU is an efficient public-key cryptosystem proposed by Hoffstein, Pipher, and Silverman. Assuming access to a decryption oracle, we show ways to recover the private key of NTRU systems that do not include a ciphertext validating procedure. The strongest of our methods will employ just a single call to the oracle, and in all cases, the number of calls needed will be small enough to be realistic.

2005
Christoph Ludwig

We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behaviour of these algorithms. We describe how Sampling Reduction allows to stage lattice attacks against the NTRU cryptosystem with smaller BKZ parameters than before and conclude that therefore the recommeded NTRU securi...

Journal: :IACR Cryptology ePrint Archive 2009
Ehsan Malekian Ali Zakerolhosseini Atefeh Mashatan

We propose QTRU, a probabilistic and multi-dimensional public key cryptosystem based on the NTRU public key cryptosystem using quaternion algebra. QTRU encrypts four data vectors in each encryption session and the only other major difference between NTRU and QTRU is that the underlying algebraic structure has been changed to a non-commutative algebraic structure. As a result, QTRU inherits the ...

2010
Ehsan Malekian Ali Zakerolhosseini Atefeh Mashatan

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent security on the...

Journal: :Journal of Mathematical Cryptology 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید