Fast arithmetic in unramified p-adic fields

Details Fast arithmetic in unramified p-adic fields Fast arithmetic in unramified p-adic fields

2009-06-30

arxiv.org/abs/0906.5510v1

Mathematics

Number Theory

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fast arithmetic in unramified p-adic fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast arithmetic in unramified p-adic fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast arithmetic in unramified p-adic fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-440907