This problem provides a numerical example of encryption using a oneround version of DES. We start with the same bit pattern for the key and the plaintext in hexadecimal notation 0 1 2 3 4 5 6 7 8 9 A B C D E F:
a. Derive K1, the first round sub-key.
b. Derive L0, R0.
c. Expand R0 to get E[R0].
d. Calculate A= E[R0] xor K1.
e. Group the 48-bit result of (d) into set of 6 bits and evaluate the corresponding S-box substitutions.
f. Concatenate the results of (e) to get a 32-bit result, B. g. Apply the permutation to get P(B). h. Calculate R1=P(B) xor L0. i.
Write down the cipher text.
1. What should Julie do first?
2. Why should she do this first?
3. List in order your next nine priorities and justify your answers.
In RSA , given e=13 and n=100
a) Encrypt the message “HOW ARE YOU” using 00 and 25 for letters A to Z and 26 for the space. Use different blocks to make P
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.