Efficient computation of \((3^n,3^n)\)-isogenies
From MaRDI portal
Publication:6186336
DOI10.1007/978-3-031-37679-5_3MaRDI QIDQ6186336
Thomas Decru, Sabrina Kunzweiler
Publication date: 2 February 2024
Published in: Progress in Cryptology - AFRICACRYPT 2023 (Search for Journal in Brave)
Cryptography (94A60) Special algebraic curves and curves of low genus (14H45) [https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=%22Curves+of+arbitrary+genus+or+genus+%28%0D%0Ae+1%29+over+global+fields%22&go=Go Curves of arbitrary genus or genus ( e 1) over global fields (11G30)]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptographic hash functions from expander graphs
- The Magma algebra system. I: The user language
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Mathematical modelling for next-generation cryptography. CREST Crypto-Math project
- Hash functions from superspecial genus-2 curves using Richelot isogenies
- Genus two isogeny cryptography
- Radical isogenies
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- The number of curves of genus two with elliptic differentials.
- Descent via (3,3)-isogeny on Jacobians of genus 2 curves
- Genus-2 curves and Jacobians with a given number of points
- Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
- Multiradical isogenies
- Supersingular curves you can trust
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Breaking SIDH in polynomial time
This page was built for publication: Efficient computation of \((3^n,3^n)\)-isogenies
