Generalized MMM-algorithm secure against SPA, DPA, and RPA

被引：0

作者：

Miyaji, Atsuko ^{[1
]}

机构：

[1] Japan Adv Inst Sci & Technol, Tokyo, Japan

来源：

INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2007 | 2007年 / 4817卷

关键词：

elliptic curve; DPA; RPA; SPA;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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. MMM-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 MMM-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.

引用

页码：282 / 296

页数：15

共 19 条

[1]

Avanzi R., 2006, Handbook of elliptic and hyperelliptic cryptography

[2]

BLAKE IF, 1999, LMS, V265

[3]

Chae Hoon Lim, 1994, Advances in Cryptology - CRYPTO '94. 14th Annual International Cryptology Conference. Proceedings, P95

[4] Trading inversions for multiplications in elliptic curve cryptography [J].

Ciet, M ;

Joye, M ;

Lauter, K ;

Montgomery, PL .

DESIGNS CODES AND CRYPTOGRAPHY, 2006, 39 (02) :189-206

[5]

Ciet M, 2003, LECT NOTES COMPUT SC, V2836, P348

[6]

Cohen H, 1998, LECT NOTES COMPUT SC, V1514, P51

[7]

COHEN H, 1997, LECT NOTES COMPUTER, V1334, P282

[8]

Doche C, 2006, LECT NOTES COMPUT SC, V3958, P191

[9]

Eisenträger K, 2003, LECT NOTES COMPUT SC, V2612, P343

[10]

Goubin L, 2003, LECT NOTES COMPUT SC, V2567, P199

← 1 2 →