Abstract Algebra: Theory and Applications · Problem 7.3.3

Algebraic Coding Theory — Thomas Judson

Mathematics — Abstract Algebra · rsa-computational-security

Problem

Explain the mathematical basis for saying: encrypting a message using an RSA public key is very simple computationally, while decrypting a communication without the private key is very hard computationally.

Related theory

Computational Security And The Adversary Model

Browse the problem library