Abstract
This paper proposes two ideas for modular exponentiation using Montgomery method. (1) A novel algorithm for modular exponentiation without operation of subtracting N for every Montgomery’s modular multiplication (MMM). (2) Two types of systolic-array for MMM which can realize more efficient and flexible chip implementation than the array in [1].
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
K. Iwamura, T. Matsumoto and H. Imai, “High-speed implementation methods for RSA scheme,” to appear in Advances in Cryptology — EUROCRYPT’92, Springer-Verlag (a primary version has appeared in EUROCRYPT’92 EXTENDED ABSTRACTS, pp.215–224).
P.L. Montgomery, “Modular multiplication without trial division,” Math.of Computation, Vol.44, pp.519–521, 1985.
S.R. Dussé and B.S. Kaliski Jr., “A cryptographic library for Motorola DSP56000.” Advances in Cryptology — EUROCRYPT’90, pp.230–244, Springer-Verlag.
S. Even, “Systolic modular multiplication,” Advances in Cryptology — CRYPTO’90, pp.619–624, Springer-Verlag.
B. Dixon and A.K. Lenstra, “Massively parallel elliptic curve factoring,” EUROCRYPT’92 EXTENDED ABSTRACTS, pp.169–179.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwamura, K., Matsumoto, T., Imai, H. (1993). Systolic-Arrays for Modular Exponentiation Using Montgomery Method. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_43
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive