Jan. 4, 2023, 2:10 a.m. | Krishnan Shankar

cs.CR updates on arXiv.org arxiv.org

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 …

algorithm hard key problems public public key questions rsa security strength

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Information Security Engineers

@ D. E. Shaw Research | New York City

Security Officer Level 1 (L1)

@ NTT DATA | Virginia, United States of America

Alternance - Analyste VOC - Cybersécurité - Île-De-France

@ Sopra Steria | Courbevoie, France

Senior Security Researcher, SIEM

@ Huntress | Remote US or Remote CAN

Cyber Security Engineer Lead

@ ASSYSTEM | Bridgwater, United Kingdom