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

Lecture notes in computer science

Séta: Supersingular Encryption from Torsion Attacks

Luca De Feo, Cyprien Delpech de Saint Guilhem, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Christophe Petit, Javier Silva, Benjamin Wesolowski

Published Jan 1, 2021• 45 citations
Publisher
DOI
10.1007/978-3-030-92068-5_9

Related papers

FESTA: Fast Encryption from Supersingular Torsion Attacks

Andrea Basso, Luciano Maino, Giacomo Pope

Lecture notes in computer science•Jan 1, 2023•57 citations

Post-Quantum Encryption Scheme with Supersingular Isogenies

Nikita Lyashenko, Kristina Rysyatova, Lydia Chemerigina +4 more

Lecture notes in networks and systems•Oct 30, 2021•2 citations

Towards Post-Quantum Updatable Public-Key Encryption via Supersingular Isogenies.

Edward Eaton, David Jao, Chelsea Komlo

•Jan 1, 2020•1 citation

SETLA: Signature and Encryption from Lattices

François Gérard, Keno Merckx

Lecture notes in computer science•Jan 1, 2018•14 citations

Masked torsion point supersingular isogeny Diffie-Hellman : A technique for preventing Castryck-Decru attack against SIDH

R. Krishnaprabha

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.

AIP conference proceedings•Jan 1, 2025•0 citations

Quantum Symmetric Encryption

Tao Shang

Springer eBooks•Oct 15, 2024•0 citations
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.