On Using The First Variant of Dependent RSA Encryption Scheme to Secure Text: A Tutorial

Abstract

Abstract The Rivest-Shamir-Adleman (RSA) public key cryptosystem has been extensively used to secure digital communication since more than forty years. The security of RSA relies on the hardness of factoring a big integer into its two big prime factors: the bigger the integer, the securer the cryptosystem. However, the RSA cryptosystem is proven to be not semantically secure. Some variants of Dependent RSA encryption schemes have been introduced by Pointcheval to overcome this problem. This study shows how the first variant of Dependent RSA (DRSA-1) encryption scheme is used to secure text. All algorithms have been implemented in the Python programming language version 2.7.15.