{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:54:51Z","timestamp":1742950491417,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031376788"},{"type":"electronic","value":"9783031376795"}],"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-37679-5_10","type":"book-chapter","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T20:31:42Z","timestamp":1689193902000},"page":"229-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Special Case of\u00a0Cyclotomic Fields in\u00a0Quantum Algorithms for\u00a0Unit Groups"],"prefix":"10.1007","author":[{"given":"Razvan","family":"Barbulescu","sequence":"first","affiliation":[]},{"given":"Adrien","family":"Poulalion","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Adrian, D., et al.: Imperfect forward secrecy: how Diffie-Hellman fails in practice. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (2015)","DOI":"10.1145\/2810103.2813707"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"issue":"1","key":"10_CR3","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. Math. Ann. 296(1), 625\u2013635 (1993)","journal-title":"Math. Ann."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Banegas, G., Bernstein, D.J., Van Hoof, I., Lange, T.: Concrete quantum cryptanalysis of binary elliptic curves. In: IACR Transactions on Cryptographic Hardware and Embedded Systems, pp. 451\u2013472 (2021)","DOI":"10.46586\/tches.v2021.i1.451-472"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-662-46800-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: Improving NFS for the discrete logarithm problem in non-prime finite fields. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 129\u2013155. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_6"},{"issue":"2","key":"10_CR6","first-page":"175","volume":"3","author":"S Beauregard","year":"2003","unstructured":"Beauregard, S.: Circuit for Shor\u2019s algorithm using 2n+ 3 qubits. Quantum Inf. Comput. 3(2), 175\u2013185 (2003)","journal-title":"Quantum Inf. Comput."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-030-17656-3_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"DJ Bernstein","year":"2019","unstructured":"Bernstein, D.J., Lange, T., Martindale, C., Panny, L.: Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 409\u2013441. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_15"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1049\/ise2.12081","volume":"17","author":"JF Biasse","year":"2023","unstructured":"Biasse, J.F., Bonnetain, X., Kirshanova, E., Schrottenloher, A., Song, F.: Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography. IET Inf. Secur. 17(2), 171\u2013209 (2023)","journal-title":"IET Inf. Secur."},{"key":"10_CR9","unstructured":"Biasse, J.F., Song, F.: On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in $$\\mathbb{Q} (\\zeta _{p^n})$$. Technical report, CACR 2015\u201312 (2015)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Biasse, J.F., Song, F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 893\u2013902. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Biasse, J.F., Song, F.: On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in $$\\mathbb{Q} (\\zeta _{2 ^k})$$. J. Math. Cryptology 13(3) (2019)","DOI":"10.1515\/jmc-2015-0046"},{"issue":"1990","key":"10_CR12","first-page":"27","volume":"1989","author":"J Buchmann","year":"1988","unstructured":"Buchmann, J.: A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. S\u00e9minaire de th\u00e9orie des nombres, Paris 1989(1990), 27\u201341 (1988)","journal-title":"S\u00e9minaire de th\u00e9orie des nombres, Paris"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-51517-8_89","volume-title":"Eurocal \u201987","author":"J Buchmann","year":"1989","unstructured":"Buchmann, J., Pohst, M.: Computing a lattice basis from a system of generating vectors. In: Davenport, J.H. (ed.) EUROCAL 1987. LNCS, vol. 378, pp. 54\u201363. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51517-8_89"},{"key":"10_CR14","unstructured":"Camus, T.: M\u00e9thodes algorithmiques pour les r\u00e9seaux alg\u00e9briques. PhD thesis, Universit\u00e9 Grenoble Alpes (2017)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-16715-2_26","volume-title":"Topics in Cryptology \u2014 CT-RSA 2015","author":"G Castagnos","year":"2015","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from $$\\sf DDH$$. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 487\u2013505. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_26"},{"key":"10_CR16","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics (1996)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-662-49896-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Cramer","year":"2016","unstructured":"Cramer, R., Ducas, L., Peikert, C., Regev, O.: Recovering short generators of principal ideals in cyclotomic rings. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 559\u2013585. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_20"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3431725","volume":"68","author":"R Cramer","year":"2021","unstructured":"Cramer, R., Ducas, L., Wesolowski, B.: Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time. J. ACM 68(2), 1\u201326 (2021)","journal-title":"J. ACM"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-45724-2_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"K de Boer","year":"2020","unstructured":"de Boer, K., Ducas, L., Fehr, S.: On the quantum complexity of the continuous hidden subgroup problem. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 341\u2013370. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_12"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-48000-6_10","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"I Duursma","year":"1999","unstructured":"Duursma, I., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with automorphisms. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 103\u2013121. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_10"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Kitaev, A., Song, F.: A quantum algorithm for computing the unit group of an arbitrary degree number field. In: Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, pp. 293\u2013302 (2014)","DOI":"10.1145\/2591796.2591860"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Kitaev, A., Song, F.: Long version of the submission to STOC 2014 for A quantum algorithm for computing the unit group of an arbitrary degree number field (2019). https:\/\/www.cse.psu.edu\/~sjh26\/units-stoc-submission.pdf","DOI":"10.1145\/2591796.2591860"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/3493492.3493498","volume":"55","author":"P Elbaz-Vincent","year":"2021","unstructured":"Elbaz-Vincent, P., Marcatel, E.: An extension of the fpLLL library to Hermitian lattices. ACM Commun. Comput. Algebra 55(2), 54\u201358 (2021)","journal-title":"ACM Commun. Comput. Algebra"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-14518-6_15","volume-title":"Algorithmic Number Theory","author":"C Fieker","year":"2010","unstructured":"Fieker, C., Stehl\u00e9, D.: Short bases of lattices over number fields. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS 2010. LNCS, vol. 6197, pp. 157\u2013173. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14518-6_15"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190\u2013200. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_11"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Gras, M.N.: M\u00e9thodes et algorithmes pour le calcul num\u00e9rique du nombre de classes et de unit\u00e9s des extensions cubiques cycliques de Q. J. f\u00fcr die reine und angewandte Mathematik (1975)","DOI":"10.1515\/crll.1975.277.89"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Hallgren, S.: Fast quantum algorithms for computing the unit group and class group of a number field. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (2005)","DOI":"10.1145\/1060590.1060660"},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1206035.1206039","volume":"54","author":"S Hallgren","year":"2007","unstructured":"Hallgren, S.: Polynomial-time quantum algorithms for Pell\u2019s equation and the principal ideal problem. J. ACM (JACM) 54(1), 1\u201319 (2007)","journal-title":"J. ACM (JACM)"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"H\u00e4ner, T., MRoetteler, M., Svore, K.M.: Factoring using $$2n+2$$ qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7\u20138) (2017)","DOI":"10.26421\/QIC17.7-8-7"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11818175_19","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A Joux","year":"2006","unstructured":"Joux, A., Lercier, R., Smart, N., Vercauteren, F.: The number field sieve in the medium prime case. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 326\u2013344. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_19"},{"issue":"2","key":"10_CR31","doi-asserted-by":"publisher","first-page":"469","DOI":"10.5802\/jtnb.334","volume":"13","author":"O Kihel","year":"2001","unstructured":"Kihel, O.: Groupe des unit\u00e9s pour des extensions di\u00e9drales complexes de degr\u00e9 $$10$$ sur $$\\mathbb{Q} $$. J. th\u00e9orie des nombres de Bordeaux 13(2), 469\u2013482 (2001)","journal-title":"J. th\u00e9orie des nombres de Bordeaux"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-71045-7_19","volume-title":"Cryptography and Coding","author":"T Kim","year":"2017","unstructured":"Kim, T., Lee, C.: Lattice reductions over Euclidean rings with applications to cryptanalysis. In: O\u2019Neill, M. (ed.) IMACC 2017. LNCS, vol. 10655, pp. 371\u2013391. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71045-7_19"},{"key":"10_CR33","unstructured":"Kitaev, A.Y.: Quantum measurements and the abelian stabilizer problem. arXiv preprint quant-ph\/9511026 (1995)"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Koch, H.: Algebraic Number Theory, volume 62 of Encyclopedia of Mathematical Sciences. Springer, Cham (1997). https:\/\/doi.org\/10.1007\/978-3-662-03983-0","DOI":"10.1007\/978-3-662-03983-0"},{"issue":"3","key":"10_CR35","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0022-314X(92)90003-8","volume":"40","author":"R Ku\u010dera","year":"1992","unstructured":"Ku\u010dera, R.: On bases of the Stickelberger ideal and of the group of circular units of a cyclotomic field. J. Number Theory 40(3), 284\u2013316 (1992)","journal-title":"J. Number Theory"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Lawrence, C.: Introduction to Cyclotomic Fields, volume 83 of Graduate Texts in Mathematics. Springer, Cham (1997). https:\/\/doi.org\/10.1007\/978-1-4612-1934-7","DOI":"10.1007\/978-1-4612-1934-7"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-34621-8_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"C Lee","year":"2019","unstructured":"Lee, C., Pellet-Mary, A., Stehl\u00e9, D., Wallet, A.: An LLL algorithm for module lattices. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 59\u201390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_3"},{"key":"10_CR38","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"AK Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1\u201319. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_1"},{"key":"10_CR40","unstructured":"Liu, X., Yang, H., Yang, L.: CNOT-count optimized quantum circuit of the Shor\u2019s algorithm. arXiv preprint arXiv:2112.11358 (2021)"},{"key":"10_CR41","unstructured":"Mosca, M., Piani, M.: 2021 quantum threat timeline report (2022). https:\/\/info.quintessencelabs.com\/hubfs\/Quantum-Threat-Timeline-Report-2021-full-report-final%20(1).pdf"},{"issue":"2","key":"10_CR42","doi-asserted-by":"publisher","first-page":"387","DOI":"10.5802\/jtnb.176","volume":"8","author":"H Napias","year":"1996","unstructured":"Napias, H.: A generalization of the LLL-algorithm over Euclidean rings or orders. J. th\u00e9orie des nombres de Bordeaux 8(2), 387\u2013396 (1996)","journal-title":"J. th\u00e9orie des nombres de Bordeaux"},{"key":"10_CR43","unstructured":"NIST. Submission requirements and evaluation criteria for the post-quantum cryptography standardization process (2016). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Proos, J.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf. Comput. 3(4) (2003)","DOI":"10.26421\/QIC3.4-3"},{"key":"10_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-70697-9_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"M Roetteler","year":"2017","unstructured":"Roetteler, M., Naehrig, M., Svore, K.M., Lauter, K.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 241\u2013270. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_9"},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Schmidt, A., Vollmer, U.: Polynomial time quantum algorithm for the computation of the unit group of a number field. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, pp. 475\u2013480 (2005)","DOI":"10.1145\/1060590.1060661"},{"issue":"242","key":"10_CR47","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1090\/S0025-5718-02-01432-1","volume":"72","author":"R Schoof","year":"2003","unstructured":"Schoof, R.: Class numbers of real cyclotomic fields of prime conductor. Math. Comput. 72(242), 913\u2013937 (2003)","journal-title":"Math. Comput."},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Thyagarajan, S.A.K., Castagnos, G., Laguillaumie, F., Malavolta, G.: Efficient CCA timed commitments in class groups. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (2021)","DOI":"10.1145\/3460120.3484773"},{"key":"10_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13"},{"key":"10_CR51","unstructured":"Zalka, C.: Shor\u2019s algorithm with fewer (pure) qubits. arXiv preprint quant-ph\/0601097 (2006)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37679-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T01:18:12Z","timestamp":1729732692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37679-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031376788","9783031376795"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37679-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 July 2023","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":"Sousse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tunisia","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":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"59","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":"21","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":"36% - 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":"2.9","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.5","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)"}}]}}