Abstract
The described architecture of a modular exponentiation unit with systolic modular multipliers shows the following features:
-
•
simple VLSI-implementation based on systolic arrays, which are improved versions of the multipliers proposed in [Atrubi65]
-
•
two identical systolic arrays for the implementation of Montomery's modulo multiplication method
-
•
small data-paths because of the serial operation mode
-
•
the required number of clock cycles for a modular multiplication depends on the actual size of the operands and not on the size of the systolic arrays
-
•
By the separation of the cells in the middle of the systolic arrays, the modular multiplier can be reconfigured such that two modular multipliers are available for the multiplication of operands with half of the size. This can be used for the parallel processing of an exponentiation using a half-sized modulus (less security requirements) or for an application of the Chinese Remainder Theorem.
-
•
The throughput and the area demand of a chip for modular exponentiations based on this architecture can be widely effected by the selection of the design parameters (base b, number of modular multipliers, number of registers).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Alia, Giuseppe; Martinelli, Enrico: “A VLSI Modulo m Multiplier”, IEEE Transactions on Computers, Vol. 40, No. 7, pp. 873–878, July 1991
Atrubin, A.J.: “A One-Dimensional Real-Time Iterative Multiplier”, IEEE Transactions on Computers, Vol. 14, pp. 394–399, 1965
Brickel, Ernest F.: “A Survey of Hardware Implementations of RSA”, in Brassard, G. (Ed.): “Advances in Cryptology — Crypto '89”, Proceedings (Lecture Notes in Computer Science 435), pp. 368–370, Springer, 1989
Brickell, E.; Gordon, D.M.; McCurley, K.; et.al.: “Fast Exponentiation with Precomputation”, appears in Proceedings of EUROCRYPT'92, Springer, 1992
Dusse, Stephen R.; Kaliski, Burton S.: “A Cryptographic Library for the Motorola DSP56000”, in Damgard, I.B. (Ed.): “Advances in Cryptology — EUROCRYPT '90”, Proceedings (Lecture Notes in Computer Science 473), pp. 230–244, Springer, 1990
Eldridge, Stephen E.: “A Faster Modular Multiplication Algorithm”, Intern. J. Computer Math., Vol. 40, pp. 63–68
Eldridge, Stephen E.; Walter, Colin D.: “Hardware Implementations of Montgomery's Modular Multiplication Algorithm”, IEEE Transactions on Computers, to appear
Even, Shimon: “Systolic Modular Multiplication”, in Menezes, A.J.; Vanstone, S.A.(Eds.): “Advances in Cryptology — Crypto'90”, Proceedings (Lecture Notes in Computer Science 537), pp. 619–624, Springer, 1990
Iwamura, K.; Matsumoto, T.; Imai, H.: “High-Speed Implementation Methods for RSA Scheme”, appears in Proceedings of EURORYPT'92, 1992
Iwamura, K.; Matsumoto, T.; Imai, H.: “Modular Exponentiation Using Montgomery Method and the Systolic-Array”, IEICE Technical Report, Vol. 92, No. 134, pp. 49–54, ISEC92-7, 1992
Knuth, Donald E.: “The Art of Computer Programming, Vol. 2: Seminumerical Algorithms”, Second Edition, Addison-Wesley, Reading, Massachusetts, 1981
Koc, C. K.; Hung, C. Y.: “Bit-Level Systolic Arrays for Modular Multiplication”, Journal of VLSI Signal Processing, Vol. 3, pp. 215–223, Kluwer Academic Publishers, Boston, 1991
Kung, H. T.; Leierson, C. E.: “Systolic Arrays (for VLSI)” in Proc. Sparse Matrix Symp. SIAM, pp. 256–282, 1978
Kung, H. T.: “Why Systolic Architectures?”, Computer, Vol. 15, No. 1, pp. 37–46, IEEE, January 1982
Lippitsch, P.; Posch, K.C.; Posch, R.: “Multiplication As Parallel As Possible”, Institute for Information Processing Graz, Report 290, October 1990
Montgomery, P. L.: “Modular Multiplication Without Trial Division”, Mathematics of Computation, Vol. 44, No. 170, pp. 519–521, April 1985
Morita, Hikaru: “A Fast Modular-Multiplication Module for Smart Cards”, Proceedings of AUSCRYPT '90 (Lecture Notes in Computer Science 453), pp. 406–409, Springer, January 1990
Orup, H.; Svendsen, E.; Andreasen, E.: “VICTOR — and efficient RSA hardware implementation”, in Damgard, I.B. (Ed.): “Advances in Cryptology — EUROCRYPT '90”, Proceedings (Lecture Notes in Computer Science 473), pp. 245–252, Springer, 1990
Sauerbrey, Jörg; Dietel, Andreas: “Resource Requirements for the Application of Addition Chains in Modulo Exponentiation”, appears in Proceedings of EUROCRYPT'92, Springer, 1992
Shand, M.; Bertin, P.; Vuillemin, J.: “Hardware speedups in long integer multiplication”, in Proceedings of the Second ACM Symposium on Parallel Algorithms and Architectures, Crete, July 1990
Siemens: “Semicustom ICs; CMOS Family SCxE6; Sea-of-Gates Gate Arrays”, V1.0, Version May '92
Walter, Colin D.: “Systolic Modular Multiplication”, IEEE Transactions on Computers, to appear
Zhan, C.N.; Martin, H.L.; Yun, D.Y.: “Parallel Algorithms and Systolic Array Designs for RSA Cryptosystem”, International Conference on Systolic Arrays, Proceedings, pp. 341–350, May 1988
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sauerbrey, J. (1993). A modular exponentiation unit based on systolic arrays. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_88
Download citation
DOI: https://doi.org/10.1007/3-540-57220-1_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57220-6
Online ISBN: 978-3-540-47976-5
eBook Packages: Springer Book Archive