DocumentCode :
2053797
Title :
Extended abstract: Unified digit-serial multiplier/inverter in finite field GF(2m)
Author :
Fan, Junfeng ; Verbauwhede, Ingrid
Author_Institution :
Katholieke Univ. Leuven, Leuven
fYear :
2008
fDate :
9-9 June 2008
Firstpage :
72
Lastpage :
75
Abstract :
Modular multiplication and inversion are the essential operations in both elliptic curve cryptosystems (ECC) and hyperelliptic curve cryptosystems (HECC). In this paper, we describe a unified digit-serial multiplier/inverter in GF(2m). The inverter is based on a modified extended Euclidean algorithm (EEA). When choosing digit size to be w, this multiplier/inverter finishes one inversion in lceil2 m/wrceil clock cycles, or two multiplications in parallel in lceilm/wrceil clock cycles.
Keywords :
logic gates; multiplying circuits; public key cryptography; digit-serial inverter; digit-serial multiplier; elliptic curve cryptosystems; extended Euclidean algorithm; finite field; hyperelliptic curve cryptosystem; modular multiplication; Arithmetic; Clocks; Educational institutions; Elliptic curve cryptography; Galois fields; Hamming weight; Polynomials; Public key cryptography; Pulse inverters; Modular inversion; Modular multiplication; Public-key cryptography;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Hardware-Oriented Security and Trust, 2008. HOST 2008. IEEE International Workshop on
Conference_Location :
Anaheim, CA
Print_ISBN :
978-1-4244-2401-6
Type :
conf
DOI :
10.1109/HST.2008.4559055
Filename :
4559055
Link To Document :
بازگشت