The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
CSIDH: An Efficient Post-Quantum Commutative Group Action
Open accessAbstract
We propose an efficient commutative group action suitable for non-interactive key exchange in a post-quantum setting. Our construction follows the layout of the Couveignes–Rostovtsev–Stolbunov cryptosystem, but we apply it to supersingular elliptic curves defined over a large prime field $$\mathbb F_p$$ , rather than to ordinary elliptic curves. The Diffie–Hellman scheme resulting from the group action allows for public-key validation at very little cost, runs reasonably fast in practice, and has public keys of only 64 bytes at a conjectured AES-128 security level, matching NIST’s post-quantum security category I.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
The Arithmetic of Elliptic Curves
Silverman, J. H. (1986) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1920-8 · Cited by 4,044
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
The Arithmetic of Elliptic Curves
Silverman, J. H. (2009) · Graduate texts in mathematics · doi:10.1007/978-0-387-09494-6 · Cited by 2,233
Speeding the Pollard and elliptic curve methods of factorization
Montgomery, P. L. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866113-7 · Cited by 1,218
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
Endomorphisms of abelian varieties over finite fields
Tate, J. (1966) · Inventiones mathematicae · doi:10.1007/bf01404549 · Cited by 718
Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
Jao, D., & De Feo, L. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5_2 · Cited by 634
Class number, a theory of factorization, and genera
Shanks, D. (1971) · Proceedings of Symposia in Pure Mathematics · doi:10.1090/pspum/020/0316385 · Cited by 518
Cryptographic Hash Functions from Expander Graphs
Charles, D. X., Lauter, K., & Goren, E. Z. (2007) · Journal of Cryptology · doi:10.1007/s00145-007-9002-x · Cited by 485
A Modular Analysis of the Fujisaki-Okamoto Transformation
Hofheinz, D., Hövelmanns, K., & Kiltz, E. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70500-2_12 · Cited by 451
Comptes Rendus de l'Académie des Sciences de Paris
Massip, A., Wouters-Ballman, P., Beckers, J., & Ectors, F. (1977) · Cited by 451
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
De Feo, L., Jao, D., & Plût, J. (2014) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2012-0015 · Cited by 405
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
Kuperberg, G. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539703436345 · Cited by 347
Über die Classenzahl quadratischer Zahlkörper
Siegel, C. (1935) · Acta Arithmetica · doi:10.4064/aa-1-1-83-86 · Cited by 276
Nonsingular plane cubic curves over finite fields
Schoof, R. (1987) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(87)90003-3 · Cited by 268
Constructing elliptic curve isogenies in quantum subexponential time
Childs, A. M., Jao, D., & Soukharev, V. (2010) · Cited by 239
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
Costello, C., Longa, P., & Naehrig, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53018-4_21 · Cited by 230
Public-Key Cryptosystem Based on Isogenies.Preprint
Rostovtsev, A., & Stolbunov, A. (2006) · IACR Cryptology ePrint Archive · Cited by 202
Constructing elliptic curve isogenies in quantum subexponential time
Childs, A., Jao, D., & Soukharev, V. (2014) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2012-0016 · Cited by 200
On the Security of Supersingular Isogeny Cryptosystems
Galbraith⋆, S. D., Petit, C., Shani, B., & Ti, Y. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53887-6_3 · Cited by 189
A Rigorous Subexponential Algorithm For Computation of Class Groups
Hafner, J. L., & McCurley, K. S. (1989) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1989-1002631-0 · Cited by 175
A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial SpacePreprint
Regev, O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0406151 · Cited by 167
Unruh, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_10 · Cited by 151
Couveignes, J.-M. (2006) · Cited by 139
Stolbunov, A. (2010) · Advances in Mathematics of Communications · doi:10.3934/amc.2010.4.215 · Cited by 135
Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
Kuperberg, G. (2013) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2013.20 · Cited by 131
Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$ F p
Delfs, C., & Galbraith⋆, S. D. (2014) · Designs Codes and Cryptography · doi:10.1007/s10623-014-0010-1 · Cited by 129
Freire, E. S. V., Hofheinz, D., Kiltz, E., & Paterson, K. G. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36362-7_17 · Cited by 125
A Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies
Costello, C., & Hışıl, H. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70697-9_11 · Cited by 125
Ramanujan graphs and Hecke operators
Pizer, A. K. (1990) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1990-15918-x · Cited by 120
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
Galbraith⋆, S. D., Petit, C., & Silva, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70694-8_1 · Cited by 117
Constructing Isogenies between Elliptic Curves Over Finite Fields
Galbraith⋆, S. D. (1999) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157000000097 · Cited by 110
Montgomery curves and their arithmetic: The case of large characteristic fields
Costello, C., & Smith, B. (2017) · Journal of Cryptographic Engineering · doi:10.1007/s13389-017-0157-6 · Cited by 106
Mathematics of Isogeny Based CryptographyPreprint
Feo, L. D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.04062 · Cited by 106
A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
Biasse, J., Jao, D., & Sankar, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13039-2_25 · Cited by 99
A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
Yoo, Y., Azarderakhsh, R., Jalali, A., Jao, D., & Soukharev, V. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70972-7_9 · Cited by 98
Faster Algorithms for Isogeny Problems Using Torsion Point Images
Petit, C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70697-9_12 · Cited by 93
On the Cost of Computing Isogenies Between Supersingular Elliptic Curves
Adj, G., Cervantes-Vázquez, D., Chi-Domínguez, J.-J., Menezes, A., & Rodríguez‐Henríquez, F. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-10970-7_15 · Cited by 89
Fast quantum algorithms for computing the unit group and class group of a number field
Hallgren, S. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060660 · Cited by 80
Towards Practical Key Exchange from Ordinary Isogeny Graphs
Feo, L. D., Kieffer, J., & Smith, B. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03332-3_14 · Cited by 73
Hasse, H. (1936) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1936.175.193 · Cited by 71
Brassard, G., & Yung, M. M. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_7 · Cited by 67
Expander graphs based on GRH with an application to elliptic curve cryptography
Jao, D., Miller, S. D., & Venkatesan, R. (2009) · Journal of Number Theory · doi:10.1016/j.jnt.2008.11.006 · Cited by 61
Computational problems in supersingular elliptic curve isogenies
Galbraith⋆, S. D., & Vercauteren, F. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2023-6 · Cited by 61
TweetNaCl: A Crypto Library in 100 Tweets
Bernstein, D. J., van Gastel, B., Janssen, W. A. M., Lange, T., Schwabe, P., & Smetsers, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16295-9_4 · Cited by 54
Self-citationComputing Isogenies Between Montgomery Curves Using the Action of (0, 0)
Renes, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_11 · Cited by 52
Self-citationSutherland, A. V. (2013) · The Open Book Series · doi:10.2140/obs.2013.1.507 · Cited by 50
A 𝑝-adic algorithm to compute the Hilbert class polynomial
Bröker, R. (2008) · Mathematics of Computation · doi:10.1090/s0025-5718-08-02091-7 · Cited by 35
Cryptographic Schemes Based on Isogenies
Stolbunov, A. (2012) · BIBSYS Brage (BIBSYS (Norway)) · doi:10.13140/rg.2.2.20826.44488 · Cited by 33
Identifying supersingular elliptic curves
Sutherland, A. V. (2012) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157012001106 · Cited by 31
A Note on the Security of CSIDH
Biasse, J., Iezzi, A., & Jacobson, M. J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-05378-9_9 · Cited by 24
Efficient CM-constructions of elliptic curves over finite fields
Bröker, R., & Stevenhagen, P. (2007) · Mathematics of Computation · doi:10.1090/s0025-5718-07-01980-1 · Cited by 17
Cited by
An Efficient Key Recovery Attack on SIDH
Castryck, W., & Decru, T. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-30589-4_15 · Cited by 281
Self-citationHülsing, A., Ning, K.-C., Schwabe, P., Weber, F. J., & Zimmermann, P. R. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00030 · Cited by 75
“The only somewhat practical post-quantum non-interactive key exchange is CSIDH [13], which is both very young and rather inefficient.”
BackgroundA Polynomial Time Attack on Instances of M-SIDH and FESTA
Castryck, W., & Vercauteren, F. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-981-99-8739-9_5 · Cited by 17
Self-citationPost-quantum XML and SAML Single Sign-On
Müller, J., & Oupický, J. (2024) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2024-0128 · Cited by 2
“Although there are newer constructions such as CSIDH [18], SQISign [23], or MAYO [10], they need further evaluation.”
Method
Metadata
- Authors
- Castryck, W., Lange, T., Martindale, C., Panny, L., & Renes, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2018
- Pages
- 395-427
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2811492100
- Cited by
- 481
- References
- 56
- FWCI
- 26.71
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.