Skip to main content

Analysis of Bidirectional Forwarding Detection (BFD) Security According to the Keying and Authentication for Routing Protocols (KARP) Design Guidelines

The information below is for an old version of the document that is already published as an RFC.
Document Type
This is an older version of an Internet-Draft that was ultimately published as RFC 7492.
Authors Manav Bhatia , Dacheng Zhang , Mahesh Jethanandani
Last updated 2015-10-14 (Latest revision 2015-02-09)
Replaces draft-bhatia-zhang-karp-bfd-analysis
RFC stream Internet Engineering Task Force (IETF)
Stream WG state WG Document
Document shepherd Brian Weis
Shepherd write-up Show Last changed 2014-07-01
IESG IESG state RFC 7492 (Informational)
Consensus boilerplate Yes
Telechat date (None)
Responsible AD Adrian Farrel
IESG note Processing as AD Sponsored as KARP working group has closed down.
Send notices to (None)
IANA IANA review state Version Changed - Review Needed
IANA action state No IANA Actions
Network Working Group                                          M. Bhatia
Internet-Draft                                            Ionos Networks
Intended status: Informational                                  D. Zhang
Expires: August 13, 2015                                         Alibaba
                                                         M. Jethanandani
                                                       Ciena Corporation
                                                        February 9, 2015

Analysis of Bidirectional Forwarding Detection (BFD) Security According
                          to KARP Design Guide


   This document analyzes the Bidirectional Forwarding Detection
   protocol (BFD) according to the guidelines set forth in section 4.2
   of KARP Design Guidelines RFC6518.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on August 13, 2015.

