In AES cryptography, what is the rationale for the bit scrambling step that is used for finding the replacement byte that goes into each cell of the S-box table?

p T Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. Suppose you have an LFSR with 6 state bits. The first 12 bits of output produced by this LFSR are 100011011000 = s0 $1 $2 S3 S4 S5 S6 87 Sg S9 S10 S11 - The first bit produced is the leftmost bit and the bit most recently produced is the rightmost bit. a) What is the initial state of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent S5 = 0, s4 = 1, 83 = 0, s2 = 1, s1 = 0, so = 1). %3D b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent P5 = 0, p4 = 1, pP3 = 0, p2 = 1, p1 = 0, po = 1).

In the steps of “Append the padding bits” in SHA-512 system (shown in Figure 1), the message is padded so that its length is congruent to 896 mod 1024 or (length ≅ 896 mod 1024). State the value of the following padding field is the message length is:  a) 1919 b) 1920 c) 2942

Encrypt the 12-bit plaintext 101010100111 using Simplified B-DES and the 9-bit key K = 010001111. This is a non-computer problem and you need to show all the steps of the encryption process