{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:37:09Z","timestamp":1786981029486,"version":"3.56.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100015499","name":"Jeonbuk National University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100015499","id-type":"DOI","asserted-by":"publisher"}]},{"name":"KIAS Individual Grant","award":["CG080601"],"award-info":[{"award-number":["CG080601"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10623-023-01233-5","type":"journal-article","created":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T03:01:45Z","timestamp":1683342105000},"page":"2779-2789","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A polynomial time algorithm for breaking NTRU encryption with multiple keys"],"prefix":"10.1007","volume":"91","author":[{"given":"Jiseung","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8191-1516","authenticated-orcid":false,"given":"Changmin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,6]]},"reference":[{"key":"1233_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S., Pellet-Mary A.: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear fe. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp. 110\u2013140 (2020).","DOI":"10.1007\/978-3-030-45721-1_5"},{"key":"1233_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal S.: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp. 191\u2013225 (2019).","DOI":"10.1007\/978-3-030-17653-2_7"},{"key":"1233_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht M.R., Cocis C., Laguillaumie F., Langlois A.: Implementing candidate graded encoding schemes from ideal lattices. In: Asiacrypt 2015, vol. 9453. Springer, New York (2015).","DOI":"10.1007\/978-3-662-48800-3_31"},{"key":"1233_CR4","doi-asserted-by":"crossref","unstructured":"Albrecht M., Bai S., Ducas L.: A subfield lattice attack on overstretched NTRU assumptions. In: Annual Cryptology Conference. Springer, New York, pp. 153\u2013178 (2016).","DOI":"10.1007\/978-3-662-53018-4_6"},{"key":"1233_CR5","doi-asserted-by":"crossref","unstructured":"Ananth P., Jain A., Jin Z., Malavolta G.: Multi-key fully-homomorphic encryption in the plain model. In: Theory of Cryptography Conference. Springer, New York, pp. 28\u201357 (2020).","DOI":"10.1007\/978-3-030-64375-1_2"},{"key":"1233_CR6","doi-asserted-by":"crossref","unstructured":"Arora S., Ge R.: New algorithms for learning in presence of errors. In: International Colloquium on Automata, Languages, and Programming. Springer, New York, pp. 403\u2013415 (2011).","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"1233_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein D.J., Chuengsatiansup C., Lange T., van Vredendaal C.: NTRU prime: reducing attack surface at low cost. In: International Conference on Selected Areas in Cryptography. Springer, New York, pp. 235\u2013260 (2017).","DOI":"10.1007\/978-3-319-72565-9_12"},{"key":"1233_CR8","unstructured":"Bernstein D.J., Chuengsatiansup C., Lange T., van Vredendaal C.: NTRU Prime: round 3. In: Submission to the NIST PQC Standardization Process. https:\/\/ntruprime.cr.yp.to (2020)."},{"key":"1233_CR9","doi-asserted-by":"crossref","unstructured":"Bos J.W., Lauter K.E., Loftus J., Naehrig M.: Improved security for a ring-based fully homomorphic encryption scheme. In: IMA International Conference. Springer, New York, pp. 45\u201364 (2013).","DOI":"10.1007\/978-3-642-45239-0_4"},{"issue":"5","key":"1233_CR10","doi-asserted-by":"publisher","first-page":"564","DOI":"10.26599\/TST.2019.9010076","volume":"25","author":"X Che","year":"2020","unstructured":"Che X., Zhou T., Li N., Zhou H., Chen Z., Yang X.: Modified multi-key fully homomorphic encryption based on NTRU cryptosystem without key-switching. Tsinghua Sci. Technol. 25(5), 564\u2013578 (2020).","journal-title":"Tsinghua Sci. Technol."},{"key":"1233_CR11","unstructured":"Chen C., Danba O., Hoffstein J., Hulsing A., Rijneveld J., Schanck J.M., Schwabe P., Whyte W., Zhang Z.: NTRU: algorithm specifications and supporting documentation (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions (2019)."},{"issue":"1","key":"1233_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1112\/S1461157016000371","volume":"19","author":"JH Cheon","year":"2016","unstructured":"Cheon J.H., Jeong J., Lee C., Cheon Jung Hee: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero. LMS J. Comput. Math. 19(1), 255\u2013266 (2016).","journal-title":"LMS J. Comput. Math."},{"key":"1233_CR13","doi-asserted-by":"crossref","unstructured":"Chongchitmate W., Ostrovsky R.: Circuit-private multi-key FHE. In: IACR International Workshop on Public Key Cryptography. Springer, New York, pp. 241\u2013270 (2017).","DOI":"10.1007\/978-3-662-54388-7_9"},{"issue":"4","key":"1233_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"P Chris","year":"2016","unstructured":"Chris P.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016).","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1233_CR15","unstructured":"Developers Sage: SageMath, the Sage Mathematics Software System (Version 9.5.2). https:\/\/www.sagemath.org (2020)."},{"issue":"2","key":"1233_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10623-015-0095-1","volume":"80","author":"Y Dor\u00f6z","year":"2016","unstructured":"Dor\u00f6z Y., Yin H., Sunar B.: Homomorphic aes evaluation using the modified ltv scheme. Des. Codes Cryptogr. 80(2), 333\u2013358 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"1233_CR17","doi-asserted-by":"crossref","unstructured":"Ducas L., Durmus A., Lepoint T., Lyubashevsky V.: Lattice signatures and bimodal gaussians. In: Advances in Cryptology\u2013CRYPTO 2013. Springer, New York, pp. 40\u201356 (2013).","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"1233_CR18","doi-asserted-by":"crossref","unstructured":"Ducas L., Lyubashevsky V., Prest T.: Efficient identity-based encryption over NTRU lattices. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer, New York, pp. 22\u201341 (2014).","DOI":"10.1007\/978-3-662-45608-8_2"},{"key":"1233_CR19","doi-asserted-by":"crossref","unstructured":"Ducas, L., van Woerden W.: Ntru fatigue: how stretched is overstretched? In: Advances in Cryptology\u2013ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, Proceedings, Part IV 27. Springer, New York, pp. 3\u201332 (2021).","DOI":"10.1007\/978-3-030-92068-5_1"},{"key":"1233_CR20","first-page":"1","volume":"2013","author":"S Garg","year":"2013","unstructured":"Garg S., Gentry C., Halevi S.: Candidate multilinear maps from ideal lattices. EUROCRYPT 2013, 1\u201317 (2013).","journal-title":"EUROCRYPT"},{"key":"1233_CR21","doi-asserted-by":"crossref","unstructured":"Gentry C., Szydlo M.: Cryptanalysis of the revised NTRU signature scheme. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp. 299\u2013320 (2002).","DOI":"10.1007\/3-540-46035-7_20"},{"key":"1233_CR23","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NTRU: a ring-based public key cryptosystem. In: Algorithmic number theory. Springer, New York, pp. 267\u2013288 (1998).","DOI":"10.1007\/BFb0054868"},{"key":"1233_CR22","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Howgrave-Graham N., Pipher J., Silverman J.H., Whyte W.: NTRUSIGN: digital signatures using the NTRU lattice. In: Topics in Cryptology\u00f9CT-RSA 2003. Springer, New York, pp. 122\u2013140 (2003).","DOI":"10.1007\/3-540-36563-X_9"},{"key":"1233_CR24","doi-asserted-by":"crossref","unstructured":"Kirchner P., Fouque P.-A.: Revisiting lattice attacks on overstretched NTRU parameters. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp. 3\u201326(2017).","DOI":"10.1007\/978-3-319-56620-7_1"},{"key":"1233_CR25","doi-asserted-by":"crossref","unstructured":"Langlois A., Stehl\u00e9 D., Steinfeld R.: GGHLite: more efficient multilinear maps from ideal lattices. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp. 239\u2013256 (2014).","DOI":"10.1007\/978-3-642-55220-5_14"},{"key":"1233_CR26","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"K Lenstra Arjen","year":"1982","unstructured":"Lenstra Arjen K., Lenstra H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"1233_CR27","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt A., Tromer E., Vaikuntanathan V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pp. 1219\u20131234 (2012).","DOI":"10.1145\/2213977.2214086"},{"issue":"2","key":"1233_CR28","first-page":"112","volume":"16","author":"A Nitaj","year":"2014","unstructured":"Nitaj A.: Cryptanalysis of NTRU with two public keys. Int. J. Netw. Secur. 16(2), 112\u2013117 (2014).","journal-title":"Int. J. Netw. Secur."},{"key":"1233_CR29","unstructured":"Peikert C.: Multiple NTRU public keys for the same private key? https:\/\/crypto.stackexchange.com\/questions\/30893\/multiple-ntru-public-keys-for-the-same-private-key (2015)."},{"key":"1233_CR30","doi-asserted-by":"crossref","unstructured":"Pellet-Mary A., Stehl\u00e9 D.: On the hardness of the NTRU problem. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer, New York, pp. 3\u201335 (2021).","DOI":"10.1007\/978-3-030-92062-3_1"},{"key":"1233_CR31","doi-asserted-by":"crossref","unstructured":"Singh S., Padhye S.: Cryptanalysis of NTRU with n public keys. In: 2017 ISEA Asia Security and Privacy (ISEASP). IEEE, pp. 1\u20136 (2017).","DOI":"10.1109\/ISEASP.2017.7976980"},{"key":"1233_CR32","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9 D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp. 27\u201347 (2011).","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"1233_CR33","doi-asserted-by":"crossref","unstructured":"Yu Y., Xu G., Wang X.: Provably secure NTRU instances over prime cyclotomic rings. In: IACR International Workshop on Public Key Cryptography. Springer, New York, pp. 409\u2013434 (2017).","DOI":"10.1007\/978-3-662-54365-8_17"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01233-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01233-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01233-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T16:33:15Z","timestamp":1689870795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01233-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,6]]},"references-count":33,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1233"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01233-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,6]]},"assertion":[{"value":"15 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}