First page number:
Last page number:
This paper proposes a number of theorems and algorithms for the Chinese Remainder Theorem, which is used to solve a system of linear congruences, and the extended Rabin cryptosystem, which accepts a key composed of an arbitrary finite number of distinct primes. This paper further proposes methods to relax the condition on the primes with trade-offs in the time complexity. The proposed algorithms can be used to provide ciphertext indistinguishability. Finally, this paper conducts extensive experimental analysis on six large data sets. The experimental results show that the proposed algorithms are asymptotically tight to the existing decryption algorithm in the Rabin cryptosystem with the key composed of two distinct primes while maintaining increased generality.
Algorithms; Cryptography; Rabin cryptosystem
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Shiue, P. J.,
Huang, S. C.,
Lowe, B. J.
Towards a Novel Generalized Chinese Remainder Algorithm for Extended Rabin Cryptosystem.
IEEE Access, 8