Abstract
There are a number of techniques known for speeding up modular multiplication, which is the main arithmetic operation in RSA cryptography. This note shows how to gain speed by scaling the modulus. Resulting hardware is limited only by the speed of addition.1 Detailed analysis of fan out shows that over existing methods the speedup is potentially as much as two-fold. This is because the addition and fan out can now be done in parallel. Of course, in RSA the modulus can be chosen to need no scaling, so that most of the minor extra costs are eliminated.
J.-J. Quisquater informed me at the conference that he had spoken on a similar technique for software in the rump session at Eurocrypt ’90, but nothing appears in the Proceedings.
Chapter PDF
Similar content being viewed by others
Key Words
References
D. E. Atkins, Higher Radix Division using Estimates of the Divisor and Partial Remainders, IEEE Trans. Comp., vol. C-17, 1968, pp. 925–934.
E. F. Brickell, A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography, Advances in Cryptology (Proceedings of Crypto 82) ed. Chaum et al., Plenum, 1983, pp. 51–60.
S. E. Eldridge and C. D. Walter, Montgomery’s Algorithm for Fast Modular Multiplication, IEEE Trans. Comp., to appear.
M. D. Ercegovac and T. Lang, Simple Radix-4 Division with Operands Scaling, IEEE Trans. Comp., vol. 39, 1990, pp. 1204–8.
R. L. Rivest, A. Shamir and L. Adleman, A Method of Obtaining Digital Signatures and Public Key Cryptosystems, Comm. ACM, vol. 21, 1978, pp. 120–126.
G. S. Taylor, Radix 16 SRT Dividers with overlapped Quotient Selection Stages, Proc. IEEE 7th Symp. Comp. Arith., 1985, pp. 64–73.
C. D. Walter, Fast Modular Multiplication using 2-Power Radix, Intern. J. Computer Maths., vol. 39, 1991, pp. 21–28.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walter, C.D. (1992). Faster Modular Multiplication by Operand Scaling. In: Feigenbaum, J. (eds) Advances in Cryptology — CRYPTO ’91. CRYPTO 1991. Lecture Notes in Computer Science, vol 576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46766-1_26
Download citation
DOI: https://doi.org/10.1007/3-540-46766-1_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55188-1
Online ISBN: 978-3-540-46766-3
eBook Packages: Springer Book Archive