An RNS barrett modular multiplication architecture
Dimitrios Schinianakis, Thanos Stouraitis · 2014
Existing RNS implementations of modular multiplication employ Montgomery's technique, especially in cryptography where consecutive multiplications of large integers are used for exponentiation. This work deviates from these approaches and an RNS architecture of Barrett's modular multiplication algorithm is presented. An algorithmic and architectural comparison with the state-of-the-art solutions shows that the proposed algorithm, although requiring more modular multiplications, may achieve competitive total delay.