Results 61 to 70 of about 113 (86)
Trouble at the CSIDH: Protecting CSIDH With Dummy-Operations Against Fault Injection Attacks
The isogeny-based scheme CSIDH is a promising candidate for quantum-resistant static-static key exchanges with very small public keys, but is inherently difficult to implement in constant time. In the current literature, there are two directions for constant-time implementations: algorithms containing dummy computations and dummy-free algorithms. While
Hiroshi Onuki
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
CSURF-Two: CSIDH for the Ratio (2 : 1)
Lecture Notes in Computer Science, 2021The Commutative Supersingular Isogeny Diffie-Hellman key exchange (CSIDH) uses supersingular elliptic curves of Montgomery form over \(\mathbb {F}_p\) with \(p\equiv 3\) \((\mathrm{mod}\) 8), while CSURF considered those of Montgomery\(^-\) form with \(p\equiv 7\) \((\mathrm{mod}\) 8).
Song Tian
exaly +2 more sources
A Constant-Time Algorithm of CSIDH Keeping Two Points
Hiroshi Onuki, Tsuyoshi Takagi
exaly +3 more sources
Stronger and Faster Side-Channel Protections for CSIDH [PDF]
This work has been accepted in LATINCRYPT ...
Francisco José Rodriguez-Henriquez +2 more
exaly +5 more sources
On Collisions Related to an Ideal Class of Order 3 in CSIDH
2020CSIDH is an isogeny-based key exchange, which is a candidate for post quantum cryptography. It uses the action of an ideal class group on \(\mathbb {F}_{p}\)-isomorphism classes of supersingular elliptic curves. In CSIDH, the ideal classes are represented by vectors with integer coefficients.
Hiroshi Onuki, Tsuyoshi Takagi
openaire +3 more sources
Speeding Up CSIDH Using Parallel Computation of Isogeny
2020 7th International Conference on Advance Informatics: Concepts, Theory and Applications (ICAICTA), 2020Isogeny-based cryptography is a promising candidate for post-quantum cryptography. CSIDH is a Diffie-Hellman key exchange protocol based on isogeny with a small public key size and is secure against a quantum computer. However, one of the problems is that it takes a long time to compute the group action corresponding to the secret key.
Koutarou Suzuki
exaly +2 more sources
He Gives C-Sieves on the CSIDH
2020Recently, Castryck, Lange, Martindale, Panny, and Renes proposed CSIDH (pronounced “sea-side”) as a candidate post-quantum “commutative group action.” It has attracted much attention and interest, in part because it enables noninteractive Diffie–Hellman-like key exchange with quite small communication.
openaire +2 more sources
Efficient and Secure CSIDH Using Relation Lattices
Communications in Computer and Information ScienceAtsuko Miyaji
exaly +2 more sources
Implementing the Elliptic Curve CSIDH Cryptosystem
International Journal of Mathematics and Computer ScienceWith the advent of quantum computers, it is vital that we have quantum-proof encryption schemes to protect any sensitive data from hackers. One promising scheme is Commutative Supersingular Isogeny Diffie-Hellman, one of the few algorithms that has no known quantum attack scheme.
William Paulsen, Victoria Mardis
openaire +1 more source

