{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:54:17Z","timestamp":1764996857930,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019562"},{"type":"electronic","value":"9783642019579"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01957-9_27","type":"book-chapter","created":{"date-parts":[[2009,5,15]],"date-time":"2009-05-15T11:24:25Z","timestamp":1242386665000},"page":"437-455","source":"Crossref","is-referenced-by-count":58,"title":["Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches"],"prefix":"10.1007","author":[{"given":"Philip S.","family":"Hirschhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Hoffstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Howgrave-Graham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Whyte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai, L.: On Lovasz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica\u00a06(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45539-6_1","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S. Cavallar","year":"2000","unstructured":"Cavallar, S., Dodson, B., Lenstra, A.K., Lioen, W., Montgomery, P.L., Murphy, B., te Riele, H.J.J., et al.: Factorization of a 512-bit RSA modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 1\u201317. Springer, Heidelberg (2000)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-69053-0_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D., Shamir, A.: Lattice Attack on NTRU. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 52\u201361. Springer, Heidelberg (1997)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-44987-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"C. Gentry","year":"2001","unstructured":"Gentry, C.: Key recovery and message attacks on NTRU-composite. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 182. Springer, Heidelberg (2001)"},{"key":"27_CR6","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 new high speed public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"27_CR7","unstructured":"Hoffstein, J., Silverman, J.H.: Invertibility in truncated polynomial rings.\u00a0 Technical report, NTRU Cryptosystems, Report #009, version 1 (October 1998), \n                    \n                      http:\/\/www.ntru.com"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(02)00588-7","volume":"130","author":"J. Hoffstein","year":"2003","unstructured":"Hoffstein, J., Silverman, J.H.: Random small hamming weight products with applications to cryptography. Discrete Applied Mathematics\u00a0130(1), 37\u201349 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-45146-4_14","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"N. Howgrave-Graham","year":"2003","unstructured":"Howgrave-Graham, N., Nguyen, P., Pointcheval, D., Proos, J., Silverman, J.H., Singer, A., Whyte, W.: The Impact of Decryption Failures on the Security of NTRU Encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 226\u2013246. Springer, Heidelberg (2003)"},{"key":"27_CR10","unstructured":"Howgrave-Graham, N., Silverman, J.H., Singer, A., Whyte, W.: NAEP: Provable Security in the Presence of Decryption Failures IACR ePrint Archive, Report 2003-172, \n                    \n                      http:\/\/eprint.iacr.org\/2003\/172\/"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham, N., Silverman, J.H., Whyte, W.: Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3 CT-RSA, pp.\u00a0118\u2013135 (2005)","DOI":"10.1007\/978-3-540-30574-3_10"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-74143-5_9","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"N. Howgrave-Graham","year":"2007","unstructured":"Howgrave-Graham, N.: A hybrid meet-in-the-middle and lattice reduction attack on NTRU. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 150\u2013169. Springer, Heidelberg (2007)"},{"key":"27_CR13","unstructured":"Joux, A., Howgrave-Graham, N.: Generalized birthday problems applied to subset sum (manuscript)"},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A. Lenstra","year":"2001","unstructured":"Lenstra, A., Verheul, E.: Selecting Cryptographic Key Sizes. Journal of Cryptology\u00a014(4), 255\u2013293 (2001)","journal-title":"Journal of Cryptology"},{"key":"27_CR15","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_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-78440-1_2","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"P. Mol","year":"2008","unstructured":"Mol, P., Yung, M.: Recovering NTRU Secret Key from Inversion Oracles. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 18\u201336. Springer, Heidelberg (2008)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"27_CR18","unstructured":"RSA Laboratories, RSAES-OAEP Encryption Scheme, \n                    \n                      ftp:\/\/ftp.rsasecurity.com\/pub\/rsalabs\/rsa\/_algorithm\/rsa-oaep_spec.pdf"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"C.P. Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice Reduction by Random Sampling and Birthday Methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 145\u2013156. Springer, Heidelberg (2003)"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-68697-5_7","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"S. Vaudenay","year":"1996","unstructured":"Vaudenay, S.: Hidden Collisions on DSS. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 83\u201388. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01957-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:15:57Z","timestamp":1558268157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01957-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019562","9783642019579"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01957-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}