A theta (1) algorithm for modulo addition

A theta (1) algorithm for large modulo addition for architectures based on the residue number (RNS) is proposed. The addition is done in a fixed number of stages which does not depend on the size of the modulus. The proposed modulo adder is much faster than previous adders and more area efficient. The implementation of the adder is modular and is based on simple cells, which leads to efficient VLSI realization.<
>