Results 71 to 80 of about 548 (94)
A Faster Way to the CSIDH [PDF]
Lecture Notes in Computer Science, 2018 Recently Castryck, Lange, Martindale, Panny, and Renes published CSIDH, a new key exchange scheme using supersingular elliptic curve isogenies. Due to its small key sizes, and the possibility of a non-interactive and a static-static key exchange, CSIDH ...
Steffen Reith, Michael Meyer
exaly +12 more sources
Advances in Mathematics of Communications, 2022 <p style='text-indent:20px;'>Since its proposal in Asiacrypt 2018, the commutative isogeny-based key exchange protocol (CSIDH) has spurred considerable attention to improving its performance and re-evaluating its classical and quantum security guarantees.
Francisco Rodríguez-Henríquez +1 more
exaly +6 more sources
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 +5 more sources
CSI-RAShi: Distributed Key Generation for CSIDH
Lecture Notes in Computer Science, 2021 We present an honest-majority Distributed Key Generation protocol (DKG) based on Shamir’s (k, n)-threshold secret sharing in the setting of Very Hard Homogenous Spaces (VHHS). DKGs in the discrete logarithm setting use Pedersen commitments, for which there is no known analogue in the VHHS setting.
Robi Pedersen +2 more
exaly +4 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 +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Practical Robust DKG Protocols for CSIDH
Lecture Notes in Computer Science, 2023Robi Pedersen +2 more
exaly +3 more sources
A Constant-Time Algorithm of CSIDH Keeping Two Points
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020 Hiroshi Onuki, Yusuke Aikawa
exaly +3 more sources
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).
Xuejun Fan +3 more
exaly +2 more sources
New Proof Systems and an OPRF from CSIDH
Lecture Notes in Computer Sciencesponsorship: 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 ...
Robi Pedersen +1 more
exaly +6 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