Asymmetrische Encryptie Demo

1 Key Generation

First, we need to generate our keys. RSA uses prime numbers for this.

Choose two small prime numbers:

p =

q =

2 Encryption (Alice → Bob)

👨🏻‍✈️

Thierry

Sender

encrypted message

👨🏻‍💻

Cor

Receiver

Alice wants to send a secret number to Bob. She uses Bob's public key to encrypt it.

Enter a message (number less than n=): m = 42

3 Decryption (Bob receives)

Bob receives the encrypted number and uses his private key to decrypt it.

Bob received: c =

4 Complete Flow Visualization

Bob's Keys

🔓 Public: (, )

🔐 Private: (, )

Bob shares public key

👨🏻‍✈️ Thierry

Has message:

Uses Bob's public key

mod =

Sends encrypted:

👨🏻‍💻 Cor

Receives:

Uses his private key

mod =

Why Does This Work?

The magic is in the mathematical relationship:

m^e×d mod n = m

Because we chose d such that: e × d ≡ 1 (mod φ(n))

This is Euler's theorem in action: m^φ(n) ≡ 1 (mod n)

Why is it secure?

An attacker knows n and e (public key), but to find d they need φ(n).

To calculate φ(n) = (p-1)(q-1), they need to factor n into p × q.

With small numbers like ours, this is easy. But with 2048-bit numbers, factoring is computationally infeasible!

5 Try It Yourself!

Experiment with different messages and see the encryption/decryption in real-time.

Message (1 to ):

Original Message (m)

42

🔓 m^e mod n

Encrypted (c)

-

🔐 c^d mod n

Decrypted (m)

-

Encryption:

Decryption:

Asymmetric Encryption Demo

What is Asymmetric Encryption?

1 Key Generation

Step 1: Calculate n (modulus)

Step 2: Calculate φ(n) (Euler's totient)

Step 3: Choose e (public exponent)

Step 4: Calculate d (private exponent)

Public Key

Private Key