{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:21:50Z","timestamp":1775794910415,"version":"3.50.1"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031400025","type":"print"},{"value":"9783031400032","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-40003-2_10","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:03:04Z","timestamp":1691586184000},"page":"256-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["NTRU in\u00a0Quaternion Algebras of\u00a0Bounded Discriminant"],"prefix":"10.1007","author":[{"given":"Cong","family":"Ling","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Mendelsohn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Albert, A.: Structure of Algebras, AMS colloquium publications, vol. 24. American Mathematical Society, Providence (1939)","DOI":"10.1090\/coll\/024"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-662-53018-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Bai, S., Ducas, L.: A subfield lattice attack on overstretched NTRU assumptions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 153\u2013178. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_6"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35"},{"key":"10_CR4","first-page":"45","volume":"10","author":"R Atani","year":"2018","unstructured":"Atani, R., Atani, S., Karbasi, A.: NETRU: a noncommutative and secure variant of CTRU cryptosystem. ISC Int. J. Inf. Sec. 10, 45\u201353 (2018)","journal-title":"ISC Int. J. Inf. Sec."},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Atani, R., Atani, S., Karbasi, A.: A provably secure variant of ETRU based on extended ideal lattices over direct product of Dedekind domains. JCS 5, 13\u201334 (2018). https:\/\/doi.org\/10.22108\/jcs.2018.106856.0","DOI":"10.22108\/jcs.2018.106856.0"},{"issue":"10","key":"10_CR6","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s10623-017-0451-4","volume":"86","author":"K Bagheri","year":"2017","unstructured":"Bagheri, K., Sadeghi, M.-R., Panario, D.: A non-commutative cryptosystem based on quaternion algebras. Des. Codes Crypt. 86(10), 2345\u20132377 (2017). https:\/\/doi.org\/10.1007\/s10623-017-0451-4","journal-title":"Des. Codes Crypt."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-36231-2_6","volume-title":"Progress in Cryptology \u2014 INDOCRYPT 2002","author":"WD Banks","year":"2002","unstructured":"Banks, W.D., Shparlinski, I.E.: A variant of NTRU with non-invertible polynomials. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 62\u201370. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36231-2_6"},{"issue":"07","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1142\/S1793042109002614","volume":"5","author":"E Bayer-Fluckiger","year":"2009","unstructured":"Bayer-Fluckiger, E., Cerri, J.P., Chaubert, J.: Euclidean minima and central division algebras. Int. J. Number Theory 5(07), 1155\u20131168 (2009). https:\/\/doi.org\/10.1142\/S1793042109002614","journal-title":"Int. J. Number Theory"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-72565-9_12","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"DJ Bernstein","year":"2018","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU prime: reducing attack surface at low cost. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 235\u2013260. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_12"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-031-22912-1_4","volume-title":"Progress in Cryptology-INDOCRYPT 2022","author":"K Boudgoust","year":"2022","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, A.: Entropic hardness of module-LWE from module-NTRU. In: Isobe, T., Sarkar, S. (eds.) INDOCRYPT 2022. LNCS, vol. 13774, pp. 78\u201399. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22912-1_4"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Caruso, X., Borgne, J.L.: Fast multiplication for skew polynomials. In: ISSAC 2017, pp. 77\u201384. Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3087604.3087617","DOI":"10.1145\/3087604.3087617"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-61273-7_3","volume-title":"Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology","author":"S Chatterjee","year":"2017","unstructured":"Chatterjee, S., Koblitz, N., Menezes, A., Sarkar, P.: Another look at tightness II: practical issues in cryptography. In: Phan, R.C.-W., Yung, M. (eds.) Mycrypt 2016. LNCS, vol. 10311, pp. 21\u201355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61273-7_3"},{"key":"10_CR13","unstructured":"Chen, C., et al.: NTRU: algorithm specifications and supporting documentation (2019). https:\/\/ntru.org\/f\/ntru-20190330.pdf"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-34618-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Genise, N., Mukherjee, P.: Approximate trapdoors for lattices and\u00a0smaller hash-and-sign signatures. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_1"},{"key":"10_CR15","unstructured":"Cheon, J.H., Kim, D., Kim, T., Son, Y.: A new trapdoor over module-NTRU lattice and its application to id-based encryption. Cryptol. ePrint Archive, Rpt. 2019\/1468 (2019). https:\/\/eprint.iacr.org\/2019\/1468"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Chuengsatiansup, C., Prest, T., Stehl\u00e9, D., Wallet, A., Xagawa, K.: ModFalcon: compact signatures based on module-NTRU lattices, pp. 853\u2013866. ASIA CCS 2020, Assoc. for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3320269.3384758","DOI":"10.1145\/3320269.3384758"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-69053-0_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D., Shamir, A.: Lattice attacks on NTRU. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 52\u201361. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_5"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/978-3-031-22969-5_24","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2022","author":"J Felderhoff","year":"2022","unstructured":"Felderhoff, J., Pellet-Mary, A., Stehl\u00e9, D.: On module unique-SVP and NTRU. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13793, pp. 709\u2013740. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_24"},{"key":"10_CR19","unstructured":"Fouque, P.A., et al.: Falcon: Fast-Fourier lattice-based compact signatures over NTRU. https:\/\/falcon-sign.info\/falcon.pdf"},{"key":"10_CR20","unstructured":"Gaborit, P., Ohler, J., Sol\u00e9, P.: CTRU, a polynomial analogue of NTRU. Technical report RR-4621, INRIA (2002). https:\/\/inria.hal.science\/inria-00071964"},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00145-022-09430-6","volume":"35","author":"C Grover","year":"2022","unstructured":"Grover, C., Mendelsohn, A., Ling, C., Vehkalahti, R.: Non-commutative ring learning with errors from cyclic algebras. J. of Cryptology 35(3), 22 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09430-6","journal-title":"J. of Cryptology"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-11659-4_9","volume-title":"Post-Quantum Cryptography","author":"J Hoffstein","year":"2014","unstructured":"Hoffstein, J., Pipher, J., Schanck, J.M., Silverman, J.H., Whyte, W.: Transcript secure signatures based on modular lattices. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 142\u2013159. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_9"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-52153-4_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2017","author":"J Hoffstein","year":"2017","unstructured":"Hoffstein, J., Pipher, J., Schanck, J.M., Silverman, J.H., Whyte, W., Zhang, Z.: Choosing parameters for NTRUEncrypt. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 3\u201318. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_1"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-74143-5_9","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"N Howgrave-Graham","year":"2007","unstructured":"Howgrave-Graham, N.: A hybrid lattice-reduction and meet-in-the-middle attack against NTRU. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 150\u2013169. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_9"},{"key":"10_CR26","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., et al.: 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":"10_CR27","unstructured":"Howgrave-Graham, N., Silverman, J., Whyte, W.: A meet-in-the-middle attack on an NTRU private key. Technical report, NTRU Cryptosystems (2003)"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-30574-3_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"N Howgrave-Graham","year":"2005","unstructured":"Howgrave-Graham, N., Silverman, J.H., Whyte, W.: Choosing parameter sets for NTRUEncrypt with NAEP and SVES-3. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 118\u2013135. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_10"},{"key":"10_CR29","unstructured":"Jarvis, K.: NTRU over the Eisenstein Integers. Master\u2019s thesis (2011). https:\/\/ruor.uottawa.ca\/handle\/10393\/19862"},{"key":"10_CR30","unstructured":"Karbasi, A.H., Atani, R.: ILTRU: an NTRU-like public key cryptosystem over ideal lattices. Cryptology ePrint Archive, p. 549 (2015)"},{"key":"10_CR31","doi-asserted-by":"crossref","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. Chapman & Hall\/CRC, Boca Raton (2014)","edition":"2"},{"key":"10_CR32","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022082","author":"N Koblitz","year":"2022","unstructured":"Koblitz, N., Samajder, S., Sarkar, P., Singha, S.: Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022082","journal-title":"Adv. Math. Commun."},{"key":"10_CR33","unstructured":"Kouzmenko, R.: Generalizations of the NTRU cryptosystem. Ph.D. thesis (2005)"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Malekian, E., Zakerolhosseini, A.: OTRU: a non-associative and high speed public key cryptosystem. In: CADS 15, pp. 83\u201390 (2010). https:\/\/doi.org\/10.1109\/CADS.2010.5623536","DOI":"10.1109\/CADS.2010.5623536"},{"key":"10_CR35","doi-asserted-by":"publisher","first-page":"29","DOI":"10.22042\/isecure.2015.3.1.3","volume":"3","author":"E Malekian","year":"2011","unstructured":"Malekian, E., Zakerolhosseini, A., Mashatan, A.: QTRU: quaternionic version of the NTRU public-key cryptosystem. ISC Int. J. Inf. Secur. 3, 29\u201342 (2011). https:\/\/doi.org\/10.22042\/isecure.2015.3.1.3","journal-title":"ISC Int. J. Inf. Secur."},{"key":"10_CR36","series-title":"Universitext","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-90233-3","volume-title":"Number Fields","author":"DA Marcus","year":"2018","unstructured":"Marcus, D.A.: Number Fields. U, Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90233-3"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: FOCS 2004. SIAM Journal on Computing, vol. 37, pp. 372\u2013381 (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-21548-4_14","volume-title":"Information Security and Privacy","author":"S Murphy","year":"2019","unstructured":"Murphy, S., Player, R.: $$\\delta $$-subgaussian random variables in cryptography. In: Jang-Jaccard, J., Guo, F. (eds.) ACISP 2019. LNCS, vol. 11547, pp. 251\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21548-4_14"},{"issue":"1","key":"10_CR39","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1515\/jmc-2020-0073","volume":"15","author":"S Murphy","year":"2021","unstructured":"Murphy, S., Player, R.: Discretisation and product distributions in ring-LWE. J. Math. Cryptol. 15(1), 45\u201359 (2021). https:\/\/doi.org\/10.1515\/jmc-2020-0073","journal-title":"J. Math. Cryptol."},{"issue":"1","key":"10_CR40","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10623-013-9850-3","volume":"74","author":"K Jarvis","year":"2013","unstructured":"Jarvis, K., Nevins, M.: ETRU: NTRU over the Eisenstein integers. Des. Codes Crypt. 74(1), 219\u2013242 (2013). https:\/\/doi.org\/10.1007\/s10623-013-9850-3","journal-title":"Des. Codes Crypt."},{"key":"10_CR41","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10623-009-9342-7","volume":"56","author":"M Nevins","year":"2009","unstructured":"Nevins, M., KarimianPour, C., Miri, A.: NTRU in rings beyond $$\\mathbb{Z} $$. Des. Codes Crypt. 56, 65\u201378 (2009). https:\/\/doi.org\/10.1007\/s10623-009-9342-7","journal-title":"Des. Codes Crypt."},{"key":"10_CR42","unstructured":"NTRU prime risk-management team: Risks of lattice KEMs (2021). https:\/\/ntruprime.cr.yp.to\/warnings.html"},{"issue":"4","key":"10_CR43","doi-asserted-by":"publisher","first-page":"441","DOI":"10.3934\/amc.2013.7.441","volume":"7","author":"F Oggier","year":"2013","unstructured":"Oggier, F., Sethuraman, B.A.: Quotients of orders in cyclic algebras and space-time codes. AMC 7(4), 441\u2013461 (2013). https:\/\/doi.org\/10.3934\/amc.2013.7.441","journal-title":"AMC"},{"key":"10_CR44","doi-asserted-by":"publisher","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in $$\\ell _p$$ norms. In: CCC 2007, pp. 333\u2013346 (2007). https:\/\/doi.org\/10.1109\/CCC.2007.12","DOI":"10.1109\/CCC.2007.12"},{"key":"10_CR45","doi-asserted-by":"publisher","unstructured":"Peikert, C., Rosen, A.: Lattices that admit logarithmic worst-case to average-case connection factors. STOC 2007, pp. 478\u2013487. Association for Computing Machinery (2007). https:\/\/doi.org\/10.1145\/1250790.1250860","DOI":"10.1145\/1250790.1250860"},{"key":"10_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92062-3_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"A Pellet-Mary","year":"2021","unstructured":"Pellet-Mary, A., Stehl\u00e9, D.: On the hardness of the NTRU problem. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 3\u201335. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_1"},{"issue":"18","key":"10_CR47","doi-asserted-by":"publisher","first-page":"6315","DOI":"10.1002\/sec.1693","volume":"9","author":"S Singh","year":"2016","unstructured":"Singh, S., Padhye, S.: Generalisations of NTRU cryptosystem. SCN 9(18), 6315\u20136334 (2016). https:\/\/doi.org\/10.1002\/sec.1693","journal-title":"SCN"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4"},{"key":"10_CR49","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRUEncrypt and NTRUSign as secure as standard worst-case problems over ideal lattices. Cryptology ePrint Archive (2013). https:\/\/eprint.iacr.org\/2013\/004"},{"key":"10_CR50","doi-asserted-by":"publisher","unstructured":"Steinfeld, R.: NTRU cryptosystem: Recent developments and emerging mathematical problems in finite polynomial rings. In: Niederreiter, H., Ostafe, A., Panario, D., Winterhof, A. (eds.) Algebraic Curves and Finite Fields, pp. 179\u2013212. De Gruyter (2014). https:\/\/doi.org\/10.1515\/9783110317916.179","DOI":"10.1515\/9783110317916.179"},{"issue":"03","key":"10_CR51","first-page":"177","volume":"20","author":"K Thakur","year":"2016","unstructured":"Thakur, K., Tripathi, B.: KTRU: NTRU over the Kleinian integers. J. Int. Acad. Phys. Sci. 20(03), 177\u2013183 (2016)","journal-title":"J. Int. Acad. Phys. Sci."},{"key":"10_CR52","unstructured":"Thakur, K., Tripathi, B.P.: STRU: a non alternative and multidimensional public key cryptosystem. GJPAM 13, 1447\u20131464 (2017). http:\/\/www.ripublication.com\/Volume\/gjpamv13n5.htm"},{"key":"10_CR53","unstructured":"Truman, K.: Analysis and extension of non-commutative NTRU. Ph.D. thesis (2007). https:\/\/drum.lib.umd.edu\/handle\/1903\/7344"},{"key":"10_CR54","unstructured":"Vats, N.: NNRU, a noncommutative analogue of NTRU. CoRR abs\/0902.1891 (2009). http:\/\/arxiv.org\/abs\/0902.1891"},{"issue":"8","key":"10_CR55","doi-asserted-by":"publisher","first-page":"3751","DOI":"10.1109\/TIT.2009.2023713","volume":"55","author":"R Vehkalahti","year":"2009","unstructured":"Vehkalahti, R., Hollanti, C., Lahtonen, J., Ranto, K.: On the densest MIMO lattices from cyclic division algebras. IEEE Trans. Inf. Theory 55(8), 3751\u20133780 (2009). https:\/\/doi.org\/10.1109\/TIT.2009.2023713","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR56","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-56694-4","volume-title":"Quaternion Algebras","author":"J Voight","year":"2021","unstructured":"Voight, J.: Quaternion Algebras. Graduate Texts in Mathematics, Springer, Cham (2021)"},{"key":"10_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-030-10970-7_18","volume-title":"Selected Areas in Cryptography \u2013 SAC 2018","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Wang, M.: Provably secure NTRUEncrypt over any cyclotomic field. In: Cid, C., Jacobson, M., Jr. (eds.) SAC 2018. LNCS, vol. 11349, pp. 391\u2013417. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_18"},{"key":"10_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-31550-8_13","volume-title":"Trusted Systems","author":"T Yasuda","year":"2016","unstructured":"Yasuda, T., Anada, H., Sakurai, K.: Application of NTRU using group rings to partial decryption technique. In: Yung, M., Zhang, J., Yang, Z. (eds.) INTRUST 2015. LNCS, vol. 9565, pp. 203\u2013213. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31550-8_13"}],"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-40003-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:04:33Z","timestamp":1691586273000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40003-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031400025","9783031400032"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40003-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 August 2023","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":"College Park, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2023.umiacs.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.30","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}