On the bit security of NTRUEncrypt

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

Volumn 2567, Issue , 2003, Pages 62-70

  Näslund, Mats ^a   Shparlinski, Igor E ^b   Whyte, William ^c  

^a ERICSSON RESEARCH   (Sweden)

^b MACQUARIE UNIVERSITY   (Australia)

^c NTRU Cryptosystems Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY;

COMPUTATIONAL MODEL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 26744476187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36288-6_5     Document Type: Article

References (18)

1. W. Alexi, B. Chor, O. Goldreich and C. P. Schnorr, 'RSA and Rabin functions: Certain parts are as hard as the whole', SIAM Journal on Computing, 17 (1988), 194-209.
2. D. Boneh and I. E. Shparlinski, 'On the unpredictability of bits of the elliptic curve Diffie-Hellman scheme', Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2139 (2001), 201-212.
3. D. Boneh and R. Venkatesan, 'Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes', Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 129-142.
4. Consortium for Efficient Embedded Security, Efficient Embedded Security Standard #1, Draft 4. Available from http://www.ceesstandards.org.
5. C. Gentry, 'Key recovery and message attack on NTRU-composite', Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2045 (2001), 182-194.
6. M. Goldman, M. Näslund and A. Russell, 'Complexity bounds on general hardcore predicates', J. Cryptology, 14 (2001), 177-195.
7. S. Goldwasser, S. Micali and P. Tong, 'Why and how to establish a private code on a public network (Extended abstract)', Proc. 23rd Annual IEEE Symp. on Foundations of Comp. Sci., 1982, 134-144.
8. M. I. González Vasco and M. Näslund, 'A survey of hard core functions', Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkhäuser, 2001, 227-256.
9. M. I. González Vasco and I. E. Shparlinski, 'On the security of Diffie-Hellman bits', Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkhauser, 2001, 257-268.
10. M. I. Gonzalez Vasco and I. E. Shparlinski, 'Security of the most significant bits of the Shamir message passing scheme', Math. Comp., 71 (2002), 333-342.
11. J. Håstad and M. Näslund, 'The security of individual RSA and discrete log bits', J. of the ACM, (to appear).
12. J. Hoffstein, J. Pipher and J. H. Silverman, 'NTRU: A ring based public key cryptosystem', Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1433 (1998), 267-288.
13. J. Hoffstein and J. H. Silverman, 'Optimizations for NTRU', Proc. the Conf. on Public Key Cryptography and Computational Number Theory, Warsaw, 2000, Walter de Gruyter, 2001, 77-88.
14. N. A. Howgrave-Graham, P. Q. Nguyen and I. E. Shparlinski, 'Hidden number problem with hidden multipliers, timed-release crypto and noisy exponentiation', Math. Comp., (to appear).
15. W.-C. W. Li, M. Näslund and I. E. Shparlinski, 'The hidden number problem with the trace and bit security of XTR and LUC', Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2442 (2002), 433-448.
16. P. Q. Nguyen and D. Pointcheval, 'Analysis and improvements of NTRU encryption paddings', Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2442 (2002, 210-225.
17. C. P. Schnorr, 'Security of almost all discrete log bits', Electronic Colloq. on Comp. Compl., Univ. of Trier, TR98-033 (1998), 1-13.
18. J. H. Silverman, 'Invertibility in truncated polynomial rings', NTRU Cryptosystem Tech. Report 9, 1998, 1-8.