Implementation of Energy Efficient Scalar Point Multiplication Techniques for ECC

Abstract

Abstract — Elliptic curve cryptography (ECC) is mainly an alternative to traditional public-key cryptosystems (PKCs), such as RSA, due to its smaller key size with same security level for resource-constrained networks. The computational efficiency of ECC depends on the scalar point multiplication, which consists of modular point addition and point doubling operations. The paper emphasizes on point multiplication techniques such as Binary, NAF, w-NAF and different coordinate systems like Affine and Projective (Standard Projective, Jacobian and Mixed) for point addition and doubling operations. These operations are compared based on execution time. The results given here are for general purpose processor with 1:73 GH z frequency. The implementation is done over NIST-recommended prime fields 192/224/256