A DIV(N) depth Boolean circuit for smooth modular inverse
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.
Unable to display preview. Download preview PDF.
- [K]N. KOBLITZ, P-adic fields, p-adic analysis and dzeta functions. Mir, Moscow, 1982.Google Scholar
- [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
- [R]J. REIF, Logarithmic depth circuits for algebraic functions. SIAM J. Comput., 15 (1986), pp. 231–242.Google Scholar
- [Z]T. ZEUGMANN, Improved parallel computations in the ring ℤ/pa. Journal of Information Processing and Cybernetics, 25 (1989).Google Scholar