Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Hybrid Low Power Encoded Multiplier for Montgomery Modular Multiplication and Efficient ECC Processor


Affiliations
1 Sathyabama University, Chennai, India
2 Department of Electrical and Electronics Engineering, Pondicherry Engineering College, Pondicherry, India
     

   Subscribe/Renew Journal


Elliptic Curve Cryptography (ECC) rules communication where the requirements of security, speed, key length and area constraints become main objective such as the portable device. Scalar multiplication becomes the key operation in any ECC, not only because it munches out major time, power and chip area, it is also a fact that the triumph of the Elliptic Curve Encryption Algorithm depends on the difficulty of calculating the multiplication. Hence the type of multiplier and its functional behavior become crux of the ECC architecture. This paper paves a way by developing a ECC architectures over GF(2160), which is bequeathed with three different multipliers namely array multiplier, modified booth multiplier and hybrid low power encoded multiplier. These multipliers are used in the Montgomery scalar multiplication algorithm to perform point addition and point doubling. The proposed ECC processor can perform the 160 bit point multiplication and coordinates conversion with 575mW, 511mW and 373mW in 100 MHz and 19176, 16260 and 8743 LUTs respectively in array multiplier, modified booth multiplier and hybrid multiplier. The architecture is implemented using spartan3E family device XC3S1600E using Modelsim 5.7 and Xilinx 9.2i.

Keywords

Array Multiplier, Elliptic Curve Cryptography, Hybrid Low Power Encoded Multiplier, Montgomery Multiplication Algorithm, Modified Booth Multiplier, Point Double, Point Addition.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 233

PDF Views: 2




  • Hybrid Low Power Encoded Multiplier for Montgomery Modular Multiplication and Efficient ECC Processor

Abstract Views: 233  |  PDF Views: 2

Authors

B. Muthukumar
Sathyabama University, Chennai, India
S. Jeevananthan
Department of Electrical and Electronics Engineering, Pondicherry Engineering College, Pondicherry, India

Abstract


Elliptic Curve Cryptography (ECC) rules communication where the requirements of security, speed, key length and area constraints become main objective such as the portable device. Scalar multiplication becomes the key operation in any ECC, not only because it munches out major time, power and chip area, it is also a fact that the triumph of the Elliptic Curve Encryption Algorithm depends on the difficulty of calculating the multiplication. Hence the type of multiplier and its functional behavior become crux of the ECC architecture. This paper paves a way by developing a ECC architectures over GF(2160), which is bequeathed with three different multipliers namely array multiplier, modified booth multiplier and hybrid low power encoded multiplier. These multipliers are used in the Montgomery scalar multiplication algorithm to perform point addition and point doubling. The proposed ECC processor can perform the 160 bit point multiplication and coordinates conversion with 575mW, 511mW and 373mW in 100 MHz and 19176, 16260 and 8743 LUTs respectively in array multiplier, modified booth multiplier and hybrid multiplier. The architecture is implemented using spartan3E family device XC3S1600E using Modelsim 5.7 and Xilinx 9.2i.

Keywords


Array Multiplier, Elliptic Curve Cryptography, Hybrid Low Power Encoded Multiplier, Montgomery Multiplication Algorithm, Modified Booth Multiplier, Point Double, Point Addition.