Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IT Professional

Isogeny-Based Cryptography: A Promising Post-Quantum Technique

Cong Peng, Jianhua Chen, Sherali Zeadally, Debiao He

Published Nov 1, 2019• 27 citations
Publisher

Abstract

Recent advances in quantum computing have made existing public key cryptosystems vulnerable to enormous security threats. Therefore, numerous efforts have been exploring post-quantum cryptographic techniques to address the emergence of quantum computing. We focus on one promising post-quantum cryptography known as “isogeny-based cryptography,” first by reviewing some concepts of the elliptic curve isogeny, and then, we present three major methods for constructing isogeny-based difficult problems. Then, we present some existing isogeny-based cryptographic primitives, such as signature and key exchange, and analyze their advantages and disadvantages. Finally, we discuss a few major challenges of isogeny research that, we hope, will attract more attention to isogeny-based cryptography.

DOI
10.1109/mitp.2019.2943136

Related papers

Elliptic Curve Isogenies: A New Frontier for Post-Quantum Cryptography

PAULO SÉRGIO DE ANDRADE

The rise of quantum computing poses a significant threat to contemporary public-key cryptography, which relies on problems like integer factorization and the discrete logarithm, both of which are solvable in polynomial time by Shor's algorithm. This has prompted a global effort to develop and standardize post-quantum cryptographic primitives that are resistant to attacks by both classical and quantum computers. Among the various families of post-quantum candidates, isogeny-based cryptography has emerged as a particularly compelling, albeit challenging, alternative. This paper explores the mathematical foundations of elliptic curve isogenies and their application as a basis for quantum-resistant cryptographic protocols. We delve into the structure of supersingular elliptic curves and the associated isogeny graphs, which form the basis for the conjectured hardness of the underlying computational problems. The Supersingular Isogeny Diffie-Hellman (SIDH) protocol and its derivative, Supersingular Isogeny Key Encapsulation (SIKE), are examined in detail as principal examples of this cryptographic paradigm. We analyze their key advantages, most notably their exceptionally small key sizes, which offer significant benefits for constrained environments. However, the security landscape of isogeny-based cryptography has been dramatically reshaped by recent cryptanalytic breakthroughs that completely broke the SIKE protocol. This paper analyzes the nature of these attacks, discussing the vulnerabilities they exploited and the profound implications for the field. We conclude by surveying the current state of isogeny-based cryptography in the aftermath of these developments, outlining the proposed countermeasures, alternative designs, and the open research questions that define the new frontier for this promising area of post-quantum cryptography.

•Nov 14, 2025•0 citations

A Study on Isogeny Based Cryptography

Lakkavaram S M Shriya Varnita, Kandlagunta Subramanyam, Tokala Pavana Narasimha +2 more

Quantum cryptography enhances security and addresses vulnerabilities present in traditional cryptography, thereby providing better protection against potential risks posed by quantum computing. As quantum computing progresses, the feasibility of quantum cryptanalysis increases, necessitating the development of various post-quantum cryptography techniques. These techniques include cryptography that relies on lattices, codes, hash functions, multivariate polynomials, and isogenies, all aimed at ensuring stronger security measures. This paper focuses specifically on isogeny-based cryptography, a novel branch of cryptography that utilizes isogenies between elliptic curves to construct cryptographic tools. These schemes are known for their speed, efficiency, and resistance to quantum attacks. Our research delves into the latest advancements in isogeny-based cryptography, exploring the challenges and opportunities for future investigation. We firmly believe that isogeny-based cryptography holds great potential in shaping the future of cryptography, and we encourage fellow researchers to delve into this captivating field.

International Conference on Electronics, Computing, Communication and Control Technology (ICECCC)•May 2, 2024•7 citations

Isogeny-based cryptosystems for post-quantum security

R. Kapgate, Dheeravath Raju, Chetansinh Vaghela +3 more

The fast progress of quantum computing is a serious threat to classical cryptographic schemes like RSA and elliptic curve cryptography, and it is time to come up with safe postquantum schemes.One of the new solutions is isogeny-based cryptography which has attracted attention because of its good-security basis and comparatively small key sizes.Nevertheless, currently used post-quantum cryptographic (PQC) designs, such as lattice-based and codebased ones, are typically characterized by the high key sizes, high computational costs, or scaling issues, with the necessity to have a well-balanced and efficient cryptographic design.This paper presents a powerful isogeny-based cryptosystem, which can allow safe communication in the post-quantum context.The mathematical complexity of isogenies over supersingular elliptic curves forms the foundation of the proposed framework and it has a structured architecture comprising of parameterization, key generation, encryption/decryption and communication layers.The design of the optimization of algorithms to generate keys, exchange keys securely and encrypt messages using shared secret derivation mechanisms is part of the methodology.Security analysis is also carried out to assess the resistance to quantum attacks and against known cryptanalytic vulnerabilities.The metrics used to conduct performance evaluation are computed cost, key size, and latency, and the results are compared to typical PQC schemes, like lattice-based (Kyber) and code-based (McEliece) systems.The results show that the model proposed has much smaller key sizes (330 bytes public key) with moderate computational efficiency although a little bit more latency than lattice-based methods.

