Enhanced Elliptic Curve Scalar Multiplication Secure Against Side Channel Attacks and Safe Errors

被引:7
|
作者
Dubeuf, Jeremy [1 ]
Hely, David [2 ]
Beroulle, Vincent [2 ]
机构
[1] Maxim Integrated, Secur Excellence Lab, San Jose, CA 95134 USA
[2] Univ Grenoble Alpes, LCIS, Grenoble, France
关键词
Elliptic curve cryptography; Point multiplication algorithms; Security issues; Forced bit; Safe-error; Dummy operands; Smartcard; POWER-ANALYSIS; EFFICIENT COUNTERMEASURES;
D O I
10.1007/978-3-319-64647-3_5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Elliptic curve cryptography (ECC) is involved in many secure schemes. Such schemes involve the elliptic curve scalar operation which is particularly security sensitive. Many algorithms of this operation have been proposed including security countermeasures. This paper discusses the security issues of such algorithms when running on a device that can be physically accessed. Leveraging these issues, new simple attack schemes to recover scalar bit information are presented and a new detailed attack based on C safe-error, probability and lattice is described against an Elliptic Curve Digital Signature Algorithm (ECDSA) using the Montgomery ladder algorithm. This new attack shows that Montgomery ladder can be sensitive to C safe-errors under some conditions. Finally, new secure elliptic curve scalar operation algorithms are presented with solutions to the discussed issues and guidance for their secure implementations.
引用
收藏
页码:65 / 82
页数:18
相关论文
共 50 条
  • [1] Efficient and Secure Implementation of Elliptic Curve Scalar Multiplication Against Power Analysis Attacks
    Sudhakar, T.
    Natarajan, V
    Kannathal, A.
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATICS AND ANALYTICS (ICIA' 16), 2016,
  • [2] Architecture for an elliptic curve scalar multiplication resistant to some side-channel attacks
    Yoon, JC
    Jung, SW
    Lee, S
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2003, 2004, 2971 : 139 - 151
  • [3] Flexible parallel computing for elliptic curve scalar multiplication with resistance against simple side-channel attacks
    Wu K.
    Wu, Keke (wukk@sziit.edu.cn), 1600, Computer Society of the Republic of China (28): : 64 - 78
  • [4] Improved elliptic curve multiplication methods resistant against side channel attacks
    Izu, T
    Möller, B
    Takagi, T
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS, 2002, 2551 : 296 - 313
  • [5] A new method for securing elliptic scalar multiplication against side-channel attacks
    Lim, CH
    INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2004, 3108 : 289 - 300
  • [6] Faster Side-Channel Resistant Elliptic Curve Scalar Multiplication
    Venelli, Alexandre
    Dassance, Francois
    ARITHMETIC, GEOMETRY, CRYPTOGRAPHY AND CODING THEORY 2009, 2010, 521 : 29 - +
  • [7] Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks
    Möller, B
    INFORMATION SECURITY, PROCEEDINGS, 2002, 2433 : 402 - 413
  • [8] T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks
    Sim, Bo-Yeon
    Choi, Kyu Young
    Moon, Dukjae
    Yoon, Hyo Jin
    Cho, Jihoon
    Han, Dong-Guk
    INFORMATION SECURITY PRACTICE AND EXPERIENCE (ISPEC 2018), 2018, 11125 : 407 - 423
  • [9] A General Framework of Side-Channel Atomicity for Elliptic Curve Scalar Multiplication
    Lu, Chia-Yu
    Jen, Shang-Ming
    Laih, Chi-Sung
    IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (03) : 428 - 438
  • [10] Analysis of Elliptic Curve Scalar Multiplication in Secure Communications
    Thomas, Christina
    Sheela, K. Gnana
    2015 GLOBAL CONFERENCE ON COMMUNICATION TECHNOLOGIES (GCCT), 2015, : 611 - 615