A novel elliptic curve scalar multiplication algorithm against power analysis
type: Item
instance of: scholarly article
title: A novel elliptic curve scalar multiplication algorithm against power analysis
zbMATH Open document ID: 1299.94087
DOI: 10.1155/2013/862508
author: Hongming Liu
author: Nianhao Zhu
author: Yu Jie Zhou
published in: Mathematical Problems in Engineering
publication date: 2014-11-24T00:00:00Z
review text: Summary: Nowadays, power analysis attacks are becoming more and more sophisticated. Through power analysis attacks, an attacker can obtain sensitive data stored in smart cards or other embedded devices more efficiently than with any other kind of physical attacks. Among power analysis, simple power analysis (SPA) is probably the most effective against elliptic curve cryptosystem, because an attacker can easily distinguish between point addition and point doubling in a single execution of scalar multiplication. To make elliptic curve scalar multiplication secure against SPA attacks, many methods have been proposed using special point representations. In this paper, a simple but efficient SPA-resistant multiscalar multiplication is proposed. The method is to convert the scalar into a nonadjacent form (NAF) representation at first and then constitute it in a new signed digit representation. This new representation is undertaken at a small precomputation cost, as each representation needs just one doubling and 1/2 additions for each bit. In addition, when combined with randomization techniques, the proposed method can also guard against differential power analysis (DPA) attack.
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6373196
Wikidata QID: Q59030767
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/862508
OpenAlex ID: W2089473596
cites work: Elliptic Curve Cryptosystems
cites work: Q3718617
cites work: Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
cites work: Simulatability and security of certificateless threshold signatures
cites work: Q4249254
cites work: Q4826108
cites work: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
cites work: Q4941869
cites work: Q3043945
cites work: Q4502796
cites work: Q4797784
cites work: Q4448412
cites work: Information and Communications Security
cites work: New Elliptic Curve Multi-scalar Multiplication Algorithm for a Pair of Integers to Resist SPA
cites work: Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
cites work: Q4797814
cites work: Advances in Elliptic Curve Cryptography
cites work: Q4718481
cites work: An Updated Survey on Secure ECC Implementations: Attacks, Countermeasures and Cost
cites work: Q4950061
description: scientific article; zbMATH DE number 6373196