The DOI matches its Crossref record, with a small difference in title or year; 26 of the 26 references it cites were found in a registry or an index.
Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“SIKE is a KEM based on isogenies of supersingular elliptic curves that follows and improves upon the construction known as Supersingular Isogeny Diffie-Hellman (SIDH) [72].”
From Status report on the fourth round of the NIST post-quantum cryptography standardization process (2025) · cites this paper as [72]
Citations
Cites
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
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_28 · Cited by 1,706
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,194
Endomorphisms of abelian varieties over finite fields
Tate, J. (1966) · Inventiones mathematicae · doi:10.1007/bf01404549 · Cited by 718
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 378
Rational Points on Elliptic Curves
Silverman, J. H., & Tate, J. (1992) · Undergraduate texts in mathematics · doi:10.1007/978-1-4757-4252-7 · Cited by 345
Constructing elliptic curve isogenies in quantum subexponential time
Childs, A. M., Jao, D., & Soukharev, V. (2010) · Cited by 238
Self-citationThe Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
Joux, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45455-1_3 · Cited by 232
Public-Key Cryptosystem Based on Isogenies.Preprint
Rostovtsev, A., & Stolbunov, A. (2006) · IACR Cryptology ePrint Archive · Cited by 202
Couveignes, J.-M. (2006) · Cited by 139
Stolbunov, A. (2010) · Advances in Mathematics of Communications · doi:10.3934/amc.2010.4.215 · Cited by 130
Extending the GHS Weil Descent Attack
Galbraith⋆, S. D., Heß, F., & Smart, N. P. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_3 · Cited by 129
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
Constructing Isogenies between Elliptic Curves Over Finite Fields
Galbraith⋆, S. D. (1999) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157000000097 · Cited by 106
Fast algorithms for computing isogenies between elliptic curves
Bostan, A., Morain, F., Salvy, B., & Schost, É. (2008) · Mathematics of Computation · doi:10.1090/s0025-5718-08-02066-8 · Cited by 84
Claw finding algorithms using quantum walk
Tani, S. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.08.030 · Cited by 79
The Case for Quantum Key Distribution
Stebila, D., Mosca, M., & Lütkenhaus, N. (2010) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-11731-2_35 · Cited by 78
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
Self-citationImproved algorithm for the isogeny problem for ordinary elliptic curves
Galbraith⋆, S. D., & Stolbunov, A. (2013) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-013-0185-0 · Cited by 46
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Petit, C., Lauter, K., & Quisquater, J.-J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85855-3_18 · Cited by 43
The Pohlig–Hellman Method Generalized for Group Structure Computation
Teske, E. (1999) · Journal of Symbolic Computation · doi:10.1006/jsco.1999.0279 · Cited by 33
Tricot, C. (1965) · L Actualité économique · doi:10.7202/1003060ar · Cited by 24
Promised and Distributed Quantum Search
Zhang, S. (2005) · Lecture notes in computer science · doi:10.1007/11533719_44 · Cited by 23
Reductionist Security Arguments for Public-Key Cryptographic Schemes Based on Group Action
Stolbunov, A. (2009) · Cited by 14
Constructing elliptic curve isogenies in quantum subexponential time
Childs, A. M., Jao, D., & Soukharev, V. (2010) · arXiv · doi:10.48550/arxiv.1012.4019
Self-citationImproved Algorithm for the Isogeny Problem for Ordinary Elliptic Curves
Galbraith, S., & Stolbunov, A. (2011) · arXiv · doi:10.48550/arxiv.1105.6331
Research works printed but not linked: 3
- Bröker, R.: Constructing supersingular elliptic curves. J. Comb. Number Theory 1(3), 269–273 (2009)
- Lagarias, J., Odlyzko, A.: Effective versions of the Chebotarev density theorem. In: Proc. Sympos. on Algebraic Number Fields: L-functions and Galois Properties, Univ. Durham, Durham, 1975, pp. 409–464. Academic Press, London (1977)
- Vélu, J.: Isogénies entre courbes elliptiques. C. R. Acad. Sci. Paris Sér. A-B 273, A238–A241 (1971)
Cited by
Sorted by citations
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
CSIDH: An Efficient Post-Quantum Commutative Group Action
Castryck, W., Lange, T., Martindale, C., Panny, L., & Renes, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03332-3_15 · Cited by 497
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D. A., Dang, Q. H., Dang, T., Kelsey, J. M., Lichtinger, J., Liu, Y.-K., Miller, C. A., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 492
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Feo, L. D., Jao, D., & Plût, J. (2014) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2012-0015 · Cited by 406
Self-citation
Metadata
- Authors
- Jao, D., & De Feo, L.
- Affiliations
- University of Waterloo (CA)
- Corresponding author
- Jao, David
- ORCID
- Jao, David
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Volume
- 7071
- Pages
- 19-34
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W43667552
- Cited by
- 634
- References
- 26
- Citations by year
- 2026: 27 · 2025: 61 · 2024: 58 · 2023: 73 · 2022: 75 · 2021: 93 · 2020: 82 · 2019: 62 · 2018: 40 · 2017: 33 · 2016: 10 · 2015: 4 · 2014: 8 · 2013: 2 · 2012: 4
- FWCI
- 3.84
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- HAL (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- post-quantum cryptography, supersingular elliptic curves, isogeny-based cryptography, public-key cryptosystems, shared key establishment, ordinary elliptic curves
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
