scientific article; zbMATH DE number 2086894

MaRDI QIDQ4737494zbMATH OpenFDO

Authors Jan Denef, Frederik Vercauteren

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2369/23690308.htm

zbMATH Keywords

cryptographyHyperelliptic curvesKedlaya's algorithmLauder-Wan algorithmMonsky-Washnitzer cohomology

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Zeta functions and related questions in algebraic geometry (e.g., Birch-Swinnerton-Dyer conjecture) (14G10) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
• Counting Points in Medium Characteristic Using Kedlaya's Algorithm
• scientific article; zbMATH DE number 1942432
• Kedlaya's Algorithm in Larger Characteristic
• Computing Zeta Functions of Artin–schreier Curves over Finite Fields

Cited in

(9)

• Computing zeta functions of Artin-Schreier curves over finite fields. II
• An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
• Report on the Denef-Vercauteren/Kedlaya algorithm
• scientific article; zbMATH DE number 1942432 (Why is no real title available?)
• Computing Zeta Functions of Artin–schreier Curves over Finite Fields
• Kedlaya's Algorithm in Larger Characteristic
• Approximating Euler products and class number computation in algebraic function fields
• A quasi quadratic time algorithm for hyperelliptic curve point counting
• Decoding by rank-2 bundles over plane quartics

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 Q4737494)