NTRU: A ring-based public key cryptosystem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1423, Issue , 1998, Pages 267-288

  Hoffstein, Jeffrey ^a   Pipher, Jill ^a   Silverman, Joseph H ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MIXING; NUMBER THEORY; PROBABILITY;

ENCRYPTION AND DECRYPTION; HIGH SPEED; LOW MEMORY; MIXING SYSTEM; NTRU CRYPTOSYSTEM; POLYNOMIAL ALGEBRA; PROBABILITY THEORY; PUBLIC KEY CRYPTOSYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84947808606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054868     Document Type: Conference Paper

References (13)

1. M. Blum, S. Goldwasser, An efficient probabilistic public-key encryption scheme which hides all partial information, Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science, vol. 196, Springer-Verlag, 1985, pp. 289-299.
2. D. Coppersmith, A. Shamir, Lattice attacks on NTRU, Preprint, April 5, 1997; presented at Eurocrypt 97.
3. W. Diffie, M.E. Hellman, New directions in cryptography, IEEE Trans, on Information Theory 22 (1976), 644-654.
4. O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptosystems from lattice reduction problems, MIT - Laboratory for Computer Science preprint, November 1996.
5. S. Goldwasser and A. Micali, Probabilistic encryption, J. Computer and Systems Science 28 (1984), 270-299.
6. J. Hoffstein, J. Pipher, J.H. Silverman, NTRU: A new high speed public key cryptosystem, Preprint; presented at the rump session of Crypto 96.
7. A.K. Lenstra, H.W. Lenstra, L. Loviz, Factoring polynomials with polynomial coefficients, Math. Annalen 261 (1982), 515-534.
8. R.J. McEliece, A public-key cryptosystem based on algebraic coding theory, JPL Pasadena, DSN Progress Reports 42-44 (1978), 114-116.
9. R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM 21 (1978), 120-126.
10. C.P. Schnorr, Block reduced lattice bases and successive minima, Combinatorics, Probar bility and Computing 3 (1994), 507-522.
11. C.P. Schnorr, M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, Mathematical Programing 66 (1994), 181-199.
12. C.P. Schnorr, H.H. Hoerner, Attacking the Chor Rivest cryptosystem by improved lattice reduction, Proc. EUROCRYPT 1995, Lecture Notes in Computer Science 921, SpringerVerlag, 1995, pp. 1-12.
13. J.H. Silverman, A Meet-In-The-Middle Attack on an NTRU Private Key, preprint.