Return to search

Analysis of Another Left Shift Binary GCD Algorithm

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.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0714109-121741
Date14 July 2009
CreatorsChen, Yan-heng
ContributorsChun-I Fan, Chia-Mei Chen, D. J. Guan,
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0714109-121741
Rightsunrestricted, Copyright information available at source archive

Page generated in 0.0017 seconds