Question

if P = NP, then RSA insecure?

Answer 1

Solution:-

First of all we need to understand the importance of RSA then we conclude that is it secure or insecure.

• RSA is an cryptographic algorithm used to decrypt and encrypt message.
• It is an Asymmetric key algorithm (i.e there are two diffrent key is used in the algorithm one is public key and another is private key.)
• RSA algorithm is widely used to secure sensitive data , and when user didn't want to disclose it openly while sending on the internet.

Yes if P=NP then RSA is insecure because of the following reason:-

• If P=NP then it means that there exist a polynomial time algorithm to break the RSA security. It implies that all the data that is secure with RSA algorithm can be decrypt the third person.
• But till now there is no such algorithm exist that to break the RSA algorithm in ploynomial time.
• It is very difficult to construct the algorithm to prove P=NP.

-----------------------------------------------------------------------------------------------------------------