{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T02:57:34Z","timestamp":1720580254718},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,10]],"date-time":"2009-11-10T00:00:00Z","timestamp":1257811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10623-009-9342-7","type":"journal-article","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T11:42:19Z","timestamp":1257766939000},"page":"65-78","source":"Crossref","is-referenced-by-count":17,"title":["NTRU over rings beyond $${\\mathbb{Z}}$$"],"prefix":"10.1007","volume":"56","author":[{"given":"Monica","family":"Nevins","sequence":"first","affiliation":[]},{"given":"Camelia","family":"KarimianPour","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Miri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,10]]},"reference":[{"key":"9342_CR1","unstructured":"Buchmann J.: Reducing lattice bases by means of approximations. Algorithmic number theory, Ithaca, NY, 1994. Lecture Notes in Computer Science, vol. 877, pp. 160\u2013168. Springer, Berlin (1994)."},{"key":"9342_CR2","doi-asserted-by":"crossref","unstructured":"Coglianese M., Goi B.-M.: MaTRU: a new NTRU-based cryptosystem. Indocrypt 2005. Lecture Notes in Computer Science, vol. 3797, pp 232\u2013243. (2005).","DOI":"10.1007\/11596219_19"},{"key":"9342_CR3","doi-asserted-by":"crossref","unstructured":"Conway J.H., Sloane N.J.A.: Sphere packings, lattices and groups. In: Grundlehren der Mathematischen Wissenschaften, 3rd edn., vol. 290. Springer-Verlag, New York (1999).","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"9342_CR4","unstructured":"Coppersmith D., Shamir A.: Lattice attacks on NTRU. Advances in cryptology\u2014EUROCRYPT 1997. Lecture Notes in Computer Science, vol. 1233, pp. 52\u201361. Springer, Berlin (1997)."},{"key":"9342_CR5","unstructured":"Gaborit P., Ohler J., Sole P.: CTRU, A polynomial analogue of NTRU. NTRU Technical Report #Inria RR-4621 (2006)."},{"key":"9342_CR6","doi-asserted-by":"crossref","unstructured":"Hirschhorn P., Hoffstein J., Howgrave-Graham N., Whyte W.: Choosing NTRUEncrypt parameters in light of combined lattice reduction and MITM approaches. In: Proceedings of the 7th international conference on applied cryptography and network security, Paris-Rocquencourt, France. Lecture Notes In Computer Science, vol. 5536, pp. 437\u2013455. (2009).","DOI":"10.1007\/978-3-642-01957-9_27"},{"key":"9342_CR7","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NTRU, a ring-based public-key cryptosystem. Algorithmic number theory, Portland, OR, 1998. Lecture Notes in Computer Science, vol. 1423, pp. 267\u2013288. Springer, Berlin (1996).","DOI":"10.1007\/BFb0054868"},{"key":"9342_CR8","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.: An introduction to mathematical cryptography. In: Undergraduate Texts in Mathematics. Springer, New York (2008).","DOI":"10.1007\/978-0-387-77993-5_6"},{"key":"9342_CR9","unstructured":"Howgrave-Graham N.: Computational mathematics inspired by RSA. PhD thesis, University of Bath (1998)."},{"key":"9342_CR10","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham N., Silverman J.H., Whyte W.: Choosing parameter sets for NTRUEncrypt with NAEP and SVES-3. Topics in cryptology\u2014CT-RSA 2005. Lecture Notes in Computer Science, vol. 3376, pp. 118\u2013135. Springer, Berlin (2005).","DOI":"10.1007\/978-3-540-30574-3_10"},{"key":"9342_CR11","unstructured":"Kouzmenko R.: Generalizations of the NTRU cryptosystem. Diploma Project, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, (2005\u20132006)."},{"key":"9342_CR12","first-page":"385","volume":"13","author":"F. Lemmermeyer","year":"1995","unstructured":"Lemmermeyer F.: The Euclidean algorithm in algebraic number fields. Exposition. Math. 13, 385\u2013416 (1995)","journal-title":"Exposition. Math."},{"key":"9342_CR13","doi-asserted-by":"crossref","unstructured":"Masley J.M., Montgomery H.L.: Cyclotomic fields with unique factorization. J. Reine Angew. Math. 248\u2013256 (1976).","DOI":"10.1515\/crll.1976.286-287.248"},{"key":"9342_CR14","doi-asserted-by":"crossref","first-page":"984","DOI":"10.2307\/2313196","volume":"69","author":"T.-S. Rhai","year":"1962","unstructured":"Rhai T.-S.: A characterization of polynomial domains over a field. Am. Math. Mon. 69, 984\u2013986 (1962)","journal-title":"Am. Math. Mon."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9342-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9342-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9342-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T13:18:29Z","timestamp":1685193509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9342-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["9342"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9342-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,10]]}}}