DeepAI AI Chat
Log In Sign Up

RSA+: An algorithm at least as secure as RSA

by   Krishnan Shankar, et al.
James Madison University

The RSA algorithm has been around for nearly five decades and remains one of the most studied public key cryptosystems. Many attempts have been made to break it or improve it and questions remain about the equivalence of the strength of its security to well known hard problems in computational number theory. In this note we propose a modified version which we call RSA+ which is at least as secure as RSA and show that breaking RSA+ is probably computationally equivalent to factoring n, the public modulus. The motivation came from wanting to obscure the encryption exponent in RSA.


page 1

page 2

page 3

page 4


Efficient Quantum Public-Key Encryption From Learning With Errors

Our main result is a quantum public-key encryption scheme based on the E...

Determining the Optimal Random-padding Size for Rabin Cryptosystems

Rabin encryption and a secure ownership transfer protocol based on the d...

Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More

We study certified everlasting secure functional encryption (FE) and man...

On One-way Functions and Kolmogorov Complexity

We prove that the equivalence of two fundamental problems in the theory ...

On homomorphic encryption using abelian groups: Classical security analysis

In [15], Leonardi and Ruiz-Lopez propose an additively homomorphic publi...

Build It, Break It, Fix It: Contesting Secure Development

Typical security contests focus on breaking or mitigating the impact of ...

On the Gold Standard for Security of Universal Steganography

While symmetric-key steganography is quite well understood both in the i...