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žené v:

Podrobná bibliografia
Vydané v:	Journal of cryptographic engineering Ročník 2; číslo 2; s. 99 - 110
Hlavní autori:	Yen, Sung-Ming, Chen, Chien-Ning, Moon, SangJae
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer-Verlag 01.09.2012
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!