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.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0714109-121741 |
| Date | 14 July 2009 |
| Creators | Chen, Yan-heng |
| Contributors | Chun-I Fan, Chia-Mei Chen, D. J. Guan, |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0714109-121741 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0017 seconds