Article,

Optimized Software Implementation of ECC over 192-bit NIST Curve

, and .
Int. J. on Recent Trends in Engineering and Technology,, 9 (1): 7 (July 2013)

Abstract

RSA is the most widely used public key cryptosystem, serving the purpose of key exchange for symmetric key cryptography and authentication. Improved network security demands forward secrecy, which RSA is unable to provide. Also the lower per bit security of the RSA technique, makes it difficult to be implemented in resource constrained devices. The protocols including Elliptic curve Diffie-Hellman Ephemeral (ECDHE) as the key exchange mechanism and RSA for authentication, overcomes the drawback incurred by the RSA alone and provides forward secrecy. The advantage of forward secrecy in a network is accompanied with higher complexity and computational cost. This paper describes the complete optimized software implementation of elliptic curve over the NIST prime field. The arithmetic operations over the prime are discussed. Different coordinate systems for elliptic curve point representation like affine, projective, Jacobian projective, and mixed coordinate systems are elaborated. Various techniques for scalar multiplication like Binary, NAF, sliding window, fixed based window, comb method, are given. Scalar multiplication is the most dominating operation in Elliptic curve cryptography (ECC) which consumes 85% of the execution time. A controller based on the fuzzy logic is presented for an optimum selection of window width, w, in the scalar multiplication methods. A comparison of various techniques and combinations of different techniques to perform complete ECDHE operation are provided along with the implementation timings.

Tags

Users

  • @idescitation

Comments and Reviews