Question: The first question uses the concepts of the RSA Algorithm to encrypt a message. You are not required to determine the public key and the
The first question uses the concepts of the RSA Algorithm to encrypt a message. You are not required to determine the public key and the private key, these will be given to you (the derivation is provided online). You will be required to use the public key given to you to encrypt the message. Please note that these are DIFFERENT prime number values than in the text, but they DO work. To familiarize yourself with this methodology, you should read the Adobe pdf file.
READ THIS: Your encrypted values for question 1 must include leading zeroes to the third digit. So, for example, if your ciphertext results in 83, you must code it as 083 if you do not do this, that particular encrypted value will be counted as incorrect.
1. Encrypt the message SENDCASHNOW (no spaces) using the following public key (proven to work): See Table 8-5 in the Adobe pdf example from the Whitman/Mattord text. Note the different P, Q, and (N,E) than in the Adobe pdf example from the Whitman/Mattord text.
P = 7, Q = 19, so public key is (N,E) = (133,5). The message is SENDCASHNOW (broken into two tables so it will fit)
| Message | S | E | N | D | C | A | S | H |
| (Text)^E |
|
|
|
|
|
|
|
|
| Ciphertext |
|
|
|
|
|
|
|
|
| Message | N | O | W |
| (Text)^E |
|
|
|
| Ciphertext |
|
|
|
2. Using the very same message and the Vernam Cipher depicted on page 362 in the Adobe pdf example from the Whitman/Mattord text, produce the correct ciphertext.
| Plaintext | S | E | N | D | C | A | S | H | N | O | W |
| One-time pad | G | P | Q | S | O | S | X | J | Y | R | L |
| Sum |
|
|
|
|
|
|
|
|
|
|
|
| After Modulo Subtraction |
|
|
|
|
|
|
|
|
|
|
|
| Ciphertext |
|
|
|
|
|
|
|
|
|
|
|
3. Using the Vigenre Square (either from the PowerPoint or the Whitman/Mattord Adobe pdf file its the same square) and the keyword CRYPTO, encrypt the very same message (note that since the plaintext only has 11 letters, we drop the O at the end of the 2nd iteration of the key).
| C | R | Y | P | T | O | C | R | Y | P | T |
| S | E | N | D | C | A | S | H | N | O | W |
|
|
|
|
|
|
|
|
|
|
|
|
4. Using Exclusive OR (XOR) with the characters Bag in ASCII binary as the key, and the word DOG as your plaintext, create the sequence of cipher bits. NOTE the key IS case-sensitive
| Bag |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| DOG |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
NOTE: you have to determine the ASCII for BOTH the key (Bag) and the plaintext (DOG). You must enter the ASCII for each before doing the XOR function.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
