Title page for etd-0714109-121741


[Back to Results | New Search]

URN etd-0714109-121741
Author Yan-heng Chen
Author's Email Address m963040059@student.nsysu.edu.tw
Statistics This thesis had been viewed 5578 times. Download 1150 times.
Department Computer Science and Engineering
Year 2008
Semester 2
Degree Master
Type of Document
Language English
Title Analysis of Another Left Shift Binary GCD Algorithm
Date of Defense 2009-06-17
Page Count 40
Keyword
  • Self-test
  • Modular inverse
  • GCD
  • Abstract In general, to compute the modular inverse is very important in information security, many encrypt/decrypt and signature algorithms always need to use it. In 2007, Liu, Horng, and Liu proposed a variation on Euclidean algorithm, which can calculate the modular inverses as simple as calculate GCDs. This paper analyzes another type of left-shift binary GCD algorithm, which is suitable for the variation and that needs the fewer bit-operations than LSBGCD, which is analyzed by Shallit, and Sorenson.
    Advisory Committee
  • Chia-Mei Chen - chair
  • Chun-I Fan - co-chair
  • D. J. Guan, - advisor
  • Files
  • etd-0714109-121741.pdf
  • indicate access worldwide
    Date of Submission 2009-07-14

    [Back to Results | New Search]


    Browse | Search All Available ETDs

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