Public Key Cryptography (RSA)

Step-by-step visualization of Key Generation, Encryption, and Decryption using small prime numbers.

1. Key Generation

Choose two distinct prime numbers \( p \) and \( q \).

p = q =

Enter a message \( m \) (number less than \( n \)).

m =

\( c = m^e \pmod n \) \( c = 9^7 \pmod{143} = \) 48

Using private key \( d \) to recover message.

\( m = c^d \pmod n \) \( m = 48^{103} \pmod{143} = \) 9