The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks

77Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The side channel attack (SCA) is a serious attack on wearable devices that have scarce computational resources. Cryptographic algorithms on them should be efficient using small memory - we have to make efforts to optimize the trade-off between efficiency and memory. In this paper we present efficient SCA-resistant scalar multiplications based on window method. Möller proposed an SPA-resistant window method based on 2w-ary window method, which replaces w-consecutive zeros to 1 plus w-consecutive 1 and it requires 2w points of table (or 2w-1 + 1 points if the signed 2w-ary is used). The most efficient window method with small memory is the width-w NAF, which requires 2w-2 points of table. In this paper we convert the width-w NAF to an SPA-resistant addition chain. Indeed we generate a scalar sequence with the fixed pattern, e.g. |0..0cursive Greek chi|0..0cursive Greek chi|...|0..0cursive Greek chi|, where cursive Greek chi is positive odd points < 2w. Thus the size of the table is 2w-1, which is optimal in the construction of the SPA-resistant chain based on width-2 NAF. The table sizes of the proposed scheme are 6% to 50% smaller than those of Möller's scheme for w = 2,3,4,5, which are relevant choices in the sense of efficiency for 160-bit ECC. © Springer-Verlag Berlin Heidelberg 2003.

References Powered by Scopus

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems

12410Citations
N/AReaders
Get full text

Differential power analysis

6045Citations
N/AReaders
Get full text

Elliptic curve cryptosystems

3799Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Zero-value point attacks on elliptic curve cryptosystem

104Citations
N/AReaders
Get full text

Efficient countermeasures against RPA, DPA, and SPA

101Citations
N/AReaders
Get full text

Highly regular right-to-left algorithms for scalar multiplication

88Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Okeya, K., & Takagi, T. (2003). The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2612, 328–342. https://doi.org/10.1007/3-540-36563-x_23

Readers over time

‘09‘11‘12‘13‘15‘16‘17‘18‘19‘20‘21‘22‘2302468

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 16

62%

Researcher 6

23%

Professor / Associate Prof. 3

12%

Lecturer / Post doc 1

4%

Readers' Discipline

Tooltip

Computer Science 22

88%

Chemistry 1

4%

Social Sciences 1

4%

Physics and Astronomy 1

4%

Save time finding and organizing research with Mendeley

Sign up for free
0