Results 61 to 70 of about 2,168 (195)
Pairing-based algorithms for jacobians of genus 2 curves with maximal endomorphism ring [PDF]
, 2012 Using Galois cohomology, Schmoyer characterizes cryptographic non-trivial self-pairings of the $\ell$-Tate pairing in terms of the action of the Frobenius on the $\ell$-torsion of the Jacobian of a genus 2 curve.
Belding +15 more
core +10 more sources
Families of fast elliptic curves from Q-curves [PDF]
, 2013 We construct new families of elliptic curves over \(\FF_{p^2}\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant-Lambert-Vanstone (GLV) and Galbraith-Lin-Scott (GLS ...
Smith, Benjamin
core +7 more sources
Guest Editorial: Guest Editorial on Cryptanalysis of (NIST PQC) post‐quantum proposals
, 2023 IET Information Security, Volume 17, Issue 2, Page 159-160, March 2023.
Ayoub Otmani +2 more
wiley +1 more source
Constructing elliptic curve isogenies in quantum subexponential time
Journal of Mathematical Cryptology, 2014 Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew +2 more
doaj +1 more source
Research Status, Challenges, and Future Development of Post-Quantum Cryptography [PDF]
中国工程科学As an important strategic resource for safeguarding national information security and the healthy development of digital economy, cryptography is the cornerstone of protecting the security of critical infrastructure, government affairs data, financial ...
Guizhen Zhu +5 more
doaj +1 more source
CTIDH: faster constant-time CSIDH
Transactions on Cryptographic Hardware and Embedded Systems, 2021 This paper introduces a new key space for CSIDH and a new algorithm for constant-time evaluation of the CSIDH group action. The key space is not useful with previous algorithms, and the algorithm is not useful with previous key spaces, but combining the ...
Gustavo Banegas +7 more
doaj +1 more source
IEEE Access, 2021 Since the introduction of the Supersingular isogeny Diffie–Hellman (SIDH) key exchange protocol by Jao and de Feo in 2011, it and its variation (SIKE) have gained significant attention as a promising candidate for post-quantum cryptography (PQC ...
Seog Chung Seo
doaj +1 more source
The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
IEEE Access, 2020 Number representation systems establish ways in which numbers are mapped to computer architectures, and how operations over the numbers are translated into computer instructions.
Paulo Martins, Leonel Sousa
doaj +1 more source
A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
Journal of Mathematical Cryptology, 2020 We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David +3 more
doaj +1 more source
, 2013 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
Sutherland, Andrew V.
core +1 more source