Optimised bit serial modular multiplier for implementation on field programmable gate arrays

A high-speed architecture for bit serial modular multiplication is presented. The design of this array is highly regular, allowing the specific logic and routing resources available in field programmable gate arrays (FPGAs) to be exploited. Furthermore, an optimised array is presented which exploits the reprogrammability of the FPGA, such that a longer bit length can be implemented on the same FPGA.

[1]  P. L. Montgomery Modular multiplication without trial division , 1985 .

[2]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[3]  Tolga Acar,et al.  Analyzing and comparing Montgomery multiplication algorithms , 1996, IEEE Micro.

[4]  Peter Kornerup,et al.  A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms , 1994, IEEE Trans. Computers.

[5]  W.P. Marnane,et al.  Optimising designs for hardware compilation to FPGAs , 1997, 1997 IEEE Workshop on Signal Processing Systems. SiPS 97 Design and Implementation formerly VLSI Signal Processing.

[6]  Stewart Smith,et al.  Serial-Data Computation , 1987 .

[7]  William P. Marnane,et al.  Compiling Regular Arrays onto FPGAs , 1995, FPL.