Optimizing the Improved Barrett Modular Multipliers for Public-Key Cryptography

Yinan Kong · 2010

This work is a significant stage of the project, "Digital Arithmetic Public-Key Cryptography". It constructs a modular multiplier for use in the channel of a Residue Number System (RNS). The modular multiplier is implemented on FPGA and optimized by evaluating different versions of the Improved Barrett Algorithm. The resulting optimized multiplier is 12 bits wide and uses separated multiplication and reduction.

Read the paper · More papers on PaperTik