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

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.

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?

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-citation
The 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
Hard Homogeneous Spaces
Couveignes, J.-M. (2006) · Cited by 139

Show all 26 references

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)

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
Post-quantum cryptography
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
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 315
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
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D., & Zaverucha, G. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3133997 · Cited by 273
A Survey of Important Issues in Quantum Computing and Communications
Yang, Z., Zolanvari, M., & Jain, R. K. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3254481 · Cited by 273
CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations
Beullens, W., Kleinjung, T., & Vercauteren, F. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34578-5_9 · Cited by 251
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 234
SQISign: Compact Post-quantum Signatures from Quaternions and Isogenies
Feo, L. D., Kohel, D., Leroux, A., Petit, C., & Wesolowski, B. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4_3 · Cited by 205
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
Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic Curves
Koziel, B., Azarderakhsh, R., Kermani, M. M., & Jao, D. (2016) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2016.2611561 · Cited by 191
Self-citation
Breaking SIDH in Polynomial Time
Robert, D. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30589-4_17 · Cited by 172
Fast Strategies for the Implementation of SIKE Round 3 on ARM Cortex-M4
Anastasova, M., Azarderakhsh, R., & Kermani, M. M. (2021) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2021.3096916 · Cited by 165
SeaSign: Compact Isogeny Signatures from Class Group Actions
Feo, L. D., & Galbraith⋆, S. D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17659-4_26 · Cited by 161
A Direct Key Recovery Attack on SIDH
Maino, L., Martindale, C., Panny, L., Pope, G., & Wesolowski, B. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30589-4_16 · Cited by 146
Elliptic Curve Lightweight Cryptography: A Survey
Lara-Nino, C. A., Díaz-Pérez, A., & Morales‐Sandoval, M. (2018) · IEEE Access · doi:10.1109/access.2018.2881444 · Cited by 135
Faster computation of isogenies of large prime degree
Bernstein, D. J., Feo, L. D., Leroux, A., & Smith, B. (2020) · The Open Book Series · doi:10.2140/obs.2020.4.39 · Cited by 133
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
Status report on the fourth round of the NIST post-quantum cryptography standardization process
Alagic, G., Bros, M., Ciadoux, P., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., et al. (2025) · doi:10.6028/nist.ir.8545 · Cited by 211
He Gives C-Sieves on the CSIDH
Peikert, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45724-2_16 · Cited by 147
Cryptographic Group Actions and Applications
Alamati, N., Feo, L. D., Montgomery, H. W., & Patranabis, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_14 · Cited by 139
Privacy-Aware Blockchain Innovation for 6G: Challenges and Opportunities
Nguyen, T., Tran, N. H., Lovén, L., Partala, J., Kechadi, T., & Pirttikangas, S. (2020) · Joint European Conference on Networks and Communications & 6G Summit (EuCNC/6G Summit) · doi:10.1109/6gsummit49458.2020.9083832 · Cited by 127
A Survey and Comparison of Post-Quantum and Quantum Blockchains
Yang, Z., Alfauri, H., Farkiani, B., Jain, R. K., Pietro, R. D., & Erbad, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3325761 · Cited by 150
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 121
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
Supersingular Isogeny Diffie-Hellman Key Exchange on 64-Bit ARM
Jalali, A., Azarderakhsh, R., Kermani, M. M., & Jao, D. (2017) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2723891 · Cited by 119
Self-citation
Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions
Eisenträger, K., Hallgren, S., Lauter, K., Morrison, T., & Petit, C. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78372-7_11 · Cited by 113
Verifiable Delay Functions from Supersingular Isogenies and Pairings
Feo, L. D., Masson, S., Petit, C., & Sanso, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34578-5_10 · Cited by 112
A High-Performance and Scalable Hardware Architecture for Isogeny-Based Cryptography
Koziel, B., Azarderakhsh, R., & Kermani, M. M. (2018) · IEEE Transactions on Computers · doi:10.1109/tc.2018.2815605 · Cited by 111
Post-Quantum Era Privacy Protection for Intelligent Infrastructures
Malina, L., Dzurenda, P., Ricci, S., Hajny, J., Srivastava, G., Matulevicius, R., Affia, A.-A. O., Laurent, M., Sultan, N. H., & Tang, Q. (2021) · IEEE Access · doi:10.1109/access.2021.3062201 · Cited by 111
Information security in the post quantum era for 5G and beyond networks: Threats to existing cryptography, and post-quantum cryptography
Chamola, V., Jolfaei, A., Chanana, V., Parashari, P., & Hassija, V. (2021) · Computer Communications · doi:10.1016/j.comcom.2021.05.019 · Cited by 117
Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs
Ueno, R., Xagawa, K., Tanaka, Y., Ito, A., Takahashi, J., & Homma, N. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i1.296-322 · Cited by 107
Safeguarding Next-Generation Multiple Access Using Physical Layer Security Techniques: A Tutorial
Lv, L., Xu, D., Hu, R. Q., Ye, Y., Yang, L. X., Lei, X., Wang, X., Kim, D. I., & Nallanathan, A. (2024) · Proceedings of the IEEE · doi:10.1109/jproc.2024.3420127 · Cited by 110
Efficient Compression of SIDH Public Keys
Costello, C., Jao, D., Longa, P., Naehrig, M., Renes, J., & Urbanik, D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_24 · Cited by 104
Self-citation
High-speed Instruction-set Coprocessor for Lattice-based Key Encapsulation Mechanism: Saber in Hardware
Roy, S. S., & Basso, A. (2020) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2020.i4.443-466 · Cited by 107
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
Self-citation
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
NEON-SIDH: Efficient Implementation of Supersingular Isogeny Diffie-Hellman Key Exchange Protocol on ARM
Koziel, B., Jalali, A., Azarderakhsh, R., Jao, D., & Kermani, M. M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-48965-0_6 · Cited by 88
Self-citation
Post-Quantum Cryptoprocessors Optimized for Edge and Resource-Constrained Devices in IoT
Ebrahimi, S., Bayat-Sarmadi, S., & Mosanaei-Boorani, H. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2903082 · Cited by 93
Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE
Jaques, S., & Schanck, J. M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26948-7_2 · Cited by 87
NIST Post-Quantum Cryptography- A Hardware Evaluation Study.Preprint
Basu, K., Soni, D., Nabeel, M., & Karri, R. (2019) · IACR Cryptology ePrint Archive · Cited by 87
Post-Quantum Security: Opportunities and Challenges
Li, S., Chen, Y., Chen, L., Liao, J., Kuang, C., Li, K., Liang, W., & Xiong, N. N. (2023) · Sensors · doi:10.3390/s23218744 · Cited by 105
A Faster Software Implementation of the Supersingular Isogeny Diffie-Hellman Key Exchange Protocol
Faz-Hernández, A., López, J., Ochoa‐Jiménez, E., & Rodríguez‐Henríquez, F. (2017) · IEEE Transactions on Computers · doi:10.1109/tc.2017.2771535 · Cited by 84
SIKE’d Up: Fast Hardware Architectures for Supersingular Isogeny Key Encapsulation
Koziel, B., Ackie, A.-B., Khatib, R. E., Azarderakhsh, R., & Kermani, M. M. (2020) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2020.2992747 · Cited by 80
Cryptographic Engineering a Fast and Efficient SIKE in FPGA
Khatib, R. E., Koziel, B., Azarderakhsh, R., & Kermani, M. M. (2023) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3584919 · Cited by 81
Will quantum computers be the end of public key encryption?
Buchanan, W. J., & Woodward, A. (2016) · Journal of Cyber Security Technology · doi:10.1080/23742917.2016.1226650 · Cited by 78
Securing the future: exploring post-quantum cryptography for authentication and user privacy in IoT devices
Mansoor, K., Afzal, M., Iqbal, W., & Abbas, Y. (2024) · Cluster Computing · doi:10.1007/s10586-024-04799-4 · Cited by 85
Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of Isogenies
Bernstein, D. J., Lange, T., Martindale, C., & Panny, L. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17656-3_15 · Cited by 82
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
SQIsignHD: New Dimensions in Cryptography
Dartois, P., Leroux, A., Robert, D., & Wesolowski, B. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58716-0_1 · Cited by 73
Analogues of Vélu’s formulas for isogenies on alternate models of elliptic curves
Moody, D., & Shumow, D. (2015) · Mathematics of Computation · doi:10.1090/mcom/3036 · Cited by 72
Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions
Balamurugan, C., Singh, K., Ganesan, G., & Rajarajan, M. (2021) · Cryptography · doi:10.3390/cryptography5040038 · Cited by 89
A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography
Borges, F., Reis, P. R., & Pereira, D. A. B. (2020) · IEEE Access · doi:10.1109/access.2020.3013250 · Cited by 76
Post Quantum Cryptography(PQC) - An overview: (Invited Paper)
Kumar, M., & Pattnaik, P. (2020) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec43674.2020.9286147 · Cited by 79
Threshold Schemes from Isogeny Assumptions
Feo, L. D., & Meyer, M. L. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45388-6_7 · Cited by 63
The supersingular isogeny path and endomorphism ring problems are equivalent
Wesolowski, B. (2022) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs52979.2021.00109 · Cited by 63
B-SIDH: Supersingular Isogeny Diffie-Hellman Using Twisted Torsion
Costello, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_15 · Cited by 62
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
del Moral, J. O., iOlius, A. D., Vidal, G., Crespo, P. M., & Martínez, J. E. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3410702 · Cited by 76
Post‐quantum cryptography techniques for secure communication in resource‐constrained Internet of Things devices: A comprehensive survey
Kumari, S., Singh, M., Singh, R., & Tewari, H. (2022) · Software Practice and Experience · doi:10.1002/spe.3121 · Cited by 58
M-SIDH and MD-SIDH: Countering SIDH Attacks by Masking Information
Fouotsa, T. B., Moriya, T., & Petit, C. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30589-4_10 · Cited by 54
Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA
Koziel, B., Azarderakhsh, R., & Kermani, M. M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-49890-4_11 · Cited by 53
Fault-Injection Attacks Against NIST’s Post-Quantum Cryptography Round 3 KEM Candidates
Xagawa, K., Ito, A., Ueno, R., Takahashi, J., & Homma, N. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92075-3_2 · Cited by 59
Stronger and Faster Side-Channel Protections for CSIDHPreprint
Cervantes-V\'azquez, D., Chenu, M., Chi-Dom\'inguez, J.-J., Feo, L. D., Rodríguez‐Henríquez, F., & Smith, B. (2019) · arXiv (Cornell University) · Cited by 53
Isogeny-Based Quantum-Resistant Undeniable Signatures
Jao, D., & Soukharev, V. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_10 · Cited by 54
Self-citation
Computing 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
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
Delay Encryption
Burdges, J., & Feo, L. D. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77870-5_11 · Cited by 51
SQIsign2D–West
Basso, A., Dartois, P., Feo, L. D., Leroux, A., Maino, L., Pope, G., Robert, D., & Wesolowski, B. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0891-1_11 · Cited by 51
Efficient Word Size Modular Arithmetic
Plantard, T. (2021) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2021.3073475 · Cited by 56
Supersingular Curves You Can Trust
Basso, A., Codogni, G., Connolly, D., Feo, L. D., Fouotsa, T. B., Lido, G., Morrison, T., Panny, L., Patranabis, S., & Wesolowski, B. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30617-4_14 · Cited by 50
On oriented supersingular elliptic curves
Onuki, H. (2020) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2020.101777 · Cited by 50
Towards Optimized and Constant-Time CSIDH on Embedded Devices
Jalali, A., Azarderakhsh, R., Kermani, M. M., & Jao, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-16350-1_12 · Cited by 49
Self-citation
Fault Attack on Supersingular Isogeny Cryptosystems
Ti, Y. B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_7 · Cited by 48
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
Galbraith⋆, S. D., Petit, C., & Silva, J. (2019) · Journal of Cryptology · doi:10.1007/s00145-019-09316-0 · Cited by 48
Rational Isogenies from Irrational Endomorphisms
Castryck, W., Panny, L., & Vercauteren, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45724-2_18 · Cited by 47
Quantum Cryptography for Enhanced Network Security: A Comprehensive Survey of Research, Developments, and Future Directions
Akter, M. S., Rodriguez-Cardenas, J., Shahriar, H., Cuzzocrea, A., & Wu, F. (2023) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata59044.2023.10386889 · Cited by 46
Loop-Abort Faults on Supersingular Isogeny Cryptosystems
Gélin, A., & Wesolowski, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_6 · Cited by 45
Compact, Efficient and UC-Secure Isogeny-Based Oblivious Transfer
Lai, Y.-F., Galbraith⋆, S. D., & Guilhem, C. D. D. S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77870-5_8 · Cited by 45
Mathematics of Isogeny Based CryptographyPreprint
Feo, L. D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.04062 · Cited by 106
Towards security recommendations for public-key infrastructures for production environments in the post-quantum era
Yunakovsky, S. E., Kot, M., Pozhar, N. O., Nabokov, D., Kudinov, M., Guglya, A. P., Kiktenko, E. O., Kolycheva, E., Borisov, A., & Fedorov, A. K. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00104-z · Cited by 48
Supersingular Isogeny Key Encapsulation (SIKE) Round 2 on ARM Cortex-M4
Seo, H., Anastasova, M., Jalali, A., & Azarderakhsh, R. (2020) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3023045 · Cited by 42
Post-quantum distributed ledger technology: a systematic survey
Parida, N. K., Jatoth, C., Reddy, V. D., Hussain, M. M., & Faizi, J. (2023) · Scientific Reports · doi:10.1038/s41598-023-47331-1 · Cited by 52
SQIsign2D-East: A New Signature Scheme Using 2-Dimensional Isogenies
Nakagawa, K., Onuki, H., Castryck, W., Chen, M., Invernizzi, R., Lorenzon, G., & Vercauteren, F. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0891-1_9 · Cited by 41
(Short Paper) A Faster Constant-Time Algorithm of CSIDH Keeping Two Points
Onuki, H., Aikawa, Y., Yamazaki, T., & Takagi, T. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26834-3_2 · Cited by 41
SiGamal: A Supersingular Isogeny-Based PKE and Its Application to a PRF
Moriya, T., Onuki, H., & Takagi, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_19 · Cited by 41
Efficient Elliptic Curve Diffie–Hellman Key Exchange for Resource-Constrained IoT Devices
Tanksale, V. (2024) · Electronics · doi:10.3390/electronics13183631 · Cited by 48
Hash functions from superspecial genus-2 curves using Richelot isogenies
Castryck, W., Decru, T., & Smith, B. (2020) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2019-0021 · Cited by 40
Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
Eisenträger, K., Hallgren, S., Leonardi, C., Morrison, T., & Park, J. (2020) · The Open Book Series · doi:10.2140/obs.2020.4.215 · Cited by 40
CTIDH: faster constant-time CSIDH
Banegas, G., Bernstein, D. J., Campos, F., Chou, T., Lange, T., Meyer, M. L., Smith, B., & Sotáková, J. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i4.351-387 · Cited by 40
Post-quantum Asynchronous Deniable Key Exchange and the Signal Handshake
Brendel, J., Fiedler, R., Günther, F., Janson, C., & Stebila, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97131-1_1 · Cited by 41
Séta: Supersingular Encryption from Torsion Attacks
Feo, L. D., Guilhem, C. D. D. S., Fouotsa, T. B., Kutas, P., Leroux, A., Petit, C., Silva, J., & Wesolowski, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92068-5_9 · Cited by 39
SIDH on ARM: Faster Modular Multiplications for Faster Post-Quantum Supersingular Isogeny Key Exchange
Seo, H., Liu, Z., Longa, P., & Hu, Z. H. (2018) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2018.i3.1-20 · Cited by 39
QFESTA: Efficient Algorithms and Parameters for FESTA Using Quaternion Algebras
Nakagawa, K., & Onuki, H. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68388-6_4 · Cited by 38
Improved Strongly Deniable Authenticated Key Exchanges for Secure Messaging
Unger, N., & Goldberg, I. (2018) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2018-0003 · Cited by 40
Area and power efficient post-quantum cryptosystem for IoT resource-constrained devices
Shahbazi, K., & Ko, S. (2021) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2021.104280 · Cited by 39
Power Analysis on NTRU Prime
Huang, W., Chen, J.-P., & Yang, B. (2019) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2020.i1.123-151 · Cited by 40

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

Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Citations

Cites

Cited by

Related

Metadata

Record

About these checks