RSA Encryption: RSA Stands For The Creators of The Technique, Rivest, Shamir and Adelman
RSA Encryption: RSA Stands For The Creators of The Technique, Rivest, Shamir and Adelman
Introduction
A B CD E F G H I J K L M N O P Q R S T U V WX Y Z
0 1 23 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5
The table above will help alot when encrypting and decrypting data.
When using the Caesar Cipher with key 10, then we encrypt each letter
by adding 10. For example, X is number 23, so we add 10 to that.
23+10=33 but we want a number that is between 0 and 25 inclusive. So,
33-26=7. Letter X is encrypted as the 7th letter of the alphabet or “H”.
The table below shows this for every letter of the alphabet.
A B C D E F G H I J K L M N O P Q R S T U V WX Y Z
1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5
K L MN O P Q R S T U V WX Y Z A B CD E F G H I J
Now that you know how to encrypt data using the Cesar Cipher, we can
get into decryption. For example, each letter has been encrypted using
key 10,
so Decrypt “OLBKRSW”
To do that you need to start with “O”, O is numbered “14” so you need to
subtract 10 since the “key” is 10. 14-10=4 So, the number 14 identifies
the same place in the alphabet as the number 4, which is “E”.
Letter L: 11-10=1 So, the number 11 identifies the same place in the
alphabet as the number 1, which is “B”.
Letter K: 10-10=0. so, the number 10 identifies the same place in the
alphabet as the number 0, which is “A”.
Letter R: 17-10=7. So, the number 17 identifies the same place in the
alphabet as the number 7, which is “H”.
Letter S: 18-10=8. So, the number 18 identifies the same place in the
alphabet as the number 8, which is “I”.
Letter W: 22-10=12 So, the number 22 identifies the same place in the
alphabet as the number 12, which is “M”.
Prime Numbers
It is fairly easy to factor prime numbers but very difficult to factor very
large numbers considering there are infinitely many prime numbers, that
is what makes RSA very hard to crack by hackers.
Step 1: Choose two prime numbers (p and q) let's say p=3 and q=11.
Step 5: Find the integer D with 1< D<A so that D×E −1 is a multiple of A.
For example, (Dx7)-1=20 so D=3.
Step 2: Find the remainders when each number is divided by 33. (n=33)
Step 3: Raise all of the remainders you got by the power of 3.(D=3)
Step 5: Put all the remainders you got together and you will be back to
the original message. So, 2,3,4,5 is our original answer which translates
to MATH.