Abstract
This paper presents a new fast compact modular-multiplication algorithm, which will multiply modulo N in log(N)/log(r) clock pulses when the algorithm is based on radix r (r ≥ 4).
Chapter PDF
Similar content being viewed by others
References
Rivest, R.L., Shamir, A., and Adleman, L., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm.ACM, Vol.21(2), pp.120–126, Feb.1978.
Brickell, E.F., “A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography,” Advances in Cryptology-CRYPTO’82, pp.51–60, Plenum NY, 1983.
Blakley, G.R., “A Computer Algorithm for Calculating the Product AB Modulo M,” IEEE Trans.Comput., Vol.C-32, pp.497–500, May 1983.
Hoornaert, F., Decroos, M., Vandewalle, J., and Govaerts, R., “Fast RSA-hardware: Dream or Reality?,” Advances in Cryptology-EUROCRYPT’88, pp.257–264, Springer-Verlag, 1988.
Baker, P.W., “Fast Computation of A * B Modulo N,” Electron.Lett., Vol.23, No.15, pp.794–795, July 1987.
Hwang, K., “Computer Arithmetic: Principles, Architecture, and Design,” John Wiley & Sons, 1979.
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
Morita, H. (1990). A Fast Modular-multiplication Algorithm based on a Higher Radix. 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_36
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_36
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