首頁 > 網路資源 > 大同大學數位論文系統

Title page for etd-0213111-143715


URN etd-0213111-143715 Statistics This thesis had been viewed 1742 times. Download 5 times.
Author Zhi-Yang Hong
Author's Email Address No Public.
Department Communication Engineering
Year 2010 Semester 1
Degree Master Type of Document Master's Thesis
Language English Page Count 56
Title EFFICIEN ALGORITHMS OF ECC SCALAR MULTIPLICATION WITH RESISTANCE AGAINST POWER ANALYSIS ATTACK
Keyword
  • power analysis
  • Side channel attack
  • scalar multiplication
  • ECC
  • ECC
  • scalar multiplication
  • Side channel attack
  • power analysis
  • 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). The discrete logarithm problem over an elliptic curve (EC) seems to be much harder than in other groups such as the multiplicative group of a finite field. 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 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 some efficient algorithms of ECC scalar multiplication with resistance against power analysis. Compared with the algorithm proposed by Kim et al [1], our algorithm can reduce some operations of EC doubling and EC addition.
    Advisor Committee
  • Shuenn-Shyang Wang - advisor
  • Chien-Hua Chen - co-chair
  • Ching-Huang Wei - co-chair
  • Files indicate in-campus access only
    Date of Defense 2011-01-24 Date of Submission 2011-02-15


    Browse | Search All Available ETDs