This question concerns the DES IP box. Please enter all answers as strings of 0's and 1's. Consider the 64 bit DES block below. 0000000000000000000000000000110100000010000100000000000000000000 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 transformation to the above, what will the result be?

This question concerns the DES IP box. Please enter all answers as strings of 0's and 1's. Consider the 64 bit DES block below. 0000000000000000000000000000110100000010000100000000000000000000 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 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

In this problem we will work through a round of DES. For notational simplicity, assume it is the first round. Please enter all answers as strings of 0's and 1's. The input is the 64 bit block 0000001000100000000000000000000000000000000000000100000000010010 Suppose that the subkey for the current round is this 48 bit number: 000000000000000000000000000001000000000000000000 What does the 64 bit state look like after the IP transformation is applied to the input? Now find Lo and Ro, the left and right halves of the state. Lo Ro = What is the result of applying the expansion box to Ro? E(Ro) = What is the result of XORing the subkey with E(Ro)? ki O E(Ro) = We now apply the S-box transformation. S(k, O E(R)) Finally we apply the permutation box to complete the function f. f(Ro) = P(S(k1 O E(Ro))) = We can now compute the state of DES going into the next round. L, = Rj =
In this problem we will work through a round of DES. For notational simplicity, assume it is the first round. Please enter all answers as strings of 0's and 1's. The input is the 64 bit block 0000000000000010000000000000001000000100000001000100000000000000 Suppose that the subkey for the current round is this 48 bit number: 000000000000000001000000000000000000000000000000 What does the 64 bit state look like after the IP transformation is applied to the input? 00000000000110000100000000000000 Now find Lo and Ro, the left and right halves of the state. Lo 01000000010000000000000000010000 = Ro=00000000000000100000000000000000 What is the result of applying the expansion box to R₁? E(Ro) = 00000000000000100000000000000000 What is the result of XORing the subkey with E(Ro)? k₁ E(Ro) = 00000000000000100000000000000000 We now apply the S-box transformation. S(k₁ E(Ro)) = 11011000110110001101111110111100 Finally we apply the permutation box to complete the function f. f(Ro) = P(S(k₁ + E(Ro)))…
Implement the design of a 2-bit binary subtractor meaning a 2-bit subtracted by another 2-bit. The 2-bit minuend are labeled AB (A = MSB, B = LSB) and the 2-bit subtrahend are labeled CD (C = MSB, D = LSB) and the 4-bit difference is labeled as WXYZ (W = MSB, Z = LSB). Any negative value answers should display in 1's complement.
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…
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
In this problem we will work through a round of DES. For notational simplicity, assume it is the first round. Please enter all answers as strings of O's and 1's. The input is the 64 bit block 0000000000000100000000000100001000100000000000000000100000000000 Suppose that the subkey for the current round is this 48 bit number: 000000000000000010000000000000000000000000000000 What does the 64 bit state lok like after the IP transformation is applied to the input? Now find Ln and Ro, the left and right halves of the state. Lo =0 Ro = What is the result of applying the expansion box to Ro? E(Ro) = 0 What is the result of XORing the subkey with E(Ro)? k1 e E(Ro) = We now apply the S-box transformation. S(kı O E(Ro)) = Finally we apply the permutation box to complete the function f. f(Ro) = P(S(kı O E(Ro))) = We can now compute the state of DES going into the next round. L, =|| Rj =
A Gray code is a sequence of binary numbers with the property that no more than 1 bit changes in going from one element of the sequence to another. For example, here is a 3-bit binary Gray code: 000, 001, 011, 010, 110, 111, 101, and 100. Using three D flip-flops and a PLA, construct a 3-bit Gray code counter that has two inputs: reset, which sets the counter to 000, and inc, which makes the counter go to the next value in the sequence. Note that the code is cyclic, so that the value after 100 in the sequence is 000.
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?
Implement the following function F(x,y,z) using a decoder. This function will return 1 if the value is divisible by Four otherwise it will return zero. asap pls.
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
Write an assmbly language program that does the following in MPLABX:• Copy 0x0a into r18.• Use operations on r18 to copy bits 3, 2 and 1 of r18 into the least significant bits ofr19, r20, r21. For example, r19 would equal 0x01 since bit 3 of 0x0a is 1.
Consider a 16 bit FPN (floating point number). Here the exponent is in excess-63 form and mantissa is the fraction. Base of the system is 2. It is used to store (0.239) X 23. 1. In the above question, what will be the hexadecimal pattern, which denote the given value without normalization. Write the complete steps used for calculation. 2. What is the largest positive and the smallest positive number stored in the 16-bit register of the FPN? Cleary explain what will be the values of mantissa and exponent in the case of largest and smallest positive number with proper justification.