{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T11:59:34Z","timestamp":1793102374045,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540435532","type":"print"},{"value":"9783540460350","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46035-7_20","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T08:21:56Z","timestamp":1186820516000},"page":"299-320","source":"Crossref","is-referenced-by-count":103,"title":["Cryptanalysis of the Revised NTRU Signature Scheme"],"prefix":"10.1007","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mike","family":"Szydlo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,4,29]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, The shortest vector problem in L 2 is NP-hard for randomized reductions, in Proc. 30th ACM Symposium on Theory of Computing, 1998, 10\u201319.","DOI":"10.1145\/276698.276705"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"H. Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, 138. Springer, 1993.","DOI":"10.1007\/978-3-662-02945-9"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"H. Cohen, Advanced Topics in Computational Number Theory, Graduate Texts in Mathematics 138, 1993.","DOI":"10.1007\/978-3-662-02945-9"},{"key":"20_CR4","unstructured":"Consortium for Efficient Embedded Security. Efficient Embedded Security Standard (EESS) # 1: Draft 1.0. Previously on http:\/\/www.ceesstandards.org"},{"key":"20_CR5","unstructured":"Consortium for Efficient Embedded Security. Efficient Embedded Security Standard (EESS) # 1: Draft 2.0. Previously on http:\/\/www.ceesstandards.org"},{"key":"20_CR6","unstructured":"Consortium for Efficient Embedded Security. Efficient Embedded Security Standard (EESS) # 1: Draft 3.0. Available from http:\/\/www.ceesstandards.org"},{"key":"20_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-69053-0_5","volume-title":"Proc. of Eurocrypt\u2019 97","author":"D. Coppersmith","year":"1997","unstructured":"D. Coppersmith and A. Shamir, Lattice Attacks on NTRU, in Proc. of Eurocrypt\u2019 97, LNCS 1233, pages 52\u201361. Springer-Verlag, 1997."},{"key":"20_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-44987-6_12","volume-title":"Proc. of Eurocrypt\u2019 01","author":"C. Gentry","year":"2001","unstructured":"C. Gentry, Key Recovery and Message Attacks on NTRU-Composite, in Proc. of Eurocrypt\u2019 01, LNCS 2045, pages 182\u2013194. Springer-Verlag, 2001."},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. of Asiacrypt\u2019 01","author":"C. Gentry","year":"2001","unstructured":"C. Gentry, J. Jonsson, J. Stern, M. Szydlo, Cryptanalysis of the NTRU signature scheme, in Proc. of Asiacrypt\u2019 01, LNCS 2248, pages 1\u201320. Springer-Verlag, 2001."},{"key":"20_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Proc. of Crypto\u2019 97","author":"O. Goldreich","year":"1997","unstructured":"O. Goldreich, S. Goldwasser, S. Halevi, Public-key Cryptography from Lattice Reduction Problems, in Proc. of Crypto\u2019 97, LNCS 1294, pages 112\u2013131. Springer-Verlag, 1997."},{"key":"20_CR11","unstructured":"J. Hoffstein, N. Howgrave-Graham, J. Pipher, J.H. Silverman, W. Whyte, NTRUSign: Digital Signatures Using the NTRU Lattice, December, 2001. Available from http:\/\/www.ntru.com"},{"key":"20_CR12","unstructured":"J. Hoffstein, B.S. Kaliski, D. Lieman, M.J.B. Robshaw, Y.L. Yin, Secure user identification based on constrained polynomials, US Patent 6,076,163, June 13, 2000."},{"key":"20_CR13","unstructured":"J. Hoffstein, D. Lieman, J.H. Silverman, Polynomial Rings and Efficient Public Key Authentication, in Proc. International Workshop on Cryptographic Techniques and E-Commerce (CrypTEC\u2019 99), Hong Kong, (M. Blum and C.H. Lee, eds.), City University of Hong Kong Press."},{"key":"20_CR14","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman, Enhanced Encoding and Verification Methods for the NTRU Signature Scheme, NTRU Technical Note #017, May 2001. Available from http:\/\/www.ntru.com"},{"key":"20_CR15","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman. Enhanced encoding and verification methods for the NTRU signature scheme (ver. 2), May 30, 2001. Available from http:\/\/www.ntru.com"},{"key":"20_CR16","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman, NSS: The NTRU Signature Scheme, preprint, November 2000. Available from http:\/\/www.ntru.com"},{"key":"20_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-44987-6_14","volume-title":"Proc. of Eurocrypt\u2019 01","author":"J. Hoffstein","year":"2001","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman, NSS: The NTRU Signature Scheme, in Proc. of Eurocrypt\u2019 01, LNCS 2045, pages 211\u2013228. Springer-Verlag, 2001."},{"key":"20_CR18","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman, NSS: The NTRU Signature Scheme: Theory and Practice, preprint, 2001. Available from http:\/\/www.ntru.com"},{"key":"20_CR19","first-page":"513","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra Jr., L. Lov\u00e1sz, Factoring Polynomials with Rational Coefficients, Mathematische Ann. 261 (1982), 513\u2013534.","journal-title":"Mathematische Ann."},{"key":"20_CR20","unstructured":"A. May, Cryptanalysis of NTRU-107, preprint, 1999. Available from http:\/\/www.informatik.uni-frankfurt.de\/~alex\/crypto.html"},{"key":"20_CR21","unstructured":"I. Mironov, A Note on Cryptanalysis of the Preliminary Version of the NTRU Signature Scheme, IACR preprint server, http:\/\/eprint.iacr.org\/2001\/005 ."},{"key":"20_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/10722028_4","volume-title":"Proc. of Algorithm Number Theory (ANTS IV)","author":"P. Nguyen","year":"2000","unstructured":"P. Nguyen and J. Stern, Lattice Reduction in Cryptology: An Update, in Proc. of Algorithm Number Theory (ANTS IV), LNCS 1838, pages 85\u2013112. Springer-Verlag, 2000."},{"key":"20_CR23","unstructured":"J.H. Silverman, Estimated Breaking Times for NTRU Lattices, NTRU Technical Note #012, March 1999. Available from http:\/\/www.ntru.com"},{"key":"20_CR24","unstructured":"J.H. Silverman, Invertibility in Truncated Polynomial Rings., NTRU Technical Note #009, October 1998. Available from http:\/\/www.ntru.com"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"L. Washington, Introduction to Cyclotomic Fields, Graduate Texts in Mathematics 83, 1982.","DOI":"10.1007\/978-1-4684-0133-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46035-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:20:51Z","timestamp":1556738451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46035-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435532","9783540460350"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-46035-7_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}