The RSA asymmetric cryptosystem provides public-key encryption and authentic digital signatures founded upon the computational intractability of prime integer factorization. Key generation derives public modulus n and private exponent d from two distinct secret prime integers p and q. Senders encrypt plaintext messages M into ciphertext C via modular exponentiation using public exponent e, while receivers decrypt C back to M using modular inverse exponent d.