Presentation	2007-12-19 Generalized EBRIP Atsuko MIYAJI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In the execution on a smart card, elliptic curve cryptosystems have to be secure against side channel attacks such as the simple power analysis (SPA), the differential power analysis (DPA), and the refined power analysis (RPA), and so on. EBRIP-algorithm proposed by Mamiya, Miyaji, and Morimoto is a scalar multiplication algorithm secure against SPA, DPA, and RPA, which can decrease the computational complexity by increasing the size of a pre-computed table. However, it provides only 4 different cases of pre-computed tables. From the practical point of view, a wider range of time-memory tradeoffs is usually desired. This paper generalizes EBRIP-algorithm to improve the flexibility of tables as well as the computational complexity. Our improved algorithm is secure, efficient and flexible for the storage size.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	elliptic curve / SPA / DPA / RPA
Paper #	ISEC2007-122
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2007/12/12(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Information Security (ISEC)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Generalized EBRIP
Sub Title (in English)
Keyword(1)	elliptic curve
Keyword(2)	SPA
Keyword(3)	DPA
Keyword(4)	RPA
1st Author's Name	Atsuko MIYAJI
1st Author's Affiliation	Information Science, Japan Advanced Institute of Science and Technology()
Date	2007-12-19
Paper #	ISEC2007-122
Volume (vol)	vol.107
Number (no)	397
Page	pp.pp.-
#Pages	12
Date of Issue