A Modular Multiplier Implemented With Truncated Multiplication

In this brief, we propose a modular multiplication algorithm with four truncated multiplications to reduce the critical path. According to our algorithm, a high-speed 3-stage modular multiplier is constructed. Moreover, synthesized with TSMC 90 nm, our design can perform a 256-bit modular multiplication for every clock period of 3.58 ns with circuit scale of approximately 629K equivalent gates. Further, by utilizing the modular multiplier, an elliptic curves cryptography processor is constructed, and it can perform a scalar multiplication in 19.4 \mu \text{s} , which is one of the fastest to date in published literatures.