scientific article; zbMATH DE number 1942432
From MaRDI portal
Publication:4409130
zbMath1023.14007MaRDI QIDQ4409130
Publication date: 30 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420369.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityhyperelliptic curveMonsky-Washnitzer cohomologyKedlaya's algorithmalgorithm for computing the zeta-function
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05)
Related Items (15)
Sublinear Scalar Multiplication on Hyperelliptic Koblitz Curves ⋮ A quasi quadratic time algorithm for hyperelliptic curve point counting ⋮ The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic ⋮ Hyperelliptic Integrals to Elliptic Integrals ⋮ Point counting in families of hyperelliptic curves ⋮ Higher-dimensional 3-adic CM construction ⋮ Algebraic curves and cryptography ⋮ Fast arithmetic in unramified \(p\)-adic fields ⋮ A generic approach to searching for Jacobians ⋮ Quasi-quadratic elliptic curve point counting using rigid cohomology ⋮ Binary Kloosterman Sums with Value 4 ⋮ Computing zeta functions of Artin-Schreier curves over finite fields. II ⋮ A \(p\)-adic point counting algorithm for elliptic curves on Legendre form ⋮ An efficient deterministic test for Kloosterman sum zeros ⋮ Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
This page was built for publication:
