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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
J. von zur GATHEN, Computing powers in parallel. SIAM J. Comput., 16 (1987), pp. 930–945.
N. KOBLITZ, P-adic fields, p-adic analysis and dzeta functions. Mir, Moscow, 1982.
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.
J. REIF, Logarithmic depth circuits for algebraic functions. SIAM J. Comput., 15 (1986), pp. 231–242.
T. ZEUGMANN, Improved parallel computations in the ring ℤ/pa. Journal of Information Processing and Cybernetics, 25 (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mňuk, M. (1990). A DIV(N) depth Boolean circuit for smooth modular inverse. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_40
Download citation
DOI: https://doi.org/10.1007/3-540-53414-8_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53414-3
Online ISBN: 978-3-540-46869-1
eBook Packages: Springer Book Archive