Elevating ‘e’ in RSA: A Path to Improved Encryption Algorithms

As the world increasingly relies on the internet for critical communication and the exchange of personal information, security concerns are at an all-time high. But do heightened security measures solely offer peace of mind to the paranoid, or do they serve as a fundamental safeguard for all users? With billions of people using the internet for business, social interaction, and the transmission of an ever-growing amount of data, the importance of security cannot be overstated. Our study proposes a modified version of the traditional RSA algorithm where the encrypting variable “e” is modified, rather than being transmitted as the public key. This approach offers a significant advantage as it only requires a single key pair for communication with an unlimited number of parties. A unique security and key generation process have been completely tested and compared to the RSA system. The results show that the new approach not only provides good security but also speeds up key generation. Thanks to a single key brace, communication between multitudinous parties is both safe and simple with this innovative approach. The RSA system was a notable achievement in the wisdom of cryptography since it was the first to allow for both signing and breaking using public key cryptography, opening the path for further advances. The RSA algorithm, a well-known public-key encryption approach, was a significant step forward in the science of cryptography. It set the path for subsequent improvements as the first technology that could be used for both signing and encrypting utilising public key cryptography. RSA encryption's security is based on two fundamental mathematical challenges: brute force (trying every conceivable private key) and mathematical attacks (factoring the product of two primes in multiple ways). The security of the RSA method is increased in this work by altering the public keys “e” value. This method is more secure than RSA because it is founded on the factoring problem.