Parallel Powering

24 August 2005

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 31-36
https://doi.org/10.1109/sfcs.1984.715898

Abstract

A fast parallel computation for large powers of an integer module another integer is presented, assuming that the modulus has only small prime factors

Keywords

This publication has 6 references indexed in Scilit:

Very Fast Parallel Matrix and Polynomial Arithmetic
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
Comparison of arithmetic functions with respect to boolean circuit depth
Published by Association for Computing Machinery (ACM) ,1984
The parallel complexity of the abelian permutation group membership problem
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
The classification of problems which have fast parallel algorithms
Lecture Notes in Computer Science, 1983
On uniform circuit complexity
Journal of Computer and System Sciences, 1981
New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
Journal of the ACM, 1976