Area-time optimal division for T =Ω((log n)1+ε)*
Information and Computation
SIAM Journal on Computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
| Hi-index | 14.98 |
An O(n)-depth polynomial-size combinational circuit algorithm is proposed for n-bit modular exponentiation, i.e., for the computation of xy mod m for arbitrary integers x, y, and m represented as n-bit binary integers, within bounds 2n驴1驴m