Skip to main content

Design of Low Power Montgomery Multiplier Using Clock Technique

  • Conference paper
  • First Online:
Advances in Bioinformatics, Multimedia, and Electronics Circuits and Signals

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

  • 425 Accesses

Abstract

Looking at the current scenario, digital systems are more beneficial than the analog system. The power consumption and speed are the major performance criteria for any digital system. It is very important to have a high speed and less power consumption in all devices. The priority of having a high speed or less power consumption depends on the need of the system. This paper presents the implementation of high-performance Montgomery modular multiplier which is also low power consuming. It works upon a simple and efficient Montgomery multiplication algorithm. Hardware as well as software fields find applications of Montgomery modular multiplication. Hardware implementations use direct data path, making them faster in contrast to software implementations. Some real-time applications of software implementations are not fast enough; the reason being their flexibility. Such kind of implementations hasve an additive advantage that they are capable of being customized as per new algorithms. The power consumption of the proposed design is 14mW and has been improved by 59.1% from the existing design.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. A. Miyamoto, N. Homma, T. Aoki, A. Satoh, Systematic design of RSA processors based on high-radix montgomery multipliers. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 19(7), 1136–1146 (2011)

    Article  Google Scholar 

  2. Y. Gong, S. Li, High-throughput FPGA implementation of 256-bit montgomery modular multiplier, in Second International Workshop on Education Technology and Second International Workshop on Education Technology and Computer Science (2010), pp. 173–177

    Google Scholar 

  3. A. Ibrahim, F. Gebali, H. El-Simary, A. Nassar, High-performance, low-power architecture for scalable radix 2 montgomery modular multiplication algorithm. Can. J. Elect. Comput. Eng. 34(4), (Fall 2009)

    Article  Google Scholar 

  4. G. Gaubatz, Versatile Montgomery Multiplier Architectures, in April, 2002

    Google Scholar 

  5. M.M. Sandoval, C.F. Uribe, R. Cumplido, I.A. Badillo, An area/performance trade-off analysis of a GF(2 m) multiplier architecture for elliptic curve cryptography. Elsevier-Comput. & Electr. Eng. 35(1), 54–58 (2007)

    Article  Google Scholar 

  6. C. McIvor, M. Mc Loone, J.V Mc Canny, High speed, low latency RSA decryption silicon core, IEEE, 133–136 (2003)

    Google Scholar 

  7. W.-C. Lin, J.-H. Ye, M.-D. Shieh, Scalable montgomery modular multiplication architecture with low-latency and low-memory bandwidth requirement. IEEE Trans. Comput. 63(2), 475–483 (2014)

    Article  MathSciNet  Google Scholar 

  8. A. Ibrahim, F. Gebali, H. Elsimary, New and improved word-based unified and scalable architecture for radix 2 montgomery modular multiplication algorithm. IEEE (2013)

    Google Scholar 

  9. H. Nozaki, M. Motoyama, A. Shimbo, S. Kawamura, Implementation of RSA Algorithm Based on RNS Montgomery Multiplication, (Corporate Research and Development Center, Toshiba Corporation 1, Komukai Toshiba-cho, Saiwai- ku, Kawasaki, Japan, 2001), pp. 364-376

    Google Scholar 

  10. X. Wang, P. Noel, T. Kwasniewski, Low power design techniques for a montgomery modular multiplier, in Proceedings of 2005 International Symposium on Intelligent Signal Processing and Communication Systems (2005), pp. 449–452

    Google Scholar 

  11. C. McIvor, M. Mc Loone, J.V Mc Canny, High-radix systolic modular multiplication on reconfigurable hardware, in IEEE, (Fall 2005); A.F. Tenca, C.K. Koc, A Scalable architecture for modular multiplication based on montgomery’s algorithm. IEEE Trans. Comput. 52(9), (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ruqaiya Khanam .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Khanam, R., Khan, R., Parashar, P. (2020). Design of Low Power Montgomery Multiplier Using Clock Technique. In: Jain, L., Virvou, M., Piuri, V., Balas, V. (eds) Advances in Bioinformatics, Multimedia, and Electronics Circuits and Signals. Advances in Intelligent Systems and Computing, vol 1064. Springer, Singapore. https://doi.org/10.1007/978-981-15-0339-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-0339-9_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-0338-2

  • Online ISBN: 978-981-15-0339-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics