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
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
Items 401–500 of 632
Torsion point attacks on ‘SIDH‐like’ cryptosystems
Kutas, P., & Petit, C. (2022) · IET Information Security · doi:10.1049/ise2.12076 · Cited by 3
A High Performance SIKE Accelerator With High Frequency and Low Area-Time Product
Ni, Z., Kundi, D., O'Neill, M. P., & Liu, W. (2022) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2022.3181625 · Cited by 3
An Effective Lower Bound on the Number of Orientable Supersingular Elliptic Curves
Leroux, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58411-4_12 · Cited by 3
The security of all private-key bits in isogeny-based schemes
Shani, B. (2019) · Discrete Applied Mathematics · doi:10.1016/j.dam.2019.10.032 · Cited by 3
Parallel strategies for SIDH: Towards computing SIDH twice as fast
Cervantes-Vázquez, D., Ochoa‐Jiménez, E., & Rodríguez‐Henríquez, F. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3080139 · Cited by 3
On the Degree-Insensitive SI-GDH problem and assumption.Preprint
Dobson, S., & Galbraith⋆, S. D. (2019) · IACR Cryptology ePrint Archive · Cited by 3
A post-quantum key exchange protocol from the intersection of quadric surfacesPreprint
Tullio, D. D., & Gyawali, M. (2022) · Research Square · doi:10.21203/rs.3.rs-1920498/v1 · Cited by 3
Collusion Resistant Revocable Ring Signatures and Group Signatures from Hard Homogeneous Spaces.Preprint
Lai, Y.-F., & Dobson, S. (2021) · IACR Cryptology ePrint Archive · Cited by 3
Post-quantum security of messengers: secure group chats and continuous key distribution protocols
Bobrysheva, J., & Zapechnikov, S. V. (2022) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-022-00446-x · Cited by 2
A Lightweight Identification Protocol Based on Lattices
Düzlü, S., Krämer, J., Pöppelmann, T., & Struck, P. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-31368-4_4 · Cited by 2
A review of mathematical and computational aspects of CSIDH algorithms
Maino, L., Mula, M., & Pintore, F. (2023) · Journal of Algebra and Its Applications · doi:10.1142/s0219498825300028 · Cited by 2
Advancements in Isogeny-Based Cryptography: A Mathematical Approach to Post-Quantum Security
Soni, A., Singh, S., & Chaturvedi, A. (2025) · IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS) · doi:10.1109/sceecs64059.2025.10941237 · Cited by 2
A Survey of Post-Quantum Oblivious Protocols
Khutsaeva, A. F., Георгиевич, Л. А., & Bezzateev, S. V. (2025) · Cryptography · doi:10.3390/cryptography9040062 · Cited by 2
Strong Designated Verifier Signatures from Isogeny Assumptions
Khuc, X. T., Susilo, W., Duong, D. H., Li, Y., Roy, P. S., Fukushima, K., & Kiyomoto, S. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-4434-9_3 · Cited by 2
LIT-SiGamal: An Efficient Isogeny-Based PKE Based on a LIT Diagram
Moriya, T., & Stopar, M. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5113-2_9 · Cited by 2
More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials
den Hollander, T., Kleine, S., Mula, M., Slamanig, D., & Spindler, S. A. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01855-7_5 · Cited by 2
Quantencomputer und die Zukunft der Kryptographie
Fumy, W. (2016) · Datenschutz und Datensicherheit - DuD · doi:10.1007/s11623-017-0717-z · Cited by 2
Recent Developments in Cryptography
Beshaj, L., & Hall, A. O. (2020) · doi:10.23919/cycon49761.2020.9131714 · Cited by 2
Dutta, A., Hutchinson, A., & Karabina, K. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-65277-7_11 · Cited by 2
Algebraic approaches for solving isogeny problems of prime power degrees
Takahashi, Y., Kudo, M., Fukasaku, R., Ikematsu, Y., Yasuda, M., & Yokoyama, K. (2020) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2020-0072 · Cited by 2
Introduction to Security for Smart Grid Systems
Cali, Ü., Kuzlu, M., Pipattanasomporn, M., Kempf, J., & Bai, L. (2021) · Springer eBooks · doi:10.1007/978-3-030-83301-5_4 · Cited by 2
Enhanced Performance of Isogenies Over Huff Curve for Post Quantum Cryptography
(2023) · International journal of intelligent engineering and systems · doi:10.22266/ijies2023.1231.37 · Cited by 2
Isogeny-Based Multi-signature Scheme
de Goyon, M., & Miyaji, A. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-7032-2_28 · Cited by 2
Fortifying IoT Against Quantum Threats: Strategies for Securing Connected Devices in the Quantum Era
Rajpoot, S., Singh, P., Singh, P., Bahadur, P. S., & Dhama, A. (2023) · International Conference on Contemporary Computing and Informatics (IC3I) · doi:10.1109/ic3i59117.2023.10397666 · Cited by 2
On the Parallelization of Square-Root Vélu’s Formulas
Chávez-Saab, J., Ortega, O., & Pizarro-Madariaga, A. (2024) · Mathematical and Computational Applications · doi:10.3390/mca29010014 · Cited by 2
Multiplierless Design of High-Speed Very Large Constant Multiplications
Aksoy, L., Roy, D. B., Imran, M., & Pagliarini, S. (2024) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac58780.2024.10473954 · Cited by 2
Adaptive Attacks Against FESTA Without Input Validation or Constant-Time Implementation
Moriya, T., Onuki, H., Xu, M., & Zhou, G. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-62746-0_1 · Cited by 2
A clipping technique for shorter hash-based signatures
Zheng, A. Y. C. L., Ferraz, L. T. D., & Junior, M. A. S. (2018) · Simpósio Brasileiro de Cibersegurança (SBSeg) · doi:10.5753/sbseg.2018.4251 · Cited by 2
A note on (2,2)-isogenies via theta coordinates
Lin, J., Wang, S., & Zhao, C. (2024) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2024.102496 · Cited by 2
Al-Samhouri, M., Novas, N., Abur-rous, M., & Gazquez, J. A. (2024) · IntechOpen eBooks · doi:10.5772/intechopen.1005806 · Cited by 2
Enhanced Bound for the Commutative Isogeny Hidden Number Problem in CSURF
Sarkar, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-80311-6_10 · Cited by 2
Isogeny Interpolation and the Computation of Isogenies from Higher Dimensional Representations
Jao, D., & Laflamme, J. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-80311-6_8 · Cited by 2
Self-citationYoshizumi, R., Onuki, H., Ohashi, R., Kudo, M., & Nuida, K. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-86602-9_1 · Cited by 3
Li, J., & Zur, S. (2025) · Quantum · doi:10.22331/q-2025-05-06-1733 · Cited by 2
Enhancing Post-Quantum Cryptographic Protocols with Quantum-Resistant Key Exchange Mechanisms
Balakrishnan, G., Samudrala, A., Chanamala, S., Rajesh, S. B., & Naganathan, S. B. T. (2025) · doi:10.1109/iccsp64183.2025.11088727 · Cited by 2
Group Key Exchange Compilers from Generic Key Exchanges
Hougaard, H. B., & Miyaji, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92708-0_10 · Cited by 2
Bottasso, L. M. (2015) · International Conference on Security and Cryptography · doi:10.5220/0005511801940201 · Cited by 2
Commutativity, Associativity, and Public Key Cryptography
Patarin, J., & Nachef, V. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76620-1_7 · Cited by 2
Cryptanalysis of the CLR-cryptosystem
Micheli, G., & Weger, V. (2018) · Designs Codes and Cryptography · doi:10.1007/s10623-018-0500-7 · Cited by 2
Hard Isogeny Problems over RSA Moduli and Groups with Infeasible Inversion
Altuğ, S. A., & Chen, Y. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34621-8_11 · Cited by 2
CSURF-TWO: CSIDH for the Ratio (2 : 1)
Fan, X., Tian, S., Xu, X. P., & Li, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-71852-7_10 · Cited by 2
Isogeny Computation on Twisted Jacobi Intersections
Hu, Z. H., Wang, L., & Zhou, Z. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-93206-0_4 · Cited by 2
Efficient Elliptic Curve Operators for Jacobian Coordinates
Eid, W. N., Al-Somani, T. F., & Silaghi, M. C. (2022) · Electronics · doi:10.3390/electronics11193123 · Cited by 2
Basso, A. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3563542 · Cited by 2
Faster isogeny computation on twisted Hessian curves
Tao, Z., Hu, Z. H., & Zhou, Z. (2023) · Applied Mathematics and Computation · doi:10.1016/j.amc.2022.127823 · Cited by 2
Phalakarn, K., Suppakitpaisarn, V., Rodríguez‐Henríquez, F., & Hasan, M. A. (2023) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2023.i3.246-269 · Cited by 2
Radical isogenies and modular curves
Pribanić, V. (2023) · Advances in Mathematics of Communications · doi:10.3934/amc.2023019 · Cited by 2
High-Performance Elliptic Curve Cryptography: A SIMD Approach to Modern Curves
Faz-Hernández, A., & López, J. (2023) · doi:10.5753/ctd.2023.230156 · Cited by 2
Delegating Supersingular Isogenies over $$\mathbb {F}_{p^2}$$ with Cryptographic Applications
Pedersen, R., & Uzunkol, O. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08896-4_5 · Cited by 2
Authentication and key establishment protocol from supersingular isogeny for mobile environments
Qi, M., & Chen, J. (2021) · The Journal of Supercomputing · doi:10.1007/s11227-021-04121-8 · Cited by 2
Breaking the Unbreakable: Exploiting Loopholes in Bell’s Theorem to Hack Quantum Cryptography
Jogenfors, J. (2017) · doi:10.3384/diss.diva-140912 · Cited by 3
Quantum Cost Models for Cryptanalysis of Isogenies
Jaques, S. (2019) · UWSpace (University of Waterloo) · Cited by 2
qSCMS: post-quantum security credential management system for vehicular communications.
de Oliveira, J. E. R. F. (2019) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.3.2019.tde-17072019-135843 · Cited by 2
The supersingular isogeny problem in genus 2 and beyondPreprint
Costello, C., & Smith, B. (2019) · arXiv (Cornell University) · Cited by 2
Performance Analysis of TLS for Quantum Robust Cryptography on a Constrained DevicePreprint
Barton, J., Buchanan, W. J., Pitropakis, N., Sayeed, S., & Abramson, W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.12257 · Cited by 2
Improving post-quantum cryptography through cryptanalysis
Schanck, J. M. (2020) · UWSpace (University of Waterloo) · Cited by 2
DeCSIDH: Delegating Isogeny Computations in the CSIDH Setting
Pedersen, R. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92518-5_16 · Cited by 1
Isogeny-Based Group Key Establishment Scheme
Yarmak, A. V. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-19-7663-6_11 · Cited by 1
Технології постквантової криптографії
Новиков, Д., & Poltorak, V. (2023) · Адаптивні системи автоматичного управління · doi:10.20535/1560-8956.42.2023.279169 · Cited by 1
Singh, H., Shailendra, & Hasabnis, A. R. (2023) · International Conference on Intelligent Technologies (CONIT) · doi:10.1109/conit59222.2023.10205538 · Cited by 1
Recent Advances in the Index Calculus Method for Solving the ECDLP
Jindal, A., Jatain, A., & Bajaj, S. B. (2023) · Algorithms for intelligent systems · doi:10.1007/978-981-99-4626-6_23 · Cited by 1
Patient Zero & Patient Six: Zero-Value and Correlation Attacks on CSIDH and SIKE
Campos, F., Meyer, M. L., Reijnders, K., & Stöttinger, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58411-4_11 · Cited by 1
Explicit addition formulae on hyperelliptic curves of genus 2 for isogeny-based cryptography
Sato, K., Onuki, H., & Takagi, T. (2024) · JSIAM Letters · doi:10.14495/jsiaml.16.65 · Cited by 1
Performance and Efficiency Evaluation of M-SIDH
Kim, S. (2024) · IEEE Access · doi:10.1109/access.2024.3513405 · Cited by 1
p261: A Karatsuba-Friendly Prime for Fast Elliptic Curve Arithmetic
EĞRİCE, B., & Hışıl, H. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-83490-5_6 · Cited by 1
Commuting Ramanujan Graphs and the Random Self-reducibility of Isogeny Problems
Mokrani, Y., & Jao, D. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-86602-9_2 · Cited by 1
Self-citationDistribution of cycles in supersingular ℓ-isogeny graphs
Orvis, E. (2025) · Journal of Number Theory · doi:10.1016/j.jnt.2025.03.013 · Cited by 1
Side-channel Information Leakage with CPU Frequency Scaling, but without CPU Frequency
Zhu, L., & Wang, C. (2025) · ACM Workshop on Hot Topics in Storage and File Systems (HotStorage) · doi:10.1145/3736548.3737831 · Cited by 1
Reusable Fuzzy Extractor from Isogeny-Based Assumptions
Wen, Y., Jin, T., & Li, W. (2025) · Symmetry · doi:10.3390/sym17071065 · Cited by 1
Analysis of the applicability of existing secret separation schemes in the post-quaternary era
Kustov, E. F., & Bezzateev, S. V. (2025) · Scientific and technical journal of information technologies mechanics and optics · doi:10.17586/2226-1494-2025-25-3-446-456 · Cited by 1
Efficient Post-quantum Commutative Group Actions from Orientations of Large Discriminant
Houben, M. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5113-2_5 · Cited by 1
Deterministic Algorithms for Class Group Actions
Houben, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01855-7_4 · Cited by 1
The SQInstructor: a Guide to SQIsign and the Deuring Correspondence with Level Structures
Borin, G., Feo, L. D., Lido, G., & Schaeffler, S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35398-6_18 · Cited by 1
SQIsign2DPush: Faster Signature Scheme Using 2-Dimensional Isogenies
Nakagawa, K., & Onuki, H. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25327-9_18 · Cited by 1
Short Solutions to Nonlinear Systems of Equations
Szepieniec, A., & Bart Preneel, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76620-1_5 · Cited by 1
Simple oblivious transfer protocols compatible with Kummer and supersingular isogenies
Vitse, V. (2019) · HAL · doi:10.1007/978-3-030-23696-0_4 · Cited by 1
Optimal Strategies for Computation of Degree ℓn Isogenies for SIDH
Wroński, M., & Chojnacki, A. (2020) · International Journal of Electronics and Telecommunications · doi:10.24425/ijet.2020.131900 · Cited by 1
Speeding up CSIDH using parallel computation of isogeny
Kato, G., & Suzuki, K. (2020) · International Conference on Advanced Informatics: Concepts, Theory and Applications (ICAICTA) · doi:10.1109/icaicta49861.2020.9429062 · Cited by 1
Supersingular Isogeny-based Ring Signature
Garjan, M. S., KILIÇ, N. G. O., & Cenk, M. (2023) · International Journal of Information Security Science · doi:10.55859/ijiss.1187756 · Cited by 1
Provably secure post-quantum authenticated key exchange from supersingular isogenies
Qi, M., & Chen, J. (2022) · The Journal of Supercomputing · doi:10.1007/s11227-022-04378-7 · Cited by 3
Eom, S., Lee, H.-S., & Song, K. (2022) · Mathematical Problems in Engineering · doi:10.1155/2022/3846369 · Cited by 1
Efficient Loop Abort Fault Attacks on Supersingular Isogeny based Key Exchange (SIKE)
Beegala, P., Roy, D. B., Ravi, P., Bhasin, S., Chattopadhyay, A., & Mukhopadhyay, D. (2022) · Proceedings · doi:10.1109/dft56152.2022.9962359 · Cited by 1
Protecting the Most Significant Bits in Scalar Multiplication Algorithms
Bock, E. A., Chmielewski, Ł., & Miteloudi, K. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22829-2_7 · Cited by 1
Computing isogenies between finite Drinfeld modules
Wesolowski, B. (2024) · IACR Communications in Cryptology · doi:10.62056/avommp-3y · Cited by 1
An Attack on a Non-Interactive Key Exchange from Code Equivalence
Persichetti, E., Randrianarisoa, T. H., & Santini, P. (2022) · Tatra Mountains Mathematical Publications · doi:10.2478/tmmp-2022-0018 · Cited by 1
An isogeny-based quantum-resistant secret sharing scheme
Eslamia, K., & Bahramiana, M. (2022) · Filomat · doi:10.2298/fil2210249e · Cited by 1
Post-Quantum Anonymous One-Sided Authenticated Key Exchange without Random Oracles
Ishibashi, R., & Yoneyama, K. (2023) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2022dmp0001 · Cited by 1
A Hybrid Post-Quantum Cryptography Driven Key Exchange Scheme for Cloud Computing Environments
Ilias, S. M., & Sharmila, V. C. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-99-1726-6_40 · Cited by 1
A Polynomial-Time Attack on G2SIDH
Zhou, G., & Xu, M. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-7356-9_6 · Cited by 1
Lightweight Public Key Encryption in Post-Quantum Computing Era
Hillmann, P. (2023) · doi:10.5121/csit.2023.132101 · Cited by 1
Efficient Additions and Montgomery Reductions of Large Integers for SIMD
Ren, P., Suda, R., & Suppakitpaisarn, V. (2023) · IEEE Symposium on Computer Arithmetic (ARITH) · doi:10.1109/arith58626.2023.00034 · Cited by 1
Computing gluing and splitting $$(\ell ,\ell )$$-isogenies
Tian, S. (2024) · Designs Codes and Cryptography · doi:10.1007/s10623-024-01413-x · Cited by 1
A Faster Variant of CGL Hash Function via Efficient Backtracking Checks
Inoue, S., Aikawa, Y., & Takagi, T. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-75764-8_5 · Cited by 1
Recovery for secret key in CTIDH-512 through Fault Injection Attack
Kim, H., Im, W., Jeong, S., Kim, H., Seo, C., & Kang, C. (2025) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2024.110057 · Cited by 1
Sterner, B. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-82852-2_8 · Cited by 1
Reusable Fuzzy Extractor from Isogeny
Zhou, Y., Liu, S., & Han, S. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-0957-4_14 · Cited by 1
Diffie-Hellman type key exchange protocols based on isogenies
Daghigh, H., Gilan, R. K., & Shahpar, F. S. (2017) · Bulletin of the Iranian Mathematical Society. · Cited by 1
On the cryptographic properties of “Limonnik-3” AKE scheme
Grebnev, S. V. (2019) · Bezopasnost informacionnyh tehnology · doi:10.26583/bit.2019.2.01 · Cited by 1
Fouotsa, T. B., & Petit, C. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-95312-6_14 · Cited by 1
Bessalov, A. V., Tsygankova, O. V., & Abramov, S. (2021) · Radiotekhnika · doi:10.30837/rt.2021.4.207.03 · Cited by 1
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