Design of multipliers for moduli$({2^{4k}} + {2^{2k + 1}} - {2^{3k + 1}} - {2^k} + 1)$ and $({2^{4k}} - {2^{3k + 1}} + {2^k} - 1)$

In this paper, the design of modulo multipliers for the moduli
$({2^{4k}} + {2^{2k + 1}} - {2^{3k + 1}} - {2^k} + 1)$
and
$({2^{4k}} - {2^{3k + 1}} + {2^k} - 1)$
is investigated. These moduli are useful for constructing four moduli sets with interesting properties resulting in simpler RNS to binary conversion architectures. The derived architectures of the multipliers can facilitate binary to RNS conversion as well. Hardware requirements and multiplication time are derived in tems of basic gates and ASIC implementation results are presented.