{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:19:00Z","timestamp":1775794740337,"version":"3.50.1"},"reference-count":23,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,3,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    In this note, we assess the efficiency of a supersingular isogeny Diffie-Hellman (SIDH)-based digital signature built on a\n                    <jats:italic>weaker<\/jats:italic>\n                    variant of a recent identification protocol proposed by Basso et al. Despite the devastating attacks against (the mathematical problem underlying) SIDH, this identification protocol remains secure, as its security is backed by a different (and more standard) isogeny-finding problem. We conduct our analysis by applying some known cryptographic techniques to decrease the signature size by about 70% for all parameter sets (obtaining signatures of approximately 21 kB for\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2023-0023_eq_001.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi mathvariant=\"sans-serif\">SIKE<\/m:mi>\n                          <m:mi mathvariant=\"sans-serif\">p<\/m:mi>\n                          <m:mn>434<\/m:mn>\n                        <\/m:math>\n                        <jats:tex-math>{\\mathsf{SIKE}}{\\mathsf{p}}434<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ). Moreover, we propose a minor optimisation to compute many isogenies in parallel from the same starting curve. Our assessment confirms that determining the most efficient methods for isogeny-based signature schemes, including optimisations such as those presented in this paper, is still a open problem, with much more work to be done.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2023-0023","type":"journal-article","created":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T11:38:45Z","timestamp":1709725125000},"source":"Crossref","is-referenced-by-count":6,"title":["Efficiency of SIDH-based signatures (yes, SIDH)"],"prefix":"10.1515","volume":"18","author":[{"given":"Wissam","family":"Ghantous","sequence":"first","affiliation":[{"name":"Mathematical Institute, University of Oxford , Oxford OX1 2JD , UK"}]},{"given":"Federico","family":"Pintore","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Bari , 70121 Bari BA , Italy"}]},{"given":"Mattia","family":"Veroni","sequence":"additional","affiliation":[{"name":"NTNU \u2013 Norwegian University of Science and Technology , Trondheim , Norway"}]}],"member":"374","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"2025120600265527791_j_jmc-2023-0023_ref_001","doi-asserted-by":"crossref","unstructured":"De Feo L, Kohel D, Leroux A, Petit C, Wesolowski B. SQISign: compact post-quantum signatures from quaternions and isogenies. International Conference on the Theory and Application of Cryptology and Information Security. 2020. Vol. 8. Issue 3; p. 64\u201393.","DOI":"10.1007\/978-3-030-64837-4_3"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_002","doi-asserted-by":"crossref","unstructured":"Feo LD, Leroux A, Longa P, Wesolowski B. New algorithms for the Deuring correspondence - towards practical and secure SQISign signatures. In: Hazay C, Stam M, editors. Advances in Cryptology - EUROCRYPT 2023 \u2013 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23\u201327, 2023, Proceedings, Part V. Vol. 14008 of Lecture Notes in Computer Science. Springer; 2023. p. 659\u201390. 10.1007\/978-3-031-30589-4_23.","DOI":"10.1007\/978-3-031-30589-4_23"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_003","doi-asserted-by":"crossref","unstructured":"De Feo L, Jao D, Pluuuut J. Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J Math Cryptol. 2014;8(3):209\u201347.","DOI":"10.1515\/jmc-2012-0015"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_004","unstructured":"Jao D, Azarderakhsh R, Campagna M, Costello C, De Feo L, Hess B, et al. SIKE. National Institute of Standards and Technology; 2017. \/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-1-submissions."},{"key":"2025120600265527791_j_jmc-2023-0023_ref_005","doi-asserted-by":"crossref","unstructured":"Galbraith SD, Petit C, Silva J. Identification protocols and signature schemes based on supersingular isogeny problems. J Cryptol. 2020;33(1):130\u201375.","DOI":"10.1007\/s00145-019-09316-0"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_006","doi-asserted-by":"crossref","unstructured":"Yoo Y, Azarderakhsh R, Jalali A, Jao D, Soukharev V. A post-quantum digital signature scheme based on supersingular isogenies. In: FC. Springer; 2017. p. 163\u201381.","DOI":"10.1007\/978-3-319-70972-7_9"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_007","doi-asserted-by":"crossref","unstructured":"Castryck W, Decru T. An efficient key recovery attack on\u00c2\u0103SIDH. In: Hazay C, Stam M, editors. Advances in cryptology - EUROCRYPT 2023. Cham: Springer Nature Switzerland; 2023. p. 423\u201347.","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_008","doi-asserted-by":"crossref","unstructured":"Maino L, Martindale C, Panny L, Pope G, Wesolowski B. A direct key recovery attack on SIDH. In: Hazay C, Stam M, editors. Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23\u201327, 2023, Proceedings, Part V. Vol. 14008 of Lecture Notes in Computer Science. Springer; 2023. p. 448\u201371. 10.1007\/978-3-031-30589-4_16.","DOI":"10.1007\/978-3-031-30589-4_16"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_009","doi-asserted-by":"crossref","unstructured":"Robert D. Breaking SIDH in polynomial time. In: Hazay C, Stam M, editors. Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23\u201327, 2023, Proceedings, Part V. Vol. 14008 of Lecture Notes in Computer Science. Springer; 2023. p. 472\u2013503. 10.1007\/978-3-031-30589-4_17.","DOI":"10.1007\/978-3-031-30589-4_17"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_010","doi-asserted-by":"crossref","unstructured":"De Feo L, Galbraith SD. SeaSign: compact isogeny signatures from class group actions. In: Ishai Y, Rijmen V, editors. Advances in Cryptology - EUROCRYPT 2019, Part III. Vol. 11478 of Lecture Notes in Computer Science. Darmstadt, Germany: Springer, Heidelberg, Germany; 2019. p. 759\u201389.","DOI":"10.1007\/978-3-030-17659-4_26"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_011","doi-asserted-by":"crossref","unstructured":"Beullens W, Kleinjung T, Vercauteren F. CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith SD, Moriai S, editors. Advances in Cryptology - ASIACRYPT 2019, Part I. Vol. 11921 of Lecture Notes in Computer Science. Kobe, Japan: Springer, Heidelberg, Germany; 2019. p. 227\u201347.","DOI":"10.1007\/978-3-030-34578-5_9"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_012","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez-Saab J, Chi-Domiiiinguez JJ, Jaques S, Rodr\u00edguez-Henr\u00edquez F. The SQALE of CSIDH: sublinear V\u00e9lu quantum-resistant isogeny action with low exponents. J Cryptograph Eng. 2022 Sep;12(3):349\u201368.","DOI":"10.1007\/s13389-021-00271-w"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_013","doi-asserted-by":"crossref","unstructured":"Feo LD, Dobson S, Galbraith SD, Zobernig L. SIDH proof of knowledge. In: Agrawal S, Lin D, editors. Advances in Cryptology - ASIACRYPT 2022 \u2013 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5\u20139, 2022, Proceedings, Part II. Vol. 13792 of Lecture Notes in Computer Science. Springer; 2022. p. 310\u201339. 10.1007\/978-3-031-22966-4_11.","DOI":"10.1007\/978-3-031-22966-4_11"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_014","doi-asserted-by":"crossref","unstructured":"Basso A, Codogni G, Connolly D, Feo LD, Fouotsa TB, Lido GM, et al. Supersingular curves you can trust. In: Hazay C, Stam M, editors. Advances in Cryptology - EUROCRYPT 2023 \u2013 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23\u201327, 2023, Proceedings, Part II. Vol. 14005 of Lecture Notes in Computer Science. Springer; 2023. p. 405\u201337. 10.1007\/978-3-031-30617-4_14.","DOI":"10.1007\/978-3-031-30617-4_14"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_015","unstructured":"Chi-Dom\u00ednguez JJ. A Note on Constructing SIDH-PoK-based Signatures after Castryck-Decru Attack; 2022. \/\/eprint.iacr.org\/2022\/1479. Cryptology ePrint Archive, Paper 2022\/1479. \/\/eprint.iacr.org\/2022\/1479."},{"key":"2025120600265527791_j_jmc-2023-0023_ref_016","doi-asserted-by":"crossref","unstructured":"Beullens W, Katsumata S, Pintore F. Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices. In: International Conference on the Theory and Application of Cryptology and Information Security; 2020. p. 464\u201392.","DOI":"10.1007\/978-3-030-64834-3_16"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_017","unstructured":"Chi-DomA\u03b7nguez JJ, Mateu V, Perin LP. SIDH-sign: an efficient SIDH PoK-based signature; 2022. \/\/eprint.iacr.org\/2022\/475. Cryptology ePrint Archive, Paper 2022\/475. \/\/eprint.iacr.org\/2022\/475."},{"key":"2025120600265527791_j_jmc-2023-0023_ref_018","doi-asserted-by":"crossref","unstructured":"Fiat A, Shamir A. How to prove yourself: practical solutions to identification and signature problems. In: Advances in Cryptology - CRYPTO \u201986, Santa Barbara, California, USA, 1986, Proceedings. Vol. 263 of Lecture Notes in Computer Science. Springer; 1986. p. 186\u201394.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_019","doi-asserted-by":"crossref","unstructured":"Silverman JH. The arithmetic of elliptic curves. Vol. 106. New York: Springer; 2009.","DOI":"10.1007\/978-0-387-09494-6"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_020","doi-asserted-by":"crossref","unstructured":"Galbraith SD. Mathematics of public key cryptography. Cambridge, UK: Cambridge University Press; 2012. \/\/books.google.no\/books?id=owd76BElvosC.","DOI":"10.1017\/CBO9781139012843"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_021","doi-asserted-by":"crossref","unstructured":"Costello C, Longa P, Naehrig M. Efficient algorithms for supersingular isogeny Diffie-Hellman. In: Robshaw M, Katz J, editors. Advances in Cryptology - CRYPTO 2016, Part I. Vol. 9814 of Lecture Notes in Computer Science. Santa Barbara, CA, USA: Springer, Heidelberg, Germany; 2016. p. 572\u2013601.","DOI":"10.1007\/978-3-662-53018-4_21"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_022","doi-asserted-by":"crossref","unstructured":"Azarderakhsh R, Jao D, Kalach K, Koziel B, Leonardi C. Key compression for isogeny-based cryptosystems. In: Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography; 2016. p. 1\u201310.","DOI":"10.1145\/2898420.2898421"},{"key":"2025120600265527791_j_jmc-2023-0023_ref_023","unstructured":"Azarderakhsh R, Campagna M, Costello C, De Feo L, Hess B, Jalali A, et al. Supersingular isogeny key encapsulation november 30, 2017. Third Round Candidate of the NIST\u2019s post-quantum cryptography standardization process; 2020. \/\/sikeorg\/."}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0023\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0023\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:27:04Z","timestamp":1764980824000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0023\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,1]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,3,6]]},"published-print":{"date-parts":[[2024,3,6]]}},"alternative-id":["10.1515\/jmc-2023-0023"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2023-0023","relation":{},"ISSN":["1862-2984"],"issn-type":[{"value":"1862-2984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,1]]},"article-number":"20230023"}}