Advertisement

A DIV(N) depth Boolean circuit for smooth modular inverse

  • Michal Mňuk
Part III Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 464)

Abstract

We present two families of Boolean circuits of depth O(log n) and size n0(1) (P uniform), and of depth O(log n loglog n) and size n0(1) (log-space uniform) for computing the modular inverse of an n-bit integer, where the modulus has only small prime factors. In the case of P uniformity the circuits presented are asymptotically best possible.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCH]
    P.W. BEAME, S.A. COOK and H.J. HOOVER, Log depth circuits for division and related problems. SIAM J. Comput., 15 (1986), pp. 994–1003.CrossRefGoogle Scholar
  2. [vzG]
    J. von zur GATHEN, Computing powers in parallel. SIAM J. Comput., 16 (1987), pp. 930–945.CrossRefGoogle Scholar
  3. [K]
    N. KOBLITZ, P-adic fields, p-adic analysis and dzeta functions. Mir, Moscow, 1982.Google Scholar
  4. [LD]
    B.E. LITOW and G.I. DAVIDA, O(log n) parallel time finite field inversion. Proc. 3rd Aegean Workshop on Computing, 1988, Lecture Notes in Computer Science 319, Springer Verlag, pp. 74–80.Google Scholar
  5. [R]
    J. REIF, Logarithmic depth circuits for algebraic functions. SIAM J. Comput., 15 (1986), pp. 231–242.Google Scholar
  6. [Z]
    T. ZEUGMANN, Improved parallel computations in the ring ℤ/pa. Journal of Information Processing and Cybernetics, 25 (1989).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Michal Mňuk
    • 1
  1. 1.Computing CenterSlovak Academy of SciencesBratislava

Personalised recommendations