Title page for etd-0831109-235209


[Back to Results | New Search]

URN etd-0831109-235209
Author Yi-shan Lu
Author's Email Address No Public.
Statistics This thesis had been viewed 5577 times. Download 1469 times.
Department Computer Science and Engineering
Year 2008
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title Efficient Implementation of the Weil Pairing
Date of Defense 2009-07-13
Page Count 41
Keyword
  • Miller's algorithm
  • Weil Pairing
  • Elliptic Curve
  • Abstract The most efficient algorithm for solving the elliptic curve discrete logarithm problem can only be done in exponential time. Hence, we can use it in many cryptographic applications. Weil pairing is a mapping which maps a pair of points on elliptic curves to a multiplicative group of a finite field with nondegeneracy and bilinearity. Pairing was found to reduce the elliptic
    curve discrete logarithm problem into the discrete logarithm problem of a finite field, and became an important issue since then. In 1986, Miller proposed an efficient algorithm for computing Weil pairings. Many researchers focus on the improvement of this algorithm. In 2006, Blake et al. proposed the reduction of total number of lines based on the conjugate of a line. Liu
    et al. expanded their concept and proposed two improved methods. In this paper, we use both NAF and segmentation algorithm to implement the Weil pairing and analyse its complexity.
    Advisory Committee
  • Chia-Mei Chen - chair
  • Chun-I Fan - co-chair
  • D. J. Guan - advisor
  • Files
  • etd-0831109-235209.pdf
  • indicate access worldwide
    Date of Submission 2009-08-31

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys