Skip to main content
Log in

FPGA implementation of RSA public-key cryptographic coprocessor based on systolic linear array architecture

  • Published:
Journal of Electronics (China)

Abstract

In order to make the typical Montgomery’s algorithm suitable for implementation on FPGA, a modified version is proposed and then a high-performance systolic linear array architecture is designed for RSA cryptosystem on the basis of the optimized algorithm. The proposed systolic array architecture has distinctive features, i.e. not only the computation speed is significantly fast but also the hardware overhead is drastically decreased. As a major practical result, the paper shows that it is possible to implement public-key cryptosystem at secure bit lengths on a single commercially available FPGA.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44 (1985), 519–521.

    Article  MathSciNet  MATH  Google Scholar 

  2. R. Rivest, A. Shamir, L. Adleman. A method for obtaining digital signatures and public key cryptosystem. Communications of the ACM, 21(1978), 120–126.

    Article  MathSciNet  MATH  Google Scholar 

  3. Gael Hachez, Jean-Jacques Quisquter. Montgomery exponentiation with no final subtractions: improved results. http://www.dice.ucl.ac.be.

  4. Ç. K. Koç, C. Y. Hung. Bit-level systolic arrays for modular multiplication. J. VLSI Signal Processing, 3(1991)3, 215–223.

    Article  Google Scholar 

  5. C. D. Walter. Systolic modular multiplication. IEEE Transactions on Computers, 42(1993)3, 376–378.

    Article  Google Scholar 

  6. T. Blum, C. Paar. Montgomery modular exponentiation on reconfigurable hardware. 14th IEEE Symp. on Computer Arithmetic, Adelaide, Australia, 1999, 70–77.

    Google Scholar 

  7. Taek-Won Kwon, Chang-Seok You, Won-Seok Heo, Yong-Kyu Kang, Jun-Rim Choi. Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified Montgomery algorithm. 0-7803-6685-9/01, 2001, IEEE.

  8. Alan Daly, William Marine. Efficient architectures for implementing Montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic. FPGA’02, Monterey, California, USA, February 24–26, 2002, 40–49.

    Google Scholar 

  9. Tin Yuan, Wang Chao. RSA cryptosystem based on modified systolic array. Electron Device, 25(2002)4, 448–452.

    Google Scholar 

  10. Li Shuguo, Zhou Runde, Feng Jianhua, Sun Yihe. The implementation of RSA coprocessor. Acta Electronica Sinica, 29(2001)11, 1441–1444.

    Google Scholar 

  11. B. Scheier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. 2nd ed, 2000.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wen Nuan.

About this article

Cite this article

Wen, N., Dai, Z. & Zhang, Y. FPGA implementation of RSA public-key cryptographic coprocessor based on systolic linear array architecture. J. of Electron.(China) 23, 718–722 (2006). https://doi.org/10.1007/s11767-004-0221-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11767-004-0221-0

Key words

Navigation