A Novel Systolic Architecture for an Efficient RSA Implementation

Moshopoulos, Nikos K.; Pekmestzi, K.Z.

doi:10.1007/3-540-44586-2_30

Nikos K. Moshopoulos⁵ &
K.Z. Pekmestzi⁵

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1992))

Included in the following conference series:

International Workshop on Public Key Cryptography

1260 Accesses

Abstract

A new systolic serial-parallel scheme that implements the Montgomery multiplier is presented. The serial input of this multiplier consists of two sets of data that enter in a bit-interleaved form. The results are also derived in the same form. The design, with minor modifications, can be used for the implementation of the RSA algorithm. The circuit yields low hardware complexity and permits high-speed operation with 100% efficiency.

Download to read the full chapter text

Chapter PDF

Low Power Semi-systolic Architectures for Polynomial-Basis Multiplication over GF(2^m) Using Progressive Multiplier Reduction

Article 19 April 2015

Systolic Arrays

A Scalable and Systolic Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems Based on DSPs

Article 01 September 2017

References

RIVEST, R. L., SHAMIR, A., ADLEMAN, L.: “A method for obtaining digital signature and public-key cryptosystems”, Commun. ACM, 1978, VOL. 21, pp. 120–126.
Article MathSciNet MATH Google Scholar
MONTGOMERY, P. L.: “Modular multiplication without trial division”, Math. Computation, 1985, VOL. 44, pp.519–521.
Article MathSciNet MATH Google Scholar
ELDRIDGE, S.E., WALTER, C. D.: “Hardware Implementation of Montgomery’s modular multiplication algorithm”, IEEE Trans. On Computers, 1993, VOL. 42, NO 6, pp. 693–699.
Article Google Scholar
KORNERUP, P.,: “A systolic, linear-array multiplier for a class of right-shift algorithms”, IEEE Trans. On Comput., 1994, VOL. 43, NO. 8, pp. 892–898.
Article MATH Google Scholar
YANG, C., CHANG, T., JEN, C.: “A new RSA cryptosystem hardware design based on Montgomery algorithm”, IEEE Trans. On Circuits and Systems II, 1998, VOL. 45, NO 7, pp. 908–913.
Article MATH Google Scholar
C. Y. SU, S. A HWANG, P. S. CHEN, C. W. WU, “An improved Montgomery’s algorithm for high-speed RSA Public-Key cryptosystem” IEEE Transactions on VLSI Systems, 1999, VOL. 7, no. 2, pp. 280–284.
Article Google Scholar

Download references

Author information

Authors and Affiliations

National Technical University of Athens, Iroon Polytechneiou 9, 15773, Zographou, Athens, Greece
Nikos K. Moshopoulos & K.Z. Pekmestzi

Authors

Nikos K. Moshopoulos
View author publications
You can also search for this author in PubMed Google Scholar
K.Z. Pekmestzi
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Information and Communications University,Information Security Group, 58-4 Hwaam-dong,Yusong-gu, 305-732, Taejon, Korea
Kwangjo Kim

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Moshopoulos, N.K., Pekmestzi, K. (2001). A Novel Systolic Architecture for an Efficient RSA Implementation. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_30

Download citation

DOI: https://doi.org/10.1007/3-540-44586-2_30
Published: 05 June 2001
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics