{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T13:22:15Z","timestamp":1769347335409,"version":"3.49.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865985","type":"print"},{"value":"9783031865992","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-86599-2_11","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:14:18Z","timestamp":1742843658000},"page":"312-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Giant Does NOT Mean Strong: Cryptanalysis of\u00a0BQTRU"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5576-7039","authenticated-orcid":false,"given":"Ali","family":"Raya","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1981-1984","authenticated-orcid":false,"given":"Vikas","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Aditi Kar","family":"Gangopadhyay","sequence":"additional","affiliation":[]},{"given":"Sugata","family":"Gangopadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Curtis, B.R., Deo, A., Davidson, A., Player, R., Postlethwaite, E.W., Virdia, F., Wunderer, T.: Estimate All the LWE, NTRU Schemes! In: Security and Cryptography for Networks. pp. 351\u2013367. Springer International Publishing, Cham (2018), https:\/\/doi.org\/10.1007\/978-3-319-98113-0_19","DOI":"10.1007\/978-3-319-98113-0_19"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-030-17656-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E.W., Stevens, M.: The General Sieve Kernel and New Records in Lattice Reduction. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 717\u2013746. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25"},{"key":"11_CR3","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key $$\\{$$Exchange\u2014A$$\\}$$ new hope. In: 25th USENIX Security Symposium (USENIX Security 16). pp. 327\u2013343 (2016), https:\/\/www.usenix.org\/system\/files\/conference\/usenixsecurity16\/sec16_paper_alkim.pdf"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-662-49890-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Aono","year":"2016","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 789\u2013819. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Bagheri, K., Sadeghi, M.R., Panario, D.: A Non-commutative Cryptosystem Based on Quaternion Algebras. Designs, Codes and Cryptography 86 (10 2018). https:\/\/doi.org\/10.1007\/s10623-017-0451-4","DOI":"10.1007\/s10623-017-0451-4"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Bai, S., Jangir, H., Ngo, T., Youmans, W.: An algebraic algorithm for breaking NTRU with multiple keys. Designs, Codes and Cryptography pp. 1\u201324 (2024), https:\/\/doi.org\/10.1007\/s10623-024-01473-z","DOI":"10.1007\/s10623-024-01473-z"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms. pp. 10\u201324. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"11_CR8","unstructured":"Boschini, C., Orsini, E., Traverso, C.: Between Codes and Lattices: Hybrid lattices and the NTWO cryptosystem. Proc. Effective Methods Algebr. Geometry (2015), http:\/\/people.cs.bris.ac.uk\/~cseao\/papr\/MEGA2015.pdf"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Caboara, M., Caruso, F., Traverso, C.: Gr\u00f6bner bases for public key cryptography. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC. pp. 315\u2013324 (2008).https:\/\/doi.org\/10.1145\/1390768.1390811","DOI":"10.1145\/1390768.1390811"},{"key":"11_CR10","unstructured":"Chen, C., Danba, O., Hoffstein, J., H\u00fclsing, A., Rijneveld, J., Schanck, J.M., Saito, T., Schwade, P.S., Whyte, W.W., Xagawa, K.X., Yamakawa, T., Zhang, Z.: PQC round-3 candidate: NTRU. technical report. Tech. rep., NTRU Cryptosystems Technical Report No.11, Version 2, March 2001. Report (2019), https:\/\/ntru.org\/f\/ntru-20190330.pdf"},{"key":"11_CR11","unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concr\u00e8te du chiffrement compl\u00e8tement homomorphe. Ph.D. thesis, l\u2019Universit\u00e9 Paris Diderot (2013), http:\/\/www.theses.fr\/2013PA077242"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates. In: International Conference on the Theory and Application of Cryptology and Information Security. pp. 1\u201320. Springer (2011).https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Coppersmith, D., Shamir, A.: Lattice Attacks on NTRU. In: Advances in Cryptology \u2014 EUROCRYPT \u201997. pp. 52\u201361. Springer Berlin Heidelberg, Berlin, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_5","DOI":"10.1007\/3-540-69053-0_5"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with Side Information: Attacks and Concrete Security Estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Ducas, L., van Woerden, W.: NTRU Fatigue: How Stretched is Overstretched? Cryptology ePrint Archive, Paper 2021\/999 (2021), https:\/\/eprint.iacr.org\/2021\/999","DOI":"10.1007\/978-3-030-92068-5_1"},{"issue":"170","key":"11_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"44","author":"U Fincke","year":"1985","unstructured":"Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comput. 44(170), 463\u2013471 (1985)","journal-title":"Math. Comput."},{"key":"11_CR17","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 \u2014 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. 2045, pp. 182\u2013194. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_12"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Herold, G., Kirshanova, E., Laarhoven, T.: Speed-Ups and Time\u2013Memory Trade-Offs for Tuple Lattice Sieving. In: Public-Key Cryptography \u2013 PKC 2018. pp. 407\u2013436. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_14","DOI":"10.1007\/978-3-319-76578-5_14"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: International algorithmic number theory symposium. pp. 267\u2013288. Springer, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868","DOI":"10.1007\/BFb0054868"},{"key":"11_CR20","unstructured":"Hoffstein, J., Silverman, J.H., Whyte, W.: Meet-in-the-middle attack on an NTRU private key. Tech. rep., Technical report, NTRU Cryptosystems, July 2006. Report (2006), https:\/\/ntru.org\/f\/tr\/tr004v2.pdf"},{"key":"11_CR21","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.Q., 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. 2729, pp. 226\u2013246. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_14"},{"key":"11_CR22","unstructured":"Hurley, T.: Group rings and rings of matrices. International Journal of Pure and Applied Mathematics 31, 319\u2013335 (01 2006), https:\/\/www.researchgate.net\/publication\/228928727_Group_rings_and_rings_of_matrices"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-319-66787-4_12","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"A H\u00fclsing","year":"2017","unstructured":"H\u00fclsing, A., Rijneveld, J., Schanck, J., Schwabe, P.: High-Speed Key Encapsulation from NTRU. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 232\u2013252. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_12"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the fifteenth annual ACM symposium on Theory of computing. pp. 193\u2013206 (1983), https:\/\/doi.org\/10.1145\/800061.808749","DOI":"10.1145\/800061.808749"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Kim, J., Lee, C.: A polynomial time algorithm for breaking NTRU encryption with multiple keys. Designs, Codes and Cryptography pp. 1\u201311 (2023). https:\/\/doi.org\/10.1007\/s10623-023-01233-5","DOI":"10.1007\/s10623-023-01233-5"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-56620-7_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"P Kirchner","year":"2017","unstructured":"Kirchner, P., Fouque, P.-A.: Revisiting Lattice Attacks on Overstretched NTRU Parameters. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 3\u201326. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_1"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Kirshanova, E., May, A., Nowakowski, J.: New NTRU Records with Improved Lattice Bases. In: Johansson, T., Smith-Tone, D. (eds.) Post-Quantum Cryptography. pp. 167\u2013195. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_7","DOI":"10.1007\/978-3-031-40003-2_7"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Kumar, V., Das, R., Gangopadhyay, A.K.: GR-NTRU: Dihedral group over ring of Eisenstein integers. Journal of Information Security and Applications 83, 103795 (2024). https:\/\/doi.org\/10.1016\/j.jisa.2024.103795","DOI":"10.1016\/j.jisa.2024.103795"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Kumar, V., Raya, A., Gangopadhyay, A.K., Gangopadhyay, S., Hussain, M.T.: An Efficient Noncommutative NTRU from Semidirect Product. Cryptology ePrint Archive, Paper 2024\/1721 (2024), https:\/\/eprint.iacr.org\/2024\/1721","DOI":"10.1007\/978-3-031-80308-6_1"},{"key":"11_CR30","unstructured":"Laarhoven, T.: Search problems in cryptography: from fingerprinting to lattice sieving. Phd thesis, Eindhoven University of Technology (2015), available at https:\/\/research.tue.nl\/en\/publications\/search-problems-in-cryptography-from-fingerprinting-to-lattice-si"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische annalen 261(ARTICLE), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","DOI":"10.1007\/BF01457454"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Ling, C., Mendelsohn, A.: NTRU in Quaternion Algebras of Bounded Discriminant. In: Post-Quantum Cryptography. pp. 256\u2013290. Springer Nature Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_10","DOI":"10.1007\/978-3-031-40003-2_10"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Maclachlan, C., Reid, A.W.: Arithmetic Hyperbolic 3-Manifolds and Orbifolds, pp. 275\u2013304. Springer New York (2003), https:\/\/doi.org\/10.1007\/978-1-4757-6720-9_10","DOI":"10.1007\/978-1-4757-6720-9_10"},{"key":"11_CR34","unstructured":"Malekian, E., Zakerolhosseini, A., Mashatan, A.: QTRU : a lattice attack resistant version of NTRU PKCS based on quaternion algebra. IACR Cryptology ePrint Archive 386 (2009), https:\/\/eprint.iacr.org\/2009\/386"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Walter, M.: Fast lattice point enumeration with minimal overhead. In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. pp. 276\u2013294. SIAM (2014)https:\/\/doi.org\/10.1137\/1.9781611973730.21","DOI":"10.1137\/1.9781611973730.21"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Peikert, C.: A decade of lattice cryptography. Foundations and trends\u00ae in theoretical computer science 10(4), 283\u2013424 (2016), url = https:\/\/doi.org\/10.1561\/0400000074","DOI":"10.1561\/0400000074"},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Raya, A., Kumar, V., Gangopadhyay, S.: DiTRU: A Resurrection of NTRU over Dihedral Group. In: Progress in Cryptology - AFRICACRYPT 2024. pp. 349\u2013375. Springer Nature Switzerland (2024).https:\/\/doi.org\/10.1007\/978-3-031-64381-1_16","DOI":"10.1007\/978-3-031-64381-1_16"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Raya, A., Kumar, V., Gangopadhyay, S., Gangopadhyay, A.K.: Results on the Key Space of Group-Ring NTRU: The Case of the Dihedral Group. In: Security, Privacy, and Applied Cryptography Engineering. pp. 1\u201319 (2024). https:\/\/doi.org\/10.1007\/978-3-031-51583-5_1","DOI":"10.1007\/978-3-031-51583-5_1"},{"issue":"2\u20133","key":"11_CR39","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"CP Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53(2\u20133), 201\u2013224 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90064-8","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR40","unstructured":"Silverman, J.: Wraps, gaps, and lattice constants. Tech. rep., NTRU Cryptosystems Technical Report No.11, Version 2, March 2001. Report (2001), https:\/\/ntru.org\/f\/tr\/tr011v2.pdf"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numerische mathematik 13(4), 354\u2013356 (1969), https:\/\/doi.org\/10.1007\/BF02165411","DOI":"10.1007\/BF02165411"},{"key":"11_CR42","unstructured":"development team, T.F.: fplll, a lattice reduction library, Version: 5.4.4 (2023), available at https:\/\/github.com\/fplll\/fplll"},{"key":"11_CR43","unstructured":"development team, T.F.: fpylll, a Python wraper for the fplll lattice reduction library, Version: 0.5.9 (2023), available at https:\/\/github.com\/fplll\/fpylll"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86599-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:14:26Z","timestamp":1742843666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86599-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865985","9783031865992"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86599-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}