3.03-2 Internet Checksum (b). Consider the two sixteen bit numbers: 10110100 01000110 11001000 01101110 Compute the Internet Checksum of these two values Enter the 2 bytes each as an 8-bit number with only 0's and 1's, and make a single blank space between the two 8-bit numbers (e.g., 01010101 00101000) [Note: you can generate/solve/practice many similar instances of this question here.]

3.03-2 Internet Checksum (b). Consider the two sixteen bit numbers: 10110100 01000110 11001000 01101110 Compute the Internet Checksum of these two values Enter the 2 bytes each as an 8-bit number with only 0's and 1's, and make a single blank space between the two 8-bit numbers (e.g., 01010101 00101000) [Note: you can generate/solve/practice many similar instances of this question here.]

Name: QUESTION 33.03-2 Internet Checksum (b). Consider the two sixteen bit
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: QUESTION 33.03-2 Internet Checksum (b). Consider the two sixteen bit numbers:10110100 0100011011001000 01101110Compute the Internet Checksum of these two valuesEnter the 2 bytes each as an 8-bit number with only 0's and 1's, and make a single blank

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

Similar questions

In this problem, we will get practice with computing the one’s complement of the one’s complement sum over a sequence of data values. We will use the exact same algorithm used to compute TCP/UDP checksum, but over a sequence of 4-bit chunks rather than 16-bit chunks. (a) Consider the following data bits. What is the (4-bit) checksum of this (8-bit) data? 0101 1100 (b) Consider the following data bits. What is the 4-bit checksum of this (12-bit) data? (Note: you may be able to reuse calculations from part (a).) 0101 1100 1001
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.
Message digests are reasonably fast, but here's a much faster function to compute. Take your message, divide it into 128-bit chunks, and XOR all the chunks together to get a 128-bit result. Finally, do the standard message digest on the result (which is only 128 bits). Is this a good message digest function? Why or why not? You must clearly state your reason, simply giving a yes or no will not earn any credit.
Assume we have a code composed of 5 ternary codewords of varying lengths (1, 1, 2, 2, 3). How many unique messages comprised of two message symbols result in a series of four code symbols after encoding?
1. Assume that P2 issues the logical address 0xD98A. What is the logical page number contained in the given logical address, in hexadecimal? Answer is: 0x 6 But I do not knot well how to calculate
Assume you are using any correct plaintext padding method, such as those described in lecture, with a 128-bit (16-byte) block cipher. If you are sending a message that is 184 bytes long, how many padding bytes would you need to add? Justify your answer. For the remaining questions, consider a 4-bit block cipher, described in hexadecimal by the following table: Plaintext Ciphertext Plaintext Ciphertext 0 a 8 e 1 c 9 d 2 f a 0 3 6 b 7 4 3 c 5 5 8 d b 6 4 e 9 7 2 f 1 You can think of this as a simple substitution cipher for hexadecimal digits. There is no “key” other than the table itself.
SUBJECT:- NETWORKING NOTE:- TAKE X = 1149 QUESTION# 1:- A bit stream X is being transmitted, where; X is the ASCII of last digits of your arid number (For example a student having 19-ARID-1149 will use ASCII of 1149 as X). a) Use 100001 as flag (starting/ending delimiter) and apply bit stuffing approach at layer 2. b) Apply Polar (RZ or NRZ) signaling/coding scheme on the resultant data obtained from part a of this question and represent the signal.
I88. Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. Manchester using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level...
42. Though there are practical reasons why we don't complicate our lives this way in the real world, from a theoretical perspective we could borrow non-consecutive bits for subnetting. So, when borrowing the first host bit, the second host bit and the last two host bits (counting from the left of the host bit field) from 172.1.0.0 can you determine the following: g. 1,203rd useable host address?
Compare and contrast the following four mechanisms for breaking up a bitstream into frames (make sure to give the pros and cons for each and provide examples of each schema in the context of transmitting the message "A B ESC FLG FLG A": byte count flag bytes with bit stuffing flag bytes with byte stuffing physical layer coding violations
a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret prefix MAC…