Skip to main content
SpringerLink
Log in

Low-Power, High-Speed Unified and Scalable Word-Based Radix 8 Architecture for Montgomery Modular Multiplication in GF(P) and GF(2n)

  • Research Article - Computer Engineering and Computer Science
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

This paper presents new low-power, high-speed unified and scalable word-based radix 8 architecture for Montgomery modular multiplication in GF(P) and GF(2n). This architecture has some similarities to the architecture of Huang, but it achieves more reduction in area and power consumption. To speed up the modular multiplication process, the hardware architecture employs carry-save addition to avoid carry propagation at each addition operation of the add-shift loop. To reduce power consumption, some latches called glitch blockers are employed at the outputs of some circuit modules to reduce the spurious transitions and the expected switching activities of high fan-out signals in the architecture. Also, we proposed a modified low-power dual-field 4-to-2 carry-save adder that has internal logic structure that reduces the chance of glitches occurrence. An ASIC implementation of the proposed architecture shows that it can perform 1,024-bit modular multiplication (for word size w = 32) in about 5.45 μs. Also, the results show that it has smaller Area × Time values compared to all unified and scalable designs by ratios ranging from 12.2 to 66.8 %, which makes it suitable for implementation where both area and performance are of concern. Also, it has higher throughput over them by ratios ranging from 6.0 to 80.7 %. In addition, it achieves a decrease in power consumption compared to these designs by ratios ranging from 18.8 to 52.6 %. By comparing to the designs that are not unified, it has slightly higher Area × Time and lower throughput values compared to some of them. However, it achieves a significant low-power consumption compared to all of them.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. National Institute for Standards and Technology, Digital signature standard. In: FIPS PUB 186–2 (2000)

  3. Hellman, M.: New directions on cryptography. IEEE Trans. Inf. Theory 644–654 (1976)

  4. Koblitz N.: Elliptic curve cryptosystems. Math. Comput. 48: 203–209 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Montgomery P.: Modular multiplication without trial division. Math. Comput. 44: 519–521 (1985)

    Article  MATH  Google Scholar 

  6. Yanik T., Savas E. and Koc C.: Incomplete reduction in modular, arithmetic. Math. Comput. 149: 46–54 (2002)

    Google Scholar 

  7. Koc C. and Acar T.: Montgomery multiplication in GF(2k). Des. Codes Cryptogr. 14: 57–69 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gang, F.: Design of modular multiplier based on improved Montgomery algorithm and systolic array. In: Proc. 1st Int. Multi-Symp. Comput. Comput. Sci. 356–359 (2006)

  9. Ghoreishi, S.; Pourmina, M.; Bozorgi, H.; Dousti, M.: High speed RSA implementation based on modified Booths technique and Montgomery’s multiplication for FPGA platform. In: Proc. 2nd Int. Conf. Adv. Circuits, Electron. Micro-Electron. 86–93 (2009)

  10. Sassaw, G.; Jimenez, C.; Valencia, M.: High radix implementation of Montgomery multipliers with CSA. In: Proc. Int. Conf. Microelectron, 315–318 (2010)

  11. Neto, J.; Tenca, A.; Ruggiero, W.: A parallel k-partition method to perform Montgomery multiplication. In: Proc. IEEE Int. Conf. Appl. Specif. Syst., Arch. Process. 251–254 (2011)

  12. Cilardo A., Mazzeo A., Romano L. and Saggese G.: Exploring the design-space for FPGA-based implementation of RSA. Microprocess. Microsyst. 28: 183–191 (2004)

    Article  Google Scholar 

  13. Bayhan, D.; Ors, S.; Saldamli, G.: Analyzing and comparing the Montgomery multiplication algorithms for their power consumption. In: Proc. Int. Conf. Comput. Eng. Syst. 257–261 (2010)

  14. Wang, X.; Noel, P.; Kwasniewski, T.: Low power design techniques for a Montgomery modular multiplier. In: Proc. Int. Symp. Intell. Signal Process. Commun. Syst. 449–452 (2005)

  15. Son, H.; Oh S.: Design and implementation of scalable low-power Montgomery multiplier. In: International Conference on Design, ICCD 2004, pp. 524–531 (2004)

  16. Kuang, S.; Wang, J.; Chang K.; Hsu, H.: Energy-Efficient High Throughput Montgomery modular multipliers for RSA cryptosystems. Accepted for inclusion in future issue of IEEE Trans. on VLSI systems, December (2012)

  17. Carbognani F., Buergin F., Felber N. and Kaeslin H.: Transmission gates combined with level-restoring CMOS gates reduce glitches in low-power low-frequency multipliers. IEEE Trans. VLSI Systems. 16: 830–836 (2008)

    Article  Google Scholar 

  18. Chirca, K.; Schulte, M.; Glossner, J; Wang, H.; Mamidi, X.; Balzola, P.; Vassiliadis, S.: A static low-power, high-performance 32-bit carry skip adder. In: Euromicro Symposium on Digital System Design, pp. 615–619 (2004)

  19. Tenca A. and Koc C.: A scalable architecture for modular multiplication based on Montgomery’s algorithm. IEEE Trans. Comput. 52: 1215–1221 (2003)

    Article  Google Scholar 

  20. Tenca A., Savas E. and Koc C.: A design framework for scalable and unified architectures that perform multiplication in gf(p) and gf(2m). Int. J. Comput. Res. 13: 68–83 (2004)

    Google Scholar 

  21. Todorov, T.; Tenca, A.; and Koc. C.: High-radix design of a scalable modular multiplier. In: Koc, C.; Naccache, D.; Paar, C. (eds.) Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science No. 2162, Springer, Berlin, Germany, pp. 189–205 (2001)

  22. Savas E., Tenca A., Ciftcibasi M. and Koc C.: Multiplier architectures for gf(p) and gf(2n). IEE Proc. Comput. Digit. Tech. 151: 147–160 (2004)

    Article  Google Scholar 

  23. Harris, D.; Krishnamurthy, R.; Andersm, M.; Mathew, S.; Hsu, S.: An improved unified scalable radix-2 Montgomery multiplier. In: IEEE (ARITH-17), pp. 172–178 (2005)

  24. Groschdl, J.: A bit-serial unified multiplier architecture for finite fields GF(p) and GF(2m). In: Proc. CHES 2001, pp. 202–218 (2001)

  25. Savas, E.; Tenca, A.; Koc, C.: A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m). In: Proceedings of CHES 2000, pp. 281–296 (2000)

  26. Ibrahim, A.; Gebali, F.; Elsimary, H.; Nassar, A.: New processor array architecture for scalable radix 8 montgomery modular multiplication. In: Proc. Canadian Conference on Electrical and Computer Engineering (CCECE), pp. 389–394 (2011)

  27. Todorov, G.; Tenca, A.: ASIC Design, Implementation and Analysis of a Scalable High-Radix Montgomery Multiplier. Master’s Thesis, Oregon State University, USA (2000)

  28. Walter C.: Montgomery exponentiation needs no final subtractions. Electron. Lett. 35: 1831–1832 (2004)

    Article  Google Scholar 

  29. Orup, H.: Simplifying quotient determination in high-radix modular multiplication. In: Proc. 12th IEEE Symp. Computer Arithmetic, pp. 193–199 (1995)

  30. Hachez, G.; Quisquater, J.: Montgomery exponentiation with no final subtractions: Improved results. In: Koc, Ç.; Naccache, D.; Paar, C. (eds.) Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science No. 1965, Springer, Berlin, Germany, pp. 293–301 (2000)

  31. Tawalbeh, L.; Tenca, A.: Radix-4 ASIC Design of a Scalable Montgomery Modular Multiplier Using Encoding Techniques. Master’s Thesis, Oregon State University, USA (2002)

  32. El-Guibaly F. and Tawfik A.: Mapping 3d iir digital filter onto systolic arrays. Multidimens. Syst. Signal Process. 7: 7–26 (1996)

    Article  MATH  Google Scholar 

  33. Gebali F.: Algorithms and Parallel Computing. Wiley, New York (2011)

    Book  MATH  Google Scholar 

  34. Huang M., Gaj K. and El-Ghazawi T.: New hardware architectures for montgomery modular multiplication algorithm. IEEE Trans. Comput. 7: 923–936 (2011)

    Article  MathSciNet  Google Scholar 

  35. Ibrahim, A.; Gebali, F.; El-Simary, H.; Nassar, A.: Design and VLSI Implementation of Fast Modular Multiplier Architectures for Cryptosystems. PhD’s Dissertation, Department of Electronics and Electrical Communication, Cairo University (2010)

  36. Ibrahim A., Gebali F., El-Simary H. and Nassar A.: Processor array architectures for scalable radix 4 montgomery modular multiplication algorithm. IEEE Trans. Parallel Distrib. Syst. 22: 1142–1149 (2011)

    Article  Google Scholar 

  37. Ibrahim, A.; Gebali, F.; El-Simary, H.: New and improved word-based unified and scalable architecture for radix 2 Montgomery modular multiplication algorithm. In: 2013 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM), pp. 153–158 (2013)

  38. Sudhakar M., Kamala R. and Srinivas M.: New and improved architectures for montgomery modular multiplication. Mobile Netw Appl. 12: 750–755 (2007)

    Article  Google Scholar 

  39. Wang, H.; Lin, W.; Ye, J.; Shieh, M.: Fast scalable radix-4 Montgomery modular multiplier. In: 2012 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 3049–3052 (2012)

  40. Amberg, P.; Pinckney, N.; Harris, M.: Parallel high-radix montgomery multipliers. In: 42nd Asilomar Conference on Signals, Systems and Computers, pp. 772–776 (2008)

  41. Ye, J.; Hung, T.; Shieh M.: Energy-efficient architecture for word-based montgomery modular multiplication algorithm. In: 2013 International Symposium on VLSI Design, Automation, and Test (VLSI-DAT), pp. 1–4 (2013)

  42. Sassaw, G.; Carlos, J.; Valencia, M.: High radix implementation of montgomery multipliers with CSA. In: 22nd International Conference on Microelectronics (ICM 2010), pp. 315–318 (2010)

Download references

Author information

Authors and Affiliations

  1. Salman Bin AbdulAziz University, Alkharj, Saudi Arabia

    Atef Ibrahim & Hamed Elsimary

  2. Electronics Research Institute, Cairo, Egypt

    Atef Ibrahim

  3. University of Victoria, Victoria, BC, Canada

    Atef Ibrahim & Fayez Gebali

Authors
  1. Atef Ibrahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamed Elsimary
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fayez Gebali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Atef Ibrahim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ibrahim, A., Elsimary, H. & Gebali, F. Low-Power, High-Speed Unified and Scalable Word-Based Radix 8 Architecture for Montgomery Modular Multiplication in GF(P) and GF(2n). Arab J Sci Eng 39, 7847–7863 (2014). https://doi.org/10.1007/s13369-014-1363-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-014-1363-5

Keywords

Search

Navigation