Journal of Discrete Mathematical Sciences and Cryptography•Oct 31, 2026•0 citations

Elliptic Curve Cryptography Reimagined: Post-Quantum Resilience Through Isogeny Graphs

PAULO SÉRGIO DE ANDRADE

The impending arrival of large-scale quantum computers poses a significant threat to modern public-key cryptography, which is largely based on the hardness of integer factorization and the discrete logarithm problem. Elliptic Curve Cryptography (ECC), a cornerstone of current digital security, is particularly vulnerable to attacks by quantum algorithms, notably Shor's algorithm. This has catalyzed the development of Post-Quantum Cryptography (PQC), a new generation of cryptographic systems designed to be secure against both classical and quantum adversaries. Among the various PQC families, isogeny-based cryptography has emerged as a compelling, albeit complex, candidate. This paper explores the reimagination of elliptic curve principles for a post-quantum world through the lens of isogeny graphs. We provide a comprehensive overview of the transition from classical ECC to isogeny-based schemes, detailing the mathematical foundations of elliptic curve isogenies and the construction of supersingular isogeny graphs. The core of our analysis focuses on how the problem of finding a secret isogeny path between two curves in this graph forms the basis for quantum-resistant cryptographic protocols. We review the evolution of seminal protocols such as Supersingular Isogeny Diffie-Hellman (SIDH) and its variants, discussing their initial promise. Crucially, the paper also addresses the recent groundbreaking cryptanalytic attacks on SIDH, which have reshaped the landscape of isogeny-based cryptography. We analyze the implications of these attacks and the ongoing research to develop new, more secure isogeny-based schemes like SQISign. By comparing the performance metrics (key size, performance, security) of isogeny-based systems with other leading PQC candidates, such as those based on lattices and codes, this paper offers a balanced perspective on their potential role in future cryptographic standards.

•Nov 19, 2025•0 citations

Post-Quantum Cryptography for Secure Communication: A Systematic Review of Algorithms, Performance Trade-offs, and Emerging Challenges

Suvhodip Saha

The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.

International Journal for Research in Applied Science and Engineering Technology•Mar 24, 2026•0 citations

Foundations and Development of Isogeny-Based Cryptography From Origins to the SIKE Collapse

Krishanu Naskar, Abhishek Dey

Isogeny-based cryptography represents a compelling direction in post-quantum security, distinguished by its exceptionally small key sizes and solid theoretical foundation based on the computational difficulty of finding isogenies between supersingular elliptic curves. This paper traces the foundation and developmental trajectory of isogeny-based cryptography, from its early theoretical proposals to significant advancements leading up to 2022. Special attention is devoted to the period between 2020 and 2022, which witnessed substantial progress in isogeny-based signature schemes, key exchange protocols, and computational optimizations, alongside emerging cryptanalytic challenges. The discussion concludes with a concise summary of the 2022 attack on the Supersingular Isogeny Key Encapsulation (SIKE) scheme, avoiding in-depth technical details, and proceeds to compare isogeny-based cryptography with alternative post-quantum cryptographic approaches.This analysis affirms the ongoing relevance of isogeny-based techniques despite setbacks, while highlighting critical directions for future research.

