In this paper, we present a comparative performance analysis of the POKÉ-based key exchange and SIDH variants. SIDH gained attention for its small key size and efficient performance, and has been selected as an alternate candidate in NIST PQC Round 4. However, following the key recovery attack by Castryck and Decru in 2022, SIDH was shown to be vulnerable to polynomial-time attacks on classical computers, undermining its security and removing it from consideration. Given that SIDH was regarded as the leading isogeny-based algorithm, several countermeasures, such as MSIDH, MD-SIDH, and bin/terSIDH have been proposed. However, these approaches still face performance limitations. Meanwhile, POKÉ, proposed by Basso and Maino at Eurocrypt 2025, is an isogeny-based public key encryption scheme that combines a SIDH-like protocol with higher-dimensional isogenies and has drawn attention for its efficient performance. In this work, we adapt POKÉ into a key exchange algorithm and benchmark it against M-SIDH, terSIDH, and CSIDH. Targeting NIST security level 1, POKÉ-based KEM is approximately 21.21 times faster than terSIDH and 64.97 times faster than CSIDH, showing that the POKÉ-based KEM is currently the most promising isogeny-based key exchange candidate.
In this paper, we present a comparative performance analysis of the POKÉ-based key exchange and SIDH variants. SIDH gained attention for its small key size and efficient performance, and has been selected as an alternate candidate in NIST PQC Round 4. However, following the key recovery attack by Castryck and Decru in 2022, SIDH was shown to be vulnerable to polynomial-time attacks on classical computers, undermining its security and removing it from consideration. Given that SIDH was regarded as the leading isogeny-based algorithm, several countermeasures, such as MSIDH, MD-SIDH, and bin/terSIDH have been proposed. However, these approaches still face performance limitations. Meanwhile, POKÉ, proposed by Basso and Maino at Eurocrypt 2025, is an isogeny-based public key encryption scheme that combines a SIDH-like protocol with higher-dimensional isogenies and has drawn attention for its efficient performance. In this work, we adapt POKÉ into a key exchange algorithm and benchmark it against M-SIDH, terSIDH, and CSIDH. Targeting NIST security level 1, POKÉ-based KEM is approximately 21.21 times faster than terSIDH and 64.97 times faster than CSIDH, showing that the POKÉ-based KEM is currently the most promising isogeny-based key exchange candidate.
The emergence of quantum computing poses a significant threat to the security of currently deployed public-key cryptosystems, including those based on elliptic curves (ECC). Shor's algorithm can solve the underlying integer factorization and discrete logarithm problems in polynomial time, rendering established cryptographic standards obsolete. This has catalyzed the development of post-quantum cryptography (PQC), a new generation of algorithms resistant to attacks by both classical and quantum computers. Among the most promising PQC candidates are systems based on supersingular isogeny graphs. This paper provides a comprehensive analysis of the supersingular isogeny paradigm as a quantum-secure evolution of elliptic curve cryptography. It begins by introducing the mathematical foundations of elliptic curves and isogenies, which are structure-preserving maps between them. The core of isogeny-based cryptography lies in the conjectured hardness of finding an isogeny path between two given supersingular elliptic curves in the vast isogeny graph. This is fundamentally different from the discrete logarithm problem that underpins traditional ECC. We review the foundational Supersingular Isogeny Diffie-Hellman (SIDH) key exchange protocol and its subsequent realization as the Supersingular Isogeny Key Encapsulation (SIKE) mechanism, which was a candidate in the NIST PQC standardization process. We discuss its advantages, such as small key sizes and perfect forward secrecy, which made it an attractive alternative. However, the paper also presents a balanced view by thoroughly examining the devastating cryptanalytic breakthroughs of 2022 that rendered the original SIDH/SIKE schemes insecure. These attacks, which exploit auxiliary point information, underscore the dynamic nature of PQC research. Despite this setback, the isogeny-based field remains active, with ongoing research into alternative constructions like CSIDH and other variants that are not vulnerable to the known attacks. We conclude that while the initial promise of SIDH/SIKE was broken, the underlying mathematical problem of finding isogenies remains a compelling basis for quantum-secure cryptography, representing a paradigm of active research rather than a discarded concept.
Supersingular Isogeny Key Encapsulation (SIKE) was a promising candidate in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography (PQC) standardization process, as it is distinguished by its exceptionally small key sizes, which makes it attractive for resource-constrained environments, and an elegant mathematical foundation rooted in supersingular elliptic curve isogenies. Its security based on the presumed hardness of computing isogenies between such curves. However, in August 2022, a groundbreaking attack by Castryck and Decru completely compromised SIKE, demonstrating its insecurity with practical polynomial-time complexity. This pivotal event led to SIKE`s immediate withdrawal from NIST`s standardization efforts, reshaping the evolving landscape of post-quantum cryptography and underscoring essential lessons in cryptographic design, evaluation, and diversity. A comprehensive academic analysis of the SIKE cryptographic scheme methodology and details of the specific nature of the Castryck-Decru attack that rendered it insecure is provided by this paper. It also discusses in brief the far-reaching implications for cryptographic design, standardization processes, and the pursuit of quantum-resistant algorithms, giving particular emphasis on the current state of post-quantum cryptography or PQC standardization as of 2025.
Collision-resistant hashing and key exchange are two significant Post Quantum cryptography challenges based on isogeny. The challenge in isogeny-based encryption is to identify an isogeny ϕ : E1 → E2, between two given supersingular elliptic curves defined over a finite field Fq. Finding End(E1) and End(E2) is the analogous problem to this one. Supersingular isogeny Diffie Hellman (SIDH) key exchange is designed to be quantum secure. In this instance, we take advantage of the endomorphism ring’s non-commutative property. In SIDH, both the initiator and the response contribute equally to the shared secret. Here, we create both public and private keys and send them through an unsecured channel. Finding isogenies between supersingular elliptic curves is the fundamentally challenging problem. The needed isogeny is calculated using the torsion point information and the degree of the secret isogeny.In July 2022, Wouter Castryck and Thomas Decru devised a successful key recovery attack on SIDH/ SIKE. The attack heavily depends on the torsion point images that Alice and Bob communicate during the protocol and is based on Kani’s “reducibility criterion” for isogenies from products of elliptic curves. We shall present a successful technique to prevent the aforementioned attack in this paper.
Abstract The Supersingular Isogeny Diffie-Hellman (SIDH) protocol is a leading contender for post-quantum cryptography. However, recent advances, specifically the Castryck-Decru attack, have exposed significant security flaws, primarily related to the predictability of torsion points and vulnerabilities in curve parameters. This study proposes and evaluates enhancements to the SIDH protocol, including increasing the size of torsion subgroups, introducing randomized isogeny generation , and employing advanced obfuscation techniques. Experimental results demonstrate that these modifications substantially improve SIDH’s security, with a manageable increase in computational overhead, positioning SIDH as a more resilient candidate for post-quantum cryptographic applications.
The advance of quantum computing poses significant risks to traditional cryptographic systems, including RSA and ECC, due to algorithms such as Shor’s, prompting an urgent need for robust post-quantum cryptography (PQC) solutions. This paper presents a systematic review of PQC algorithms, encompassing lattice-based, code-based, multivariate polynomial, hash-based, and supersingular isogeny-based cryptography. By evaluating recent publications and NIST standardization efforts, we assess these approaches in terms of quantum resistance, computational efficiency, scalability, and implementation challenges. Lattice-based schemes, notably CRYSTALS-Kyber, excel in quantum-secure encryption and performance, whereas code-based systems like McEliece are hindered by large key sizes. Hash-based signatures, such as SPHINCS+, and isogeny-based protocols, including SIDH, provide promising alternatives but require further optimization to reduce computational overhead. Our analysis highlights the potential of hybrid PQC methods and lightweight hardware implementations for securing emerging domains like IoT, blockchain, and financial systems. The review serves as a foundational resource for researchers and practitioners, advocating the adoption of quantum-resistant cryptography to preserve data confidentiality, integrity, and authenticity in the quantum era.
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.