Fast cryptography in genus 2
From MaRDI portal
Publication:271578
DOI10.1007/s00145-014-9188-7zbMath1351.94028OpenAlexW2040961499MaRDI QIDQ271578
Huseyin Hisil, Craig Costello, Joppe W. Bos, Kristin E. Lauter
Publication date: 7 April 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-014-9188-7
Related Items (3)
On the statistical leak of the GGH13 multilinear map and some variants ⋮ Computing supersingular isogenies on Kummer surfaces ⋮ Efficient arithmetic in (pseudo-)Mersenne prime order fields
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genus 2 point counting over prime fields
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- A fast Diffie-Hellman protocol in genus 2
- A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\)
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- On addition chains \(l(mn)\leq 1 (n)-b\) and lower bounds for c(r)
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
- Group Law Computations on Jacobians of Hyperelliptic Curves
- Fast Elliptic Curve Cryptography in OpenSSL
- Faster Implementation of Scalar Multiplication on Koblitz Curves
- Kummer Strikes Back: New DH Speed Records
- On the discrete logarithm problem in class groups of curves
- Counting Points on Genus 2 Curves with Real Multiplication
- High-Speed High-Security Signatures
- Modular Multiplication Without Trial Division
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Computing with the analytic Jacobian of a genus 2 curve
- High-Performance Modular Multiplication on the Cell Processor
- Speeding Up Bipartite Modular Multiplication
- Factorization with genus 2 curves
- Twisted Edwards Curves Revisited
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Elliptic Curve Cryptosystems
- Monte Carlo Methods for Index Computation (mod p)
- Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems
- Examples of genus two CM curves defined over the rationals
- The Montgomery inverse and its applications
- Constructing hyperelliptic curves of genus 2 suitable for cryptography
- Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Elliptic and Hyperelliptic Curves: A Practical Security Analysis
- Fast genus 2 arithmetic based on Theta functions
- The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
- Selected Areas in Cryptography
- On addition chains
- Public Key Cryptography - PKC 2006
- Algorithmic Number Theory
This page was built for publication: Fast cryptography in genus 2