International Journal of Computer Sciences and Engineering•Jun 30, 2025•0 citations
Recent advances in quantum computing have made existing public key cryptosystems vulnerable to enormous security threats. Therefore, numerous efforts have been exploring post-quantum cryptographic techniques to address the emergence of quantum computing. We focus on one promising post-quantum cryptography known as “isogeny-based cryptography,” first by reviewing some concepts of the elliptic curve isogeny, and then, we present three major methods for constructing isogeny-based difficult problems. Then, we present some existing isogeny-based cryptographic primitives, such as signature and key exchange, and analyze their advantages and disadvantages. Finally, we discuss a few major challenges of isogeny research that, we hope, will attract more attention to isogeny-based cryptography.
The rise of quantum computing poses a significant threat to contemporary public-key cryptography, which relies on problems like integer factorization and the discrete logarithm, both of which are solvable in polynomial time by Shor's algorithm. This has prompted a global effort to develop and standardize post-quantum cryptographic primitives that are resistant to attacks by both classical and quantum computers. Among the various families of post-quantum candidates, isogeny-based cryptography has emerged as a particularly compelling, albeit challenging, alternative. This paper explores the mathematical foundations of elliptic curve isogenies and their application as a basis for quantum-resistant cryptographic protocols. We delve into the structure of supersingular elliptic curves and the associated isogeny graphs, which form the basis for the conjectured hardness of the underlying computational problems. The Supersingular Isogeny Diffie-Hellman (SIDH) protocol and its derivative, Supersingular Isogeny Key Encapsulation (SIKE), are examined in detail as principal examples of this cryptographic paradigm. We analyze their key advantages, most notably their exceptionally small key sizes, which offer significant benefits for constrained environments. However, the security landscape of isogeny-based cryptography has been dramatically reshaped by recent cryptanalytic breakthroughs that completely broke the SIKE protocol. This paper analyzes the nature of these attacks, discussing the vulnerabilities they exploited and the profound implications for the field. We conclude by surveying the current state of isogeny-based cryptography in the aftermath of these developments, outlining the proposed countermeasures, alternative designs, and the open research questions that define the new frontier for this promising area of post-quantum cryptography.
Quantum cryptography enhances security and addresses vulnerabilities present in traditional cryptography, thereby providing better protection against potential risks posed by quantum computing. As quantum computing progresses, the feasibility of quantum cryptanalysis increases, necessitating the development of various post-quantum cryptography techniques. These techniques include cryptography that relies on lattices, codes, hash functions, multivariate polynomials, and isogenies, all aimed at ensuring stronger security measures. This paper focuses specifically on isogeny-based cryptography, a novel branch of cryptography that utilizes isogenies between elliptic curves to construct cryptographic tools. These schemes are known for their speed, efficiency, and resistance to quantum attacks. Our research delves into the latest advancements in isogeny-based cryptography, exploring the challenges and opportunities for future investigation. We firmly believe that isogeny-based cryptography holds great potential in shaping the future of cryptography, and we encourage fellow researchers to delve into this captivating field.
The fast progress of quantum computing is a serious threat to classical cryptographic schemes like RSA and elliptic curve cryptography, and it is time to come up with safe postquantum schemes.One of the new solutions is isogeny-based cryptography which has attracted attention because of its good-security basis and comparatively small key sizes.Nevertheless, currently used post-quantum cryptographic (PQC) designs, such as lattice-based and codebased ones, are typically characterized by the high key sizes, high computational costs, or scaling issues, with the necessity to have a well-balanced and efficient cryptographic design.This paper presents a powerful isogeny-based cryptosystem, which can allow safe communication in the post-quantum context.The mathematical complexity of isogenies over supersingular elliptic curves forms the foundation of the proposed framework and it has a structured architecture comprising of parameterization, key generation, encryption/decryption and communication layers.The design of the optimization of algorithms to generate keys, exchange keys securely and encrypt messages using shared secret derivation mechanisms is part of the methodology.Security analysis is also carried out to assess the resistance to quantum attacks and against known cryptanalytic vulnerabilities.The metrics used to conduct performance evaluation are computed cost, key size, and latency, and the results are compared to typical PQC schemes, like lattice-based (Kyber) and code-based (McEliece) systems.The results show that the model proposed has much smaller key sizes (330 bytes public key) with moderate computational efficiency although a little bit more latency than lattice-based methods.
The impending arrival of large-scale quantum computers poses a significant threat to modern public-key cryptography, which is largely based on the hardness of integer factorization and the discrete logarithm problem. Elliptic Curve Cryptography (ECC), a cornerstone of current digital security, is particularly vulnerable to attacks by quantum algorithms, notably Shor's algorithm. This has catalyzed the development of Post-Quantum Cryptography (PQC), a new generation of cryptographic systems designed to be secure against both classical and quantum adversaries. Among the various PQC families, isogeny-based cryptography has emerged as a compelling, albeit complex, candidate. This paper explores the reimagination of elliptic curve principles for a post-quantum world through the lens of isogeny graphs. We provide a comprehensive overview of the transition from classical ECC to isogeny-based schemes, detailing the mathematical foundations of elliptic curve isogenies and the construction of supersingular isogeny graphs. The core of our analysis focuses on how the problem of finding a secret isogeny path between two curves in this graph forms the basis for quantum-resistant cryptographic protocols. We review the evolution of seminal protocols such as Supersingular Isogeny Diffie-Hellman (SIDH) and its variants, discussing their initial promise. Crucially, the paper also addresses the recent groundbreaking cryptanalytic attacks on SIDH, which have reshaped the landscape of isogeny-based cryptography. We analyze the implications of these attacks and the ongoing research to develop new, more secure isogeny-based schemes like SQISign. By comparing the performance metrics (key size, performance, security) of isogeny-based systems with other leading PQC candidates, such as those based on lattices and codes, this paper offers a balanced perspective on their potential role in future cryptographic standards.
The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.
Isogeny-based cryptography represents a compelling direction in post-quantum security, distinguished by its exceptionally small key sizes and solid theoretical foundation based on the computational difficulty of finding isogenies between supersingular elliptic curves. This paper traces the foundation and developmental trajectory of isogeny-based cryptography, from its early theoretical proposals to significant advancements leading up to 2022. Special attention is devoted to the period between 2020 and 2022, which witnessed substantial progress in isogeny-based signature schemes, key exchange protocols, and computational optimizations, alongside emerging cryptanalytic challenges. The discussion concludes with a concise summary of the 2022 attack on the Supersingular Isogeny Key Encapsulation (SIKE) scheme, avoiding in-depth technical details, and proceeds to compare isogeny-based cryptography with alternative post-quantum cryptographic approaches.This analysis affirms the ongoing relevance of isogeny-based techniques despite setbacks, while highlighting critical directions for future research.