CoChat
Sign Up
Cited by 634Cryptography and Residue ArithmeticCryptography and Data SecurityQuantum Information and Cryptography

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

Jao, David, De Feo, Luca·2011·Lecture Notes in Computer Science
DOI 10.1007/978-3-642-25405-5_2
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-642-25405-5_2

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 26 references

Research works printed but not linked: 3

  1. Bröker, R.: Constructing supersingular elliptic curves. J. Comb. Number Theory 1(3), 269–273 (2009)
  2. 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)
  3. 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

Items 601–632 of 632

Related

See all

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
DOI
10.1007/978-3-642-25405-5_2
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
Licence
www.springer.com/tdm (unspecified)
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