Efficient modulo 2n +1 multiplier
Masoud Abbasi Alaie, Somayeh Timarchi · International Journal of Computer Aided Engineering and Technology · 2016
Modulo 2n + 1 multiplier is one of the critical components in RNS-based cryptography and security application, digital signal processing, and fault-tolerant system. An important issue in multiplication is utilising an efficient reduction tree for partial product accumulation. This paper presents two efficient architectures for modulo 2n + 1 multiplication. The proposed methods realise a well-organised addition tree for partial product reduction that is based on utilising appropriate compressors. The synthesis results depicts that the proposed architectures consume less power and occupy less area than the most efficient modulo 2n + 1 multiplier. The least delay obtained for the proposed architecture is also less than the one achieved for the best modulo 2n + 1 multiplier.