This paper presents the design and implementation of a systolic RSA cryptosystem based on a modified Montgomery’s algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique improves the throughput rate up to 4 times in the best case. The processing unit of the systolic array has 100% utilization because of the proposed block interleaving technique for multiplication and squa...

In this paper, we propose two memoryless converters for the moduli set {22n+1 − 1,2,2 − 1}. First, we propose a novel reverse converter, which is purely adder based, using the traditional Chinese Remainder Theorem (CRT). Second, due to the fact that the proposed CRT based structure does not cover the entire dynamic range, a second converter, which covers the entire dynamic range based on Mixed ...

IP traceback is a defense method to help a victim to identifying the sources of attacking packets. In this paper, we propose an IP traceback method based on the Chinese Remainder Theorem to require routers to probabilistically mark packets with partial path information when packets traverse routers through the Internet. The routers with the proposed IP traceback method can interoperate seamless...

A new threshold scheme for the Digital Signature Standard is proposed using Asmuth-Bloom secret sharing based on the Chinese Remainder Theorem. The proposed scheme is simple and can be used practically in real life.

We consider the distribution of spacings between consecutive elements in subsets of Z/qZ, where q is highly composite and the subsets are defined via the Chinese Remainder Theorem. We give a sufficient criterion for the spacing distribution to be Poissonian as the number of prime factors of q tends to infinity, and as an application we show that the value set of a generic polynomial modulo q ha...

The Chinese remainder theorem provides the solvability conditions for system of linear congruences. In section 2 we present construction solution such a system. Focusing on usage in field number theory, looked some problems. main contribution is 3, consisting Problems 3.1, 3.2 and 3.3 from theory leading to theorem. Finally, different view congruences by its geometric interpretation, applying l...

Many improvements have been made since the RSA origin in terms of encryption/decryption speed and memory saving. This paper concentrates on the performance improvement. Rebalanced RSA is designed to improve the decryption speed at the cost of encryption speed. Further work was done to improve its encryption speed in terms of rebalanced Chinese Remainder Theorem (CRT) variants. Rebalanced CRT va...