| Summary: | 碩士 === 大同大學 === 通訊工程研究所 === 97 === ABSTRACT
Elliptic curve cryptosystem (ECC) is one of the effectively public key cryptography systems. It is based on the difficulty to solve the discrete logarithm problem over the points on an elliptic curve (ECDLP). Compared with other existing public key cryptosystems, the key size of ECC is smaller than other cryptosystems in equal security level. Therefore, ECC is well-suited for the implementation on memory constraint environments such as smart card … etc. due to its small key size. However, in the execution on a smart card, side cannel attacks (SCA) such as simple power analysis (SPA) and the differential power analysis (DPA) have become serious threat. SCA can break the secret key of ECC on such devices, if the implementation method is not carefully considered.
In this thesis, we propose an efficient method of ECC scalar multiplication with resistance against power analysis. Compared with the method proposed by Zhang and Shi [1], our method not only needs smaller memory but also resists against power analysis. Finally, we extend our method to perform aP + bQ operated on digital signature algorithm (DSA) to resist against power analysis.
|
|---|
