Please enter all answers as strings of 0's and 1's. Consider the 64 bit DES block below. 00100000001000010001000000000000000000000000000000000000000000000010000000100001000100000000000000000000000000000000000000000000 Suppose that this is the initial input to DES. What will the block look like after the initial permutation (IP) is applied? If we apply the IP−1−1 transformation to the above, what will the result be?

Please enter all answers as strings of 0's and 1's. Consider the 64 bit DES block below. 00100000001000010001000000000000000000000000000000000000000000000010000000100001000100000000000000000000000000000000000000000000 Suppose that this is the initial input to DES. What will the block look like after the initial permutation (IP) is applied? If we apply the IP−1−1 transformation to the above, what will the result be?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 41VE

See similar textbooks

Similar questions

Implementing AES Implement (almost) the first round of AES with a 128-bit key. Given a 128-bit plaintext and a 128-bit key, this involves: Performing a bitwise XOR with the plaintext and the key Applying byte substitution for each byte in the state Applying shift rows on the state table rows Applying mix columns on the state table columns Output the state table at this point. The "almost" above means that you don't have to perform the XOR with the state and the first sub-key. Please name the program AESEncryptRound.java or aesencryptround.py. You may hard code the inputs. Please use the following inputs, which are the same as given in Appendix B of the FIPS197 document: plaintext = 0x3243f6a8885a308d313198a2e0370734 key = 0x2b7e151628aed2a6abf7158809cf4f3c The byte substitution, multiply-by-2, an multiply-by-3 tables are available at AEStables.txt. Each is given as a list where the ith entry is the value of applying the given operation to i. Please print the state table after each…
We can perform logical operations on strings of bits by considering each pair of corresponding bits separately (called bitwise operation). Given two eight-bit strings A = 10110001 and B = 10101100 , evaluate the eight-bit result after the following logical operations: OR
Consider the divisor 10011, and suppose that the data-word has the value 1010100000. What is the value of CRC? What will be the sent code-word?
Suppose the DES Mangler function mapped every 32-bit value to zero, regardless of the value of its input, what function would DES compute? Solve this question by answering the following 3 sub-questions. What is the result of each round? What is the result after the 16 rounds? Remind DES = Initial permutation + 16 rounds + swap halves + final permutation? Assume the original message is a 64-bit message, i.e., 1 2 3 4 … 64. Specify the bit positions by then end of these 4 operation. Must provide detailed explanation of the calculation steps.
Suppose the DES Mangler function mapped every 32-bit value to zero, regardless of the value of its input, what function would DES compute? Solve this question by answering the following 3 sub-questions. What is the result of each round? What is the result after the 16 rounds? Remind DES = Initial permutation + 16 rounds + swap halves + final permutation? Assume the original message is a 64-bit message, i.e., 1 2 3 4 … 64. Specify the bit positions by then end of these 4 operation. Use 8x8 matrix for this. Must provide detailed explanation of the calculation steps.
In the Hamming coding system (7.3), its representation is expressed as 3 control (test) bits and 7 total bits (data+control bits).In the literature, control bits are represented as (cl, c2, c3, or (pl, p2, p3, .) The bit string sent by encoding with Hamming coding (15,4) is on the receiving side, It is retrieved as 001100101100 (pl.p2.dll). According to this bit sequence;Which option is given according to the control bits (p1.p2.p3.p4) sequence of the received bit sequence?A 0110B 1100C 1001D 0011E 0010
We can perform logical operations on strings of bits by considering each pair of corresponding bits separately (called bitwise operation). Given two eight-bit strings A = 10110001 and B = 10101100 , evaluate the eight-bit result after the following logical operations: XOR
One way of detecting errors is to transmit data as a block of n rows of k bits per row and adding parity bits to each row and each column. The lower-right corner is a parity bit that checks its row and its column, Will this scheme detect all single errors? Double errors? Triple errors?
Take into consideration the binary BCH code, which is 127 bits long and has a distance of 6 bits intended for it, and use the binary field extension F 128, which is 128 bits in size. How big is the code, and can you guarantee a certain minimum distance between entries?
Let A denote the set of bit strings of length 5 that begins with 10 and B denote the set of bit strings of length 5 that terminate at 00. the number of elements in A∩B is ____
You receive the following data fragment: 0110 0111 1100 1111 0111 1101. You know that the protocol uses bit stuffing. Show the data after destuffing
In the AES Project, you should change the secret key of the AES by a dynamic key generated by RC4 after every 1024 bits, remember you should encrypt an image of 512*512*3 bytes, moreover, the used mode of operation should be CBC mode, Finally, use the attached figure to find the Number of cycles per byte and the encryption throughput?