Sieving in Function Fields
From MaRDI portal
Recommendations
Cites work
- Algorithmic number theory. 1st international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994. Proceedings
- Computing discrete logarithms in real quadratic congruence function fields of large genus
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- scientific article; zbMATH DE number 3510453 (Why is no real title available?)
- scientific article; zbMATH DE number 1005261 (Why is no real title available?)
- scientific article; zbMATH DE number 802334 (Why is no real title available?)
- Hyperelliptic cryptosystems
- Integer matrix diagonalization
- Real and imaginary quadratic representations of hyperelliptic function fields
Cited in
(8)- Weil descent of Jacobians.
- A simple method for obtaining relations among factor basis elements for special hyperelliptic curves
- Arithmetic on superelliptic curves
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
- Explicit bounds and heuristics on class numbers in hyperelliptic function fields
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- A new method for decomposition in the Jacobian of small genus hyperelliptic curves
- Computing a group action from the class field theory of imaginary hyperelliptic function fields
This page was built for publication: Sieving in Function Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4947131)