Advertisement

O(log(n)) parallel time finite field inversion

  • Bruce E. Litow
  • George I. Davida
NC Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 319)

Abstract

Let p be prime and assume that GF(p n ) is given via an irreducible nth degree GF(p) polynomial. We exhibit a boolean circuit of size n O(1) and depth O(log(n)) such that for any x ε GF(p n ) the circuit produces x −1. The circuit is based upon an interesting connection between finite field computations and the eigenvalues of certain matrices. The issue of circuit uniformity is also considered.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P. Beame,S. Cook,H. Hoover,“Log Depth Circuits for Division and Related Problems”, SIAM J. Comput.,vol.15,no.4,pp.994–1003,1986MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    S. Berkowitz, “On Computing the Determinant in Small Parallel Time using a Small Number of Processors”,Inf.Proc.Lett.,vol.18, pp.147–150,1984MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    E. Berlekamp,Algebraic Coding Theory,McGraw-Hill,1968Google Scholar
  4. 4.
    S. Cook, “A Taxonomy of Problems with Fast Parallel Algorithms”, Inf. and Control, vol.64,pp.2–22,1985MATHCrossRefGoogle Scholar
  5. 5.
    L. Csanky, “Fast Parallel Matrix Inversion Algoritms”, SIAM J. Comput.,vol.5,pp.618–623, 1976MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    G.Davida,B.Litow, “Fast Parallel Inversion in Finite Fields”,19th CISS at Johns Hopkins,pp.305–308,1985Google Scholar
  7. 7.
    G. Davida,B.Litow, “Fast Parallel Comparison and Division in Modular Representation 1987,in preparationGoogle Scholar
  8. 8.
    G. Davida, “Inverse of Elements of a galois Field”, Electronics Lett.,vol.8,21,Oct.1972Google Scholar
  9. 9.
    N.Koblitz,p-Adic Analysis and Zeta Functions,GTM 58,Springer Verlag,1977Google Scholar
  10. 10.
    B.Litow, “Complexity of Polynomial Root Approximation”,manuscript,1987Google Scholar
  11. 11.
    K. Mulmuley, “A Fast Parallel Algorithm to Compute the Rank of a matrix Over an Arbitrary Field”,Proc. 18th ACM STOC,pp.338–339,1986Google Scholar
  12. 12.
    W. Ruzzo, “On Uniform Circuit Complexity”, JCSS,vol. 22,pp.365–383,1981MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Bruce E. Litow
    • 1
  • George I. Davida
    • 1
  1. 1.Electrical Engineering and Computer Science DepartmentUniversity of Wisconsin-MilwaukeeUSA

Personalised recommendations