{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:16:19Z","timestamp":1743149779562,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031643804"},{"type":"electronic","value":"9783031643811"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-64381-1_16","type":"book-chapter","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:01:56Z","timestamp":1719961316000},"page":"349-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["DiTRU: A Resurrection of NTRU over Dihedral Group"],"prefix":"10.1007","author":[{"given":"Ali","family":"Raya","sequence":"first","affiliation":[]},{"given":"Vikas","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Sugata","family":"Gangopadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-45721-1_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Pellet-Mary, A.: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 110\u2013140. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_5"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-030-64834-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Gheorghiu, V., Postlethwaite, E.W., Schanck, J.M.: Estimating quantum speedups for lattice sieves. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 583\u2013613. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_20"},{"key":"16_CR3","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key $$\\{$$Exchange-A$$\\}$$ new hope. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 327\u2013343 (2016)"},{"key":"16_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":"16_CR5","unstructured":"Avanzi, R., et al.: CRYSTALS-Kyber algorithm specifications and supporting documentation. NIST PQC Round (2020). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Bagheri, K., Sadeghi, M.R., Panario, D.: A non-commutative cryptosystem based on quaternion algebras. Des. Codes Cryptogr. 86 (2018). https:\/\/doi.org\/10.1007\/s10623-017-0451-4","DOI":"10.1007\/s10623-017-0451-4"},{"key":"16_CR7","doi-asserted-by":"crossref","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)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"16_CR8","unstructured":"Chen, C., et al.: NTRU: algorithm specifications and supporting documentation. NIST (2020). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"16_CR9","unstructured":"Chen, C., Hoffstein, J., Whyte, W., Zhang, Z.: NIST PQ submission: ntruencrypt a lattice based encryption algorithm. NIST (2017)"},{"key":"16_CR10","unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concrete du chiffrement completement homomorphe (Ph. D. thesis) (2013)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"16_CR12","unstructured":"Coppersmith, D.: Attacking non-commutative NTRU. Technical report, IBM research report, April 1997. Report (2006). https:\/\/dominoweb.draco.res.ibm.com\/d102d0885e971b558525659300727a26.html"},{"key":"16_CR13","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":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"L Ducas","year":"2013","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 40\u201356. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92068-5_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"L Ducas","year":"2021","unstructured":"Ducas, L., van Woerden, W.: NTRU fatigue: how stretched is overstretched? In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_1"},{"issue":"170","key":"16_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":"16_CR17","unstructured":"Fouque, P.A., et al.: FALCON: fast-fourier lattice-based compact signatures over NTRU. Technical report (2018). https:\/\/www.di.ens.fr\/~prest\/Publications\/falcon.pdf"},{"key":"16_CR18","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":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-01957-9_27","volume-title":"Applied Cryptography and Network Security","author":"PS Hirschhorn","year":"2009","unstructured":"Hirschhorn, P.S., Hoffstein, J., Howgrave-Graham, N., Whyte, W.: Choosing NTRUEncrypt parameters in light of combined lattice reduction and MITM approaches. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 437\u2013455. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01957-9_27"},{"key":"16_CR20","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":"16_CR21","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.: An Introduction to Mathematical Cryptography, 1st edn. Springer Publishing Company, New York (2008). Incorporated. https:\/\/doi.org\/10.1007\/978-0-387-77993-5","DOI":"10.1007\/978-0-387-77993-5"},{"key":"16_CR22","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":"16_CR23","unstructured":"Hoffstein, J., Silverman, J.: A non-commutative version of the NTRU public key cryptosystem. It was for a while available at (1997). http:\/\/www.tiac.net\/users\/ntru\/NTRUFTP.html"},{"key":"16_CR24","unstructured":"Hoffstein, J., Silverman, J.H.: A non-commutative version of the NTRU public key cryptosystem. unpublished paper, February 1997"},{"key":"16_CR25","unstructured":"Hoffstein, J., Silverman, J.H., Whyte, W.: Meet-in-the-middle attack on an NTRU private key. Technical report, NTRU Cryptosystems, July 2006. Report (2006)"},{"key":"16_CR26","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":"16_CR27","unstructured":"Howgrave-Graham, N., Silverman, J.H., Whyte, W.: A meet-in-the-middle attack on an NTRU private key. NTRU cryptosystem Technical report #004. (2003). https:\/\/www.securityinnovation.com\/uploads\/Crypto\/NTRUTech004v2.pdf"},{"key":"16_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":"16_CR29","unstructured":"Hurley, T.: Group rings and rings of matrices. Int. J. Pure Appl. Math. 31, 319\u2013335 (2006). https:\/\/www.researchgate.net\/publication\/228928727_Group_rings_and_rings_of_matrices"},{"issue":"1","key":"16_CR30","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10623-013-9850-3","volume":"74","author":"K Jarvis","year":"2015","unstructured":"Jarvis, K., Nevins, M.: ETRU: NTRU over the eisenstein integers. Des. Codes Crypt. 74(1), 219\u2013242 (2015). https:\/\/doi.org\/10.1007\/s10623-013-9850-3","journal-title":"Des. Codes Crypt."},{"key":"16_CR31","unstructured":"Karbasi, A.H., Atani, S.E., Atani, R.E.: PairTRU: pairwise Non-commutative Extension of the NTRU public key cryptosystem. Int. J. Inf. Secur. Sci. 8, 1\u201310 (2018)"},{"key":"16_CR32","doi-asserted-by":"publisher","unstructured":"Kim, J., Lee, C.: A polynomial time algorithm for breaking NTRU encryption with multiple keys. Des. Codes Cryptogr. 1\u201311 (2023).https:\/\/doi.org\/10.1007\/s10623-023-01233-5","DOI":"10.1007\/s10623-023-01233-5"},{"key":"16_CR33","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":"16_CR34","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77993-5","volume-title":"An Introduction to Mathematical Cryptography","author":"JH Silverman","year":"2008","unstructured":"Silverman, J.H., Pipher, J., Hoffstein, J.: An Introduction to Mathematical Cryptography. UTM, Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-77993-5"},{"key":"16_CR35","doi-asserted-by":"publisher","unstructured":"Kumar, V., Raya, A., Gangopadhyay, S., Gangopadhyay, A.K.: Lattice attack on group ring NTRU: the case of the dihedral group (2023). https:\/\/doi.org\/10.48550\/arXiv.2309.08304","DOI":"10.48550\/arXiv.2309.08304"},{"key":"16_CR36","unstructured":"Laarhoven, T.: Search problems in cryptography: from fingerprinting to lattice sieving. Phd thesis, Eindhoven University of Technology (2015). https:\/\/research.tue.nl\/en\/publications\/search-problems-in-cryptography-from-fingerprinting-to-lattice-si"},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(ARTICLE), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","DOI":"10.1007\/BF01457454"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Ling, C., Mendelsohn, A.: NTRU in quaternion algebras of bounded discriminant. In: Johansson, T., Smith-Tone, D. (eds.) Post-Quantum Cryptography. PQCrypto 2023. LNCS, vol. 14154, pp. 256\u2013290. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_10","DOI":"10.1007\/978-3-031-40003-2_10"},{"issue":"1","key":"16_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.joems.2014.08.001","volume":"24","author":"N Makhijani","year":"2016","unstructured":"Makhijani, N., Sharma, R., Srivastava, J.: Units in finite dihedral and quaternion group algebras. J. Egypt. Math. Soc. 24(1), 5\u20137 (2016). https:\/\/doi.org\/10.1016\/j.joems.2014.08.001","journal-title":"J. Egypt. Math. Soc."},{"key":"16_CR40","unstructured":"Malekian, E., Zakerolhosseini, A., Mashatan, A.: QTRU : a lattice attack resistant version of NTRU PKCS based on quaternion algebra. IACR Cryptology ePrint Archive 2009 (2009). https:\/\/eprint.iacr.org\/2009\/386"},{"key":"16_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-84245-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"A May","year":"2021","unstructured":"May, A.: How to meet ternary LWE keys. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 701\u2013731. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_24"},{"key":"16_CR42","doi-asserted-by":"crossref","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)","DOI":"10.1137\/1.9781611973730.21"},{"key":"16_CR43","doi-asserted-by":"crossref","unstructured":"Miyata, T.: On the units of the integral group ring of a dihedral group. J. Math. Soc. Jpn. 32(4) (1980)","DOI":"10.2969\/jmsj\/03240703"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Peikert, C.: A decade of lattice cryptography. Found. Trends\u00ae Theor. Comput. Sci. 10(4), 283\u2013424 (2016)","DOI":"10.1561\/0400000074"},{"issue":"2\u20133","key":"16_CR45","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. Theor. Comput. Sci. 53(2\u20133), 201\u2013224 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90064-8","journal-title":"Theor. Comput. Sci."},{"key":"16_CR46","unstructured":"Silverman, J.H.: Almost Inverses and Fast NTRU Key Creation. NTRU Cryptosystems Technical report $$\\#14$$ (1999)"},{"key":"16_CR47","doi-asserted-by":"publisher","unstructured":"Singh, S., Padhye, S.: Cryptanalysis of NTRU with n public keys. In: 2017 ISEA Asia Security and Privacy (ISEASP), pp. 1\u20136 (2017). https:\/\/doi.org\/10.1109\/ISEASP.2017.7976980","DOI":"10.1109\/ISEASP.2017.7976980"},{"key":"16_CR48","unstructured":"Development team, T.F.: FPLLL, a lattice reduction library, Version: 5.4.4 (2023). https:\/\/github.com\/fplll\/fplll"},{"key":"16_CR49","unstructured":"Development team, T.F.: FPYLLL, a Python wraper for the fplll lattice reduction library, Version: 0.5.9 (2023). https:\/\/github.com\/fplll\/fpylll"},{"key":"16_CR50","unstructured":"Truman, K.R.: Analysis and Extension of Non-Commutative NTRU. PhD dissertation, University of Maryland (2007). https:\/\/drum.lib.umd.edu\/handle\/1903\/7344"},{"key":"16_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-030-81293-5_7","volume-title":"Post-Quantum Cryptography","author":"I van Hoof","year":"2021","unstructured":"van Hoof, I., Kirshanova, E., May, A.: Quantum key search for ternary LWE. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 117\u2013132. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_7"},{"key":"16_CR52","unstructured":"Vats, N.: NNRU, a noncommutative analogue of NTRU (2009). https:\/\/arxiv.org\/abs\/0902.1891"},{"key":"16_CR53","unstructured":"Working Group of the C\/MM Committee and others: IEEE P1363.1 Standard Specification for Public-Key Cryptographic Techniques Based on Hard Problems over Lattices (2009)"},{"key":"16_CR54","unstructured":"Yasuda, T., Dahan, X., Sakurai, K.: Characterizing NTRU-variants using group ring and evaluating their lattice security. IACR Cryptol. ePrint Arch., p.\u00a01170 (2015). http:\/\/eprint.iacr.org\/2015\/1170"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64381-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:03:44Z","timestamp":1719961424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64381-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643804","9783031643811"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64381-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Douala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cameroon","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}