{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:52:00Z","timestamp":1779900720742,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540008477","type":"print"},{"value":"9783540365631","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36563-x_9","type":"book-chapter","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T10:24:59Z","timestamp":1193999099000},"page":"122-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":173,"title":["NTRUSign: Digital Signatures Using the NTRU Lattice"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Hoffstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nick","family":"Howgrave-Graham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jill","family":"Pipher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph H.","family":"Silverman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Whyte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, C. Dwork, A public-key cryptosystem with worst case\/average case equivalence. In Proc. 29th ACM Symposium on Theory of Computing, 1997, 284\u2013293. 122","DOI":"10.1145\/258533.258604"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"L. Babai On Lov\u00e1sz lattice reduction and the nearest lattice point problem, Combinatorica, vol. 6, 1986, 1\u201313. 127","journal-title":"Combinatorica"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"H. Cohen, A course in computational algebraic number theory, GTM 138, Springer-Verlag, 1993. 126","DOI":"10.1007\/978-3-662-02945-9"},{"key":"9_CR4","unstructured":"Wei Dai, Crypto++ 4.0 Benchmarks, \n                    http:\/\/www.eskimo.com\/\u223cweidai\/benchmarks.html\n                    \n                   139"},{"key":"9_CR5","unstructured":"Consortium for Efficient Embedded Security, Efficient Embedded Security Standard #1, available from \n                    http:\/\/www.ceesstandards.org\n                    \n                   139"},{"key":"9_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2014Asiacrypt\u2019 01","author":"C. Gentry","year":"2001","unstructured":"Craig Gentry, Jakob Jonsson, Jacques Stern, Michael Szydlo Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt\u2019 01, Advances in Cryptology\u2014Asiacrypt\u2019 01, Lecture Notes in Computer Science, Springer-Verlag, 2001. 123, 131"},{"key":"9_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2014Eurocrypt\u2019 02","author":"C. Gentry","year":"2002","unstructured":"C. Gentry, M Szydlo, Cryptanalysis of the Revised NTRU Signature Scheme, Advances in Cryptology\u2014Eurocrypt\u2019 02, Lecture Notes in Computer Science, Springer-Verlag, 2002. 123, 132, 133, 138"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptography from lattice reduction problems. In Proc. CRYPTO\u2019 97, Lect. Notes in Computer Science 1294, Springer-Verlag, 1997, 112\u2013131. 122, 123, 132","DOI":"10.1007\/BFb0052231"},{"key":"9_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44499-8_1","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 2000","author":"D. Hankerson","year":"2000","unstructured":"D. Hankerson, J. L. Hernandez, A. Menezes, Software Implementation of Elliptic Curve Cryptography over Binary Fields, Cryptographic Hardware and Embedded Systems-CHES 2000, LNCS 1965, C.K. Koc and C. Paar (eds), Springer-Verlag, 2000, 1\u201319. 139"},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory (ANTS III)","author":"J. Hoffstein","year":"1998","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman, NTRU: A new high speed public key cryptosystem, in Algorithmic Number Theory (ANTS III), Portland, OR, June 1998, Lecture Notes in Computer Science 1423 (J. P. Buhler, ed.), Springer-Verlag, Berlin, 1998, 267\u2013288. 122, 131"},{"key":"9_CR11","unstructured":"J. Hoffstein, N. Howgrave-Graham, J. Pipher, J. H. Silverman, W. Whyte NTRUSign: Digital signatures using the NTRU lattice. Preliminary draft 2\n                           \n                    http:\/\/www.ntru.com\/NTRUFTPDocsFolder\/NTRUSign v2.pdf\n                    \n                   123, 131, 138, 139"},{"key":"9_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2014Eurocrypt\u2019 01","author":"J. Hoffstein","year":"2001","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman, NSS: An NTRU Lattice-Based SignatureScheme, Advances in Cryptology\u2014Eurocrypt\u2019 01, Lecture Notes in Computer Science, Springer-Verlag, 2001. 123, 137"},{"key":"9_CR13","unstructured":"J. Hoffstein, D. Lieman, J.H. Silverman, Polynomial Rings and Efficient Public Key Authentication, in Proceeding of the 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. 137, 138"},{"key":"9_CR14","unstructured":"J. Hoffstein, J.H. Silverman, Polynomial Rings and Efficient Public Key Authentication II, in Proceedings of a Conference on Cryptography and Number Theory (CCNT\u2019 99), (I. Shparlinski, ed.), Birkhauser. 137"},{"issue":"4","key":"9_CR15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A. K. Lenstra","year":"2001","unstructured":"A. K. Lenstra, E.R. Verheul, Selecting Cryptographic Key Sizes, Journal of Cryptology vol. 14, no. 4, 2001, 255\u2013293. 131","journal-title":"Journal of Cryptology"},{"key":"9_CR16","unstructured":"T. Meskanen and A. Renvall, University of Turku, private communication. 139"},{"key":"9_CR17","series-title":"Lect Notes Comput Sci","volume-title":"Dimension reduction methods for convolution modular lattices","author":"A. May","year":"2001","unstructured":"A. May, J. H. Silverman, Dimension reduction methods for convolution modular lattices, in Cryptography and Lattices Conference (CaLC 2001), J.H. Silverman (ed.), Lecture Notes in Computer Science 2146, Springer-Verlag, 2001 131"},{"key":"9_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto\u2019 97","author":"P. Nguyen","year":"1997","unstructured":"P. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto\u2019 97, Advances in Cryptology\u2014Proceedings of CRYPTO\u2019 99, (August 15\u201319, 1999, Santa Barbara, California), M. Wiener (ed.), Lecture Notes in Computer Science, Springer-Verlag. 122"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"P. Nguyen and J. Stern, Lattice Reduction in Cryptology: An Update, ANTS 2000, pp 85\u2013112. 122","DOI":"10.1007\/10722028_4"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"A. Shamir, A polynomial-time algorithm for breaking the basic Merkel-Hellman cryptosystem. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, IEEE, 1982, 145\u2013152. 122","DOI":"10.1109\/SFCS.1982.5"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2003"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36563-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:49:06Z","timestamp":1558262946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36563-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008477","9783540365631"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-36563-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}