Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
From MaRDI portal
(Redirected from Publication:2229293)
Recommendations
Cites work
- A faster way to the CSIDH
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- Branching and bounds tighteningtechniques for non-convex MINLP
- Communication Complexity
- Constructing canonical strategies for parallel implementation of isogeny based cryptography
- CSIDH: an efficient post-quantum commutative group action
- Distributed Computing: A Locality-Sensitive Approach
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- He gives C-sieves on the CSIDH
- How to construct CSIDH on Edwards curves
- scientific article; zbMATH DE number 3889661 (Why is no real title available?)
- scientific article; zbMATH DE number 1971713 (Why is no real title available?)
- On lions and elligators: an efficient constant-time implementation of CSIDH
- Pseudorandomness
- Removing randomness in parallel computation without a processor penalty
- Stronger and faster side-channel protections for CSIDH
- The cost of unknown diameter in dynamic networks
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- What Can be Computed Locally?
Cited in
(16)- Optimal strategies for CSIDH
- (Short paper) Analysis of a strong fault attack on static/ephemeral CSIDH
- Fully projective radical isogenies in constant-time
- How not to create an isogeny-based PAKE
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- L₁-norm ball for CSIDH: optimal strategy for choosing the secret key space
- CSIDH on the surface
- SCALLOP: scaling the CSI-FiSh
- Towards optimized and constant-time CSIDH on embedded devices
- Disorientation faults in CSIDH
- Low memory attacks on small key CSIDH
- Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees
- A review of mathematical and computational aspects of CSIDH algorithms
- Effective pairings in isogeny-based cryptography
- Deterministic algorithms for class group actions
- Efficient post-quantum commutative group actions from orientations of large discriminant
This page was built for publication: Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229293)
