본문 바로가기
  • Home

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 1

1목포대학교

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    ±.

Citation status

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