Copyright Notice

   Copyright (c) 2015 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   ( in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of

Bhatia, et al.           Expires August 13, 2015                [Page 1]
Internet-Draft              BFD Gap Analysis               February 2015

   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

1.  Introduction

   This document performs a gap analysis of the current state of
   Bidirectional Forwarding Detection [RFC5880] according to the
   requirements of KARP Design Guidelines [RFC6518].  Previously, the
   OPSEC working group has provided an analysis of cryptographic issues
   with BFD in Issues with Existing Cryptographic Protection Methods for
   Routing Protocols [RFC6039].

   The existing BFD specifications provide a basic security solution.
   Key ID is provided so that the key used in securing a packet can be
   changed on demand.  Two cryptographic algorithms (MD5 and SHA-1) are
   supported for integrity protection of the control packets; the
   algorithms are both demonstrated to be subject to collision attacks.
   Routing protocols like RIPv2 Cryptographic Authentication [RFC4822],
   IS-IS Generic Cryptographic Authentication [RFC5310] and OSPFv2 HMAC-
   SHA Cryptographic Authentication [RFC5709] have started to use BFD
   for liveliness check.  Moving the routing protocols to a stronger
   algorithm while using weaker algorithm for BFD would allow the
   attacker to bring down BFD in order to bring down the routing
   protocol.  BFD therefore needs to match the routing protocols in its
   strength of algorithm.

   While BFD uses a non-decreasing per-packet sequence number to protect
   itself from intra-connection replay attacks, it still leaves the
   protocol vulnerable to the inter-session replay attacks.

2.  Requirements to Meet

   There are several requirements described in section 3 of The Threat
   Analysis and Requirements for Cryptographic Authentication of Routing
   Protocols' Transports [RFC6862] that BFD as defined in BFD [RFC5880]
   does not currently meet:

      Replay Protection: BFD provides an incomplete intra-session and no
      inter-session replay attack protection; this creates significant
      denial-of-service opportunities.

      Strong Algorithms: the cryptographic algorithms adopted for
      message authentication in BFD are MD5 or SHA-1 based.  However,
      both algorithms are known to be vulnerable to collision attacks.
      BFD Generic Cryptographic Authentication
      [I-D.ietf-bfd-generic-crypto-auth] and Authenticating BFD using
      HMAC-SHA-2 procedures [I-D.ietf-bfd-hmac-sha] together propose a

Bhatia, et al.           Expires August 13, 2015                [Page 2]
Internet-Draft              BFD Gap Analysis               February 2015

      solution to support HMAC with the SHA-2 family of hash functions
      for BFD.

      DoS Attacks: BFD packets can be sent at millisecond intervals (the
      protocol uses timers at microsecond intervals).  When malicious
      packets are sent at short intervals, with the authentication bit
      set, it can cause a DoS attack.  There is currently no light
      weight mechanism within BFD to address this issue and is one of
      the reasons BFD authentication is still not widely deployed in the

   The remainder of this document explains the details of how these
   requirements fail to be met and proposes mechanisms for addressing

3.  Current State of Security Methods

   BFD [RFC5880] describes five authentication mechanisms for the
   integrity protection of BFD control packets: Simple Password, Keyed
   MD5 The MD5 Message-Digest Algorithm [RFC1321], Meticulous Keyed MD5,
   Keyed SHA-1 and Meticulous SHA-1.  In the simple password mechanism,
   every control packet is associated with a password transported in
   plain text; attacks eavesdropping the network traffic can easily
   learn the password and compromise the security of the corresponding
   BFD session.  In the Keyed MD5 and the Meticulous Keyed MD5
   mechanisms, BFD nodes use share secret keys to generate keyed MD5
   digests for control packets.  Similarly, in the Keyed SHA-1 and the
   Meticulous Keyed SHA-1 mechanisms, BFD nodes use shared secret keys
   to generate keyed SHA-1 digests for control packets.  Note that in
   the keyed authentication mechanisms, every BFD control packet is
   associated with a non-decreasing 32-bit sequence number to resist
   replay attacks.  In the Keyed MD5 and the Keyed SHA-1 mechanisms, the
   sequence member is only required to increase occasionally.  However,
   in the Meticulous Keyed MD5 and the Meticulous Keyed SHA-1
   mechanisms, the sequence member is required to increase with each
   successive packet.

   Additionally, limited key updating functionality is provided.  There
   is a Key ID in every authenticated BFD control packet, indicating the
   key used to hash the packet.  However, there is no mechanism
   described to provide a smooth key rollover that the BFD routers can
   use when moving from one key to the other.

   The BFD session timers are defined with the granularity of
   microseconds, and it is common in practice to send BFD packets at
   millisecond intervals.  Since the cryptographic sequence number space
   is only 32 bits, a sequence number used in a BFD session may reach
   its maximum value and roll over within limited period.  For instance,

Bhatia, et al.           Expires August 13, 2015                [Page 3]
Internet-Draft              BFD Gap Analysis               February 2015

   if a sequence number is increased by one every 3.3 millisecond, then
   it will reach its maximum value in less than 24 weeks.  This can
   result in potential inter-session replay attacks especially when BFD
   uses the non-meticulous authentication modes.

   Note that when using authentication mechanisms, BFD drops all packets
   that fall outside the limited range (3* Detection time multiplier).
   Therefore, when meticulous authentication modes are used, a replayed
   BFD packet will be rejected if it cannot fit into a relatively short
   window (3 times the detect interval of the session).  This introduces
   some difficulties for replaying packets.  However, in a non-
   meticulous authentication mode, such windows can be large as sequence
   numbers are only increased occasionally, thus making it easier to
   perform replay attacks .

   In a BFD session, each node needs to select a 32-bit discriminator to
   identify itself.  Therefore, a BFD session is identified by two
   discriminators.  If a node will randomly select a new discriminator
   for a new session and uses authentication mechanism to secure the
   control packets, inter-session replay attacks can be mitigated to
   some extent.  However, in existing BFD demultiplexing mechanisms, the
   discriminators used in a new BFD session may be predictable.  In some
   deployment scenarios, the discriminators of BFD routers may be
   decided by the destination and source addresses.  So, if the sequence
   number of a BFD router rolls over for some reason (e.g., reboot), the
   discriminators used to identify the new session will be identical to
   the ones used in the previous session.  This makes performing a reply
   attack relatively simple.

   BFD allows a mode called the echo mode.  Echo packets are not defined
   in the BFD specification, though they can keep the BFD session up.
   The format of the echo packet is local to the sending side and there
   are no guidelines on the properties of these packets beyond the
   choice of the source and destination addresses.  While the BFD
   specification recommends applying security mechanisms to prevent
   spoofing of these packets, there are no guidelines on what type of
   mechanisms are appropriate.

4.  Impacts of BFD Replays

   As discussed, BFD cannot meet the requirements of inter-session or
   intra-session replay protection.  This section discusses the impacts
   of BFD replays.

   When cryptographic authentication mechanisms are adopted for BFD, a
   non-decreasing 32-bit long sequence number is used.  In the Keyed MD5
   and the Keyed SHA-1 mechanisms, the sequence member is not required
   to increase for every packet.  Therefore an attacker can keep

Bhatia, et al.           Expires August 13, 2015                [Page 4]
Internet-Draft              BFD Gap Analysis               February 2015

   replaying the packets with the latest sequence number until the
   sequence number is updated.  This issue is eliminated in the
   Meticulous Keyed MD5 and the Meticulous Keyed SHA-1 mechanisms.
   However, note that a sequence number may reach its maximum and be
   rolled over in a session.  In this case, without the support from a
   automatic key management mechanism, the BFD session will be
   vulnerable to replay attacks performed by sending the packets before
   the roll over of the sequence number.  For instance, an attacker can
   replay a packet with a sequence number which is larger than the
   current one.  If the replayed packet is accepted, the victim will
   reject the legal packets whose sequence members are less than the one
   in the replayed packet.  Therefore, the attacker can get a good
   chance to bring down the BFD session.  This kind of attack assumes
   that attacker has access to the link when the BFD session is on a
   point to point link, or can inject packets for a BFD session with
   multiple hops.

   Additionally, the BFD specification allows for the change of
   authentication state based on the state of a received packet.  For
   instance, according to BFD [RFC5880], if the state of a accepted
   packet is down, the receiver of the packet needs to transfer its
   state to down as well.  Therefore, an carefully selected replayed
   packet can cause a serious denial-of-service attack.

   BFD does not provide any solution to deal with inter-session replay
   attacks.  If two subsequent BFD sessions adopt an identical
   discriminator pair and use the same cryptographic key to secure the
   control packets, it is intuitive to use a malicious authenticated
   packet (stored from the past session) to perform inter-connection
   replay attacks.

   Any security issues in the BFD echo mode will directly affect the BFD
   protocol and session states, and hence the network stability.  For
   instance, any replay attacks would be indistinguishable from normal
   forwarding of the tested router.  An attack would still cause a
   faulty link to be believed to be up, but there is little that can be
   done about it.  However, if the echo packets are guessable, it may be
   possible to spoof from an external source and cause BFD to believe
   that a one-way link is really bidirectional.  As a result, it is
   important that the echo packets contain random material that is also
   checked upon reception.

5.  Impact of New Authentication Requirements

   BFD can be run in software or hardware.  Hardware implementations run
   BFD at a much smaller timeout, typically in the order of few
   milliseconds.  For instance with a timeout of 3.3 milliseconds, a BFD
   session is required to send or receive 3 packets every 10

Bhatia, et al.           Expires August 13, 2015                [Page 5]
Internet-Draft              BFD Gap Analysis               February 2015

   milliseconds.  Software implementations typically run with a timeout
   in hundreds of milliseconds.

   Additionally, it is not common to find hardware support for computing
   the authentication data for the BFD session in hardware or software.
   In the keyed MD5 and Keyed SHA-1 implementation where the sequence
   number does not increase with every packet, software can be used to
   compute the authentication data.  This is true if the time between
   increasing sequence number is long enough to compute the data in
   software.  The ability to compute the hash in software is difficult
   with Meticulous Keyed MD5 and Meticulous Keyed SHA-1 if the time
   interval between transmits or between receives is small.  The
   computation problem becomes worse if hundred or thousands of sessions
   require the hash to be recomputed every few milliseconds.

   Smaller and cheaper boxes that have to support a few hundred BFD
   sessions are boxes that also use a slower CPU.  The CPU is used for
   running the entire control plane software in addition to supporting
   the BFD sessions.  As a general rule, no more than 40-45% of the CPU
   can be dedicated towards supporting BFD.  Adding computation of the
   hash for every BFD session, can easily cause the CPU to exceed the
   40-45% limit even with a few tens of sessions.  On higher end boxes
   with faster and more CPU cores, the expectation is that the number of
   sessions that need to be supported are in the thousands, but the
   number of BFD sessions with authentication that CPU can support is
   still in the hundreds.

   Implementors should assess the impact of authenticating BFD sessions
   on their platform.

6.  Considerations for improvement

   This section suggests changes that can be adopted to improve the
   protection of BFD.

   The security risks brought by SHA-1 and MD5 have been well
   understood.  However, when using stronger digest algorithm, e.g.,
   SHA-2, the imposed computing overhead will seriously affect the
   performance of BFD implementation.  In order to make the trade-off
   between the strong algorithm requirement and the imposed overhead,
   Galois Message Authentication Code (GMAC) can be a candidate option.
   This algorithm is relatively effective and has been supported by
   IPsec for data origin authentication.  More detailed information can
   be found in The Use of GMAC in IPsec ESP and AH [RFC4543].

   There has been some hallway conversation around the idea of using BFD
   cryptographic authentication only when some data in the BFD payload
   changes.  The other BFD packets can be transmitted and received

Bhatia, et al.           Expires August 13, 2015                [Page 6]
Internet-Draft              BFD Gap Analysis               February 2015

   without authentication enabled.  Bulk of the BFD packets that are
   transmitted and received have no state change associated with them.
   Limiting authentication to BFD packets that affect a BFD session
   state allows for more sessions to be supported for authentication.
   This change can significantly help the routers since they dont have
   to compute and verify the authentication digest for the BFD packets
   coming at the milli-second intervals.  This proposal needs some more
   discussion in the BFD working group and is certainly a direction that
   BFD could look at.

7.  IANA Considerations

   This document makes no request of IANA.

   Note to RFC Editor: this section may be removed on publication as an

8.  Security Considerations

   This document discusses vulnerabilities in the existing BFD protocol
   and suggests possible mitigations.

   In analyzing the improvements for BFD the ability to repel a replay
   attack is discussed.  For example, increasing the sequence number to
   a 64bit value makes the wrap around time much longer and a replay
   attack can be easily prevented.

   Mindful of the impact that stronger algorithms can have on the
   performance of BFD, the document suggests GMAC as a possible
   candidate for MAC function.

9.  Acknowledgements

   We would like to thank Alexander Vainshtein for his comments on this

10.  References

10.1.  Normative References

   [RFC1321]  Rivest, R., "The MD5 Message-Digest Algorithm", RFC 1321,
              April 1992.

   [RFC5880]  Katz, D. and D. Ward, "Bidirectional Forwarding Detection
              (BFD)", RFC 5880, June 2010.

Bhatia, et al.           Expires August 13, 2015                [Page 7]
Internet-Draft              BFD Gap Analysis               February 2015

   [RFC6039]  Manral, V., Bhatia, M., Jaeggli, J., and R. White, "Issues
              with Existing Cryptographic Protection Methods for Routing
              Protocols", RFC 6039, October 2010.

10.2.  Informative References

              Bhatia, M., Manral, V., Zhang, D., and M. Jethanandani,
              "BFD Generic Cryptographic Authentication", draft-ietf-
              bfd-generic-crypto-auth-06 (work in progress), April 2014.

              Zhang, D., Bhatia, M., Manral, V., and M. Jethanandani,
              "Authenticating BFD using HMAC-SHA-2 procedures", draft-
              ietf-bfd-hmac-sha-05 (work in progress), July 2014.

   [RFC4543]  McGrew, D. and J. Viega, "The Use of Galois Message
              Authentication Code (GMAC) in IPsec ESP and AH", RFC 4543,
              May 2006.

   [RFC4822]  Atkinson, R. and M. Fanto, "RIPv2 Cryptographic
              Authentication", RFC 4822, February 2007.

   [RFC5310]  Bhatia, M., Manral, V., Li, T., Atkinson, R., White, R.,
              and M. Fanto, "IS-IS Generic Cryptographic
              Authentication", RFC 5310, February 2009.

   [RFC5709]  Bhatia, M., Manral, V., Fanto, M., White, R., Barnes, M.,
              Li, T., and R. Atkinson, "OSPFv2 HMAC-SHA Cryptographic
              Authentication", RFC 5709, October 2009.

   [RFC6518]  Lebovitz, G. and M. Bhatia, "Keying and Authentication for
              Routing Protocols (KARP) Design Guidelines", RFC 6518,
              February 2012.

   [RFC6862]  Lebovitz, G., Bhatia, M., and B. Weis, "Keying and
              Authentication for Routing Protocols (KARP) Overview,
              Threats, and Requirements", RFC 6862, March 2013.

Authors' Addresses

   Manav Bhatia
   Ionos Networks


Bhatia, et al.           Expires August 13, 2015                [Page 8]
Internet-Draft              BFD Gap Analysis               February 2015

   Dacheng Zhang


   Mahesh Jethanandani
   Ciena Corporation
   3939 North 1st Street
   San Jose, CA  95134

   Phone: 408.904.2160
   Fax:   408.436.5582

Bhatia, et al.           Expires August 13, 2015                [Page 9]