Skip to main content
SpringerLink
Log in

Design of a New Kind of Encryption Kernel Based on RSA Algorithm

  • Conference paper
Book cover Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3802))

Included in the following conference series:

Abstract

Fast realization of RSA algorithm by hardware is a significant and challenging task. In this paper an ameliorative Montgomery algorithm that makes for hardware realization to actualize the RSA algorithm is proposed. This ameliorative algorithm avoids multiplication operation, which is easier for hardware realization. In the decryption and digital signature process, a combination of this ameliorative Montgomery algorithm and the Chinese remainder theorem is applied, which could quadruple the speed of the decryption and digital signature compared to the encryption. Furthermore, a new hardware model of the encryption kernel based on the ameliorative Montgomery is founded whose correctness and feasibility is validated by Verilog HDL in practice.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tenca, A.F.: A Scalable Architecture for Modular Multiplication Based on Montgomery’s Algorithm. IEEE Trans. Computers 52(9), 1215–1220 (2003)

    Article  Google Scholar 

  2. Eldridge, S.E., Walter, C.D.: Hardware Implementation of Montgomery’s Modular Multiplication Algorithm. IEEE Trans. Computers 42(6), 693–699 (1993)

    Article  Google Scholar 

  3. Montgomery, P.L.: Modular multiplication without trial division. Math. Computation 44(170), 519–521 (1985)

    Article  MATH  Google Scholar 

  4. Kaihara, M.E., Takagi, N.: A hardware algorithm for modular multiplica-tion/division. IEEE Trans. Computers 54(1), 12–21 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Engineer School, University of Science and Technology, Beijing, Beijing, 100083, China

    Ping Dong, Xiangdong Shi & Jiehui Yang

Authors
  1. Ping Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiangdong Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiehui Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yu-Ping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security(Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dong, P., Shi, X., Yang, J. (2005). Design of a New Kind of Encryption Kernel Based on RSA Algorithm. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_4

Download citation

  • DOI: https://doi.org/10.1007/11596981_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30819-5

  • Online ISBN: 978-3-540-31598-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation