A binary symmetric channel has a chance p 0.002 of incorrectly transmitting a single bit. Let w = 10100011 be a word which is transmitted over the channel. Let T(w) denote the received word. (a) What is the probability that T(w) 10100011 ? (b) What is the probability that T(w) = 10101011 ? (c) What is the probability that T(w) = w+e for some error string %3D

A binary symmetric channel has a chance p 0.002 of incorrectly transmitting a single bit. Let w = 10100011 be a word which is transmitted over the channel. Let T(w) denote the received word. (a) What is the probability that T(w) 10100011 ? (b) What is the probability that T(w) = 10101011 ? (c) What is the probability that T(w) = w+e for some error string %3D

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

Over a network using WEP, we were able to capture two frames with the sameInitialization Vector (IV). The following are the encrypted messages:• First frame encrypted message:1 0 0 1 0 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 1 0 1 1 0 0 1 0 1 1 1 1 0 1 1 0 1 1 0 1 0 0 11 1 1 1 1 0 0 1 0 0 0 1 0 0 1 1 1 0 0 0• Second frame encrypted message:1 1 0 0 0 0 0 1 1 1 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 0 1 1 1 1 0 11 0 1 0 1 1 0 0 1 1 0 0 0 1 1 0 1 1 1 0We also know that one of the messages is a control message with the following plaintext content:0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 01 0 0 1 1 0 0 1 0 0 0 1 1 1 0 0 01. Find the plaintext of the other message.2. If the captured messages were from two different stations on a network that usesTKIP, is it possible to find the plaintext of the other message? Explain why orwhy not possible.
For the Zhou-Gollman non-repudiation protocol discussed in the lecture on “Non-Repudiationand Anonymity Protocols”, which one of the following statements is false:a) At time point 4, both A and B can produce evidence to prove that they received Kb) At time point 2, both A and B can produce evidence to prove that they received a signedmessage from the other partyc) At time point 0, S cannot prove anythingd) At time point 3, B cannot produce evidence to prove that A has access to key Ke) At time point 1, A can prove that B is alivef) At time point 4, S can prove that A is aliveg) At time point 3, S can produce evidence that that A has access to key Kh) At time point 0, A is not alivei) At time point 2, A can produce evidence to prove that B is alivej) At time point 4, the protocol terminates
Suppose N people want to communicate with each of N – 1 other people using symmetric key encryption. All communication between any two people, i and j, is visible to all other people in this group of N, and no other person in this group should be able to decode their communication. How many keys are required in the system as a whole? Now suppose that public key encryption is used. How many keys are required in this case?
77. Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is .................. a. nP(1-P)^n-1 b. nP c. P(1-P)^n-1 d. n^P(1-P)^n-1
Consider there are 4 stations in the token ring. There is only one packet in the ring. Supposeif the station 1 holds the packet until it completes one revolution and returns to it then whatcould be the Token Holding Time (THT)?a) THT = Propagation delay+ 4*bit delayb) THT = Transmission delay + Propagation delay + 4*bit delayc) THT = Propagation delay + Transmission delay *4d) THT = Transmission delay
Computer Science Before the introduction of IEEE 802.11i, the security scheme for IEEE 802.11 was Wired Equivalent Privacy (WEP). Assume that the initialization vector (IV) is not used in WEP. Instead, RC4 is applied using K as input and producing s as output. Assume RC4(K, n) is applied for each packet and that all packets have the same length. If an attacker intercepts a single packet with ciphertext C1 and also has a known plaintext/ciphertext pair (P2, C2). Show how the attacker can find the plaintext P1. You can make use of an example by assuming some random data is being encrypted.
4.) Suppose that a sender and a receiver are using ARQ to perform reliable data delivery. If we have to send 12 packet and window size of 4 , if every 5 th packet is being transmitted is lost, then how many retransmissions and total number of transmissions are required? (7) a. GoBack-N b. Selective Repeat
Msg3. B→A : B, N1, Ks, Message2, h(B, N1, Message2) Whereas: h(m) represents the digest of the message (m). {m}{K} represents the encryption of message (m) using the key (K) PK is public key N1 is a random number. 1. What are the main problems in Msg3?
Consider two events, a and b, and a set of these binary events is S = {a, b, a, a, b, a, b, b, b, a, a, a}. If we split the set S at the middle then which of the following is related to information gain/loss? a)0.9951 b) 0.9591 c)0.9159 d)0.9519
Consider the GBN protocol with a sender window size of 4 and a sequence number rangeof 1,024. Suppose that at time t, the next in-order packet that the receiver is expecting has asequence number of k. Assume that the medium does not reorder messages. Answer thefollowing questions: What are all possible values of the ACK field in all possible messages currently propagating back to the sender at time t? Justify your answer.
In the final key agreement protocol detailed in the textbook, let's assume that p is about 2048 bits long. Approximately how many bits of entropy are in gxymod p? a)2048 b)512 c)256 d)128
Let A and B be two stations attempting to transmit on Ethernet. Each has a steady queue of frames ready to send. A's frames will be numbered A₁, A₂ and so on, and B's similarly. Let T= 51.2 µs be the exponential backoff = base unit. Suppose A and B simultaneously attempt to send frame 1, collide, and happen to choose backoff times OxT and 1xT, respectively, meaning 'A' wins the race and transmits A₁, while B waits. At the end of this transmission, B will attempt to transmit B, while A will attempt to transmit A₂. These first attempts will collide, but now A backs off for either OxT or 1xT while B backs off for time equal to one of OxT......3xT. Give the probability that A wins the second backoff race.