{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T06:32:18Z","timestamp":1777012338200,"version":"3.51.4"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683909","type":"print"},{"value":"9783031683916","type":"electronic"}],"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-68391-6_1","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T19:02:14Z","timestamp":1723834934000},"page":"3-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum Complexity for\u00a0Discrete Logarithms and\u00a0Related Problems"],"prefix":"10.1007","author":[{"given":"Minki","family":"Hhan","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[]},{"given":"Aaram","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"1_CR1","unstructured":"Aaronson, S.: Ten semi-grand challenges for quantum computing theory (2005)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Arora, A.S., Coladangelo, A., Coudron, M., Gheorghiu, A., Singh, U., Waldner, H.: Quantum depth in the random oracle model. arXiv preprint arXiv:2210.06454 (2022)","DOI":"10.1145\/3564246.3585153"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3570637","volume":"70","author":"NH Chia","year":"2023","unstructured":"Chia, N.H., Chung, K.M., Lai, C.Y.: On the need for large quantum depth. J. ACM 70(1), 1\u201338 (2023)","journal-title":"J. ACM"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"AM Childs","year":"2014","unstructured":"Childs, A.M., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1), 1\u201329 (2014)","journal-title":"J. Math. Cryptol."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Coudron, M., Menda, S.: Computations with greater quantum depth are strictly more powerful (relative to an oracle). In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, 22\u201326 June 2020, pp. 889\u2013901. ACM (2020)","DOI":"10.1145\/3357713.3384269"},{"key":"1_CR7","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. Cryptology ePrint Archive, Paper 2006\/291 (2006). https:\/\/eprint.iacr.org\/2006\/291"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Cleve, R., Watrous, J.: Fast parallel circuits for the quantum Fourier transform. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 526\u2013536. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892140"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-031-22318-1_2","volume-title":"TCC 2022","author":"J Don","year":"2022","unstructured":"Don, J., Fehr, S., Huang, Y.H.: Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. LNCS, vol. 13747, pp. 33\u201351. Springer, Heidleberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_2"},{"issue":"6","key":"1_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR11","unstructured":"Duman, J., Hartmann, D., Kiltz, E., Kunzweiler, S., Lehmann, J., Riepel, D.: Generic models for group actions. Cryptology ePrint Archive, Paper 2023\/186, to appear at PKC 2023 (2023(. https:\/\/eprint.iacr.org\/2023\/186"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Eker\u00e5, M., G\u00e4rtner, J.: Extending Regev\u2019s factoring algorithm to compute discrete logarithms. arXiv preprint arXiv:2311.05545 (2023)","DOI":"10.1007\/978-3-031-62746-0_10"},{"key":"1_CR13","unstructured":"Eker\u00e5, M., G\u00e4rtner, J.: A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography. arXiv preprint arXiv:2405.14381 (2024)"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1006\/aama.2000.0699","volume":"25","author":"M Ettinger","year":"2000","unstructured":"Ettinger, M., H\u00f8yer, P.: On quantum algorithms for noncommutative hidden subgroups. Adv. Appl. Math. 25(3), 239\u2013251 (2000)","journal-title":"Adv. Appl. Math."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-59879-6_20","volume-title":"Post-Quantum Cryptography","author":"M Eker\u00e5","year":"2017","unstructured":"Eker\u00e5, M., H\u00e5stad, J.: Quantum algorithms for computing short discrete logarithms and factoring RSA integers. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 347\u2013363. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_20"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ipl.2004.01.024","volume":"91","author":"M Ettinger","year":"2004","unstructured":"Ettinger, M., H\u00f8yer, P., Knill, E.: The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett. 91(1), 43\u201348 (2004)","journal-title":"Inf. Process. Lett."},{"key":"1_CR17","unstructured":"Eker\u00e5, M.: Revisiting Shor\u2019s quantum algorithm for computing general discrete logarithms. arXiv preprint arXiv:1905.09084 (2019)"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1515\/jmc-2020-0006","volume":"15","author":"M Eker\u00e5","year":"2021","unstructured":"Eker\u00e5, M.: Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. J. Math. Cryptol. 15(1), 359\u2013407 (2021)","journal-title":"J. Math. Cryptol."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-81293-5_9","volume-title":"Post-Quantum Cryptography","author":"E Eaton","year":"2021","unstructured":"Eaton, E., Stebila, D.: The \u201cQuantum Annoying\u2019\u2019 property of\u00a0password-authenticated key exchange\u00a0protocols. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 154\u2013173. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_9"},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"433","DOI":"10.22331\/q-2021-04-15-433","volume":"5","author":"C Gidney","year":"2021","unstructured":"Gidney, C., Eker\u00e5, M.: How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433 (2021)","journal-title":"Quantum"},{"key":"1_CR22","unstructured":"Hhan, M.: A new approach to generic lower bounds: classical\/quantum MDL, quantum factoring, and more. arXiv preprint arXiv:2402.11269 (2024)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-44223-1_23","volume-title":"Post-Quantum Cryptography","author":"T H\u00e4ner","year":"2020","unstructured":"H\u00e4ner, T., Jaques, S., Naehrig, M., Roetteler, M., Soeken, M.: Improved quantum circuits for elliptic curve discrete logarithms. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_23"},{"key":"1_CR24","unstructured":"Hamoudi, Y., Liu, Q., Sinha, M.: Quantum-classical tradeoffs in the random oracle model. arXiv preprint arXiv:2211.12954 (2022)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Hallgren, S., Moore, C., R\u00f6tteler, M., Russell, A., Sen, P.: Limitations of quantum coset states for graph isomorphism. J. ACM 57(6), 34:1\u201334:33 (2010)","DOI":"10.1145\/1857914.1857918"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Hallgren, S., Russell, A., Ta-Shma, A.: Normal subgroup reconstruction and quantum computation using group representations. In:\u00a0Yao, F.F., Luks, E.M., (eds.) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 21\u201323 May 2000, pp. 627\u2013635. ACM (2000)","DOI":"10.1145\/335305.335392"},{"issue":"1","key":"1_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.4086\/toc.2005.v001a005","volume":"1","author":"P H\u00f8yer","year":"2005","unstructured":"H\u00f8yer, P., Spalek, R.: Quantum fan-out is powerful. Theory Comput. 1(1), 81\u2013103 (2005)","journal-title":"Theory Comput."},{"key":"1_CR28","unstructured":"Jozsa, R.: An introduction to measurement based quantum computation. In: NATO Science Series, III: Computer and Systems Sciences. Quantum Information Processing-From Theory to Experiment, vol. 199, pp. 137\u2013158 (2006)"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-36030-6_11","volume-title":"Theory of Cryptography","author":"Z Ji","year":"2019","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-88733-1_14","volume-title":"Provable Security","author":"T Jager","year":"2008","unstructured":"Jager, T., Schwenk, J.: On the equivalence of generic group models. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol. 5324, pp. 200\u2013209. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88733-1_14"},{"key":"1_CR31","unstructured":"Kaliski Jr, B.S.: A quantum \u201cmagic box\u201d for the discrete logarithm problem. Cryptology ePrint Archive, Paper 2017\/745 (2017). http:\/\/eprint.iacr.org\/2017\/745"},{"key":"1_CR32","unstructured":"Kitaev, A.Y.: Quantum measurements and the abelian stabilizer problem. Electron. Colloquium Comput. Complex. TR96-003 (1996)"},{"issue":"1\u20132","key":"1_CR33","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2007.02.057","volume":"380","author":"P Koiran","year":"2007","unstructured":"Koiran, P., Nesme, V., Portier, N.: The quantum query complexity of the abelian hidden subgroup problem. Theor. Comput. Sci. 380(1\u20132), 115\u2013126 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45537-X_17","volume-title":"Selected Areas in Cryptography","author":"F Kuhn","year":"2001","unstructured":"Kuhn, F., Struik, R.: Random walks revisited: extensions of pollard\u2019s rho algorithm for computing multiple discrete logarithms. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 212\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45537-X_17"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Shen, A., Vyalyi, M.N.: Classical and quantum computation, no\u00a047. American Mathematical Society (2002)","DOI":"10.1090\/gsm\/047"},{"issue":"1","key":"1_CR36","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170\u2013188 (2005)","journal-title":"SIAM J. Comput."},{"key":"1_CR37","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In: 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, p.\u00a020. Citeseer (2013)"},{"key":"1_CR38","unstructured":"Lomont, C.: The hidden subgroup problem-review and open problems. arXiv preprint quant-ph\/0411037 (2004)"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding","author":"U Maurer","year":"2005","unstructured":"Maurer, U.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-49208-9_15","volume-title":"Quantum Computing and Quantum Communications","author":"M Mosca","year":"1999","unstructured":"Mosca, M., Ekert, A.: The hidden subgroup problem and eigenvalue estimation on a quantum computer. In: Williams, C.P. (ed.) QCQC 1998. LNCS, vol. 1509, pp. 174\u2013188. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49208-9_15"},{"key":"1_CR41","unstructured":"Maurer, U., Portmann, C., Zhu, J.: Unifying generic group models. Cryptology ePrint Archive, Paper 2020\/996 (2020). https:\/\/eprint.iacr.org\/2020\/996"},{"issue":"6","key":"1_CR42","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/050644896","volume":"37","author":"C Moore","year":"2008","unstructured":"Moore, C., Russell, A., Schulman, L.J.: The symmetric group defies strong fourier sampling. SIAM J. Comput. 37(6), 1842\u20131864 (2008)","journal-title":"SIAM J. Comput."},{"key":"1_CR43","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-22963-3_1","volume-title":"ASIACRYPT 2022","author":"H Montgomery","year":"2023","unstructured":"Montgomery, H., Zhandry, M.: Full quantum equivalence of group action DLog and CDH, and more. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13791, pp. 3\u201332. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_1"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-030-45724-2_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"C Peikert","year":"2020","unstructured":"Peikert, C.: He gives C-sieves on the CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 463\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_16"},{"issue":"7\u20138","key":"1_CR45","first-page":"649","volume":"14","author":"A Pavlidis","year":"2014","unstructured":"Pavlidis, A., Gizopoulos, D.: Fast quantum modular exponentiation architecture for Shor\u2019s factoring algorithm. Quantum Inf. Comput. 14(7\u20138), 649\u2013682 (2014)","journal-title":"Quantum Inf. Comput."},{"issue":"2","key":"1_CR46","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0209022","volume":"9","author":"N Pippenger","year":"1980","unstructured":"Pippenger, N.: On the evaluation of powers and monomials. SIAM J. Comput. 9(2), 230\u2013250 (1980)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR47","first-page":"317","volume":"3","author":"J Proos","year":"2003","unstructured":"Proos, J., Zalka, C.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf. Comput. 3(4), 317\u2013344 (2003)","journal-title":"Quantum Inf. Comput."},{"issue":"3","key":"1_CR48","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O Regev","year":"2004","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM J. Comput. 33(3), 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"1_CR49","unstructured":"Regev, O.: An efficient quantum factoring algorithm. arXiv preprint arXiv:2308.06572 (2023)"},{"key":"1_CR50","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":"1_CR51","unstructured":"Rosmanis, A.: Hybrid quantum-classical search algorithms. arXiv preprint arXiv:2202.11443 (2022)"},{"key":"1_CR52","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-key cryptosystem based on isogenies. Cryptology ePrint Archive, Paper 2006\/145 (2006). https:\/\/eprint.iacr.org\/2006\/145"},{"issue":"9\u201310","key":"1_CR53","first-page":"888","volume":"14","author":"M R\u00f6tteler","year":"2014","unstructured":"R\u00f6tteler, M., Steinwandt, R.: A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth $${O}(\\log ^2 n)$$. Quantum Inf. Comput. 14(9\u201310), 888\u2013900 (2014)","journal-title":"Quantum Inf. Comput."},{"key":"1_CR54","unstructured":"Ragavan, S., Vaikuntanathan, V.: Optimizing space in Regev\u2019s factoring algorithm. arXiv preprint arXiv:2310.00899 (2023)"},{"issue":"3","key":"1_CR55","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1109\/18.256501","volume":"39","author":"K-Y Siu","year":"1993","unstructured":"Siu, K.-Y., Bruck, J., Kailath, T., Hofmeister, T.: Depth efficient neural networks for division and related problems. IEEE Trans. Inf. Theory 39(3), 946\u2013956 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR56","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":"1_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"1_CR58","unstructured":"Thomas, S.: Re: [CFRG] proposed PAKE selection process. CFRG Mailing list (2019)"},{"key":"1_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/978-3-662-46803-6_27","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"A Yun","year":"2015","unstructured":"Yun, A.: Generic hardness of the multiple discrete logarithm problem. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 817\u2013836. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_27"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-030-92062-3_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Zhandry","year":"2021","unstructured":"Zhandry, M.: Redeeming reset indifferentiability and applications to post-quantum security. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 518\u2013548. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_18"},{"key":"1_CR61","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-031-15982-4_3","volume-title":"CRYPTO 2022","author":"M Zhandry","year":"2022","unstructured":"Zhandry, M.: To label, or not to label (in generic groups). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13509, pp. 66\u201396. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68391-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:02:41Z","timestamp":1730214161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68391-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683909","9783031683916"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68391-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}