Results 31 to 40 of about 3,965 (252)
The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field has made them an important tool for computational number theorists and practitioners of elliptic curve cryptography. This expository paper recounts the theory behind these graphs and examines several recently developed algorithms that ...
openaire +2 more sources
Proposal of a New Isogeny-Based Cryptographic Protocol: Formal Analysis and Comparison [PDF]
This paper proposes a novel isogeny-based cryptographic protocol that leverages the dual hardness of the isogeny problem and linear code decoding for secure post-quantum key exchange.
mohammed EL BARAKA, Siham Ezzouak
doaj +1 more source
An efficient post-quantum KEM from CSIDH
The SIDH and CSIDH are now the two most well-known post-quantum key exchange protocols from the supersingular isogeny-based cryptography, which have attracted much attention in recent years and served as the building blocks of other supersingular isogeny-
Qi Mingping
doaj +1 more source
Machine learning for moduli space of genus two curves and an application to isogeny-based cryptography [PDF]
We use machine learning to study the moduli space of genus two curves, specifically focusing on detecting whether a genus two curve has (n, n)-split Jacobian.
Elira Shaska, Tanush Shaska
semanticscholar +1 more source
On the Performance Analysis for CSIDH-Based Cryptosystems
In this paper, we present the performance and security analysis for various commutative SIDH (CSIDH)-based algorithms. As CSIDH offers a smaller key size than SIDH and provides a relatively efficient signature scheme, numerous CSIDH-based key exchange ...
Donghoe Heo +3 more
doaj +1 more source
Ordinary isogeny graphs with level structure [PDF]
We study $\ell $ -isogeny graphs of ordinary elliptic curves defined over $\mathbb {F}_q$ with an added level structure. Given an integer N coprime to p and $\ell ,$ we look at the graphs obtained by adding $\Gamma _0(N)$ , $\Gamma _1(N),$ and
Derek Perrin, J. Voloch
semanticscholar +1 more source
Constructing Cycles in Isogeny Graphs of Supersingular Elliptic Curves
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve E defined over 𝔽p2, if an imaginary quadratic order O can be embedded in End(E) and a ...
Xiao Guanju, Luo Lixia, Deng Yingpu
doaj +1 more source
Complete Analysis of Implementing Isogeny-Based Cryptography Using Huff Form of Elliptic Curves
In this paper, we present the analysis of Huff curves for implementing isogeny-based cryptography. In this regard, we first investigate the computational cost of the building blocks when compression functions are used for Huff curves.
Suhri Kim
doaj +1 more source
Strategies and their evaluations play important roles in speeding up the computation of large smooth-degree isogenies. The concept of optimal strategies for such computation was introduced by De Feo et al., and virtually all implementations of isogeny ...
Kittiphon Phalakarn +3 more
doaj +1 more source
Genus Two Isogeny Cryptography [PDF]
We study \((\ell ,\ell )\)-isogeny graphs of principally polarised supersingular abelian surfaces (PPSSAS). The \((\ell ,\ell )\)-isogeny graph has cycles of small length that can be used to break the collision resistance assumption of the genus two isogeny hash function suggested by Takashima.
Flynn, E, Ti, Y
openaire +1 more source

