Results 21 to 30 of about 312 (116)
FESTA: Fast Encryption from Supersingular Torsion Attacks [PDF]
, 2023 We introduce FESTA, an efficient isogeny-based public-key encryption (PKE) protocol based on a constructive application of the SIDH attacks. At its core, FESTA is based on a novel trapdoor function, which uses an improved version of the techniques ...
Andrea Basso +2 more
core
SCALLOP-HD: group action from 2-dimensional isogenies [PDF]
, 2023 We present SCALLOP-HD, a novel group action that builds upon the recent SCALLOP group action introduced by De Feo, Fouotsa, Kutas, Leroux, Merz, Panny and Wesolowski in 2023. While our group action uses the same action of the class group $\textnormal{Cl}(
Antonin Leroux, Mingjie Chen
core
SILBE: an Updatable Public Key Encryption Scheme from Lollipop Attacks [PDF]
We present a new post-quantum Public Key Encryption scheme (PKE) named Supersingular Isogeny Lollipop Based Encryption or SILBE. SILBE is obtained by leveraging the generalized lollipop attack of Castryck and Vercauteren on the M-SIDH Key exchange by ...
Max Duparc +2 more
core
QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras [PDF]
, 2023 In 2023, Basso, Maino, and Pope proposed FESTA (Fast Encryption from Supersingular Torsion Attacks), an isogeny-based public-key encryption (PKE) protocol that uses the SIDH attack for decryption.
Hiroshi Onuki, Kohei Nakagawa
core
Leveled Isogeny Problems with Hints [PDF]
We define and analyze the Leveled Isogeny Problem with Hints (LIPH), which is a generalization of the Isogeny Problem with Level Structure first introduced by De Feo, Fuoutsa and Panny at EUROCRYPT\u2724.
Jonas Meers +3 more
core
, 2023 We show that the soundness proof for the De Feo-Jao-Plut identification scheme (the basis for supersingular isogeny Diffie--Hellman (SIDH) signatures) contains an invalid assumption, and we provide a counterexample for this assumption---thus showing the ...
Luca De Feo +3 more
core
Cryptographic Smooth Neighbors [PDF]
, 2023 We revisit the problem of finding two consecutive $B$-smooth integers by giving an optimised implementation of the Conrey-Holmstrom-McLaughlin ``smooth neighbors\u27\u27 algorithm.
Bruno Sterner +6 more
core
Isogeny problems with level structure [PDF]
Given two elliptic curves and the degree of an isogeny between them, finding the isogeny is believed to be a difficult problem---upon which rests the security of nearly any isogeny-based scheme. If, however, to the data above we add information about the
Lorenz Panny +2 more
core
Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves [PDF]
, 2023 Finding isogenies between supersingular elliptic curves is a natural algorithmic problem which is known to be equivalent to computing the curves\u27 endomorphism rings. When the isogeny is additionally required to have a specific degree $d$, the problem
Benjamin Benčina +5 more
core
Proving knowledge of isogenies – A survey [PDF]
, 2023 Isogeny-based cryptography is an active area of research in post-quantum public key cryptography. The problem of proving knowledge of an isogeny is a natural problem that has several applications in isogeny-based cryptography, such as allowing users to ...
Christophe Petit +3 more
core