An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials

Abstract

The Chinese remainder theorem (CRT)-based multiplier is a new type of hybrid bit-parallel multiplier, which can achieve nearly the same time complexity compared with the fastest multiplier known to date with reduced space complexity. However, the current CRT-based multipliers are only applicable to trinomials. In this article, we propose an efficient CRT-based bit-parallel multiplier for a special type of pentanomial <inline-formula><tex-math notation="LaTeX">$x^m+x^{m-k}+x^{m-2k}+x^{m-3k}+1, 5k+1&lt;m\leq 11k$</tex-math></inline-formula> . Through transforming the non-constant part <inline-formula><tex-math notation="LaTeX">$x^m+x^{m-k}+x^{m-2k}+x^{m-3k}$</tex-math></inline-formula> into a binomial, we can obtain relatively simpler quotient and remainder computations, which lead to faster implementation with reduced space complexity compared with classic quadratic multipliers for the same pentanomials. Moreover, for some <inline-formula><tex-math notation="LaTeX">$m$</tex-math></inline-formula> , our proposal can match the fastest multipliers for irreducible Type I, Type II, and Type C.1 pentanomials of the same degree, but space complexities are roughly reduced by 8 percent.