{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T17:09:56Z","timestamp":1784999396471,"version":"3.55.0"},"reference-count":167,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"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":["Wireless Netw"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s11276-025-03906-6","type":"journal-article","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T18:10:31Z","timestamp":1740507031000},"page":"2993-3024","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A survey on isogeny-based cryptographic protocols"],"prefix":"10.1007","volume":"31","author":[{"given":"Sweta","family":"Mishra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bhaskar","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rishi Kumar","family":"Jha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,25]]},"reference":[{"key":"3906_CR1","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W. (1976). New direction in cryptography. IEEE Transactions on Information Theory, 22, 472\u2013492.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"3906_CR2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120\u2013126.","journal-title":"Communications of the ACM"},{"issue":"2","key":"3906_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1008354106356","volume":"19","author":"N Koblitz","year":"2000","unstructured":"Koblitz, N., Menezes, A., & Vanstone, S. (2000). The state of elliptic curve cryptography. Designs, Codes and Cryptography, 19(2), 173\u2013193.","journal-title":"Designs, Codes and Cryptography"},{"key":"3906_CR4","doi-asserted-by":"crossref","unstructured":"Miller, V. S. (1985). Use of elliptic curves in cryptography. In Conference on the theory and application of cryptographic techniques (pp. 417\u2013426). Springer.","DOI":"10.1007\/3-540-39799-X_31"},{"issue":"1","key":"3906_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/s102070100002","volume":"1","author":"D Johnson","year":"2001","unstructured":"Johnson, D., Menezes, A., & Vanstone, S. (2001). The elliptic curve digital signature algorithm (ECDSA). International Journal of Information Security, 1(1), 36\u201363.","journal-title":"International Journal of Information Security"},{"issue":"2","key":"3906_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120\u2013126. https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Communications of the ACM"},{"key":"3906_CR7","doi-asserted-by":"crossref","unstructured":"Amara, M., & Siad, A. (2011). Hardware implementation of elliptic curve point multiplication over gf ($$2^{ \\wedge } \\,{\\text{m}}$$) for ECC protocols. International Journal for Information Security Research (IJISR), 1(3).","DOI":"10.20533\/ijisr.2042.4639.2012.0013"},{"key":"3906_CR8","doi-asserted-by":"crossref","unstructured":"Gura, N., Patel, A., Wander, A., Eberle, H., & Shantz, S. C. (2004). Comparing elliptic curve cryptography and rsa on 8-bit cpus. In International workshop on cryptographic hardware and embedded systems (pp. 119\u2013132). Springer.","DOI":"10.1007\/978-3-540-28632-5_9"},{"key":"3906_CR9","doi-asserted-by":"crossref","unstructured":"Bafandehkar, M., Yasin, S. M., Mahmod, R., & Hanapi, Z. M. (2013). Comparison of ECC and RSA algorithm in resource constrained devices. In 2013 International conference on IT convergence and security (ICITCS) (pp. 1\u20133). IEEE.","DOI":"10.1109\/ICITCS.2013.6717816"},{"key":"3906_CR10","unstructured":"Standards, N. I., (NIST), T., Barker, E. (2000). Digital signature standard (DSS). Federal Information Processing Standards (NIST FIPS), National Institute of Standards and Technology, Gaithersburg, MD."},{"key":"3906_CR11","first-page":"155","volume":"800","author":"A Regenscheid","year":"2011","unstructured":"Regenscheid, A., & Scarfone, K. (2011). Recommendations of the National Institute of Standards and Technology. NIST Special Publication, 800, 155.","journal-title":"NIST Special Publication"},{"issue":"5","key":"3906_CR12","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"AJ Menezes","year":"1993","unstructured":"Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993). Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, 39(5), 1639\u20131646.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"3906_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P. W. (1999). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review, 41(2), 303\u2013332.","journal-title":"SIAM Review"},{"issue":"4","key":"3906_CR14","first-page":"1","volume":"2","author":"R Avanzi","year":"2019","unstructured":"Avanzi, R., Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehl\u00e9, D. (2019). Crystals-kyber algorithm specifications and supporting documentation. NIST PQC Round, 2(4), 1\u201343.","journal-title":"NIST PQC Round"},{"key":"3906_CR15","unstructured":"Kannwischer, M. J. (2022). Polynomial multiplication for post-quantum cryptography. Ph.D. thesis [Sl]:[Sn]."},{"issue":"6","key":"3906_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O. (2009). On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM), 56(6), 1\u201340.","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"3906_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3422178","volume":"54","author":"P Ravi","year":"2021","unstructured":"Ravi, P., Howe, J., Chattopadhyay, A., & Bhasin, S. (2021). Lattice-based key-sharing schemes: A survey. ACM Computing Surveys (CSUR), 54(1), 1\u201339.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"3906_CR18","doi-asserted-by":"crossref","first-page":"334","DOI":"10.46586\/tches.v2021.i3.334-359","volume":"2021","author":"S Bhasin","year":"2021","unstructured":"Bhasin, S., D\u2019Anvers, J.-P., Heinz, D., P\u00f6ppelmann, T., Van\u00a0Beirendonck, M. (2021). Attacking and defending masked polynomial comparison for lattice-based cryptography. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2021, 334\u2013359.","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"3906_CR19","doi-asserted-by":"crossref","unstructured":"Lai, R. W., & Malavolta, G. (2023). Lattice-based timed cryptography. In Annual international cryptology conference (pp. 782\u2013804). Springer.","DOI":"10.1007\/978-3-031-38554-4_25"},{"issue":"5","key":"3906_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3609223","volume":"22","author":"D Lei","year":"2023","unstructured":"Lei, D., He, D., Peng, C., Luo, M., Liu, Z., & Huang, X. (2023). Faster implementation of ideal lattice-based cryptography using avx512. ACM Transactions on Embedded Computing Systems, 22(5), 1\u201318.","journal-title":"ACM Transactions on Embedded Computing Systems"},{"issue":"3","key":"3906_CR21","doi-asserted-by":"crossref","first-page":"366","DOI":"10.46586\/tches.v2023.i3.366-390","volume":"2023","author":"A Aikata","year":"2023","unstructured":"Aikata, A., Basso, A., Cassiers, G., Mert, A. C., & Roy, S. S. (2023). Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2023(3), 366\u2013390.","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"3906_CR22","doi-asserted-by":"crossref","unstructured":"Wan, L., Zheng, F., & Lin, J. (2021). Teslac: Accelerating lattice-based cryptography with AI accelerator. In International conference on security and privacy in communication systems (pp. 249\u2013269). Springer.","DOI":"10.1007\/978-3-030-90019-9_13"},{"issue":"12","key":"3906_CR23","first-page":"5079","volume":"69","author":"YA Birgani","year":"2022","unstructured":"Birgani, Y. A., Timarchi, S., & Khalid, A. (2022). Area-time-efficient scalable schoolbook polynomial multiplier for lattice-based cryptography. IEEE Transactions on Circuits and Systems II: Express Briefs, 69(12), 5079\u20135083.","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"3906_CR24","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R. J. (1978). A public-key cryptosystem based on algebraic. Coding Thv, 4244, 114\u2013116.","journal-title":"Coding Thv"},{"issue":"3","key":"3906_CR25","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., & Van Tilborg, H. (1978). On the inherent intractability of certain coding problems (corresp.). IEEE Transactions on Information Theory, 24(3), 384\u2013386.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3906_CR26","doi-asserted-by":"crossref","unstructured":"Biasse, J.-F., Jao, D., & Sankar, A. (2014). A quantum algorithm for computing isogenies between supersingular elliptic curves. In International conference on cryptology in India (pp. 428\u2013442). Springer.","DOI":"10.1007\/978-3-319-13039-2_25"},{"issue":"2","key":"3906_CR27","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10623-022-01114-3","volume":"91","author":"L Bidoux","year":"2023","unstructured":"Bidoux, L., Gaborit, P., Kulkarni, M., & Mateu, V. (2023). Code-based signatures from new proofs of knowledge for the syndrome decoding problem. Designs, Codes and Cryptography, 91(2), 497\u2013544.","journal-title":"Designs, Codes and Cryptography"},{"key":"3906_CR28","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10623-016-0276-6","volume":"82","author":"Q Alam\u00e9lou","year":"2017","unstructured":"Alam\u00e9lou, Q., Blazy, O., Cauchie, S., & Gaborit, P. (2017). A code-based group signature scheme. Designs, Codes and Cryptography, 82, 469\u2013493.","journal-title":"Designs, Codes and Cryptography"},{"key":"3906_CR29","unstructured":"Mac, D. T. (2021). On certain types of code-based signatures. Ph.D. thesis, Universit\u00e9 de Limoges."},{"key":"3906_CR30","doi-asserted-by":"crossref","unstructured":"Gaborit, P., & Girault, M. (2007). Lightweight code-based identification and signature. In 2007 IEEE international symposium on information theory (pp. 191\u2013195). IEEE.","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"3906_CR31","unstructured":"Baldi, M., Battaglioni, M., Chiaraluce, F., Horlemann-Trautmann, A.-L., Persichetti, E., Santini, P., & Weger, V. (2020). A new path to code-based signatures via identification schemes with restricted errors. arXiv preprint arXiv:2008.06403."},{"key":"3906_CR32","doi-asserted-by":"crossref","first-page":"177506","DOI":"10.1109\/ACCESS.2020.3026989","volume":"8","author":"Y Lee","year":"2020","unstructured":"Lee, Y., Lee, W., Kim, Y. S., & No, J.-S. (2020). Modified pqsigrm: Rm code-based signature scheme. IEEE Access, 8, 177506\u2013177518.","journal-title":"IEEE Access"},{"key":"3906_CR33","doi-asserted-by":"crossref","unstructured":"Lau, T. S. C., & Tan, C.H. (2020). Murave: a new rank code-based signature with multiple rank verification. In Code-based cryptography workshop (pp. 94\u2013116). Springer.","DOI":"10.1007\/978-3-030-54074-6_6"},{"key":"3906_CR34","volume-title":"Multivariate public key cryptosystems (advances in information security)","author":"J Ding","year":"2006","unstructured":"Ding, J., Gower, J. E., & Schmidt, D. (2006). Multivariate public key cryptosystems (advances in information security). Berlin: Springer."},{"issue":"10","key":"3906_CR35","doi-asserted-by":"crossref","first-page":"2499","DOI":"10.1093\/comjnl\/bxac100","volume":"66","author":"V Srivastava","year":"2023","unstructured":"Srivastava, V., & Debnath, S. K. (2023). A multivariate-based provably secure certificateless signature scheme with applications to the internet of medical things. The Computer Journal, 66(10), 2499\u20132516.","journal-title":"The Computer Journal"},{"issue":"9","key":"3906_CR36","doi-asserted-by":"crossref","first-page":"9853","DOI":"10.1109\/TVT.2022.3176755","volume":"71","author":"V Srivastava","year":"2022","unstructured":"Srivastava, V., Debnath, S. K., Bera, B., Das, A. K., Park, Y., & Lorenz, P. (2022). Blockchain-envisioned provably secure multivariate identity-based multi-signature scheme for internet of vehicles environment. IEEE Transactions on Vehicular Technology, 71(9), 9853\u20139867.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"6","key":"3906_CR37","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.3934\/amc.2021050","volume":"17","author":"V Srivastava","year":"2023","unstructured":"Srivastava, V., Debnath, S. K., Stanica, P., & Pal, S. K. (2023). A multivariate identity-based broadcast encryption with applications to the internet of things. Advances in Mathematics of Communications, 17(6), 1302\u20131313.","journal-title":"Advances in Mathematics of Communications"},{"issue":"2","key":"3906_CR38","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s13389-022-00308-8","volume":"13","author":"SK Debnath","year":"2023","unstructured":"Debnath, S. K., Mesnager, S., Srivastava, V., Pal, S. K., & Kundu, N. (2023). Mul-IBS: a multivariate identity-based signature scheme compatible with IoT-based NDN architecture. Journal of Cryptographic Engineering, 13(2), 187\u2013199.","journal-title":"Journal of Cryptographic Engineering"},{"issue":"2","key":"3906_CR39","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1049\/ise2.12092","volume":"17","author":"Y Ikematsu","year":"2023","unstructured":"Ikematsu, Y., Nakamura, S., & Takagi, T. (2023). Recent progress in the security evaluation of multivariate public-key cryptography. IET Information Security, 17(2), 210\u2013226.","journal-title":"IET Information Security"},{"key":"3906_CR40","doi-asserted-by":"crossref","unstructured":"Ding, J., Petzoldt, A., Schmidt, D. S., Ding, J., Petzoldt, A., & Schmidt, D. S. (2020). Multivariate cryptography. In Multivariate public key cryptosystems (pp. 7\u201323).","DOI":"10.1007\/978-1-0716-0987-3_2"},{"key":"3906_CR41","doi-asserted-by":"crossref","unstructured":"Kuang, R., & Barbeau, M. (2021). Indistinguishability and non-deterministic encryption of the quantum safe multivariate polynomial public key cryptographic system. In 2021 IEEE Canadian conference on electrical and computer engineering (CCECE) (pp. 1\u20135). IEEE.","DOI":"10.1109\/CCECE53047.2021.9569200"},{"issue":"10","key":"3906_CR42","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/s11128-022-03712-5","volume":"21","author":"R Kuang","year":"2022","unstructured":"Kuang, R., Perepechaenko, M., & Barbeau, M. (2022). A new post-quantum multivariate polynomial public key encapsulation algorithm. Quantum Information Processing, 21(10), 360.","journal-title":"Quantum Information Processing"},{"key":"3906_CR43","doi-asserted-by":"crossref","unstructured":"Ustimenko, V.: On schubert cells of projective geometry and quadratic public keys of multivariate cryptography. Cryptology ePrint Archive (2024)","DOI":"10.15407\/fmmit2023.36.027"},{"issue":"3","key":"3906_CR44","doi-asserted-by":"crossref","first-page":"814","DOI":"10.3934\/amc.2022026","volume":"18","author":"R Sarkar","year":"2024","unstructured":"Sarkar, R., Mandal, M., & Mukhopadhyay, S. (2024). Quantum-safe identity-based broadcast encryption with provable security from multivariate cryptography. Advances in Mathematics of Communications, 18(3), 814\u2013827.","journal-title":"Advances in Mathematics of Communications"},{"key":"3906_CR45","doi-asserted-by":"crossref","DOI":"10.1016\/j.jisa.2023.103474","volume":"74","author":"V Srivastava","year":"2023","unstructured":"Srivastava, V., Debnath, S. K., Tiwari, S. K., & Singh, H. (2023). On the security of multivariate-based ring signature and other related primitives. Journal of Information Security and Applications, 74, 103474.","journal-title":"Journal of Information Security and Applications"},{"key":"3906_CR46","unstructured":"Srivastava, V., Baksi, A., & Debnath, S. K. (2023). An overview of hash based signatures. Cryptology ePrint Archive, Paper 2023\/411. https:\/\/eprint.iacr.org\/2023\/411."},{"key":"3906_CR47","doi-asserted-by":"crossref","unstructured":"Bernstein, D. J., Hopwood, D., H\u00fclsing, A., Lange, T., Niederhagen, R., Papachristodoulou, L., Schneider, M., Schwabe, P., & Wilcox-O\u2019Hearn, Z. (2015). Sphincs: Practical stateless hash-based signatures. In Annual international conference on the theory and applications of cryptographic techniques (pp. 368\u2013397). Springer.","DOI":"10.1007\/978-3-662-46800-5_15"},{"key":"3906_CR48","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","volume":"560","author":"CH Bennett","year":"2014","unstructured":"Bennett, C. H., & Brassard, G. (2014). Quantum cryptography: Public key distribution and coin tossing. Theoretical Computer Science, 560, 7\u201311.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"3906_CR49","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","volume":"67","author":"AK Ekert","year":"1991","unstructured":"Ekert, A. K. (1991). Quantum cryptography based on Bell\u2019s theorem. Physical Review Letters, 67(6), 661.","journal-title":"Physical Review Letters"},{"issue":"3","key":"3906_CR50","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s11128-024-04316-x","volume":"23","author":"M Kumar","year":"2024","unstructured":"Kumar, M., & Mondal, B. (2024). Quantum blockchain architecture using cyclic QSCD and QKD. Quantum Information Processing, 23(3), 101.","journal-title":"Quantum Information Processing"},{"key":"3906_CR51","doi-asserted-by":"crossref","DOI":"10.1016\/j.jisa.2022.103127","volume":"66","author":"SK Debnath","year":"2022","unstructured":"Debnath, S. K., Srivastava, V., Mohanty, T., Kundu, N., & Sakurai, K. (2022). Quantum secure privacy preserving technique to obtain the intersection of two datasets for contact tracing. Journal of Information Security and Applications, 66, 103127.","journal-title":"Journal of Information Security and Applications"},{"key":"3906_CR52","doi-asserted-by":"crossref","unstructured":"Mohanty, T., Srivastava, V., Debnath, S. K., Das, A. K., & Sikdar, B. (2023). Quantum secure threshold private set intersection protocol for IoT-enabled privacy preserving ride-sharing application. IEEE Internet of Things Journal.","DOI":"10.1109\/JIOT.2023.3291132"},{"key":"3906_CR53","doi-asserted-by":"crossref","unstructured":"Sarkar, S., Srivastava, V., Mohanty, T., Debnath, S. K., & Mesnager, S. (2024). An efficient quantum oblivious transfer protocol. Cluster Computing, 1\u201312.","DOI":"10.1007\/s10586-024-04642-w"},{"key":"3906_CR54","doi-asserted-by":"crossref","unstructured":"Sarkar, S., Mohanty, T., Srivastava, V., Debnath, S. K., Das, A. K., & Park, Y. (2024). Quantum secure disease surveillance through private set intersection. IEEE Transactions on Consumer Electronics.","DOI":"10.1109\/TCE.2024.3435860"},{"key":"3906_CR55","doi-asserted-by":"publisher","first-page":"022334","DOI":"10.1103\/PhysRevA.88.022334","volume":"88","author":"J-L Zhang","year":"2013","unstructured":"Zhang, J.-L., Guo, F.-Z., Gao, F., Liu, B., & Wen, Q.-Y. (2013). Private database queries based on counterfactual quantum key distribution. Physical Review A, 88, 022334. https:\/\/doi.org\/10.1103\/PhysRevA.88.022334","journal-title":"Physical Review A"},{"issue":"1","key":"3906_CR56","doi-asserted-by":"crossref","first-page":"7537","DOI":"10.1038\/srep07537","volume":"4","author":"C-Y Wei","year":"2014","unstructured":"Wei, C.-Y., Gao, F., Wen, Q.-Y., & Wang, T.-Y. (2014). Practical quantum private query of blocks based on unbalanced-state Bennett-Brassard-1984 quantum-key-distribution protocol. Scientific Reports, 4(1), 7537.","journal-title":"Scientific Reports"},{"issue":"2","key":"3906_CR57","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.83.022301","volume":"83","author":"M Jakobi","year":"2011","unstructured":"Jakobi, M., Simon, C., Gisin, N., Bancal, J.-D., Branciard, C., Walenta, N., & Zbinden, H. (2011). Practical private database queries based on a quantum-key-distribution protocol. Physical Review A-Atomic, Molecular, and Optical Physics, 83(2), 022301.","journal-title":"Physical Review A-Atomic, Molecular, and Optical Physics"},{"issue":"16","key":"3906_CR58","doi-asserted-by":"crossref","first-page":"17411","DOI":"10.1364\/OE.20.017411","volume":"20","author":"F Gao","year":"2012","unstructured":"Gao, F., Liu, B., Wen, Q.-Y., & Chen, H. (2012). Flexible quantum private queries based on quantum key distribution. Optics Express, 20(16), 17411\u201317420.","journal-title":"Optics Express"},{"key":"3906_CR59","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., & Schwabe, P. (2016). Post-quantum key $$\\{Exchange-A\\}$$ new hope. In 25th USENIX security symposium (USENIX Security 16) (pp. 327\u2013343)."},{"key":"3906_CR60","doi-asserted-by":"crossref","first-page":"142413","DOI":"10.1109\/ACCESS.2020.3013250","volume":"8","author":"F Borges","year":"2020","unstructured":"Borges, F., Reis, P. R., & Pereira, D. (2020). A comparison of security and its performance for key agreements in post-quantum cryptography. IEEE Access, 8, 142413\u2013142422.","journal-title":"IEEE Access"},{"key":"3906_CR61","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1515\/crll.1936.175.193","volume":"175","author":"H Hasse","year":"1936","unstructured":"Hasse, H. (1936). Zur theorie der abstrakten elliptischen funktionenk\u00f6rper iii. die struktur des meromorphismenrings. die riemannsche vermutung. Journal f\u00fcr die reine und angewandte Mathematik, 175, 193\u2013208.","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"issue":"1","key":"3906_CR62","doi-asserted-by":"crossref","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R Schoof","year":"1995","unstructured":"Schoof, R. (1995). Counting points on elliptic curves over finite fields. Journal de th\u00e9orie des nombres de Bordeaux, 7(1), 219\u2013254.","journal-title":"Journal de th\u00e9orie des nombres de Bordeaux"},{"key":"3906_CR63","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The arithmetic of elliptic curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J. H. (2009). The arithmetic of elliptic curves (Vol. 106). Berlin: Springer."},{"key":"3906_CR64","doi-asserted-by":"crossref","unstructured":"Joye, M., & Quisquater, J.-J. (2001). Hessian elliptic curves and side-channel attacks. In Cryptographic hardware and embedded systems-CHES 2001: Third international workshop Paris, France, May 14\u201316, 2001 proceedings (Vol. 3, pp. 402\u2013410). Springer.","DOI":"10.1007\/3-540-44709-1_33"},{"key":"3906_CR65","doi-asserted-by":"crossref","unstructured":"Bernstein, D. J., & Lange, T. (2007). Faster addition and doubling on elliptic curves. In Advances in cryptology\u2013ASIACRYPT 2007: 13th international conference on the theory and application of cryptology and information security, Kuching, Malaysia, December 2\u20136, 2007. Proceedings (Vol. 13, pp. 29\u201350). Springer.","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"3906_CR66","doi-asserted-by":"crossref","unstructured":"Moriya, T., Onuki, H., & Takagi, T. (2020). How to construct csidh on Edwards curves. In Cryptographers\u2019 track at the RSA conference (pp. 512\u2013537). Springer.","DOI":"10.1007\/978-3-030-40186-3_22"},{"key":"3906_CR67","unstructured":"Smith, B. (2008). Mappings of elliptic curves. DIAMANT-summer school on elliptic and hyperelliptic curve cryptography."},{"issue":"2","key":"3906_CR68","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01404549","volume":"2","author":"J Tate","year":"1966","unstructured":"Tate, J. (1966). Endomorphisms of abelian varieties over finite fields. Inventiones Mathematicae, 2(2), 134\u2013144.","journal-title":"Inventiones Mathematicae"},{"key":"3906_CR69","doi-asserted-by":"crossref","unstructured":"Boneh, D., & Lipton, R. J. (1995). Quantum cryptanalysis of hidden linear functions. In Annual international cryptology conference (pp. 424\u2013437). Springer.","DOI":"10.1007\/3-540-44750-4_34"},{"key":"3906_CR70","first-page":"305","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J. (1971). Isog\u00e9nies entre courbes elliptiques. Comptes rendus de l\u2019Academie des sciences Paris, 273, 305\u2013347.","journal-title":"Comptes rendus de l\u2019Academie des sciences Paris"},{"issue":"3","key":"3906_CR71","first-page":"269","volume":"1","author":"R Br\u00f6ker","year":"2009","unstructured":"Br\u00f6ker, R. (2009). Constructing supersingular elliptic curves. Journal of Combinatorics and Number Theory, 1(3), 269\u2013273.","journal-title":"Journal of Combinatorics and Number Theory"},{"key":"3906_CR72","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1112\/S1461157012001106","volume":"15","author":"AV Sutherland","year":"2012","unstructured":"Sutherland, A. V. (2012). Identifying supersingular elliptic curves. LMS Journal of Computation and Mathematics, 15, 317\u2013325.","journal-title":"LMS Journal of Computation and Mathematics"},{"issue":"179","key":"3906_CR73","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-1987-0890272-3","volume":"49","author":"H-G R\u00fcck","year":"1987","unstructured":"R\u00fcck, H.-G. (1987). A note on elliptic curves over finite fields. Mathematics of Computation, 49(179), 301\u2013304.","journal-title":"Mathematics of Computation"},{"issue":"170","key":"3906_CR74","first-page":"483","volume":"44","author":"R Schoof","year":"1985","unstructured":"Schoof, R. (1985). Elliptic curves over finite fields and the computation of square roots mod $$p$$. Mathematics of Computation, 44(170), 483\u2013494.","journal-title":"Mathematics of Computation"},{"key":"3906_CR75","doi-asserted-by":"crossref","unstructured":"Waldschmidt, M. (2008). Elliptic functions and transcendence. In Surveys in number theory (pp. 1\u201346).","DOI":"10.1007\/978-0-387-78510-3_7"},{"key":"3906_CR76","unstructured":"Rostovtsev, A., & Stolbunov, A. (2006). Public-key cryptosystem based on isogenies. Cryptology ePrint Archive."},{"issue":"3","key":"3906_CR77","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1515\/jmc-2012-0015","volume":"8","author":"L De Feo","year":"2014","unstructured":"De Feo, L., Jao, D., & Pl\u00fbt, J. (2014). Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. Journal of Mathematical Cryptology, 8(3), 209\u2013247.","journal-title":"Journal of Mathematical Cryptology"},{"issue":"2","key":"3906_CR78","doi-asserted-by":"crossref","first-page":"215","DOI":"10.3934\/amc.2010.4.215","volume":"4","author":"A Stolbunov","year":"2010","unstructured":"Stolbunov, A. (2010). Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves. Advances in Mathematics of Communications, 4(2), 215.","journal-title":"Advances in Mathematics of Communications"},{"key":"3906_CR79","doi-asserted-by":"crossref","unstructured":"Azarderakhsh, R., Jao, D., Kalach, K., Koziel, B., & Leonardi, C. (2016). Key compression for isogeny-based cryptosystems. In Proceedings of the 3rd ACM international workshop on ASIA public-key cryptography (pp. 1\u201310).","DOI":"10.1145\/2898420.2898421"},{"key":"3906_CR80","doi-asserted-by":"crossref","unstructured":"Jao, D., & Feo, L. D. (2011). Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In International workshop on post-quantum cryptography (pp. 19\u201334). Springer.","DOI":"10.1007\/978-3-642-25405-5_2"},{"key":"3906_CR81","doi-asserted-by":"crossref","unstructured":"Costello, C., Longa, P., & Naehrig, M. (2016). Efficient algorithms for supersingular isogeny Diffie\u2013Hellman. In Annual international cryptology conference (pp. 572\u2013601). Springer.","DOI":"10.1007\/978-3-662-53018-4_21"},{"key":"3906_CR82","doi-asserted-by":"crossref","unstructured":"Verheul, E. R. (2001). Evidence that xtr is more secure than supersingular elliptic curve cryptosystems. In International conference on the theory and applications of cryptographic techniques (pp. 195\u2013210). Springer.","DOI":"10.1007\/3-540-44987-6_13"},{"issue":"177","key":"3906_CR83","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P. L. (1987). Speeding the pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177), 243\u2013264.","journal-title":"Mathematics of Computation"},{"key":"3906_CR84","doi-asserted-by":"crossref","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., & Renes, J. (2018). Csidh: An efficient post-quantum commutative group action. In International conference on the theory and application of cryptology and information security (pp. 395\u2013427). Springer.","DOI":"10.1007\/978-3-030-03332-3_15"},{"issue":"1","key":"3906_CR85","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"A Childs","year":"2014","unstructured":"Childs, A., Jao, D., & Soukharev, V. (2014). Constructing elliptic curve isogenies in quantum subexponential time. Journal of Mathematical Cryptology, 8(1), 1\u201329.","journal-title":"Journal of Mathematical Cryptology"},{"issue":"19","key":"3906_CR86","doi-asserted-by":"crossref","first-page":"6927","DOI":"10.3390\/app10196927","volume":"10","author":"D Heo","year":"2020","unstructured":"Heo, D., Kim, S., Park, Y.-H., & Hong, S. (2020). On the performance analysis for csidh-based cryptosystems. Applied Sciences, 10(19), 6927.","journal-title":"Applied Sciences"},{"key":"3906_CR87","doi-asserted-by":"crossref","unstructured":"Meyer, M., & Reith, S. (2018). A faster way to the csidh. In International conference on cryptology in India (pp. 137\u2013152). Springer.","DOI":"10.1007\/978-3-030-05378-9_8"},{"issue":"1","key":"3906_CR88","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2140\/obs.2020.4.39","volume":"4","author":"DJ Bernstein","year":"2020","unstructured":"Bernstein, D. J., De Feo, L., Leroux, A., & Smith, B. (2020). Faster computation of isogenies of large prime degree. Open Book Series, 4(1), 39\u201355.","journal-title":"Open Book Series"},{"key":"3906_CR89","doi-asserted-by":"crossref","unstructured":"Petit, C. (2017). Faster algorithms for isogeny problems using torsion point images. In International conference on the theory and application of cryptology and information security (pp. 330\u2013353). Springer.","DOI":"10.1007\/978-3-319-70697-9_12"},{"key":"3906_CR90","doi-asserted-by":"crossref","unstructured":"De\u00a0Feo, L., Saint\u00a0Guilhem, C., Fouotsa, T.B., Kutas, P., Leroux, A., Petit, C., Silva, J., & Wesolowski, B. (2021). S\u00e9ta: Supersingular encryption from torsion attacks. In International conference on the theory and application of cryptology and information security (pp. 249\u2013278). Springer.","DOI":"10.1007\/978-3-030-92068-5_9"},{"key":"3906_CR91","doi-asserted-by":"crossref","unstructured":"Quehen, V. d., Kutas, P., Leonardi, C., Martindale, C., Panny, L., Petit, C., & Stange, K. E. (2021). Improved torsion-point attacks on sidh variants. In Annual international cryptology conference (pp. 432\u2013470). Springer.","DOI":"10.1007\/978-3-030-84252-9_15"},{"key":"3906_CR92","doi-asserted-by":"crossref","unstructured":"Basso, A., Kutas, P., Merz, S.-P., Petit, C., & Sanso, A. (2021). Cryptanalysis of an oblivious PRF from supersingular isogenies. Cryptology ePrint Archive, Paper 2021\/706.","DOI":"10.1007\/978-3-030-92062-3_6"},{"issue":"1","key":"3906_CR93","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s00145-007-9002-x","volume":"22","author":"DX Charles","year":"2009","unstructured":"Charles, D. X., Lauter, K. E., & Goren, E. Z. (2009). Cryptographic hash functions from expander graphs. Journal of Cryptology, 22(1), 93\u2013113.","journal-title":"Journal of Cryptology"},{"key":"3906_CR94","unstructured":"Fouotsa, T. B. (2022). Sidh with masked torsion point images. Cryptology ePrint Archive."},{"key":"3906_CR95","doi-asserted-by":"crossref","unstructured":"Azarderakhsh, R., Jao, D., & Leonardi, C. (2017). Post-quantum static-static key agreement using multiple protocol instances. In International conference on selected areas in cryptography (pp. 45\u201363). Springer.","DOI":"10.1007\/978-3-319-72565-9_3"},{"key":"3906_CR96","doi-asserted-by":"crossref","unstructured":"Fouotsa, T. B., & Petit, C. (2021). Sheals and heals: Isogeny-based pkes from a key validation method for sidh. In International conference on the theory and application of cryptology and information security (pp. 279\u2013307). Springer.","DOI":"10.1007\/978-3-030-92068-5_10"},{"key":"3906_CR97","doi-asserted-by":"crossref","unstructured":"Fiat, A., & Shamir, A. (1986) How to prove yourself: Practical solutions to identification and signature problems. In Conference on the theory and application of cryptographic techniques (pp. 186\u2013194). Springer.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"3906_CR98","doi-asserted-by":"crossref","unstructured":"De\u00a0Feo, L., & Galbraith, S. D. (2019). Seasign: Compact isogeny signatures from class group actions. In Advances in cryptology\u2014EUROCRYPT 2019: 38th annual international conference on the theory and applications of cryptographic techniques, Darmstadt, Germany, May 19\u201323, 2019, proceedings, part III (Vol. 38, pp. 759\u2013789). Springer.","DOI":"10.1007\/978-3-030-17659-4_26"},{"key":"3906_CR99","unstructured":"Stolbunov, A. (2012). Cryptographic schemes based on isogenies."},{"key":"3906_CR100","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V. (2009). Fiat\u2013Shamir with aborts: Applications to lattice and factoring-based signatures. In International conference on the theory and application of cryptology and information security (pp. 598\u2013616). Springer.","DOI":"10.1007\/978-3-642-10366-7_35"},{"issue":"7","key":"3906_CR101","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/358699.358718","volume":"24","author":"RC Merkle","year":"1981","unstructured":"Merkle, R. C., & Hellman, M. E. (1981). On the security of multiple encryption. Communications of the ACM, 24(7), 465\u2013467.","journal-title":"Communications of the ACM"},{"key":"3906_CR102","doi-asserted-by":"crossref","unstructured":"Prasithsangaree, P., & Krishnamurthy, P. (2003). Analysis of energy consumption of rc4 and aes algorithms in wireless lans. In GLOBECOM\u201903. IEEE global telecommunications conference (IEEE Cat. No. 03CH37489) (Vol. 3, pp. 1445\u20131449). IEEE.","DOI":"10.1109\/GLOCOM.2003.1258477"},{"key":"3906_CR103","doi-asserted-by":"crossref","unstructured":"Campos, F., Kr\u00e4mer, J., & M\u00fcller, M. (2021). Safe-error attacks on sike and csidh. In International conference on security, privacy, and applied cryptography engineering (pp. 104\u2013125). Springer.","DOI":"10.1007\/978-3-030-95085-9_6"},{"issue":"4","key":"3906_CR104","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4), 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3906_CR105","unstructured":"Daemen, J., & Rijmen, V. (1999). Aes proposal: Rijndael."},{"issue":"177","key":"3906_CR106","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of Computation, 48(177), 203\u2013209.","journal-title":"Mathematics of Computation"},{"key":"3906_CR107","doi-asserted-by":"crossref","unstructured":"Gueron, S., Johnson, S., & Walker, J. (2011). Sha-512\/256. In 2011 Eighth international conference on information technology: New generations (pp. 354\u2013358). IEEE.","DOI":"10.1109\/ITNG.2011.69"},{"key":"3906_CR108","unstructured":"Rabin, M. O. (1979). Digitalized signatures and public-key functions as intractable as factorization. Technical report, Massachusetts Institute of Technology, USA."},{"key":"3906_CR109","unstructured":"PUB, F. (2000). Digital signature standard (DSS). FIPS PUB (pp. 186\u2013192)."},{"issue":"1","key":"3906_CR110","first-page":"86","volume":"64","author":"B Koziel","year":"2016","unstructured":"Koziel, B., Azarderakhsh, R., Kermani, M. M., & Jao, D. (2016). Post-quantum cryptography on FPGA based on isogenies on elliptic curves. IEEE Transactions on Circuits and Systems I: Regular Papers, 64(1), 86\u201399.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"3906_CR111","doi-asserted-by":"crossref","unstructured":"Costello, C., & Hisil, H. (2017). A simple and compact algorithm for sidh with arbitrary degree isogenies. In Advances in cryptology\u2014ASIACRYPT 2017: 23rd international conference on the theory and applications of cryptology and information security, Hong Kong, China, December 3\u20137, 2017, proceedings, part II (Vol. 23, pp. 303\u2013329). Springer.","DOI":"10.1007\/978-3-319-70697-9_11"},{"key":"3906_CR112","doi-asserted-by":"crossref","unstructured":"De\u00a0Feo, L., Kohel, D., Leroux, A., Petit, C., & Wesolowski, B. (2020). Sqisign: Compact post-quantum signatures from quaternions and isogenies. In International conference on the theory and application of cryptology and information security (pp. 64\u201393). Springer.","DOI":"10.1007\/978-3-030-64837-4_3"},{"issue":"10","key":"3906_CR113","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1587\/transfun.2019DMP0008","volume":"103","author":"H Onuki","year":"2020","unstructured":"Onuki, H., Aikawa, Y., Yamazaki, T., & Takagi, T. (2020). A constant-time algorithm of csidh keeping two points. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 103(10), 1174\u20131182.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"3906_CR114","unstructured":"Castryck, W., & Decru, T. (2019). CSIDH on the surface. Cryptology ePrint Archive, Paper 2019\/1404. https:\/\/eprint.iacr.org\/2019\/1404."},{"key":"3906_CR115","doi-asserted-by":"crossref","unstructured":"Beullens, W., Kleinjung, T., & Vercauteren, F. (2019). Csi-fish: Efficient isogeny based signatures through class group computations. In International conference on the theory and application of cryptology and information security (pp. 227\u2013247). Springer.","DOI":"10.1007\/978-3-030-34578-5_9"},{"issue":"5","key":"3906_CR116","first-page":"1","volume":"36","author":"P-A Fouque","year":"2018","unstructured":"Fouque, P.-A., Hoffstein, J., Kirchner, P., Lyubashevsky, V., Pornin, T., Prest, T., Ricosset, T., Seiler, G., Whyte, W., Zhang, Z., et al. (2018). Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Submission to the NIST\u2019s Post-quantum Cryptography Standardization Process, 36(5), 1\u201375.","journal-title":"Submission to the NIST\u2019s Post-quantum Cryptography Standardization Process"},{"key":"3906_CR117","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., & Micciancio, D. (Eds.). (2019). Advances in cryptology\u2013CRYPTO 2019: 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18\u201322, 2019, proceedings, part III. Lecture notes in computer science (LNCS) (Vol. 11694). Heidelberg: Springer.","DOI":"10.1007\/978-3-030-26954-8"},{"key":"3906_CR118","doi-asserted-by":"crossref","unstructured":"Costello, C., Longa, P., Naehrig, M., Renes, J., & Virdia, F. (2020). Improved classical cryptanalysis of sike in practice. In IACR international conference on public-key cryptography (pp. 505\u2013534). Springer.","DOI":"10.1007\/978-3-030-45388-6_18"},{"key":"3906_CR119","unstructured":"Adj, G., Chi-Dom\u00ednguez, J.-J., & Rodr\u00edguez-Henr\u00edquez, F. (2020). Karatsuba-based square-root v\u00e9lu\u2019s formulas applied to two isogeny-based protocols. Cryptology ePrint Archive."},{"key":"3906_CR120","doi-asserted-by":"crossref","unstructured":"Galbraith, S. D., Petit, C., Shani, B., & Ti, Y. B. (2016). On the security of supersingular isogeny cryptosystems. In International conference on the theory and application of cryptology and information security (pp. 63\u201391). Springer.","DOI":"10.1007\/978-3-662-53887-6_3"},{"issue":"A","key":"3906_CR121","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1112\/S1461157014000151","volume":"17","author":"D Kohel","year":"2014","unstructured":"Kohel, D., Lauter, K., Petit, C., & Tignol, J.-P. (2014). On the quaternion-isogeny path problem. LMS Journal of Computation and Mathematics, 17(A), 418\u2013432.","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"3906_CR122","first-page":"21","volume":"7","author":"ND Elkies","year":"1998","unstructured":"Elkies, N. D., et al. (1998). Elliptic and modular curves over finite fields and related computational issues. AMS IP Studies in Advanced Mathematics, 7, 21\u201376.","journal-title":"AMS IP Studies in Advanced Mathematics"},{"issue":"263","key":"3906_CR123","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1090\/S0025-5718-08-02066-8","volume":"77","author":"A Bostan","year":"2008","unstructured":"Bostan, A., Morain, F., Salvy, B., & Schost, \u00c9. (2008). Fast algorithms for computing isogenies between elliptic curves. Mathematics of Computation, 77(263), 1755\u20131778.","journal-title":"Mathematics of Computation"},{"issue":"3","key":"3906_CR124","doi-asserted-by":"crossref","first-page":"783","DOI":"10.5802\/jtnb.650","volume":"20","author":"R Lercier","year":"2008","unstructured":"Lercier, R., & Sirvent, T. (2008). On elkies subgroups of el-torsion points in elliptic curves defined over a finite field. Journal de th\u00e9orie des nombres de Bordeaux, 20(3), 783\u2013797.","journal-title":"Journal de th\u00e9orie des nombres de Bordeaux"},{"key":"3906_CR125","unstructured":"Couveignes, J.-M. (1994). Quelques calculs en th\u00e9orie des nombres. Th ese, Universit e de Bordeaux I."},{"key":"3906_CR126","doi-asserted-by":"crossref","unstructured":"Couveignes, J.-M. (1996). Computing l-isogenies using the p-torsion. In International algorithmic number theory symposium (pp. 59\u201365). Springer.","DOI":"10.1007\/3-540-61581-4_41"},{"issue":"232","key":"3906_CR127","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1090\/S0025-5718-00-01193-5","volume":"69","author":"J-M Couveignes","year":"2000","unstructured":"Couveignes, J.-M. (2000). Isomorphisms between Artin-Schreier towers. Mathematics of Computation, 69(232), 1625\u20131631.","journal-title":"Mathematics of Computation"},{"issue":"A","key":"3906_CR128","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1112\/S146115701600036X","volume":"19","author":"L De Feo","year":"2016","unstructured":"De Feo, L., Hugounenq, C., Pl\u00fbt, J., & Schost, \u00c9. (2016). Explicit isogenies in quadratic time in any characteristic. LMS Journal of Computation and Mathematics, 19(A), 267\u2013282.","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"3906_CR129","doi-asserted-by":"crossref","unstructured":"De\u00a0Feo, L., & Schost, \u00c9. (2009). Fast arithmetics in Artin-Schreier towers over finite fields. In Proceedings of the 2009 international symposium on symbolic and algebraic computation (pp. 127\u2013134).","DOI":"10.1145\/1576702.1576722"},{"key":"3906_CR130","doi-asserted-by":"crossref","unstructured":"Bonnetain, X., & Schrottenloher, A. (2020). Quantum security analysis of csidh. In Annual international conference on the theory and applications of cryptographic techniques (pp. 493\u2013522). Springer.","DOI":"10.1007\/978-3-030-45724-2_17"},{"key":"3906_CR131","doi-asserted-by":"crossref","unstructured":"Shanks, D. (1971). Class number, a theory of factorization, and genera. In Proceedings of the symposium on mathematical society (Vol. 20, pp. 41\u2013440).","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"3906_CR132","doi-asserted-by":"crossref","unstructured":"Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022). Status report on the third round of the NIST post-quantum cryptography standardization process.","DOI":"10.6028\/NIST.IR.8413"},{"key":"3906_CR133","doi-asserted-by":"crossref","unstructured":"Zhang, S. (2005). Promised and distributed quantum search. In International computing and combinatorics conference (pp. 430\u2013439).","DOI":"10.1007\/11533719_44"},{"issue":"1","key":"3906_CR134","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G. (2005). A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM Journal on Computing, 35(1), 170\u2013188.","journal-title":"SIAM Journal on Computing"},{"key":"3906_CR135","unstructured":"Regev, O. (2004). A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space. arXiv preprint quant-ph\/0406151."},{"key":"3906_CR136","doi-asserted-by":"crossref","unstructured":"Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing (pp. 212\u2013219).","DOI":"10.1145\/237814.237866"},{"key":"3906_CR137","unstructured":"Bottinelli, P., Quehen, V., Leonardi, C., Mosunov, A., Pawlega, F., & Sheth, M. (2019). The dark sidh of isogenies. Cryptology ePrint Archive."},{"key":"3906_CR138","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., H\u00f6velmanns, K., & Kiltz, E. (2017). A modular analysis of the Fujisaki-Okamoto transformation. In Theory of cryptography conference (pp. 341\u2013371). Springer.","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"3906_CR139","doi-asserted-by":"crossref","unstructured":"Fujisaki, E., & Okamoto, T. (1999). Secure integration of asymmetric and symmetric encryption schemes. In M. Wiener (Ed.), Advances in cryptology\u2014CRYPTO\u2019 99 (pp. 537\u2013554). Berlin: Springer.","DOI":"10.1007\/3-540-48405-1_34"},{"key":"3906_CR140","doi-asserted-by":"crossref","unstructured":"Peyrin, T., & Galbraith, S. (2018). Advances in cryptology\u2014ASIACRYPT 2018: 24th international conference on the theory and application of cryptology and information security, Brisbane, QLD, Australia, December 2\u20136, 2018, proceedings, part II (Vol. 11273). Springer.","DOI":"10.1007\/978-3-030-03329-3"},{"key":"3906_CR141","doi-asserted-by":"crossref","unstructured":"Fouotsa, T. B., & Petit, C. (2022). A new adaptive attack on sidh. In Cryptographers\u2019 track at the RSA conference (pp. 322\u2013344). Springer.","DOI":"10.1007\/978-3-030-95312-6_14"},{"key":"3906_CR142","doi-asserted-by":"crossref","unstructured":"Castryck, W., Panny, L., & Vercauteren, F. (2019). Rational isogenies from irrational endomorphisms. Cryptology ePrint Archive, Paper 2019\/1202.","DOI":"10.1007\/978-3-030-45724-2_18"},{"key":"3906_CR143","unstructured":"Castryck, W., & Decru, T. (2022). An efficient key recovery attack on SIDH (preliminary version). Cryptology ePrint Archive, Paper 2022\/975."},{"issue":"9","key":"3906_CR144","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1109\/12.869328","volume":"49","author":"S-M Yen","year":"2000","unstructured":"Yen, S.-M., & Joye, M. (2000). Checking before output may not be enough against fault-based cryptanalysis. IEEE Transactions on Computers, 49(9), 967\u2013970.","journal-title":"IEEE Transactions on Computers"},{"key":"3906_CR145","unstructured":"Jao, D., Azarderakhsh, R., Campagna, M., Costello, C., De Feo, L., Hess, B., Jalali, A., Koziel, B., LaMacchia, B., Longa, P., et al. (2019). Sike. Technical report."},{"issue":"4","key":"3906_CR146","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/TC.2003.1190587","volume":"52","author":"S-M Yen","year":"2003","unstructured":"Yen, S.-M., Kim, S., Lim, S., & Moon, S.-J. (2003). Rsa speedup with Chinese remainder theorem immune against hardware fault cryptanalysis. IEEE Transactions on Computers, 52(4), 461\u2013472.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"3906_CR147","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1234\/adapt2020","volume":"10","author":"J Dobson","year":"2020","unstructured":"Dobson, J., & Smith, J. (2020). Adaptive systems in modern computing. Journal of Adaptive Systems, 10(2), 123\u2013134. https:\/\/doi.org\/10.1234\/adapt2020","journal-title":"Journal of Adaptive Systems"},{"key":"3906_CR148","doi-asserted-by":"crossref","unstructured":"Ti, Y. B. (2017). Fault attack on supersingular isogeny cryptosystems. In International workshop on post-quantum cryptography (pp. 107\u2013122). Springer.","DOI":"10.1007\/978-3-319-59879-6_7"},{"key":"3906_CR149","doi-asserted-by":"crossref","unstructured":"Koziel, B., Azarderakhsh, R., & Jao, D. (2017). Side-channel attacks on quantum-resistant supersingular isogeny Diffie\u2013Hellman. In International conference on selected areas in cryptography (pp. 64\u201381). Springer.","DOI":"10.1007\/978-3-319-72565-9_4"},{"key":"3906_CR150","doi-asserted-by":"crossref","unstructured":"Azarderakhsh, R., Lang, B. E., Jao, D., & Koziel, B. (2018). Edsidh: Supersingular isogeny Diffie\u2013Hellman key exchange on Edwards curves. In International conference on security, privacy, and applied cryptography engineering SPACE 2018: security, privacy, and applied cryptography engineering.","DOI":"10.1007\/978-3-030-05072-6_8"},{"key":"3906_CR151","first-page":"107","volume-title":"Post-quantum cryptography","author":"YB Ti","year":"2017","unstructured":"Ti, Y. B. (2017). Fault attack on supersingular isogeny cryptosystems. In T. Lange & T. Takagi (Eds.), Post-quantum cryptography (pp. 107\u2013122). Cham: Springer."},{"key":"3906_CR152","doi-asserted-by":"crossref","unstructured":"G\u00e9lin, A., & Wesolowski, B. (2017). Loop-abort faults on supersingular isogeny cryptosystems. In International workshop on post-quantum cryptography (pp. 93\u2013106). Springer.","DOI":"10.1007\/978-3-319-59879-6_6"},{"issue":"2","key":"3906_CR153","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10623-014-0010-1","volume":"78","author":"C Delfs","year":"2016","unstructured":"Delfs, C., & Galbraith, S. D. (2016). Computing isogenies between supersingular elliptic curves over $$f_ p$$. Designs, Codes and Cryptography, 78(2), 425\u2013440.","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"3906_CR154","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1137\/S009753970343141X","volume":"36","author":"W Van Dam","year":"2006","unstructured":"Van Dam, W., Hallgren, S., & Ip, L. (2006). Quantum algorithms for some hidden shift problems. SIAM Journal on Computing, 36(3), 763\u2013778.","journal-title":"SIAM Journal on Computing"},{"key":"3906_CR155","doi-asserted-by":"crossref","unstructured":"Bleichenbacher, D. (1998). Chosen ciphertext attacks against protocols based on the rsa encryption standard pkcs# 1. In Annual international cryptology conference (pp. 1\u201312).","DOI":"10.1007\/BFb0055716"},{"key":"3906_CR156","doi-asserted-by":"crossref","unstructured":"Lim, C. H., & Lee, P. J. (1997). A key recovery attack on discrete log-based schemes using a prime order subgroup. In Annual international cryptology conference (pp. 249\u2013263). Springer.","DOI":"10.1007\/BFb0052240"},{"key":"3906_CR157","doi-asserted-by":"crossref","unstructured":"Biehl, I., Meyer, B., & M\u00fcller, V. (2000). Differential fault attacks on elliptic curve cryptosystems. In Annual international cryptology conference (pp. 131\u2013146). Springer.","DOI":"10.1007\/3-540-44598-6_8"},{"issue":"1","key":"3906_CR158","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10623-003-1160-8","volume":"36","author":"M Ciet","year":"2005","unstructured":"Ciet, M., & Joye, M. (2005). Elliptic curve cryptosystems in the presence of permanent and transient faults. Designs, Codes and Cryptography, 36(1), 33\u201343.","journal-title":"Designs, Codes and Cryptography"},{"key":"3906_CR159","doi-asserted-by":"crossref","unstructured":"De\u00a0Feo, L., Kieffer, J., & Smith, B. (2018). Towards practical key exchange from ordinary isogeny graphs. In International conference on the theory and application of cryptology and information security (pp. 365\u2013394). Springer.","DOI":"10.1007\/978-3-030-03332-3_14"},{"key":"3906_CR160","doi-asserted-by":"crossref","unstructured":"Renes, J. (2018). Computing isogenies between montgomery curves using the action of (0, 0). In International conference on post-quantum cryptography (pp. 229\u2013247). Springer.","DOI":"10.1007\/978-3-319-79063-3_11"},{"issue":"5","key":"3906_CR161","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s00200-018-0349-z","volume":"29","author":"J Doliskani","year":"2018","unstructured":"Doliskani, J. (2018). On division polynomial pit and supersingularity. Applicable Algebra in Engineering, Communication and Computing, 29(5), 393\u2013407.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"3","key":"3906_CR162","doi-asserted-by":"crossref","first-page":"1934","DOI":"10.1109\/TIT.2019.2938984","volume":"66","author":"S Kim","year":"2020","unstructured":"Kim, S., Yoon, K., Kwon, J., Park, Y.-H., & Hong, S. (2020). New hybrid method for isogeny-based cryptosystems using Edwards curves. IEEE Transactions on Information Theory, 66(3), 1934\u20131943.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3906_CR163","doi-asserted-by":"crossref","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., & Renes, J. (2018). CSIDH: An efficient post-quantum commutative group action. Cryptology ePrint Archive, Paper 2018\/383. https:\/\/eprint.iacr.org\/2018\/383.","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"3906_CR164","doi-asserted-by":"crossref","unstructured":"Yoo, Y., Azarderakhsh, R., Jalali, A., Jao, D., & Soukharev, V. (2017). A post-quantum digital signature scheme based on supersingular isogenies. In International conference on financial cryptography and data security (pp. 163\u2013181). Springer.","DOI":"10.1007\/978-3-319-70972-7_9"},{"key":"3906_CR165","doi-asserted-by":"crossref","unstructured":"Galbraith, S. D., Petit, C., & Silva, J. (2017). Identification protocols and signature schemes based on supersingular isogeny problems. In T. Takagi & T. Peyrin (Eds.), Advances in cryptology\u2014ASIACRYPT 2017 (pp. 3\u201333). Cham: Springer.","DOI":"10.1007\/978-3-319-70694-8_1"},{"key":"3906_CR166","doi-asserted-by":"crossref","unstructured":"Castryck, W., & Decru, T. (2020). Csidh on the surface. In International conference on post-quantum cryptography (pp. 111\u2013129). Springer.","DOI":"10.1007\/978-3-030-44223-1_7"},{"key":"3906_CR167","doi-asserted-by":"crossref","unstructured":"Campos, F., Chavez-Saab, J., Chi-Dom\u00ednguez, J.-J., Meyer, M., Reijnders, K., Rodr\u00edguez-Henr\u00edquez, F., Schwabe, P., & Wiggers, T. (2023). Optimizations and practicality of high-security CSIDH. Cryptology ePrint Archive, Paper 2023\/793. https:\/\/eprint.iacr.org\/2023\/793.","DOI":"10.62056\/anjbksdja"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-025-03906-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-025-03906-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-025-03906-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T05:13:08Z","timestamp":1742188388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-025-03906-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,25]]},"references-count":167,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["3906"],"URL":"https:\/\/doi.org\/10.1007\/s11276-025-03906-6","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,25]]},"assertion":[{"value":"8 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No human and\/or animal studies have been presented in the manuscript. Hence, no ethical approval is needed.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors do not have any financial or personal conflict of interest related to this manuscript to disclose.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}