The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Open accessAbstract
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main technical idea in our scheme is that we transmit the images of torsion bases under the isogeny in order to allow the parties to construct a shared commutative square despite the non-commutativity of the endomorphism ring. We give a precise formulation of the necessary computational assumptions along with a discussion of their validity, and prove the security of our protocols under these assumptions. In addition, we present implementation results showing that our protocols are multiple orders of magnitude faster than previous isogeny-based cryptosystems over ordinary curves. This paper is an extended version of [Lecture Notes in Comput. Sci. 7071, Springer (2011), 19–34]. We add a new zero-knowledge identification scheme and detailed security proofs for the protocols. We also present a new, asymptotically faster, algorithm for key generation, a thorough study of its optimization, and new experimental data.
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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 1×
“Computing R′ by a standard double-and-add approach requires half the effort of computing [m]P + [n]Q naively (see [13, 38, 1], though, for better ways of computing the latter).”
MethodKocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
The On-Line Encyclopedia of Integer Sequences
Sloane, N. J. A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73086-6_12 · Cited by 3,225
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
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,653
Goldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
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
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
Self-citationCryptographic 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
Zero knowledge proofs of identity
Fiege, U., Fiat, A., & Shamir, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28419 · Cited by 407
Bernstein, D. J., Birkner, P., Jóye, M., Lange, T., & Peters, C. (2008) · Springer eBooks · doi:10.1007/978-3-540-68164-9_26 · Cited by 364
A new identification scheme based on syndrome decoding
Stern, J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_2 · Cited by 353
Some Applications of Modular Forms
Sarnak, P. (1990) · Cambridge University Press eBooks · doi:10.1017/cbo9780511895593 · Cited by 285
Constructing elliptic curve isogenies in quantum subexponential time
Childs, A. M., Jao, D., & Soukharev, V. (2010) · Cited by 239
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 135
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 123
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
An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
Shamir, A. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_54 · Cited by 110
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
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
A New Identification Scheme Based on the Perceptrons Problem
Pointcheval, D. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_26 · Cited by 74
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-citationFull 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
Reductionist Security Arguments for Public-Key Cryptographic Schemes Based on Group Action
Stolbunov, A. (2009) · Cited by 14
On the Correspondence between Supersingular Elliptic Curves and maximal quaternionic OrdersPreprint
Cerviño, J. M. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0404538 · Cited by 7
Cited by
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
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 481
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 395
Fernandez-Carames, T. M. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2958788 · Cited by 317
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Metadata
- Authors
- De Feo, L., Jao, D., & Plût, J.
- Venue
- Journal of Mathematical Cryptology
- Publisher
- Walter de Gruyter GmbH
- Published
- 2014-06-11
- Volume
- 8
- Issue
- 3
- Pages
- 209-247
- ISSN
- 1862-2976 (ISSN-L)
- 1862-2984
- OpenAlex
- W1987475429
- Cited by
- 405
- References
- 31
- FWCI
- 13.53
- Type
- journal article
- 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.