A Combined Random Scalar Multiplication Algorithm Resistant to Power Analysis on Elliptic Curves (전력분석 공격에 대응하는 타원곡선 상의 결합 난수 스칼라 곱셈 알고리즘)

Seok Won Jung (정석원)

A Combined Random Scalar Multiplication Algorithm Resistant to Power Analysis on Elliptic Curves

Journal of Internet of Things and Convergence
Abbr : JKIOTS
2020, 6(2), pp.25-29
Publisher : The Korea Internet of Things Society
Research Area : Engineering > Computer Science > Internet Information Processing
Received : April 27, 2020
Accepted : June 12, 2020
Published : June 30, 2020

Seok Won Jung ¹

¹목포대학교

Candidate

ABSTRACT

The elliptic curve crypto-algorithm is widely used in authentication for IoT environment, since it has small key size and low communication overhead compare to the RSA public key algorithm. If the scalar multiplication, a core operation of the elliptic curve crypto-algorithm, is not implemented securely, attackers can find the secret key to use simple power analysis or differential power analysis. In this paper, an elliptic curve scalar multiplication algorithm using a randomized scalar and an elliptic curve point blinding is suggested. It is resistant to power analysis but does not significantly reduce efficiency. Given a random  and an elliptic curve random point , the elliptic scalar multiplication       is calculated by using the regular variant Shamir's double ladder algorithm, where   -bit  ≡  mod and  ≡  mod using  ∓ for the case of the order    ±.

KEYWORDS

IoT, Authentication, Elliptic Curve, Scalar Multiplication, DPA, Randomized Key, Point Blinding

Citation status

* References for papers published after 2023 are currently being built.

[other] Ministry of the Interior and Safety / 2019 / Guideline for introduction of government internet of things : 19~22

[journal] S. Park / 2016 / The Simplified V2V Communication Authentication Service for Privacy Protection / Jour. of The Korea Internet of Things Society 2(1) : 35~40

[journal] T. Kim / 2015 / Test Vector Generator of timing simulation for 224-bit ECDSA hardware / Jour. of The Korea Internet of Things Society 1(1) : 33~38

[confproc] J-S. Coron / 1999 / Resistance against differential power analysis for elliptic curve cryptosystems / CHES’99 , LNCS 1717 : 292~302

[confproc] E. Brier / 2002 / Weirstrass elliptic curves and side-channel attacks / PKC 2002 , LNCS 2274 : 335~345

[confproc] M. Joye / 2007 / Highly regular right-to-left algorithms for scalar multiplication / CHES 2007 , LNCS 4727 : 135~147

[journal] A. Bauer / 2014 / Horizontal collision correlation attack on elliptic curves : -Extended Version- / Cryptography and Communications 7(1) : 91~119

[confproc] L. Goubin / 2002 / A refined power-analysis attack on elliptic curve cryptosystem / PKC 2003 , LNCS 2567 : 199~211

[confproc] T. Akishita / 2003 / Zero-value point attacks on elliptic curve cryptosystem / ISC 2003 , LNCS 2851 : 218~233

[confproc] N. Hanley / 2015 / Exploiting collisions in addition chain-based exponentiation algorithms using a single trace / CT-RSA 2015 , LNCS 9048 : 431~448

[confproc] C. Clavier / 2001 / Universal exponentiation algorithm / CHES 2001 , LNCS 2162 : 300~308

[confproc] M. Ciet / 2003 / (Virtually)Free randomization techniques for elliptic curve cryptography / ICICS 2003 , LNCS 2836 : 348~359

[journal] N. Smart / 2008 / Randomised representations / IET Information Security 2 : 19~27

[confproc] P-A. Fouque / 2003 / The doubling attack why upwards is better than downloads / CHES 2003 , LNCS 2779 : 269~280

[confproc] J. Ha / 2007 / Provably secure countermeasure resistant to several types if power attack for ECC / WISA 2007 , LNCS 4867 : 333~344

[other] D.Hankerson / 2004 / Guide to Elliptic Curve Cryptography : 75~97

[confproc] B. Feix / 2014 / Side-channel analysis on blinded regular scalar multiplications / INDOCRYPT 2014 , LNCS 8885 : 3~20

[thesis] N.M.Ebeid / 2007 / Key randomization countermeasures to power analysis attacks on elliptic curve cryptosystems / Phd.D / University of Waterloo

[confproc] K. Okeya / 2000 / Power analysis breaks elliptic curve cryptosystems even secure against the timing attack / INDOCRYPT 2000 , LNCS 1977 : 178~190

[journal] 정석원 / 2020 / A Method for Scalar Multiplication on Elliptic Curves against Differential Power Analysis using Efficient Key-Randomization / 한국콘텐츠학회 논문지 / 한국콘텐츠학회 20(1) : 356~363

KJCKorea
Journal Central

Journal of Internet of Things and Convergence 2023 KCI Impact Factor : 0.89