Counting Points in Medium Characteristic Using Kedlaya's Algorithm

DOI10.1080/10586458.2003.10504508zbMath1076.11038MaRDI QIDQ4651432

Pierrick Gaudry, Nicolas Gürel

Publication date: 21 February 2005

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51827

zbMATH Keywords

cryptography; hyperelliptic curves; \(p\)-adic cohomology; point counting; Kedlaya's algorithm

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

11Y16: Number-theoretic algorithms; complexity

14H45: Special algebraic curves and curves of low genus

14H40: Jacobians, Prym varieties

11G20: Curves over finite and local fields

14Q05: Computational aspects of algebraic curves

Related Items

𝑝-adic point counting on singular superelliptic curves, Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox, Point counting on Picard curves in large characteristic, Approximating Euler products and class number computation in algebraic function fields, Computing zeta functions of superelliptic curves in larger characteristic, Fast arithmetic in unramified \(p\)-adic fields, Moments of zeta functions associated to hyperelliptic curves over finite fields, A generic approach to searching for Jacobians

Uses Software

• gmp
• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing zeta functions of Kummer curves via multiplicative characters
• Fast computation of canonical lifts of elliptic curves and its application to point counting.
• Counting points on elliptic curves over finite fields
• A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2
• Satoh's algorithm in characteristic 2
• Counting points on curves and Abelian varieties over finite fields