Let N= pq be an RSA modulus which is the product of two balanced prime factors. In 2018,
Murru and Saettone presented a variant of the RSA cryptosystem based on a cubic Pell …

In 2022, Cotan and Teşeleanu presented a variant of the RSA cryptosystem where the
modulus is of the form N= pq, and the private and the public exponents satisfy ed≡ 1 (mod …

The RSA is one of the current default cryptosystems that provides security with applications
such as encryptions and digital signatures. It is important to further study the weak …

Let N= pq be the product of two balanced prime numbers p and q. In Elkamchouchi et
al.(Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian …

An authenticated reversible image hiding algorithm based on blockchain framework is
presented in this paper. First, global eigenvalues of the plain image are extracted as …

Let N= pq be the product of two balanced prime numbers p and q. Murru and Saettone
presented in 2017 an interesting RSA-like cryptosystem that uses the key equation ed-k (p …

The RSA (Rivest–Shamir–Adleman) cryptosystem is a widely used public-key cryptographic
algorithm in information systems and computer applications. With the advancement of lattice …

To enhance the security or the efficiency of the standard RSA cryptosystem, some variants
have been proposed based on elliptic curves, Gaussian integers or Lucas sequences. A …

Abstract The Murru-Saettone cryptosystem is an RSA-like cryptosystem constructed from a
particular group with a non-standard product in a cubic field related to the general cubic form …

In this paper, we consider five variants of the RSA cryptosystem, where the modulus is N=
pq, and the public key e and the secret key d satisfy ed− k (p 2+ p+ 1)(q 2+ q+ 1)= 1 or ed− k …