Abstract
A new compact modular multiplication algorithm based on a higher radix can reduce the amount of processing to half or less that of conventional algorithms. When applied to smart cards, the new division method can reduce the number of memory access events. Consequently, a module containing 3 Kbits of RAM and a 3-Kgate operation unit will calculate a 512-bit modular exponentiation in under two seconds at a 4-MHz clock.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
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.
Baker, P.W., “Fast Computation of A * B Modulo N,” Electron.Lett., Vol.23, No.15, pp.794–795, July 1987.
Morita, H., “A Fast Modular-multiplication Algorithm based on a Higher Radix,” CRYPTO'89 Abstracts, pp.363–375, Aug. 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morita, H. (1990). A fast modular-multiplication module for smart cards. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030379
Download citation
DOI: https://doi.org/10.1007/BFb0030379
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53000-8
Online ISBN: 978-3-540-46297-2
eBook Packages: Springer Book Archive