{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:32Z","timestamp":1778128052995,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T00:00:00Z","timestamp":1682640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T00:00:00Z","timestamp":1682640000000},"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":["J Supercomput"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s11227-023-05146-x","type":"journal-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T03:50:42Z","timestamp":1682653842000},"page":"16529-16558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A post-quantum key exchange protocol from the intersection of quadric surfaces"],"prefix":"10.1007","volume":"79","author":[{"given":"Daniele Di","family":"Tullio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Gyawali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,28]]},"reference":[{"key":"5146_CR1","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.jalgebra.2006.01.015","volume":"303","author":"A Abdesselam","year":"2006","unstructured":"Abdesselam A (2006) A computational solution to a question by Beauville on the invariants of the binary quintic. J Algebra 303:771\u2013788","journal-title":"J Algebra"},{"issue":"3","key":"5146_CR2","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp ER, McEliece RJ, van Tilborg HCA (1978) On the inherent intractability of certain coding problems. IEEE Trans Inf Theory 24(3):384\u2013386","journal-title":"IEEE Trans Inf Theory"},{"key":"5146_CR3","doi-asserted-by":"crossref","unstructured":"Bernardin L, Monagan MB (1997) Efficient multivariate factorization over finite fields. In: Mora T, Mattson H (eds) Applied algebra, algebraic algorithms and error-correcting codes. AAECC 1997. Lecture notes in computer science 1225, Springer 15\u201328","DOI":"10.1007\/3-540-63163-1_2"},{"key":"5146_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein DJ, Buchmann J, Dahmen E (2009) Post-Quantum Cryptography. Springer-Verlag, Berlin Heidelberg"},{"key":"5146_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"EUROCRYPT 2001","author":"R Canetti","year":"2001","unstructured":"Canetti R, Krawczyk H (2001) Analysis of Key-Exchange Protocols and their Use for Building Secure Channels. In: Pfitzmann B (ed) EUROCRYPT 2001, vol 2045. LNCS. Springer, Heidelberg, pp 453\u2013474"},{"key":"5146_CR6","unstructured":"Cannon J, Bosma W, Fieker C, Steel A (eds) (2013) Handbook of Magma Functions, Version 2.19. https:\/\/www.math.uzh.ch\/sepp\/magma-2.19.8-cr\/Handbook.pdf"},{"key":"5146_CR7","unstructured":"Castryck W, Decru T (2022) An efficient key recovery attack on SIDH (preliminary version). Cryptology ePrint Archive, Paper 2022\/975 https:\/\/eprint.iacr.org\/2022\/975"},{"key":"5146_CR8","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: Peyrin T, Galbraith S (eds) Advances in cryptology - ASIACRYPT 2018. Lecture notes in computer science, vol 11274. Springer, Cham","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"5146_CR9","doi-asserted-by":"publisher","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. J Math Cryptol 8:209\u2013247","journal-title":"J Math Cryptol"},{"key":"5146_CR10","doi-asserted-by":"crossref","unstructured":"Ding J, Petzoldt A, Schmidt DS (2020) Multivariate Public Key Cryptosystems. Advances in Information Security 80 http:\/\/www.springer.com\/series\/5576","DOI":"10.1007\/978-1-0716-0987-3"},{"key":"5146_CR11","doi-asserted-by":"crossref","unstructured":"Dolgachev I (2003) Lectures on invariant theory. CUP","DOI":"10.1017\/CBO9780511615436"},{"issue":"8","key":"5146_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/3524455","volume":"65","author":"L Gyongyosi","year":"2022","unstructured":"Gyongyosi L, Imre S (2022) Advances in the quantum internet. Commun ACM 65(8):52\u201363","journal-title":"Commun ACM"},{"key":"5146_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cosrev.2018.11.002","volume":"31","author":"L Gyongyosi","year":"2019","unstructured":"Gyongyosi L, Imre S (2019) A Survey on quantum computing technology. Comput Sci Rev 31:51\u201371","journal-title":"Comput Sci Rev"},{"key":"5146_CR14","doi-asserted-by":"publisher","first-page":"5172","DOI":"10.1038\/s41598-020-76728-5","volume":"11","author":"L Gyongyosi","year":"2021","unstructured":"Gyongyosi L, Imre S (2021) Scalable distributed gate-model quantum computers. Sci Rep 11:5172","journal-title":"Sci Rep"},{"key":"5146_CR15","unstructured":"Hartshorne R (1997) Algebraic geometry. Springer https:\/\/link.springer.com\/book\/10.1007\/978-1-4757-3849-0"},{"key":"5146_CR16","unstructured":"Maino L, Martindale C (2022) An attack on SIDH with arbitrary starting curve. Cryptology ePrint Archive, Paper 2022\/1026 https:\/\/eprint.iacr.org\/2022\/1026"},{"key":"5146_CR17","unstructured":"Robert D (2022) Breaking SIDH in polynomial time. Cryptology ePrint Archive, Paper 2022\/1038 https:\/\/eprint.iacr.org\/2022\/1038"},{"key":"5146_CR18","unstructured":"Salmon G (1964) Higher Algebra, fifth ed., 1885, reprinted by Chelsea, New York. https:\/\/archive.org\/details\/lessonsintroduc00salmgoog\/page\/n210\/mode\/2up"},{"key":"5146_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38010-5","volume-title":"Basic algebraic geometry 1","author":"IR Shafarevich","year":"2013","unstructured":"Shafarevich IR (2013) Basic algebraic geometry 1, 3rd edn. Springer, New York","edition":"3"},{"key":"5146_CR20","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: Discrete logarithmsand factoring. In: Robshaw M, Katz J (eds) Foundations of ComputerScience, CONFERENCE 1994, Proceedings., 35th Annual Symposium, pp 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"key":"5146_CR21","doi-asserted-by":"crossref","unstructured":"Peng R, Vempala S (2021) Solving sparse linear systems faster than matrix multiplication. In: Proceedings of the 2021 ACM-SIAM symposium on discrete algorithms (SODA) 504-521 https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611976465.31","DOI":"10.1137\/1.9781611976465.31"},{"key":"5146_CR22","first-page":"113","volume":"22","author":"D Pera","year":"2018","unstructured":"Pera D (2018) Design and Performance Evaluation of a Linux HPC Cluster. Task Quarterly 22:113\u2013123","journal-title":"Task Quarterly"},{"key":"5146_CR23","unstructured":"The National Institute of Standards and Technology (NIST).PQC standardization process: second round candidate announcement. (2019)"},{"key":"5146_CR24","unstructured":"The National Institute of Standards and Technology (NIST). Submission requirements and evaluation criteria for the post-quantum cryptography standardization process (2016)"},{"key":"5146_CR25","unstructured":"Vakil R The rising sea - Foundations of Algebraic Geometry. http:\/\/math.stanford.edu\/~vakil\/216blog\/FOAGnov1817public.pdf"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05146-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05146-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05146-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T15:11:51Z","timestamp":1693408311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05146-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,28]]},"references-count":25,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["5146"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05146-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,28]]},"assertion":[{"value":"26 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}