Results 1 to 10 of about 356 (107)

DeCSIDH: Delegating Isogeny Computations in the CSIDH Setting

Lecture Notes in Computer Science, 2021
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 No. 101020788 -Adv-ERC-ISOCRYPT), the Research Council KU Leuven grant C14/18/067, and by CyberSecurity Research Flanders with reference number VR20192203.
Robi Pedersen
exaly   +4 more sources

Practical Robust DKG Protocols for CSIDH

Lecture Notes in Computer Science, 2023
Shahla Atapoor, Karim Baghery, Daniele Cozzo   +2 more
exaly   +3 more sources

Trouble at the CSIDH: Protecting CSIDH with Dummy-Operations Against Fault Injection Attacks

2020 Workshop on Fault Detection and Tolerance in Cryptography (FDTC), 2020
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   +4 more sources

A Constant-Time Algorithm of CSIDH Keeping Two Points

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020
Hiroshi Onuki
exaly   +3 more sources

CSURF-TWO: CSIDH for the Ratio (2 : 1)

Lecture Notes in Computer Science, 2021
The 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).
Xuejun Fan, Song Tian, Xiu Xu, Bao Li 0001   +3 more
exaly   +2 more sources

New Proof Systems and an OPRF from CSIDH

Lecture Notes in Computer Science
sponsorship: The authors would like to thank Karim Baghery, Steven Galbraith, Yi-Fu Lai, Emmanuela Orsini, Nigel Smart and Frederik Vercauteren for helpful discussions regarding the contents of this work. This work was supported in part by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme ...
Cyprien Delpech De Saint Guilhem, Robi Pedersen   +1 more
exaly   +5 more sources

Speeding up CSIDH using parallel computation of isogeny

2020 7th International Conference on Advance Informatics: Concepts, Theory and Applications (ICAICTA), 2020
Isogeny-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

L1-norm ball for CSIDH: Optimal strategy for choosing the secret key space

Discrete Applied Mathematics, 2023
Kohei Nakagawa, Hiroshi Onuki, Atsushi Takayasu   +2 more
exaly  

Solving the Hidden Number Problem for CSIDH and CSURF via Automated Coppersmith

Lecture Notes in Computer Science, 2023
Jonas Meers, Julian Nowakowski
exaly  

A review of mathematical and computational aspects of CSIDH algorithms

Journal of Algebra and Its Applications
Marzio Mula, Federico Pintore
exaly