Fast arithmetic in unramified \(p\)-adic fields
From MaRDI portal
Publication:973961
DOI10.1016/j.ffa.2009.12.004zbMath1208.11132arXiv0906.5510OpenAlexW2021359997MaRDI QIDQ973961
Publication date: 26 May 2010
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.5510
Related Items (6)
Computing zeta functions of arithmetic schemes ⋮ Counting points on curves using a map to \(\mathbf P^1\). II. ⋮ Improvements to the deformation method for counting points on smooth projective hypersurfaces ⋮ Computing zeta functions of cyclic covers in large characteristic ⋮ Counting points on curves using a map to $\mathbf {P}^1$ ⋮ MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
- Point counting in families of hyperelliptic curves
- Quasi-quadratic elliptic curve point counting using rigid cohomology
- Computing zeta functions for ordinary formal groups over finite fields.
- Counting solutions to equations in many variables over finite fields
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- Counting points on elliptic curves over finite fields
- An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
- MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING
- Point Counting in Families of Hyperelliptic Curves in Characteristic 2
- Fast Polynomial Factorization and Modular Composition
- A Recursive Method for Computing Zeta Functions of Varieties
- Computing zeta functions of nondegenerate curves
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Fast computation of GCDs
- Proof of a Mixed Arithmetic-Mean, Geometric-Mean Inequality
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm
- Satoh's algorithm in characteristic 2
- Deformation theory and the computation of zeta functions
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Computing Zeta Functions in Families of C a,b Curves Using Deformation
- Kedlaya's Algorithm in Larger Characteristic
- Fast construction of irreducible polynomials over finite fields
This page was built for publication: Fast arithmetic in unramified \(p\)-adic fields
