/Find the output for the simplified DES encryption with one round and the input (1011 1101), IP-2 6 3 1 4 857, IP¹-4 1 3 5 72 86, E/P-4 1 2 3 2 3 41, P4-2 4 3 1, K-01110011 Y SO= (1032 0 (0123 0 3210 1 S1= 2013 0213 2 3010 2 31323 2103 3 The S-boxes operate as follows. The 1st and 4th input bits are treated as a 2-bit number that specify a row of the S-box, and the 2nd and 3rd input bits specify a column of the S-box. For ex. 1001->row3 and column 0. i.e. in S0-3 in binary = 11 F Borthing 8-bit plaintest &-bit eipherlest

/Find the output for the simplified DES encryption with one round and the input (1011 1101), IP-2 6 3 1 4 857, IP¹-4 1 3 5 72 86, E/P-4 1 2 3 2 3 41, P4-2 4 3 1, K-01110011 Y SO= (1032 0 (0123 0 3210 1 S1= 2013 0213 2 3010 2 31323 2103 3 The S-boxes operate as follows. The 1st and 4th input bits are treated as a 2-bit number that specify a row of the S-box, and the 2nd and 3rd input bits specify a column of the S-box. For ex. 1001->row3 and column 0. i.e. in S0-3 in binary = 11 F Borthing 8-bit plaintest &-bit eipherlest

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Find the representation x of the following signed numbers listed below in the base specified on the…

A: Note: Answering the first three subparts as per the guidelines. Given : Number in binary :…

Q: write pseudo code of simple key expansion routine( version AES -128) Do not copy from internet.

A: Question :- write pseudo code of simple key expansion routine( version AES -128)

Q: c) Consider an NFA given in figure below. Check whether the strings 001, 010111,01110,110 are…

A: We need to check if the given strings are accepted by the given nfa or not.

Q: In the following code, what is the minimum distance for the code? What is the best situation we…

A: Given Code: b1 =(011100) , b2 =(011011) , b3 =(111011) , b4 =(100011) , b5 =(000000) , b6…

Q: If the sequence number space contains k bits, think about using both the Go-Back-N and…

A: 1) Go-Back-N and selective-repeat are two flow control techniques used in computer networking to…

Q: Write a program to check whether the message received at the destination is error-free. For…

A: #include <iostream>#include <fstream> using namespace std; int main(){ int count1 =…

Q: Consider the following TM: 0/0 → B|B → 1/0 → 1/1 → start → 9 0/0- 0/0 - B|B + On input 1010110 which…

A: Please find answer to the above question below:

Q: Which of the following g(x) values guarantees that a single-bit error is caught? For each case, what…

A: Given Which of the following g(x) values guarantees that a single-bit error is caught? For each…

Q: Question 2. The following sequence of 25 binary digits is the beginning of the output sequence from…

A: The LFSR stands for Linear-feedback shift register. it is a shift register whos input value is a…

Q: Using CBC and IV=101, Encrypt 111100011100? Input Output 000 110 001 111 010 101 011…

A: To encrypt the given plaintext "111100011100" using Cipher Block Chaining (CBC) mode with an Initial…

Q: 1110 0111 (binary) is equal to E3 (hex)? True or false?

A: Definition: Binary Code Decimal: The binary coded decimal is a class that is of the binary…

Q: CRC checker using the generator 10011 (x4+x+1) received the following message: 10111101. The…

A: Message codeword is 101111010101

Q: Implementing AES Implement (almost) the first round of AES with a 128-bit key. Given a 128-bit…

A: Steps for the AES Encryption Process The encryption process uses a set of specially designed keys…

Question

Y
/ Find the output for the simplified DES encryption with one round and the input (1011
1101), IP=2 6 3 1 4 857, IP¹-4 1 3 5 7 2 8 6, E/P=4 1 2 3 2 3 4 1, P4-2 4 3 1, K=0 1 1 1 0011
SO=
(1032 0
3210
1
0213
2
3132 3
S1 =
(0123 0
2013 1
3010 2
21033
The S-boxes operate as follows. The 1st and 4th input bits are treated
as a 2-bit number that specify a row of the S-box, and the 2nd and
3rd input bits specify a column of the S-box. For ex. 1001=>row3
and column 0. i.e. in S0=3 in binary = 11
8-bit plaintest
ys
IP
IP-1
8-bit cipherlest

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Let A be the set of all strings of 0's and 1's, and let T be the set of all strings of 0's and 1's that consist of consecutive triples of identical bits. Consider the coding and decoding functions E and D defined below : Find E (0110) and D (111111000111). E (0110)=? D (111111000111)=?
In the hamming code C (7, 4), three redundant bits are generated as follows:0 2 1 0 r = a ⊕ a ⊕ a1 3 2 1 r = a ⊕ a ⊕ a2 3 1 0 r = a ⊕ a ⊕ a
What are the various problems that could arise in Non-Return to Zero (NRZ) encoding if a continuous stream of 0s or 1s is sent? Instead of writing an essay, try writing in bulleted form, briefly explaining what you understand from the findings.
So i have to find the minimum hamming distance of a binary code c={1001, 0111, 1110, 1100, 0000, 1010, 1111, 1100}, now in one part of my lecture i think my prof said the min d equals the smallest weight of the nonzero character and that would be 2 but at the same time the min between 0111 and 1111 is 1 so which one is hammings min distance?
Decode the message without encoding techniques.(I need an explanation on how it's done. Having diffulties. Thanks) 01001110 01100101 01110110 01100101 01110010 00100000 01100111 01101111 01101110 01101110 01100001 00100000 01100111 01101001 01110110 01100101 00100000 01111001 01101111 01110101 00100000 01110101 01110000 00001010 01001110 01100101 01110110 01100101 01110010 00100000 01100111 01101111 01101110 01101110 01100001 00100000 01101100 01100101 01110100 00100000 01111001 01101111 01110101 00100000 01100100 01101111 01110111 01101110 00001010 01001110 01100101 01110110 01100101 01110010 00100000 01100111 01101111 01101110 01101110 01100001 00100000 01110010 01110101 01101110 00100000 01100001 01110010 01101111 01110101 01101110 01100100 00100000 01100001 01101110 01100100 00100000 01100100 01100101 01110011 01100101 01110010 01110100 00100000 01111001 01101111 01110101 00001010 01001110 01100101 01110110 01100101 01110010 00100000 01100111 01101111 01101110 01101110 01100001…
What is the result of the following binary subtraction? (11011001)2 - (01101010)2 None of the other choices listed here is correct. (1001111) 2 (1011111)2 (1101011)2 (1101111)2 (1100111)2
Please answer both questions, exactly with explanation: # A password generator creates a 10-character case-sensitive alphanumeric (a-zA-Z0-9) password keyed by pseudo-random number generator that has deterministic output based on a 32-bit seed (e.g., a 32-bit integer) provided by the user. How many passwords are possible? If it takes .0001 seconds to check a password, what will the average length of time be for a successful brute force attack?
Need answer for this. Theres a txt file of data given. Below : Txt file name is A2data6.txt 6 6 3 2 74 11 27 14 712 3 1814 8 217 18 1619 3 1520 17 1024 12 727 16 831 1 734 13 937 6 738 5 1042 1 242 7 1046 9 147 8 1052 18 1654 8 058 6 1658 1 2062 8 2066 12 166 8 1269 13 1473 16 175 19 1880 5 682 6 785 15 585 10 385 11 1690 17 194 6 695 4 1296 14 799 6 3101 1 4103 19 7105 17 19109 14 13111 19 15115 17 8116 13 13119 14 8123 5 19125 7 10128 1 7129 11 19132 11 1133 14 0134 16 18139 17 1141 4 0142 19 5144 17 17146 3 10147 12 5150 11 10155 8 18156 0 18159 3 14164 18 2168 5 3171 6 10174 5…
Calculate the state of PRESENT-80 after the execution of one round.Use the following values (in hexadecimal notation):Plaintext: 0000 0000 0012 3456Key: BBBB 5555 5555 EEEE FFFF
Suppose that we have the following 128-bit AES key, given in hexadecimalrepresentation:54 77 6F 20 4F 6E 65 20 4E 69 6E 65 20 54 77 6F Construct the round key for the first round.
Write the number as a generic binary number using a radix point. Do not write the number using an IEEE standard. Convert 0.625 to binary
You have been hired by a company to design a circuit to encrypt passwords. Assumepasswords are 3 bits in size and that the encrypted password is the original password inverted(0's become 1's and 1's become 0's) and then add 3 (modulo 8 as we only have 3 bits). Forexample if the password is 000, we invert it to give us 111. We then add 3 (7 + 3 = 10 mod8 = 2) which makes the encrypted password 010. Design and build a sequential circuit (usingthe procedure from your notes) using 3 T flip-flops to perform the above function. You needto show the State Table, K-maps and draw the sequential circuit.