Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of cryptographic engineering Ročník 2; číslo 2; s. 99 - 110
Hlavní autoři: Yen, Sung-Ming, Chen, Chien-Ning, Moon, SangJae
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer-Verlag 01.09.2012
Témata:
Circuits and Systems
Communications Engineering
Computer Communication Networks
Computer Science
Cryptology
Data Structures and Information Theory
Networks
Operating Systems
Regular Paper
Multi-exponentiation
Euclidean algorithm
Binary GCD algorithm
Greatest common divisor
Exponentiation
Public-key cryptography
Side-channel attack
ISSN:2190-8508, 2190-8516
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.53 n and 1.75 n 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.
ISSN:2190-8508
2190-8516
DOI:10.1007/s13389-012-0032-4