Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems
From MaRDI portal
Publication:4216666
DOI10.1017/S000497270003207XzbMath0915.11058MaRDI QIDQ4216666
Publication date: 23 June 1999
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
hyperelliptic curveJacobi sumslattice basis reductionhyperelliptic cryptosystemsnumber of points on the Jacobian
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Gauss and Kloosterman sums; generalizations (11L05) Other character sums and Gauss sums (11T24) Algebraic number theory computations (11Y40) Cyclotomy (11T22)
Related Items
Fast cryptography in genus 2 ⋮ Remarks on the zeta function of some diagonal hyperelliptic curves ⋮ Computation of Jacobi sums of orders \(l^2\) and \(2l^2\) with odd prime \(l\) ⋮ Cyclotomic problem, Gauss sums and Legendre curve ⋮ Some computational aspects of Jacobians of curves in the family \(y^3=\gamma x^5+\delta\) over \(\mathbb F_p\) ⋮ Counting points of the curve \(y^2=x^{12}+a\) over a finite field ⋮ Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems ⋮ Hyperelliptic curves with compact parameters ⋮ Complete congruences of Jacobi sums of order \(2l^2\) with prime \(l\)
Cites Work
- Unnamed Item
- Unnamed Item
- On principal ideal testing in algebraic number fields
- Hyperelliptic cryptosystems
- Factoring polynomials with rational coefficients
- Euclid's Algorithm in Cyclotomic Fields
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- Numbers of solutions of equations in finite fields