If F is an error-detection function, either internal or external use will provide error-detection capability. If any bit of the transmitted message is altered, this will be reflected in a mismatch of the received FCS and the calculated FCS, whether the FCS function is performed inside or outside the encryption function. Some codes also provide an error-correction capability. Depending on the nature of the function, if one or a small number of bits is altered in transit, the error-correction code contains sufficient redundant information to determine the errored bit or bits and correct them. Clearly, an error-correction code will provide error correction capability when used external to the encryption function. Will it also provide this capability if used internal to the encryption function?

If F is an error-detection function, either internal or external use will provide error-detection capability. If any bit of the transmitted message is altered, this will be reflected in a mismatch of the received FCS and the calculated FCS, whether the FCS function is performed inside or outside the encryption function. Some codes also provide an error-correction capability. Depending on the nature of the function, if one or a small number of bits is altered in transit, the error-correction code contains sufficient redundant information to determine the errored bit or bits and correct them. Clearly, an error-correction code will provide error correction capability when used external to the encryption function. Will it also provide this capability if used internal to the encryption function?

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

1. Symmetric Encryption and Message Confidentiality: a) Figure 2 shows the Cipher Block Chaining (CBC). There is an error in the transmitted Ciphertext no 1. i) Is there any block further than P1 is affected? ii) Suppose there is a bit error in the source version of P1. Through how many ciphertext blocks is this error propagated? What is the effect on the receiver? iii) Identify which decrypted plaintext blocks Px will be corrupted if there is an error in block C4 of the transmitted ciphertext.
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?
The following figure shows a scenario of insertion attack in which packet "O" has a bad checksum. Why does NIDS let the packet pass through? Question 10 options: NIDS cannot detect the packet "O" NIDS is not allowed to check the checksum of each packet NIDS does not check single letter packet NIDS is not programmed to validate the checksum of each packet.
Which of the following statements is/are correct?I. The fragmentation is applicable for data in the datagram but not for header.II. Reassembly of the fragments must be performed at the destination because,theIntermediate networks may have different maximum transmission unit (MTU) sizes.III. In the IP header, the time-to-live (TTL) field is invariable. (A) I and II(B) I and III(c) II and III(D) All are correct
When many senders attempt to access the same media at once, a condition known as data collision occurs; what protocols and at what Layer(s) are available to avoid this? Is reliable, collision-free transmission ensured by using these protocols? What other choices do you have to solve the issue if that is not the case?
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
In WPA/RSN, what does Michael mean? O RC4's primary mixer algorithm. O The TKIP message-integrity hash. The AES-based message integrity code. OTKIP's cypher algorithm. O TKIP's anti-replay algorithm.
Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose that a datagram is fragmented into four fragments. The first three fragments arrive, but the last one is delayed. Eventually, the timer goes off and the three fragments in the receiver's memory are discarded. A little later, the last fragment stumbles in. What should be done with it?
Data collision is caused when many senders access the same medium at the same time; which protocol(s) and at what layer(s) are available to handle this problem? Is a transfer without collisions guaranteed by using these protocols? In the event that this is not the case, what other possibilities exist for finding a solution to the issue?
3. Consider the go-back-N ARQ: (a) What is the receiver window size? (b) Illustrate two delivery scenarios that would result in a time-out event for the sender after transmitting a data frame to the receiver. (c) In what situation would the receiver discard a received frame? (d) What is the frame error probablity if the frame size is 10 bits and the bit error probability is 0.001.
This begs the issue of why the maximum packet lifetime must be long enough to ensure that not only the packet, but also any acknowledgements associated with it, are no longer present.
Contrast cypher block chaining with cypher feedback mode while sending large files.Which ratio is more productive?