Advertisement

A Modified Bit-Serial Montgomery Multiplier Algorithm in Fault Detection Method

  • M. Prabu
  • R. Shanmugalakshmi
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 99)

Abstract

Elliptic Curve Cryptography is one of the major cryptographic algorithms which play an efficient role in cryptography and security fields. ECC makes a good conscientiousness for deployment of new level of architecture and design in those fields. In this article, a new modified architecture for the Montgomery algorithm is proposed. Montgomery multiplication is defined and derived from irreducible polynomial fields such as f(x). Here the fields can be estranged into two ways fixed and normal, a(x),b(x) are two fields elements in Galois Field used in prime number that is GF(2m). r(x) is a fixed element in GF(2m). In this article, first the bit serial Montgomery multiplier GF (2m) is presented, then, a sequential based on circuit is added to avoid the power analysis based hackers with a consistent output. Complexities of the Montgomery multiplier in terms of gate operation and time delay of the circuit are investigated and found to be as good as or better than that of pervious bit serial architecture for the power analysis in the same field. We analyze result in graphical manner. Our modified bit-serial architecture proved the same level of output with the help of using logic gates. It produces same level of latency with different logic gates. The modified Elliptic curve based bit serial Montgomery architecture is computationally efficient and suitable for hardware implementations.

Keywords

Bit Serial Architecture Montgomery Architecture Polynomial Fields Elliptic Curves 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shantz, S.C.: From Euclid’s GCD to Montgomery Multiplication to the Great Divide. Sun Microsystems Laboratories, 901 San Antonio Road, Palo Alto, CaliforniaGoogle Scholar
  2. 2.
    Castryck, W., Galbraith, S., Farashahi, R.R.: Efficient arithmetic on elliptic curves using a mixed Edwards Montgomery representation. Springer Lecture Notes in Computer Science (LNCS). Springer, HeidelbergGoogle Scholar
  3. 3.
    Lee, Y.K., Verbauwhede, I.: A Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor. Springer Lecture Notes in Computer Science (LNCS). Springer, HeidelbergGoogle Scholar
  4. 4.
    Ibrahim, A., Gebali, F., El-Simary, H., Nassar, A.: High-performance, low-power architecture for scalable radix 2 montgomery modular multiplication algorithm. Canda Journal Electronics Computer Engineering 34(4) (Fall 2009)Google Scholar
  5. 5.
    Ahmadi, H.R., Afzali-Kusha, A.: Low-Power Low-Energy Prime-Field ECC Processor Based on Montgomery Modular Inverse Algorithm. In: 12th Euromicro Conference on Digital System Design / Architectures, Methods and Tools (2009), 978-0-7695-3782-5/09, doi: 10.1109/DSD.2009.140 Google Scholar
  6. 6.
    Miyamoto, A., Homma, N., Aoki, T., Satoh, A.: SPA against an FPGA-Based RSA Implementation with a High-Radix Montgomery Multiplier, pp. 1847–1850, doi: 1-4244-0921-7/07Google Scholar
  7. 7.
    Mukaida, K., Takenaka, M., Torii, N., Masui, S.: Design of High-speed and Area-Efficient Montgomery Modular Multiplier for RSA Algorithm. In: Symposium On VLSl Circuits Digest of Technical Papers, pp. 320–323 (2004), doi: 0 7803-8287-010Google Scholar
  8. 8.
    Shin, J.-B., Kim, J., Lee-Kwang, H.: Optimisation of Montgomery modular multiplication algorithm for systolic arrays. Electronics Letters 34(79), 1830–1831 (1998)CrossRefGoogle Scholar
  9. 9.
    Lai, J.-Y., Hung, T.-Y., Yang, K.-H., Huang, C.-T.: High-Performance Architecture for Elliptic Curve Cryptography over Binary Field, pp. 3033–3936, doi: 978-1-4244-5309-2/10Google Scholar
  10. 10.
    Homma, N., Miyamoto, A., Aoki, T., Satoh, A., Shamir, A.: Comparative Power Analysis of Modular Exponentiation Algorithms. IEEE Transaction on Computers 59(6), 795–807 (2010)CrossRefGoogle Scholar
  11. 11.
    de Dormale, G.M., Bulens, P., Quisquater, J.-J.: An Improved Montgomery Modular Inversion Targeted for Efficient Implementation on FPGA. In: ICFPT 2004, pp. 441–444 (2004), doi: 0-7803-8652-3/04Google Scholar
  12. 12.
    McIvor, C., McLoone, M., McCanny, J.V.: Improved Montgomery modular inverse algorithm. Electronics Letters 40(18) (September 2, 2004)Google Scholar
  13. 13.
    Miyamoto, A., Homma, N., Aoki, T., Satoh, A.: Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers. IEEE Transactions on very large scale integration(VLSI) Systems 1, 1063–8210, doi: 10.1109/TVLSI.2010.2049037 Google Scholar
  14. 14.
    Ibrahim, A.A., Elsimary, H.A., Nassar, A.M.: Design and Implementation of Scalable Low Power Radix-4 Montgomery Modular Multiplier. In: IEEE Conference,Google Scholar
  15. 15.
    Son, H.-K., Oh, S.-G.: Design and Implementation of Scalable Low-Power Montgomery Multiplier. In: Proceedings of the IEEE International Conference on Computer Design (ICCD 2004) (2004), doi: 1063-6404/04 Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • M. Prabu
    • 1
  • R. Shanmugalakshmi
    • 2
  1. 1.Anna UniversityCoimbatoreIndia
  2. 2.CSEGovernment College of TechnologyIndia

Personalised recommendations