Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/100160
Title: | Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure | Authors: | Yen, Sung-Ming Chen, Chien-Ning Moon, SangJae |
Keywords: | DRNTU::Science::Mathematics::Discrete mathematics::Algorithms | Issue Date: | 2012 | Source: | Yen, S.-M., Chen, C.-N., & Moon, S. (2012). Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure. Journal of cryptographic engineering, 2(2), 99-110. | Series/Report no.: | Journal of cryptographic engineering | Abstract: | A series of algorithms for evaluation of multi-exponentiation are proposed based on the binary greatest common divisor algorithm. The proposed algorithms are inversion free and have the capability to evaluate double or multi-exponentiation with non-fixed base numbers and exponents. They can also be employed in developing side-channel countermeasures. For n-bit double and triple exponentiation, they achieve the average complexity of 1.53n and 1.75n multiplications (including squarings), respectively. The proposed algorithms can be very useful for the implementation of many public-key cryptosystems on small devices with limited memory space, e.g., smart cards. | URI: | https://hdl.handle.net/10356/100160 http://hdl.handle.net/10220/24096 |
DOI: | 10.1007/s13389-012-0032-4 | Research Centres: | Temasek Laboratories | Rights: | © 2012 Springer-Verlag. | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
Appears in Collections: | TL Journal Articles |
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.