Title

Towards a Novel Generalized Chinese Remainder Algorithm for Extended Rabin Cryptosystem

Document Type

Article

Publication Date

1-17-2020

Publication Title

IEEE Access

Volume

8

First page number:

26433

Last page number:

26444

Abstract

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.

Keywords

Algorithms; Cryptography; Rabin cryptosystem

Disciplines

Mathematics

Language

English

UNLV article access

Search your library

Share

COinS