{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T03:03:42Z","timestamp":1792724622082,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540646570","type":"print"},{"value":"9783540691136","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054868","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:06:06Z","timestamp":1154419566000},"page":"267-288","source":"Crossref","is-referenced-by-count":1297,"title":["NTRU: A ring-based public key cryptosystem"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Hoffstein","sequence":"first","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"}]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"M. Blum, S. Goldwasser, An efficient probabilistic public-key encryption scheme which hides all partial information, Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science, vol. 196, Springer-Verlag, 1985, pp. 289\u2013299.","DOI":"10.1007\/3-540-39568-7_23"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, A. Shamir, Lattice attacks on NTRU, Preprint, April 5, 1997; presented at Eurocrypt 97.","DOI":"10.1007\/3-540-69053-0_5"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M.E. Hellman, New directions in cryptography, IEEE Trans. on Information Theory 22 (1976), 644\u2013654.","journal-title":"IEEE Trans. on Information Theory"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptosystems from lattice reduction problems, MIT \u2014 Laboratory for Computer Science preprint, November 1996.","DOI":"10.1007\/BFb0052231"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and A. Micali, Probabilistic encryption, J. Computer and Systems Science 28 (1984), 270\u2013299.","journal-title":"J. Computer and Systems Science"},{"key":"19_CR6","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman, NTRU: A new high speed public key cryptosystem, Preprint; presented at the rump session of Crypto 96."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra, L. Lov\u015az, Factoring polynomials with polynomial coefficients, Math. Annalen 261 (1982), 515\u2013534.","journal-title":"Math. Annalen"},{"key":"19_CR8","first-page":"114","volume":"42\u201344","author":"R.J. McEliece","year":"1978","unstructured":"R.J. McEliece, A public-key cryptosystem based on algebraic coding theory, JPL Pasadena, DSN Progress Reports 42\u201344 (1978), 114\u2013116.","journal-title":"JPL Pasadena, DSN Progress Reports"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM 21 (1978), 120\u2013126.","journal-title":"Communications of the ACM"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1017\/S0963548300001371","volume":"3","author":"C.P. Schnorr","year":"1994","unstructured":"C.P. Schnorr, Block reduced lattice bases and successive minima, Combinatorics, Probability and Computing 3 (1994), 507\u2013522.","journal-title":"Combinatorics, Probability and Computing"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C.P. Schnorr","year":"1994","unstructured":"C.P. Schnorr, M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, Mathematical Programing 66 (1994), 181\u2013199.","journal-title":"Mathematical Programing"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"C.P. Schnorr, H.H. Hoerner, Attacking the Chor Rivest cryptosystem by improved lattice reduction, Proc. EUROCRYPT 1995, Lecture Notes in Computer Science 921, Springer-Verlag, 1995, pp. 1\u201312.","DOI":"10.1007\/3-540-49264-X_1"},{"key":"19_CR13","unstructured":"J.H. Silverman, A Meet-In-The-Middle Attack on an NTRU Private Key, preprint."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:18:20Z","timestamp":1555748300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646570","9783540691136"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0054868","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}