he code containing of 8 code words which encrypt the communications zero to 1 1 1 as follows: State the succeeding questions with explanation on the question above: Is it linear? what is its block length, message length, charge and distance? how many mistakes can it detect, and how many situations is it incorrect?

he code containing of 8 code words which encrypt the communications zero to 1 1 1 as follows: State the succeeding questions with explanation on the question above: Is it linear? what is its block length, message length, charge and distance? how many mistakes can it detect, and how many situations is it incorrect?

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

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…
Compute CBC-MAC for a message of 16 bits, “ABCD” (in Hexa). Assume a block size of 8 bits with an IV=C9 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be D8 (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.
N blocks of plaintext (P1 to PN) are being encrypted in CFB mode into ciphertext (C1 to CN). Assume that two bits of C3 are erroneous (their binary values have flipped). What bits of C3, C4, and C20 are erroneous?
Computer Science With the CBC/OFB/CFB/CTR mode: (a) if there is a single bit transmission error in block C3 of the ciphertext, which plaintext blocks are affected? CBC and CTR (b) Suppose that there is a bit error in the source version of P1. Through how many ciphertext blocks is this error propagated? What is the effect at the receiver?
Compute CBC-MAC for a message of 16 bits, “ABCD” (in Hexa). Assume a block size of 8 bits with an IV=C9 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be D8 (in Hexa).
Give encryption or decryption of these hexadecimal messages using the one-time pad algorithm, giving the result in hexadecimal also. You may wish to convert to binary first. a. m = 0xdeadbeef, K = 0x4ea04002, c = ? b. c = 0x84848484, K = 0xffffffff, m = ? c. c = 0x104557ce, K = 0xdabbad00, m = ?
Suppose that a message is to be encrpted using the formula c=9p mod 26. What is the formula that you must use to decrypt a secret message?
Problem with constructing MAC. The messages X to be authenticated consists of z independent blocks, so that: X = x1||x2|| . . . ||xz, where every xi consists of |xi| = 8 bits. The input blocks are consecutively put into the compression function ci = h(ci−1, xi) = ci−1⊕xi At the end, the MAC value: MACk(X) = cz+k mod 28 is calculated, where k is a 64-bit long shared key. Describe how exactly the (effective part of the) key k can be calculated with only one known message X.
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).
To decode a message encrypted using DES requires finding the key from among the 256 possible 56-bit binary keys. Although you might find the key early on, the worst case is that you have to test all 256 possible DES keys. a. How long would this take using the gaming PC described in the Special Interest Box “The Tortoise and the Hare” in Chapter 3? Assume that a single key can be tested in one floating-point operation. b. How long would this take using the Chinese Sunway TaihuLight supercomputer described in the Special Interest Box “The Tortoise and the Hare” in Chapter 3? Assume that a single key can be tested in one floating-point operation.
The very last block of a message encrypted with AES-256 in CBC mode is 15 bytes long and ends with the bytes: 0102030405060708090a0b0c0d0e0f When padded in accordance with PKCS #7 with 16-byte blocks, what is the complete value of the last block? *Please explain how you have solved this, thank you!!
Given are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situation