Now let’s look at a more modern symmetric encryption. Assume that the algorithm

ID: 3855073 • Letter: N

Question

Now let’s look at a more modern symmetric encryption. Assume that the algorithm for this system is to rotate the bits in the message right 4 positions, XOR the bits with the key, and rotate the bits 2 positions to the left.

a.I will email you the key which is encoded within a spam email message. Please be on the lookoutfor this message.Once you receive the email go tohttp://www.spammimic.com/ and click on Decode. Cut and paste the body of your email into the Decode window and get the key. The keywill be 2 hex numerals. If you don't get 2 hex numerals when you decode the message, you haven't copied the entire email message. What is the key?

a) The Key is 96 , i dont know what to do from here, please show your work for b and c !!!! thank you

b.Using the key and the above algorithm, decrypt the following message which contains a name given in hex): 0A 0F 48 4B 09 CA Remember that you’ll have to reverse the order and direction of operations in order to decrypt the name (i.e. Start by rotating 2 positions right). What is name (as it appears exactly in the message) ?

c.The answer to Part b is the name of a Greek god. Find (and give) the Roman equivalent of this god in upper case. Using the key and the above algorithm, encrypt the name (in upper case) and give your answer in hex format (not ASCII

Explanation / Answer

b) 0A 0F 48 4B 09 CA to binary is
0000 1010 0000 1111 0100 1000 0100 1011 0000 1001 1100 1010

Rotate 2 bits to the right
1000 0010 1000 0011 1101 0010 0001 0010 1100 0010 0111 0010

96 in binary is 1001 0110. So we XOR the bits above with these and get

Your teacher couldn't say that the key should not be repeated. So you can repeat the key
note:
1 xor 1=0
1 xor 0=1
0 xor 0=0
0 xor 1=1

Code:
         1000 0010 1000 0011 1101 0010 0001 0010 1100 0010 0111 0010
         1001 0110 1001 0110 1001 0110 1001 0110 1001 0110 1001 0110
(XOR)
        -----------------------------------------------------------
         0001 0100 0001 0101 0100 0100 1000 0100 0101 0100 1110 0100

Rotate 4 left
0100 0001 0101 0100 0100 1000 0100 0101 0100 1110 0100 0001

Convert to hex:
4 1 5 4 4 8 4 5 4 E 4 1

separate by 2 digit value:
41 54 48 45 4E 41

Look up ASCII table value equal to the hex value and you get
A T H E N A

"ATHENA" is Greek Goddess of wisdom, craft, war.

c) Roman equivalent of ATHENA in uppercase is MINERVA

So, here consider MINERVA is in ASCII and find the equivalent hexadecimal value using the table

Convert MINERVA to hexadecimal
4D 49 4E 45 52 56 41

4D 49 4E 45 52 56 41 to binary is 0100 1101 0100 1001 0100 1110 0100 0101 0101 0010 0101 0110 0100 0001

rotate 2 right:
0101 0011 0101 0010 0101 0011 1001 0001 0101 0100 1001 0101 1001 0000

code XOR:

0101 0011 0101 0010 0101 0011 1001 0001 0101 0100 1001 0101 1001 0000

1001 0110 1001 0110 1001 0110 1001 0110 1001 0110 1001 0110 1001 0110

-----------------------------------------------------------------------

1100 0101 1100 0100 1100 0101 0000 0111 1100 0010 0000 0011 0000 0110

sift 2 left:
0101 1100 0100 1100 0101 0000 0111 1100 0010 0000 0011 0000 0110 1100

convert to hex:
5C4C507C20306C

Navigate

Now let’s consider an example based on Henry Cavendish’s famous experiment to di

Now let’s look at a more modern symmetric encryption. Assume that the algorithm

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

Now let’s look at a more modern symmetric encryption. Assume that the algorithm

Question

Explanation / Answer

Related Questions

Navigate