Skip to main content
SpringerLink
Log in

Study of Modified Montgomery’s Algorithm and Its Application to 1,024-bit RSA

  • Conference paper
  • First Online:
Book cover Proceedings of International Conference on Soft Computing Techniques and Engineering Application

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 250))

Abstract

The modified Montgomery algorithm made the modular multiplication simple using addition and shifting. We introduce four-to-two CSA architecture to design the modified Montgomery’s algorithm. It cannot convert the carry-save form of an operand into its binary representation at each end of modular multiplication. At the end of RSA, we use the basic 4-CPA to accomplish the data form conversion. As a result, our design can reduce the operating time. This architecture adapts to the single chip for key lengths in excess of 1,024 bits of RSA.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signature and public-key cryptosystems. Commun. ACM 21, 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  2. Koc, C.K., Acar, T., Kaliski Jr, B.S.: Analyzing and comparing Montgomery multiplication algorithms, vol. 16. IEEE Micro, pp. 26–33 (1996)

    Google Scholar 

  3. Kwon, T.W., You, C.S., Heo, W.S., Kang, Y.K., Choi, J.R.: Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified Montgomery algorithm. Proceedings of IEEE International Symposium on Circuits System, vol. 4. pp. 650–653 (2001)

    Google Scholar 

  4. Cilardo, A., Mazzeo, A., Romano L., Saggese, G.P.: Carry-save Montgomery modular exponentiation on reconfigurable hardware. IEEE Proceedings of the conference on Design, automation and test in Europe-vol. 3. pp. 206–211 (2004)

    Google Scholar 

  5. McIvor, C., McLoone, M., McCanny, J.V.: Fast Montgomery modular multiplication and RSA cryptographic processor architectures. 37th Asilomar Conference on Signals, Systems and Computers, vol. 1. pp. 379–384 (2003)

    Google Scholar 

  6. Shieh, M.D., Chen, J.H., Wu, H.H., Lin, W.C.: A new modular exponentiation architecture for efficient design of rsa cryptosystem. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 16. pp. 1151–1161 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shandong Provincial Key Laboratory of Network Based Intelligent Computing, 250022, Jinan, People’s Republic of China

    Yulin Zhang & Xinggang Wang

Authors
  1. Yulin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinggang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yulin Zhang .

Editor information

Editors and Affiliations

  1. Dept of Computer Science and Engineering, SOA University, Bhubaneswar, Orissa, India

    Srikanta Patnaik

  2. Electronics and Computer Engg Tech., Indiana State University, Indiana, Indiana, USA

    Xiaolong Li

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Zhang, Y., Wang, X. (2014). Study of Modified Montgomery’s Algorithm and Its Application to 1,024-bit RSA. In: Patnaik, S., Li, X. (eds) Proceedings of International Conference on Soft Computing Techniques and Engineering Application. Advances in Intelligent Systems and Computing, vol 250. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1695-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1695-7_20

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1694-0

  • Online ISBN: 978-81-322-1695-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation