1. Summary
This paper describes a method for computing a modular exponentiation, useful in performing the RSA Public Key algorithm, suitable for software or hardware implementation. The method uses conventional multiplication, followed by partial modular reduction based on sums of residues. We show that for a simple recursive system where the output of partial modular reduction is the input for the next multiplication, overflow presents few problems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Baker, P.W. ‘Fast computation of A*B mod N’ IEE Electronics Letters, Vol.23, No.15, 16 July 1987, pp794.
Blakley, G.R. ‘A Computer Algorithm for Calculating the Product AB Mod M’ IEEE Trans. Comp. Vol.C32 No.5 May 1983
Brickell, E.F. ‘A Fast Modular Multiplication Algorithm with application to two-key Cryptography’ In “Advances in Cryptology”, conf. proc. Crypto’82, Plenum Press, 1982.
Ngo-Chen, I., Willoner, R. ‘An O(n) Parallel Multiplier having Bit Sequential Input and Output’ IEEE Trans. Comp. Vol.C28 No.10 Oct.1979
Ngo-Chen, I., Willoner, R. ‘An Algorithm for Modular Exponentiation’ Proc. 5th Symp. Comp. Arith. IEEE 1981
Rivest, R.L., Shamir, A., and Adleman, L. ‘On Digital Signatures and Public Key Cryptosystems’, Comms. ACM, Vol.21, No.2, Feb. 1978 pp120–126
Selby, A., Mitchell, C. ‘Algorithms for Software Implementations of RSA’ IEE Proc. May 1989 Vol.136 Part E No.3 p166
Strader, N.R., Rhynne, V.T. ‘A Canonical Bit Sequential Multiplier’ IEEE Trans. Comp. Vol.C31 No.8 Aug. 1982
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Findlay, P.A., Johnson, B.A. (1990). Modular Exponentiation Using Recursive Sums of Residues. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_35
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_35
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive