Design An High Speed Bypass Multiplier For Communication

Abstract

Redundant Based Multiplier Over Gaulois Field (GF(2m)) has gained more popularity in elliptic curve cryptography (ECC) mainly due to their negligible hardware cost for squaring and modular reduction. In this paper, we have proposed a novel recursive decomposition algorithm for RB multiplication to obtain high throughput digit-serial implementation.