{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:53Z","timestamp":1775794853531,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642349607","type":"print"},{"value":"9783642349614","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34961-4_27","type":"book-chapter","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T09:22:26Z","timestamp":1353057746000},"page":"433-450","source":"Crossref","is-referenced-by-count":65,"title":["Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures"],"prefix":"10.1007","author":[{"given":"L\u00e9o","family":"Ducas","sequence":"first","affiliation":[]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Ajtai, M.: Generating random lattices according to the invariant distribution (Draft of March 2006)"},{"key":"27_CR2","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Complexity of Computations and Proofs. Quad. Mat, vol.\u00a013, Dept. Math., Seconda Univ. Napoli, Caserta, pp. 1\u201332 (2004)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz lattice reduction and the nearest lattice point problem. Combinatorica\u00a06, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"27_CR4","unstructured":"Consortium for Efficient Embedded Security. Efficient embedded security standards #1: Implementation aspects of NTRUEncrypt and NTRUSign. Version 2.0 [17] (June 2003)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Ducas, L., Nguyen, P.Q.: Learning a zonotope and more: Cryptanalysis of NTRUSign countermeasures. Full version of the ASIACRYPT 2012 article (2012)","DOI":"10.1007\/978-3-642-34961-4_27"},{"key":"27_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-34961-4_26","volume-title":"ASIACRYPT 2012","author":"L. Ducas","year":"2012","unstructured":"Ducas, L., Nguyen, P.Q.: Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 415\u2013432. Springer, Heidelberg (2012)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proc. STOC 2009, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proc. STOC 2008, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-Key Cryptosystems from Lattice Reduction Problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997); full version vailable at ECCC as TR96-056"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Graham, N.A.H., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSIGN: Digital signatures using the NTRU lattice. Full version of [11] Draft of April 2 (2002); Available on NTRU\u2019s website","DOI":"10.1007\/3-540-36563-X_9"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-36563-X_9","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"J. Hoffstein","year":"2003","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSIGN: Digital Signatures Using the NTRU Lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 122\u2013140. Springer, Heidelberg (2003)"},{"key":"27_CR12","unstructured":"Hoffstein, J., Graham, N.A.H., Pipher, J., Silverman, J.H., Whyte, W.: Performances improvements and a baseline parameter generation algorithm for NTRUsign. In: Proc. of Workshop on Mathematical Problems and Techniques in Cryptology, pp. 99\u2013126. CRM (2005)"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Whyte, W.: Practical lattice-based cryptography: NTRUEncrypt and NTRUSign. In\u00a0[25] (2010)","DOI":"10.1007\/978-3-642-02295-1_11"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A Ring-Based Public Key Cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998); first presented at the rump session of Crypto 1996"},{"key":"27_CR15","unstructured":"Howgrave-Graham, N., Silverman, J.H., Whyte, W.: A meet-in-the-middle attack on an NTRU private key (2003), http:\/\/www.ntru.com\/cryptolab\/tech_notes.htm#004"},{"issue":"7","key":"27_CR16","doi-asserted-by":"publisher","first-page":"3216","DOI":"10.1109\/TIT.2008.924662","volume":"54","author":"Y. Hu","year":"2008","unstructured":"Hu, Y., Wang, B., He, W.: NTRUSign with a new perturbation. IEEE Transactions on Information Theory\u00a054(7), 3216\u20133221 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR17","unstructured":"IEEE P1363.1. Public-key cryptographic techniques based on hard problems over lattices (June 2003), http:\/\/grouper.ieee.org\/groups\/1363\/lattPK\/index.html"},{"key":"27_CR18","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: Proc. of SODA 2000. ACM\u2013SIAM (2000)"},{"key":"#cr-split#-27_CR19.1","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V.: Lattice Signatures without Trapdoors. IACR Cryptology ePrint Archive, 2011:537 (2011)","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"#cr-split#-27_CR19.2","unstructured":"In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 738-755. Springer, Heidelberg (2012)"},{"key":"27_CR20","unstructured":"Malkin, T., Peikert, C., Servedio, R.A., Wan, A.: Learning an overcomplete basis: Analysis of lattice-based signatures with perturbations, 2009 manuscript cited in\u00a0[26], available as [27, Chapter 6] (2009)"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44670-2_11","volume-title":"Cryptography and Lattices","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: Improving Lattice Based Cryptosystems Using the Hermite Normal Form. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 126\u2013145. Springer, Heidelberg (2001)"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D. Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Post-Quantum Cryptography, pp. 147\u2013191. Springer, Berlin (2009)"},{"key":"#cr-split#-27_CR23.1","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Regev, O.: Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. J. Cryptology\u00a022(2), 139-160 (2009)","DOI":"10.1007\/s00145-008-9031-0"},{"key":"#cr-split#-27_CR23.2","unstructured":"In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 271-288. Springer, Heidelberg (2006)"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The Two Faces of Lattices in Cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Vall\u00e9e, B. (eds.): The LLL Algorithm: Survey and Applications. Information Security and Cryptography. Springer (2010)","DOI":"10.1007\/978-3-642-02295-1"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C. Peikert","year":"2010","unstructured":"Peikert, C.: An Efficient and Parallel Gaussian Sampler for Lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 80\u201397. Springer, Heidelberg (2010)"},{"key":"27_CR27","unstructured":"Wan, A.: Learning, cryptography, and the average case. PhD thesis, Columbia University (2010), http:\/\/itcs.tsinghua.edu.cn\/~atw12\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34961-4_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T01:08:53Z","timestamp":1745197733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34961-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642349607","9783642349614"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34961-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}