EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 8, Problem P23P
Program Plan Intro
Given Information:
It is given that:
- Trudy is a woman in the middle.
- In the stream of datagram’s going from R1 and R2, she can insert a datagram.
- Trudy sends one of the datagram’s duplicate copies to perform a reply attack.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Are HMAC-based message integrity schemes vulnerable to replay attacks? Is it possible to use a nonce to delete this if that is the case? vulnerability?
Help me please
b) Consider a scenario where fragmentation may take place in packet transfer. Discuss how such fragmentation may be reassembled at the destination. Now consider in such scenario, a datagram is fragmented into five fragments. The first four fragments arrive, but the last one is delayed. Eventually, the timer goes off and the four fragments in the receiver’s memory are discarded. A little later, the last fragment arrives. What should be done with it?
Chapter 8 Solutions
EBK COMPUTER NETWORKING
Ch. 8 - Prob. R1RQCh. 8 - Prob. R2RQCh. 8 - Prob. R3RQCh. 8 - Prob. R4RQCh. 8 - Prob. R5RQCh. 8 - Prob. R6RQCh. 8 - Prob. R7RQCh. 8 - Prob. R8RQCh. 8 - Prob. R9RQCh. 8 - Prob. R10RQ
Ch. 8 - Prob. R11RQCh. 8 - Prob. R12RQCh. 8 - Prob. R13RQCh. 8 - Prob. R14RQCh. 8 - Prob. R15RQCh. 8 - Prob. R16RQCh. 8 - Prob. R17RQCh. 8 - Prob. R18RQCh. 8 - Prob. R19RQCh. 8 - Prob. R20RQCh. 8 - Prob. R21RQCh. 8 - Prob. R22RQCh. 8 - Prob. R23RQCh. 8 - Prob. R24RQCh. 8 - Prob. R25RQCh. 8 - Prob. R26RQCh. 8 - Prob. R27RQCh. 8 - Prob. R28RQCh. 8 - Prob. R29RQCh. 8 - Prob. R30RQCh. 8 - Prob. R31RQCh. 8 - Prob. R32RQCh. 8 - Prob. R33RQCh. 8 - Prob. P1PCh. 8 - Prob. P2PCh. 8 - Prob. P3PCh. 8 - Prob. P4PCh. 8 - Prob. P5PCh. 8 - Prob. P6PCh. 8 - Prob. P8PCh. 8 - Prob. P12PCh. 8 - Prob. P13PCh. 8 - Prob. P14PCh. 8 - Prob. P18PCh. 8 - Prob. P20PCh. 8 - Prob. P21PCh. 8 - Prob. P22PCh. 8 - Prob. P23P
Knowledge Booster
Similar questions
- 4. We conduct a known plaintext attack on LFSR-based stream cipher. We know that the plaintext was: 1001 0010 0110 1101 1001 0010 0110 and the corresponding ciphertext was: 1011 1100 0011 0001 0010 1011 0001 Answer the following tasks with motivation. (a) What is the degree of the key stream generator? (b) What is the intialization vector? (c) Determine the feedbak coefficients of LFSR.arrow_forwardConsider sending a 2000-byte datagram into a link with a MTU of 980 bytes. Suppose the original datagram has the identification number 227. How many fragments are generated? For each fragment, what is its size, what is the value of its identification number, fragment offset, and fragment flag?arrow_forwardWith the ECB mode, if there is an error in a block of the transmitted ciphertext, only the corresponding plaintext block is affected. However, in the CBC mode, this error propagates. For example, an error in the transmitted C1 obviously corrupts P1 and P21. 1. Are any blocks beyond P2 affected? 2. 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? (Encryption algorithms question)arrow_forward
- Using a TCP SYN spoofing attack, the attacker aims to flood the table of TCP connection requests on a system so that it is unable to respond to legitimate connection requests. Consider a server system with a table for 256 connection requests. This system will retry sending the SYN-ACK packet five times when it fails to receive an ACK packet in response, at 30 second intervals, before purging the request from its table. Assume that no additional countermeasures are used against this attack and that the attacker has filled this table with an initial flood of connection requests. a. At what rate must the attacker continue to send TCP connection requests to this system in order to ensure that the table remains full? b. Assuming that the TCP SYN packet is 40 bytes in size (ignoring framing overhead), how much bandwidth does the attacker consume to continue this attack?arrow_forwardR6Fragmentation of an IP datagram takes place if its size is larger than the MTU of the subnet over which the datagram will be routed. Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose 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?arrow_forwardWhen a file is transferred between two computers, two acknowledgement strategies are possible. In the first one, the file is chopped up into packets, which are individually acknowledged by the receiver, but the file transfer as a whole is not acknowledged. In the second one, the packets are not acknowledged individually, but the entire file is acknowledged when it arrives. Discuss these two approaches.arrow_forward
- 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.arrow_forwardSuppose an error occurs in a block of ciphertext on transmission using CBC. What effect is produced on the recovered plaintext blocks?arrow_forwardIn IPsec, each incoming and outgoing packet will be checked with the Security Policy Database (SPD) and the Security Association Database (SAD). (a) What is the checking done with the SPD: (b) What is the checking done with the SAD? (c) Each security association stored in SAD is identified by an integer. What is this integer called?arrow_forward
- What is traffic analysis for a network? Is there any relationship between the network traffic and the cryptographic key used (by nodes) for a communication? For instance, let us consider that five nodes have several keys in common. They are now communicating over a network. Given this scenario, write some paragraphs about your understanding why or why not the keys would affect the traffic analysis.arrow_forwardIn order to implement the classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 60 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 30-Mbps link? How many per second if the attacker uses a 100-Mbps link? Or a1-Gbps link?arrow_forward10 For a Smurf attack, we know the amplification factor = (total response size)/(request size).For example, a group of adversaries uses 'Dumb' protocol to conduct a Smurf attack. In the 'Dumb' protocol, a request containing 56 bytes results in 500 bytes of response. Assume that 150 devices are running this 'Dumb' protocol in a network. The devices are connected to the Internet through a single gateway. What would be the amplification factor for 'Dumb' protocol if we conduct the Smurf attack using the devices in the above network? Show your work. Plz answer ASAP, will votearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education