Visible to the public Biblio

Filters: Author is Sudhakar, T.  [Clear All Filters]
2017-06-05
Sudhakar, T., Natarajan, V., Kannathal, A..  2016.  Efficient and Secure Implementation of Elliptic Curve Scalar Multiplication Against Power Analysis Attacks. Proceedings of the International Conference on Informatics and Analytics. :70:1–70:5.

The Elliptic Curve Cryptosystems(ECC) are proved to be the cryptosystem of future generation because of its smaller key size and uncompromised security. It is well suited for applications running in resource-restricted devices such as smart cards. At present, there is no efficient algorithm or known sub-exponential algorithm to break ECC theoretically. However, a hardware implementation of ECC leaks secret key information due to power analysis attacks particularly differential power analysis attack(DPA). These attacks break the system with far less effort when compared to all other attacks based on algebraic weaknesses of the algorithms. There are many solutions to overcome the power analysis attack, but all the available solutions have their own advantages and disadvantages by compromising either its security or performance. In this paper, we present a secure and efficient algorithm to solve the elliptic curve scalar multiplication(ECSM) using initial points randomization and by delaying the point addition operation. The implementation results and performance analysis shows that the proposed algorithm is efficient and secure against power analysis attacks.