rsa
An abbreviation encryption system that is very powerful. It uses prime numbers in order to make it harder to break. It will convert characters and words into one very large number which is solved using a decryption algorithm.
crypto encryption cryptography
crypto encryption cryptography
P = 61 <- first prime number (destroy this after computing E and D)
Q = 53 <- second prime number (destroy this after computing E and D)
PQ = 3233 <- modulus (give this to others)
E = 17 <- public exponent (give this to others)
D = 2753 <- private exponent (keep this secret!)
Your public key is (E,PQ).
Your private key is D.
decrypt(C) = (C^D) mod PQ
= (C^2753) mod 3233
encrypt(T) = (T^E) mod PQ
= (T^17) mod 3233
Q = 53 <- second prime number (destroy this after computing E and D)
PQ = 3233 <- modulus (give this to others)
E = 17 <- public exponent (give this to others)
D = 2753 <- private exponent (keep this secret!)
Your public key is (E,PQ).
Your private key is D.
decrypt(C) = (C^D) mod PQ
= (C^2753) mod 3233
encrypt(T) = (T^E) mod PQ
= (T^17) mod 3233
Get the rsa mug.