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.
Full Text:
PDFCopyright (c) 2018 Edupedia Publications Pvt Ltd
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
All published Articles are Open Access at https://journals.pen2print.org/index.php/ijr/
Paper submission: ijr@pen2print.org