Efficient Computation of Roots in Finite Fields

15 years 11 months ago

Download www.ma.utexas.edu

We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms, which need O(rm3 log3 q) steps.

Paulo S. L. M. Barreto, José Felipe Voloch

Real-time Traffic

Certain Choices | Computer Graphics | DCC 2006 |

claim paper

» Detecting Rational Points on Hypersurfaces over Finite Fields

» Efficient dot product over wordsize finite fields

» Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis

» Efficient Multivariate Factorization over Finite Fields

» Trading GRH for algebra algorithms for factoring polynomials and related structures

» Achieving efficient polynomial multiplication in fermat fields using the fast Fourier tran...

» Efficient simulation for tail probabilities of Gaussian random fields

» Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction

Post Info
More Details (n/a)

Added	25 Dec 2009
Updated	25 Dec 2009
Type	Conference
Year	2006
Where	DCC
Authors	Paulo S. L. M. Barreto, José Felipe Voloch

Comments (0)

Sciweavers

Efficient Computation of Roots in Finite Fields

Certain Choices | Computer Graphics | DCC 2006 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers