Efficient computation of \((2^n, 2^n)\)-isogenies
From MaRDI portal
Publication:6544473
DOI10.1007/S10623-024-01366-1zbMATH Open1537.11093MaRDI QIDQ6544473
Publication date: 27 May 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Computational aspects of algebraic surfaces (14Q10) Abelian varieties of dimension (> 1) (11G10) Curves over finite and local fields (11G20) Isogeny (14K02)
Cites Work
- Title not available (Why is that?)
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Cryptographic hash functions from expander graphs
- The Magma algebra system. I: The user language
- CSIDH: an efficient post-quantum commutative group action
- Computing supersingular isogenies on Kummer surfaces
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Hash functions from superspecial genus-2 curves using Richelot isogenies
- Genus two isogeny cryptography
- Group Law Computations on Jacobians of Hyperelliptic Curves
- The Supersingular Isogeny Problem in Genus 2 and Beyond
- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Breaking SIDH in polynomial time
- Secret keys in genus-2 SIDH
Related Items (1)
This page was built for publication: Efficient computation of \((2^n, 2^n)\)-isogenies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544473)
