Extended abstract: Unified digit-serial multiplier/inverter in finite field GF(2m)
Junfeng Fan, Ingrid M.R. Verbauwhede · 2008
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.