Cryptography is the science of using mathematics that's used to hide information or data that is being sent between participants in a way that prevents other people from reading it. The need of exchanging messages secretly promoted the creation of cryptosystems to enable receivers to interpret the exchanged information. In this study, a particular public key cryptosystem called Rabin Cryptosystem is presented considered with the help of Chinese Reminder Theorem. Since the decryption algorithm of the Rabin cryptosystem is based on computing square roots modulo n, where n = p.q where p and q are primes. This study suggests a modification of Rabin cryptosystem that can make the cryptosystem more immune against some attacks. This modification focuses on considering n = p. q. r where p, q and r are primes. This new modification of Rabin cryptosystem is called H-Rabin Cryptosystem. Also, some basic mathematical concepts are explained and it finally compares the H-Rabin Cryptosystem, RSA cryptosystem and Rabin cryptosystem in terms of security and efficiency. This H-Rabin cryptosystem is a public key cryptosystem where the private key is composed of three primes, p, q and r and a public key composed of n = p. q. r and it is based on the hardness of factoring. Therefore, this new modification can make the cryptosystem more immune against some future attacks.
In this paper, we study the integer solutions of the following equation that is so called the Jin-Schmidt equation, AX2+BY2+CZ2=DXYZ+1, where (X,Y,Z)=(Li,Lj,Lk), with i,j,k≥1 such that Li, Lj and Lk represent terms in the Lucas sequence that is defined by the relation L0=2, L1=1, Ln+1=Ln+Ln−1 with n≥1.
1 January 2023 in Journal of Interdisciplinary Mathematics
This paper represents a new image encryption algorithm based on modifying generalized singular value decomposition (GSVD) by decomposing the plain-image into two segments using GSVD with an exchanged key-image to produce the cipher-image. The exchanged key-image is used as an encrypting and decrypting image. Mathematically, this procedure is represented by transforming the plain-image’s matrix into two different matrices and applying the GSVD with the exchanged key-image’s matrix to obtain the cipher-image’s matrix. The two encoded segments can be kept in several places or assigned to a group of authorized persons. No one can obtain the information of the image easily without the knowledge of the decrypting key. This proposed algorithm is represented as one of the digital image encryption techniques used to enhance the security of images that have been sent between recipients.