scientific article; zbMATH DE number 1748068
Because of the absence of exponential time algorithms for solving the discrete logarithm problem, the implementation of discrete logarithm based public-key protocols on elliptic curves and hyperelliptic curves of small genus \(g\) over finite fields has become increasingly important in public key cryptography. (For larger genus \(g\geq 4\) there exists a method for computing the discrete logarithm which is faster than Pollard's rho method [see \textit{P. Gaudry}, An algorithm for solving the discrete log problem on hyperelliptic curves, Lect. Notes Comput. Sci. 1807, 19--34 (2000) and \textit{N. Thériault}, Index calculus attack for hyperelliptic curves of small genus. Adv. Cryptology - ASIACRYPT 2003, Lect. Notes Comput. Sci. 2894, 75--92 (2003)].) Koblitz, Solinas, and others investigated a family of elliptic curves defined over a small finite field but considered over a large extension field (see \textit{J. A. Solinas} [Des. Codes Cryptography 19, 195--249 (2000; Zbl 0997.94017)]). These curves admit faster arithmetic on the curve. In [\textit{C. Günther}, \textit{T. Lange}, and \textit{A. Stein}, SAC 2000, Lect. Notes Comput. Sci. 2012, 106--117 (2001; Zbl 0976.94014)] these ideas were generalized to hyperelliptic curves of genus \(2\) over fields of characteristic \(2\). The main achievements of the thesis under review are the extensions of these results to hyperelliptic curves of arbitrary genus \(g\) over finite fields of arbitrary characteristic \(p\). Along the way, the author deduces some explicit formulae for the arithmetic in the divisor class groups for \(g=2\) and determines the class numbers of curves of genus \(g\leq 4\) defined over fields of \(p\leq 5\) elements.
- scientific article; zbMATH DE number 799760
- Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
- Formulae for arithmetic on genus 2 hyperelliptic curves
- scientific article; zbMATH DE number 5575556
- Fast multiplication on elliptic curves over small fields of characteristic two
- Aspects of hyperelliptic curves over large prime fields in software implementations
- An algorithm for solving the discrete log problem on hyperelliptic curves
- A Family of Subfield Hyperelliptic Curves for Use in Cryptography
- An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
- On the discrete logarithm in the divisor class group of curves
- Bäcklund transformations and divisor doubling
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves
- Koblitz curve cryptosystems
- Some properties of \(\tau\)-adic expansions on hyperelliptic Koblitz curves
- New fast algorithms for elliptic curve arithmetic in affine coordinates
- Efficient arithmetic on Koblitz curves
- Point compression for the trace zero subgroup over a small degree extension field
- Sharp upper bounds for arithmetic in hyperelliptic function fields
- An introduction to hyperelliptic curve arithmetic
- Group law computations on Jacobians of hyperelliptic curves
- Sublinear scalar multiplication on hyperelliptic Koblitz curves
- The Q-curve construction for endomorphism-accelerated elliptic curves
- Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three
- Empirical optimization of divisor arithmetic on hyperelliptic curves over \(\mathbb{F}_{2^m}\)
- Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomor\-phisms
- An optimal representation for the trace zero subgroup
- Efficient reduction of large divisors on hyperelliptic curves
- The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems
- Index calculus in the trace zero variety
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530230)
