Results 11 to 20 of about 2,762 (168)

Horizontal Racewalking Using Radical Isogenies

IACR Cryptology ePrint Archive, 2022
sponsorship: This work was supported in part by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement ISOCRYPT -No. 101020788) and by CyberSecurity Research Flanders with reference number VR20192203.
Castryck, Wouter, Decru, Thomas, Houben, Marc, Vercauteren, Frederik   +3 more
openaire   +3 more sources

Efficient Commutative PQC Algorithms on Isogenies of Edwards Curves

Cryptography
The article presents the author’s works in the field of modifications and modeling of the Post-Quantum Cryptography (PQC) Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) algorithm on non-cyclic supersingular Edwards curves and its predecessor ...
Anatoly Bessalov, Volodymyr Sokolov, Serhii Abramov   +2 more
doaj   +2 more sources

{KLaPoTi}: An asymptotically efficient isogeny group action from 2-dimensional isogenies

IACR Communications in Cryptology
We construct and implement an efficient post-quantum commutative cryptographic group action based on combining the SCALLOP framework for group actions from isogenies of oriented elliptic curves on one hand with the recent Clapoti method for polynomial-time evaluation of the CM group action on elliptic curves on ...
Lorenz Panny, Christophe Petit, Miha Stopar   +2 more
openaire   +2 more sources

OPRFs from Isogenies

Proceedings of the 19th ACM Asia Conference on Computer and Communications Security
Oblivious Pseudorandom Functions (OPRFs) are an elementary building block in cryptographic and privacy-preserving applications. While there are numerous pre-quantum secure OPRF constructions, it is unclear which of the proposed options for post-quantum ...
Heimberger, Lena, Hennerbichler, Tobias, Meisingseth, Fredrik, Ramacher, Sebastian, Rechberger, Christian   +4 more
semanticscholar   +4 more sources

Group signatures and more from isogenies and lattices: generic, simple, and efficient

Designs, Codes and Cryptography, 2023
We construct an efficient dynamic group signature (or more generally an accountable ring signature) from isogeny and lattice assumptions. Our group signature is based on a simple generic construction that can be instantiated by cryptographically hard ...
Ward Beullens, Samuel Dobson, Shuichi Katsumata, Yi-Fu Lai, Federico Pintore   +4 more
semanticscholar   +1 more source

A trade-off between classical and quantum circuit size for an attack against CSIDH

Journal of Mathematical Cryptology, 2020
We propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪).
Biasse Jean-François, Bonnetain Xavier, Pring Benjamin, Schrottenloher André, Youmans William   +4 more
doaj   +1 more source

Optimal Strategies for Computation of Degree ℓn Isogenies for SIDH [PDF]

International Journal of Electronics and Telecommunications, 2020
This article presents methods and algorithms for the computation of isogenies of degree ℓn. Some of these methods are obtained using recurrence equations and generating functions.
Michał Wroński, Andrzej Chojnacki
doaj   +1 more source

Algebraic approaches for solving isogeny problems of prime power degrees

Journal of Mathematical Cryptology, 2020
Recently, supersingular isogeny cryptosystems have received attention as a candidate of post-quantum cryptography (PQC). Their security relies on the hardness of solving isogeny problems over supersingular elliptic curves. The meet-in-the-middle approach
Takahashi Yasushi, Kudo Momonari, Fukasaku Ryoya, Ikematsu Yasuhiko, Yasuda Masaya, Yokoyama Kazuhiro   +5 more
doaj   +1 more source

On the supersingular GPST attack

Journal of Mathematical Cryptology, 2021
The main attack against static-key supersingular isogeny Diffie–Hellman (SIDH) is the Galbraith–Petit–Shani–Ti (GPST) attack, which also prevents the application of SIDH to other constructions such as non-interactive key-exchange.
Basso Andrea, Pazuki Fabien
doaj   +1 more source

Cyclic isogenies of elliptic curves over fixed quadratic fields [PDF]

Mathematics of Computation, 2022
Building on Mazur's 1978 work on prime degree isogenies, Kenku determined in 1981 all possible cyclic isogenies of elliptic curves over $\mathbb{Q}$. Although more than 40 years have passed, the determination of cyclic isogenies of elliptic curves over a
Barinder S. Banwait, Filip Najman, Oana Padurariu   +2 more
semanticscholar   +1 more source