{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T23:29:58Z","timestamp":1718062198486},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:00:00Z","timestamp":1648857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:00:00Z","timestamp":1648857600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11704-021-1073-6","type":"journal-article","created":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:03:03Z","timestamp":1648886583000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the hardness of NTRU problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Yang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Mingqiang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,2]]},"reference":[{"key":"1073_CR1","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman J H. NTRU: a ring-based public key cryptosystem. In: Proceedings of the 3rd International Algorithmic Number Theory Symposium. 1998, 267\u2013288","DOI":"10.1007\/BFb0054868"},{"key":"1073_CR2","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: Proceedings of Cryptographers\u2019 Track at the RSA Conference. 2003, 122\u2013140","DOI":"10.1007\/3-540-36563-X_9"},{"key":"1073_CR3","doi-asserted-by":"crossref","unstructured":"Coppersmith D, Shamir A. Lattice attacks on NTRU. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. 1997, 52\u201361","DOI":"10.1007\/3-540-69053-0_5"},{"key":"1073_CR4","doi-asserted-by":"crossref","unstructured":"Albrecht M, Bai S, Ducas L. A subfield lattice attack on overstretched NTRU assumptions: cryptanalysis of some FHE and graded encoding schemes. In: Proceedings of 36th Annual International Cryptology Conference. 2016, 153\u2013178","DOI":"10.1007\/978-3-662-53018-4_6"},{"issue":"A","key":"1073_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1112\/S1461157016000371","volume":"19","author":"J H Cheon","year":"2016","unstructured":"Cheon J H, Jeong J, Lee C. An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero. LMS Journal of Computation and Mathematics, 2016, 19(A): 255\u2013266","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"1073_CR6","doi-asserted-by":"crossref","unstructured":"Ducas L, Nguyen P Q. Learning a zonotope and more: cryptanalysis of NTRUSign countermeasures. In: Proceedings of the 18th International Conference on the Theory and Application of Cryptology and Information Security. 2012, 433\u2013450","DOI":"10.1007\/978-3-642-34961-4_27"},{"key":"1073_CR7","doi-asserted-by":"crossref","unstructured":"Gentry C. Key recovery and message attacks on NTRU-composite. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. 2001, 182\u2013194","DOI":"10.1007\/3-540-44987-6_12"},{"key":"1073_CR8","doi-asserted-by":"crossref","unstructured":"Gama N, Nguyen P Q. New chosen-ciphertext attacks on NTRU. In: Proceedings of the 10th International Workshop on Public Key Cryptography. 2007, 89\u2013106","DOI":"10.1007\/978-3-540-71677-8_7"},{"key":"1073_CR9","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham N. A hybrid lattice-reduction and meet-in-the-middle attack against NTRU. In: Proceedings of the 27th Annual International Cryptology Conference. 2007, 150\u2013169","DOI":"10.1007\/978-3-540-74143-5_9"},{"key":"1073_CR10","doi-asserted-by":"crossref","unstructured":"Jaulmes \u00c9, Joux A. A chosen-ciphertext attack against NTRU. In: Proceedings of the 20th Annual International Cryptology Conference. 2000, 20\u201335","DOI":"10.1007\/3-540-44598-6_2"},{"key":"1073_CR11","doi-asserted-by":"crossref","unstructured":"Kirchner P, Fouque P A. Revisiting lattice attacks on overstretched NTRU parameters. In: Proceedings of the 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2017, 3\u201326","DOI":"10.1007\/978-3-319-56620-7_1"},{"key":"1073_CR12","unstructured":"NIST. Post-quantum cryptography, round 3 submissions. csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions. 2020"},{"issue":"4","key":"1073_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert C. A decade of lattice cryptography. Foundations and trends\u00ae in theoretical computer science, 2016, 10(4): 283\u2013424","journal-title":"Foundations and trends\u00ae in theoretical computer science"},{"key":"1073_CR14","doi-asserted-by":"crossref","unstructured":"Peikert C, Regev O, Stephens-Davidowitz N. Pseudorandomness of ring-LWE for any ring and modulus. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. 2017, 461\u2013473","DOI":"10.1145\/3055399.3055489"},{"key":"1073_CR15","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2010, 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"1073_CR16","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9 D, Steinfeld R. Making NTRU as secure as worst-case problems over ideal lattices. In: Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2011, 27\u201347","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"1073_CR17","doi-asserted-by":"crossref","unstructured":"Yu Y, Xu G, Wang X. Provably secure NTRU instances over prime cyclotomic rings. In: Proceedings of the 20th IACR International Workshop on Public Key Cryptography. 2017, 409\u2013434","DOI":"10.1007\/978-3-662-54365-8_17"},{"key":"1073_CR18","doi-asserted-by":"crossref","unstructured":"Wang Y, Wang M Q. Provably secure NTRUEncrypt over any cyclotomic field. In: Proceedings of the 25th International Conference on Selected Areas in Cryptography. 2018, 391\u2013417","DOI":"10.1007\/978-3-030-10970-7_18"},{"key":"1073_CR19","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing. 2008, 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"issue":"3","key":"1073_CR20","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois A, Stehl\u00e9 D. Worst-case to average-case reductions for module lattices. Designs, Codes and Cryptography, 2015, 75(3): 565\u2013599","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"1073_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio D, Regev O. Worst-case to average-case reductions based on Gaussian measures. SIAM Journal on Computing, 2007, 37(1): 267\u2013302","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"1073_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 2009, 56(6): 34","journal-title":"Journal of the ACM"},{"issue":"1","key":"1073_CR23","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk W. New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen, 1993, 296(1): 625\u2013635","journal-title":"Mathematische Annalen"},{"issue":"3","key":"1073_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"M R Albrecht","year":"2015","unstructured":"Albrecht M R, Player R, Scott S. On the concrete hardness of learning with errors. Journal of Mathematical Cryptology, 2015, 9(3): 169\u2013203","journal-title":"Journal of Mathematical Cryptology"},{"issue":"4","key":"1073_CR25","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/TWC.2003.814350","volume":"2","author":"M Chiani","year":"2003","unstructured":"Chiani M, Dardari D, Simon M K. New exponential bounds and approximations for the computation of error probability in fading channels. IEEE Transactions on Wireless Communications, 2003, 2(4): 840\u2013845","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"1073_CR26","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O. A toolkit for ring-LWE cryptography. In: Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2013, 35\u201354","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"1073_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H Cohen","year":"1993","unstructured":"Cohen H. A Course in Computational Algebraic Number Theory. Berlin, Heidelberg: Springer, 1993"},{"key":"1073_CR28","doi-asserted-by":"crossref","unstructured":"Rosca M, Stehl\u00e9 D, Wallet A. On the ring-LWE and polynomial-LWE problems. In: Proceedings of the 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2018, 146\u2013173","DOI":"10.1007\/978-3-319-78381-9_6"},{"key":"1073_CR29","doi-asserted-by":"crossref","unstructured":"Liu F H, Wang Z. Rounding in the rings. In: Proceedings of the 40th Annual International Cryptology Conference. 2020, 296\u2013326","DOI":"10.1007\/978-3-030-56880-1_11"},{"key":"1073_CR30","doi-asserted-by":"crossref","unstructured":"Pellet-Mary A, Stehl\u00e9 D. On the hardness of the NTRU problem. In: Proceedings of the 27th International Conference on the Theory and Application of Cryptology and Information Security. 2021, 3\u201335","DOI":"10.1007\/978-3-030-92062-3_1"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-021-1073-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-021-1073-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-021-1073-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T21:33:46Z","timestamp":1705700026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-021-1073-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,2]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1073"],"URL":"https:\/\/doi.org\/10.1007\/s11704-021-1073-6","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,2]]},"assertion":[{"value":"14 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"166822"}}