Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
From MaRDI portal
Publication:2229293
DOI10.1007/978-3-030-57808-4_24OpenAlexW2982388819MaRDI QIDQ2229293
Brian Koziel, Reza Azarderakhsh, Jason T. LeGrow, Aaron Hutchinson
Publication date: 23 February 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_24
Related Items (8)
CSIDH on the Surface ⋮ (Short paper) Analysis of a strong fault attack on static/ephemeral CSIDH ⋮ Fully projective radical isogenies in constant-time ⋮ Disorientation faults in CSIDH ⋮ \( L_1\)-norm ball for CSIDH: optimal strategy for choosing the secret key space ⋮ How not to create an isogeny-based PAKE ⋮ Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors ⋮ Optimal strategies for CSIDH
Cites Work
- Unnamed Item
- Unnamed Item
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- How to construct CSIDH on Edwards curves
- Removing randomness in parallel computation without a processor penalty
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- CSIDH: an efficient post-quantum commutative group action
- A faster way to the CSIDH
- Constructing canonical strategies for parallel implementation of isogeny based cryptography
- He gives C-sieves on the CSIDH
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- Stronger and faster side-channel protections for CSIDH
- On Lions and elligators: an efficient constant-time implementation of CSIDH
- Pseudorandomness
- Branching and bounds tighteningtechniques for non-convex MINLP
- Distributed Computing: A Locality-Sensitive Approach
- The Cost of Unknown Diameter in Dynamic Networks
- What Can be Computed Locally?
- Communication Complexity
This page was built for publication: Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
