Fast arithmetic in unramified p-adic fields
From MaRDI portal
Publication:973961
DOI10.1016/J.FFA.2009.12.004zbMATH Open1208.11132arXiv0906.5510OpenAlexW2021359997MaRDI QIDQ973961FDOQ973961
Authors: Hendrik Hubrechts 
Publication date: 26 May 2010
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Abstract: Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work of Kedlaya and Umans about modular composition of polynomials, we achieve quasi-linear time algorithms in the parameters n and N, and quasi-linear or quasi-quadratic time in log p, for most basic operations on these fields, including Galois conjugation, Teichmuller lifting and computing minimal polynomials.
Full work available at URL: https://arxiv.org/abs/0906.5510
Recommendations
Cites Work
- Title not available (Why is that?)
- Fast polynomial factorization and modular composition
- Title not available (Why is that?)
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- An extension of Satoh's algorithm and its implementation
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Fast construction of irreducible polynomials over finite fields
- Counting points on elliptic curves over finite fields
- Fast computation of GCDs
- Counting solutions to equations in many variables over finite fields
- The canonical lift of an ordinary elliptic curve over a finite field and its point counting
- Computing zeta functions of nondegenerate curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deformation theory and the computation of zeta functions
- Kedlaya's Algorithm in Larger Characteristic
- Title not available (Why is that?)
- Proof of a Mixed Arithmetic-Mean, Geometric-Mean Inequality
- An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm
- Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
- A Recursive Method for Computing Zeta Functions of Varieties
- Title not available (Why is that?)
- Computing Zeta Functions in Families of C a,b Curves Using Deformation
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING
- Title not available (Why is that?)
- Point counting in families of hyperelliptic curves
- Title not available (Why is that?)
- Computing zeta functions for ordinary formal groups over finite fields.
- Title not available (Why is that?)
- Bounding Picard numbers of surfaces using \(p\)-adic cohomology
- Point counting in families of hyperelliptic curves in characteristic 2
- Quasi-quadratic elliptic curve point counting using rigid cohomology
- Title not available (Why is that?)
- Title not available (Why is that?)
- Satoh's algorithm in characteristic 2
Cited In (8)
- Q-adic transform revisited
- Counting points on curves using a map to \(\mathbf P^1\). II.
- MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING
- Counting points on curves using a map to \(\mathbf{P}^1\)
- Computing zeta functions of arithmetic schemes
- Improvements to the deformation method for counting points on smooth projective hypersurfaces
- Computing zeta functions of cyclic covers in large characteristic
- Division and slope factorization of \(p\)-adic polynomials
This page was built for publication: Fast arithmetic in unramified \(p\)-adic fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973961)
