Fast genus 2 arithmetic based on Theta functions
From MaRDI portal
Publication:5443536
DOI10.1515/JMC.2007.012zbMath1145.11048MaRDI QIDQ5443536
Publication date: 21 February 2008
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11G20: Curves over finite and local fields
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
ECM using Edwards curves, Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves, Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic, Arithmetic on abelian and Kummer varieties, Fast cryptography in genus 2, Genus 2 point counting over prime fields, Traces of the group law on the Kummer surface of a curve of genus 2 in characteristic 2, A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties, The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines, Constructing abelian surfaces for cryptography via Rosenhain invariants, Hyper-and-elliptic-curve cryptography, Group Law Computations on Jacobians of Hyperelliptic Curves, Computing isogenies between abelian varieties, Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves, Montgomery Ladder for All Genus 2 Curves in Characteristic 2, Factorization with genus 2 curves, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
Cites Work
- A fast Diffie-Hellman protocol in genus 2
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Computing in the Jacobian of a Hyperelliptic Curve
- Equations for the Jacobian of a hyperelliptic curve
- Constructing hyperelliptic curves of genus 2 suitable for cryptography