Efficient implementation of digit-serial Montgomery modular multiplier architecture

The importance of security in communications has made cryptography one of the most important research for designers. Montgomery modular multiplication is one of the best methods used in cryptosystems. These multipliers can be implemented in different ways including digit-serial architecture. The digit-serial multiplier is an efficient structure for low power and high-speed applications. The architecture of digit-serial multiplier can benefit from the advantage of both serial and parallel structures. This study presents a new digit-serial Montgomery modular multiplier architecture, which takes up less area by reducing internal blocks of the structure. The latency and design complexity of the proposed digit-serial Montgomery multiplier is less than many other similar designs. The critical path delay of the proposed architecture is reduced compared to similar works. The proposed circuit has the flexibility to be used in a large number of bits and can be used for any size of the digit. The simulation results of the proposed multiplier are presented.

[1]  Jimson Mathew,et al.  Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of ${\rm GF}(2^{m})$ , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[2]  Tarek A. El-Ghazawi,et al.  New Hardware Architectures for Montgomery Modular Multiplication Algorithm , 2011, IEEE Transactions on Computers.

[3]  Shiann-Rong Kuang,et al.  Low-Cost High-Performance VLSI Architecture for Montgomery Modular Multiplication , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[4]  Chin-Chen Chang,et al.  Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials , 2007, IET Circuits Devices Syst..

[5]  J. McCanny,et al.  Modified Montgomery modular multiplication and RSA exponentiation techniques , 2004 .

[6]  Majid Ahmadi,et al.  Low-Power Design for a Digit-Serial Polynomial Basis Finite Field Multiplier Using Factoring Technique , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[7]  Anil Çelebi,et al.  A General Digit-Serial Architecture for Montgomery Modular Multiplication , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Shiann-Rong Kuang,et al.  Energy-Efficient High-Throughput Montgomery Modular Multipliers for RSA Cryptosystems , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[9]  Akashi Satoh,et al.  Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[10]  Parviz Keshavarzi,et al.  High-Throughput Modular Multiplication and Exponentiation Algorithms Using Multibit-Scan–Multibit-Shift Technique , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Jean-Pierre Deschamps,et al.  Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation , 2011, IEEE Transactions on Industrial Electronics.

[12]  Amar Aggoun,et al.  Radix-2n serial-serial multipliers , 2004 .

[13]  Alessandro Cilardo,et al.  Modular inversion based on digit-level speculative addition , 2013 .

[14]  Jeng-Shyang Pan,et al.  Efficient digit-serial modular multiplication algorithm on FPGA , 2018, IET Circuits Devices Syst..

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

[16]  Ming-Der Shieh,et al.  A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[17]  Frederik Vercauteren,et al.  Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods , 2010, IEEE Transactions on Computers.

[18]  C. D. Walter,et al.  Montgomery exponentiation needs no final subtractions , 1999 .

[19]  Nitha Thampi,et al.  Montgomery Multiplier for Faster Cryptosystems , 2016 .