Jump to content

Smurf attack

From Wikipedia, the free encyclopedia

A Smurf attack is a distributed denial-of-service attack in which large numbers of Internet Control Message Protocol (ICMP) packets with the intended victim's spoofed source IP are broadcast to a computer network using an IP broadcast address.[1] Most devices on a network will, by default, respond to this by sending a reply to the source IP address. If the number of machines on the network that receive and respond to these packets is very large, the victim's computer will be flooded with traffic. This can slow down the victim's computer to the point where it becomes impossible to work on.



The original tool for creating a Smurf attack was written by Dan Moschuk (alias TFreak) in 1997.[2][3]

In the late 1990s, many IP networks would participate in Smurf attacks if prompted (that is, they would respond to ICMP requests sent to broadcast addresses). The name comes from the idea of very small, but numerous attackers overwhelming a much larger opponent (see Smurfs). Today, administrators can make a network immune to such abuse; therefore, very few networks remain vulnerable to Smurf attacks.[4]



A Smurf amplifier is a computer network that lends itself to being used in a Smurf attack. Smurf amplifiers act to worsen the severity of a Smurf attack because they are configured in such a way that they generate a large number of ICMP replies to the victim at the spoofed source IP address.

In DDoS, amplification is the degree of bandwidth enhancement that an original attack traffic undergoes (with the help of Smurf amplifiers) during its transmission towards the victim computer. An amplification factor of 100, for example, means that an attacker could manage to create 100 Mb/s of traffic using just 1 Mb/s of its own bandwidth.[5]

Under the assumption no countermeasures are taken to dampen the effect of a Smurf attack, this is what happens in the target network with n active hosts (that will respond to ICMP echo requests). The ICMP echo request packets have a spoofed source address (the Smurfs' target) and a destination address (the patsy; the apparent source of the attack). Both addresses can take two forms: unicast and broadcast.

The dual unicast form is comparable with a regular ping: an ICMP echo request is sent to the patsy (a single host), which sends a single ICMP echo reply (a Smurf) back to the target (the single host in the source address). This type of attack has an amplification factor of 1, which means: just a single Smurf per ping.

When the target is a unicast address and the destination is the broadcast address of the target's network, then all hosts in the network will receive an echo request. In return they will each reply to the target, so the target is swamped with n Smurfs. Amplification factor = n. If n is small, a host may be hindered but not crippled. If n is large, a host may come to a halt.

If the target is the broadcast address and the patsy a unicast address, each host in the network will receive a single Smurf per ping, so an amplification factor of 1 per host, but a factor of n for the network. Generally, a network would be able to cope with this form of the attack, if n is not too great.

When both the source and destination address in the original packet are set to the broadcast address of the target network, things start to get out of hand quickly. All hosts receive an echo request, but all replies to that are broadcast again to all hosts. Each host will receive an initial ping, broadcast the reply and get a reply from all n-1 hosts. An amplification factor of n for a single host, but an amplification factor of n2 for the network.

ICMP echo requests are typically sent once a second. The reply should contain the contents of the request; a few bytes, normally. A single (double broadcast) ping to a network with 100 hosts causes the network to process 10000 packets. If the payload of the ping is increased to 15000 bytes (or 10 full packets in Ethernet) then that ping will cause the network to have to process 100000 large packets per second. Send more packets per second, and any network would collapse under the load. This will render any host in the network unreachable for as long as the attack lasts.



A Smurf attack can overwhelm servers and networks. The bandwidth of the communication network can be exhausted resulting in the communication network becoming paralyzed.[6]



The fix is two-fold:

  1. Configure hosts and routers to ignore packets where the source address is a broadcast address; and
  2. Configure routers to not forward packets directed to broadcast addresses. Until 1999, standards required routers to forward such packets by default. Since then, the default standard was changed to not forward such packets.[7]

It's also important for ISPs to implement ingress filtering, which rejects the attacking packets on the basis of the forged source address.[8]

Mitigation on a Cisco router


An example of configuring a router so it will not forward packets to broadcast addresses, for a Cisco router, is:

Router(config-if)# no ip directed-broadcast[9]

(This example does not protect a network from becoming the target of a Smurf attack; it merely prevents the network from participating in a Smurf attack.)

Fraggle attack


A Fraggle attack (named for the creatures in the puppet TV series Fraggle Rock) is a variation of a Smurf attack where an attacker sends a large amount of UDP traffic to ports 7 (Echo) and 19 (CHARGEN). It works similarly to the Smurf attack in that many computers on the network will respond to this traffic by sending traffic back to the spoofed source IP of the victim, flooding it with traffic.[10]

Fraggle.c, the source code of the attack, was also released by TFreak.[11]

See also



  1. ^ Sun, Fei Xian (2011). "Danger Theory Based Risk Evaluation Model for Smurf Attacks". Key Engineering Materials. 467–469: 515–521. doi:10.4028/www.scientific.net/KEM.467-469.515. ISSN 1662-9795. S2CID 110045205.
  2. ^ "Tfreak". Hackepedia. 2013-03-28. Retrieved 2019-11-13.
  3. ^ Pramatarov, Martin (2021-09-09). "What is a Smurf DDoS attack?". ClouDNS Blog. Retrieved 2022-09-15.
  4. ^ For example, netscan.org (Web Archive) showed 122,945 broken networks as of Jan 25, 1999, but only 2,417 as of Jan 06, 2005.
  5. ^ S. Kumar (5 July 2007). Kumar, Sanjeev (2007). "Smurf-based Distributed Denial of Service (DDoS) Attack Amplification in Internet". Second International Conference on Internet Monitoring and Protection (ICIMP 2007). p. 25. doi:10.1109/ICIMP.2007.42. ISBN 978-0-7695-2911-0. S2CID 14876546. Retrieved 2020-12-30. {{cite book}}: |website= ignored (help)
  6. ^ Hartanto, Sri (2023-07-30). "The Impact of Smurf Attack on Web Server in Communication Network and its Preventions". International Journal of Sustainable Applied Sciences (IJSAS). 1 (1). Sri Hartanto: 35–46. ISSN 3025-5597.
  7. ^ D. Senie (August 1999). Changing the Default for Directed Broadcasts in Routers. Network Working Group. doi:10.17487/RFC2644. BCP 34. RFC 2644. Best Common Practice. Updates RFC 1812.
  8. ^ Ferguson, P.; Senie, D. (May 2000). Network Ingress Filtering: Defeating Denial of Service Attacks which employ IP Source Address Spoofing. IETF. doi:10.17487/RFC2827. BCP 38. RFC 2827. Best Common Practice.
  9. ^ "A Cisco Guide to Defending Against Distributed Denial of Service Attacks". Cisco. Retrieved 2019-09-26.
  10. ^ Hendric, William (23 March 2016). "Fraggle attack".
  11. ^ Anonymous (2003). Maximum Security. Sams Publishing. ISBN 978-0-672-32459-8.