RFC 8784 PROPOSED STANDARD IKEV2 · IPSEC · POST-QUANTUM

IKEv2 PSK mixing: Mixing Preshared Keys in the Internet Key Exchange Protocol Version 2 (IKEv2) for Post-quantum Security

Mixing an extra preshared key into IKEv2 so that VPN traffic stays protected even if quantum computers break today's key exchange.

On rfc-editor.org ↗
PUBLISHED
June 2020
AUTHORS
S. Fluhrer, P. Kampanakis, D. McGrew, V. Smyslov
STREAM
IETF
USE_PPK NOTIFICATION TYPE
16435
PPK_IDENTITY NOTIFICATION TYPE
16436
NO_PPK_AUTH NOTIFICATION TYPE
16437
RECOMMENDED KEY ENTROPY
At least 256 bits
POST-QUANTUM SECURITY THAT GIVES
128 bits
KEY IDENTIFIER TYPES
PPK_ID_OPAQUE (1) and PPK_ID_FIXED (2)
DOI
10.17487/RFC8784
ERRATA
Reported errata

RFC text

Contents
Original text · RFC Editor View on rfc-editor.org ↗
Internet Engineering Task Force (IETF)                        S. Fluhrer
Request for Comments: 8784                                 P. Kampanakis
Category: Standards Track                                      D. McGrew
ISSN: 2070-1721                                            Cisco Systems
                                                              V. Smyslov
                                                              ELVIS-PLUS
                                                               June 2020


 Mixing Preshared Keys in the Internet Key Exchange Protocol Version 2
                   (IKEv2) for Post-quantum Security

Abstract

   The possibility of quantum computers poses a serious challenge to
   cryptographic algorithms deployed widely today.  The Internet Key
   Exchange Protocol Version 2 (IKEv2) is one example of a cryptosystem
   that could be broken; someone storing VPN communications today could
   decrypt them at a later time when a quantum computer is available.
   It is anticipated that IKEv2 will be extended to support quantum-
   secure key exchange algorithms; however, that is not likely to happen
   in the near term.  To address this problem before then, this document
   describes an extension of IKEv2 to allow it to be resistant to a
   quantum computer by using preshared keys.

Status of This Memo

   This is an Internet Standards Track document.

   This document is a product of the Internet Engineering Task Force
   (IETF).  It represents the consensus of the IETF community.  It has
   received public review and has been approved for publication by the
   Internet Engineering Steering Group (IESG).  Further information on
   Internet Standards is available in Section 2 of RFC 7841.

   Information about the current status of this document, any errata,
   and how to provide feedback on it may be obtained at
   https://www.rfc-editor.org/info/rfc8784.

Copyright Notice

   Copyright (c) 2020 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
   (https://trustee.ietf.org/license-info) 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
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction
     1.1.  Requirements Language
   2.  Assumptions
   3.  Exchanges
   4.  Upgrade Procedure
   5.  PPK
     5.1.  PPK_ID Format
     5.2.  Operational Considerations
       5.2.1.  PPK Distribution
       5.2.2.  Group PPK
       5.2.3.  PPK-Only Authentication
   6.  Security Considerations
   7.  IANA Considerations
   8.  References
     8.1.  Normative References
     8.2.  Informative References
   Appendix A.  Discussion and Rationale
   Acknowledgements
   Authors' Addresses

1.  Introduction

   Recent achievements in developing quantum computers demonstrate that
   it is probably feasible to build one that is cryptographically
   significant.  If such a computer is implemented, many of the
   cryptographic algorithms and protocols currently in use would be
   insecure.  A quantum computer would be able to solve Diffie-Hellman
   (DH) and Elliptic Curve Diffie-Hellman (ECDH) problems in polynomial
   time [C2PQ], and this would imply that the security of existing IKEv2
   [RFC7296] systems would be compromised.  IKEv1 [RFC2409], when used
   with strong preshared keys, is not vulnerable to quantum attacks
   because those keys are one of the inputs to the key derivation
   function.  If the preshared key has sufficient entropy and the
   Pseudorandom Function (PRF), encryption, and authentication
   transforms are quantum secure, then the resulting system is believed
   to be quantum secure -- that is, secure against classical attackers
   of today or future attackers with a quantum computer.

   This document describes a way to extend IKEv2 to have a similar
   property; assuming that the two end systems share a long secret key,
   then the resulting exchange is quantum secure.  By bringing post-
   quantum security to IKEv2, this document removes the need to use an
   obsolete version of IKE in order to achieve that security goal.

   The general idea is that we add an additional secret that is shared
   between the initiator and the responder; this secret is in addition
   to the authentication method that is already provided within IKEv2.
   We stir this secret into the SK_d value, which is used to generate
   the key material (KEYMAT) for the Child Security Associations (SAs)
   and the SKEYSEED for the IKE SAs created as a result of the initial
   IKE SA rekey.  This secret provides quantum resistance to the IPsec
   SAs and any subsequent IKE SAs.  We also stir the secret into the
   SK_pi and SK_pr values; this allows both sides to detect a secret
   mismatch cleanly.

   It was considered important to minimize the changes to IKEv2.  The
   existing mechanisms to perform authentication and key exchange remain
   in place (that is, we continue to perform (EC)DH and potentially PKI
   authentication if configured).  This document does not replace the
   authentication checks that the protocol does; instead, they are
   strengthened by using an additional secret key.

1.1.  Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
   "OPTIONAL" in this document are to be interpreted as described in
   BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all
   capitals, as shown here.

2.  Assumptions

   We assume that each IKE peer has a list of Post-quantum Preshared
   Keys (PPKs) along with their identifiers (PPK_ID), and any potential
   IKE initiator selects which PPK to use with any specific responder.
   In addition, implementations have a configurable flag that determines
   whether this PPK is mandatory.  This PPK is independent of the
   preshared key (if any) that the IKEv2 protocol uses to perform
   authentication (because the preshared key in IKEv2 is not used for
   any key derivation and thus doesn't protect against quantum
   computers).  The PPK-specific configuration that is assumed to be on
   each node consists of the following tuple:

   Peer, PPK, PPK_ID, mandatory_or_not

   We assume the reader is familiar with the payload notation defined in
   Section 1.2 of [RFC7296].

3.  Exchanges

   If the initiator is configured to use a PPK with the responder
   (whether or not the use of the PPK is mandatory), then it MUST
   include a notification USE_PPK in the IKE_SA_INIT request message as
   follows:

   Initiator                       Responder
   ------------------------------------------------------------------
   HDR, SAi1, KEi, Ni, N(USE_PPK)  --->

   N(USE_PPK) is a status notification payload with the type 16435; it
   has a protocol ID of 0, no Security Parameter Index (SPI), and no
   notification data associated with it.

   If the initiator needs to resend this initial message with a COOKIE
   notification, then the resend would include the USE_PPK notification
   if the original message did (see Section 2.6 of [RFC7296]).

   If the responder does not support this specification or does not have
   any PPK configured, then it ignores the received notification (as
   defined in [RFC7296] for unknown status notifications) and continues
   with the IKEv2 protocol as normal.  Otherwise, the responder replies
   with the IKE_SA_INIT message, including a USE_PPK notification in the
   response:

   Initiator                       Responder
   ------------------------------------------------------------------
                   <--- HDR, SAr1, KEr, Nr, [CERTREQ,] N(USE_PPK)

   When the initiator receives this reply, it checks whether the
   responder included the USE_PPK notification.  If the responder did
   not include the USE_PPK notification and the flag mandatory_or_not
   indicates that using PPKs is mandatory for communication with this
   responder, then the initiator MUST abort the exchange.  This
   situation may happen in case of misconfiguration, i.e., when the
   initiator believes it has a mandatory-to-use PPK for the responder
   and the responder either doesn't support PPKs at all or doesn't have
   any PPK configured for the initiator.  See Section 6 for discussion
   of the possible impacts of this situation.

   If the responder did not include the USE_PPK notification and using a
   PPK for this particular responder is optional, then the initiator
   continues with the IKEv2 protocol as normal, without using PPKs.

   If the responder did include the USE_PPK notification, then the
   initiator selects a PPK, along with its identifier PPK_ID.  Then, it
   computes this modification of the standard IKEv2 key derivation from
   Section 2.14 of [RFC7296]:

    SKEYSEED = prf(Ni | Nr, g^ir)
    {SK_d' | SK_ai | SK_ar | SK_ei | SK_er | SK_pi' | SK_pr'}
                    = prf+ (SKEYSEED, Ni | Nr | SPIi | SPIr)

    SK_d  = prf+ (PPK, SK_d')
    SK_pi = prf+ (PPK, SK_pi')
    SK_pr = prf+ (PPK, SK_pr')

   That is, we use the standard IKEv2 key derivation process, except
   that the three resulting subkeys SK_d, SK_pi, and SK_pr (marked with
   primes in the formula above) are then run through the prf+ again,
   this time using the PPK as the key.  The result is the unprimed
   versions of these keys, which are then used as inputs to subsequent
   steps of the IKEv2 exchange.

   Using a prf+ construction ensures that it is always possible to get
   the resulting keys of the same size as the initial ones, even if the
   underlying PRF has an output size different from its key size.  Note
   that at the time of this writing, all PRFs defined for use in IKEv2
   (see the "Transform Type 2 - Pseudorandom Function Transform IDs"
   subregistry [IANA-IKEV2]) have an output size equal to the
   (preferred) key size.  For such PRFs, only the first iteration of
   prf+ is needed:

    SK_d  = prf (PPK, SK_d'  | 0x01)
    SK_pi = prf (PPK, SK_pi' | 0x01)
    SK_pr = prf (PPK, SK_pr' | 0x01)

   Note that the PPK is used in SK_d, SK_pi, and SK_pr calculations only
   during the initial IKE SA setup.  It MUST NOT be used when these
   subkeys are calculated as result of IKE SA rekey, resumption, or
   other similar operations.

   The initiator then sends the IKE_AUTH request message, including the
   PPK_ID value as follows:

   Initiator                       Responder
   ------------------------------------------------------------------
   HDR, SK {IDi, [CERT,] [CERTREQ,]
       [IDr,] AUTH, SAi2,
       TSi, TSr, N(PPK_IDENTITY, PPK_ID), [N(NO_PPK_AUTH)]}  --->

   PPK_IDENTITY is a status notification with the type 16436; it has a
   protocol ID of 0, no SPI, and notification data that consists of the
   identifier PPK_ID.

   A situation may happen when the responder has some PPKs but doesn't
   have a PPK with the PPK_ID received from the initiator.  In this
   case, the responder cannot continue with the PPK (in particular, it
   cannot authenticate the initiator), but the responder could be able
   to continue with the normal IKEv2 protocol if the initiator provided
   its authentication data computed as in the normal IKEv2 without using
   PPKs.  For this purpose, if using PPKs for communication with this
   responder is optional for the initiator (based on the
   mandatory_or_not flag), then the initiator MUST include a NO_PPK_AUTH
   notification in the above message.  This notification informs the
   responder that PPKs are optional and allows for authenticating the
   initiator without using PPKs.

   NO_PPK_AUTH is a status notification with the type 16437; it has a
   protocol ID of 0 and no SPI.  The Notification Data field contains
   the initiator's authentication data computed using SK_pi', which has
   been computed without using PPKs.  This is the same data that would
   normally be placed in the Authentication Data field of an AUTH
   payload.  Since the Auth Method field is not present in the
   notification, the authentication method used for computing the
   authentication data MUST be the same as the method indicated in the
   AUTH payload.  Note that if the initiator decides to include the
   NO_PPK_AUTH notification, the initiator needs to perform
   authentication data computation twice, which may consume computation
   power (e.g., if digital signatures are involved).

   When the responder receives this encrypted exchange, it first
   computes the values:

    SKEYSEED = prf(Ni | Nr, g^ir)
    {SK_d' | SK_ai | SK_ar | SK_ei | SK_er | SK_pi' | SK_pr'}
                    = prf+ (SKEYSEED, Ni | Nr | SPIi | SPIr)

   The responder then uses the SK_ei/SK_ai values to decrypt/check the
   message and then scans through the payloads for the PPK_ID attached
   to the PPK_IDENTITY notification.  If no PPK_IDENTITY notification is
   found and the peers successfully exchanged USE_PPK notifications in
   the IKE_SA_INIT exchange, then the responder MUST send back an
   AUTHENTICATION_FAILED notification and then fail the negotiation.

   If the PPK_IDENTITY notification contains a PPK_ID that is not known
   to the responder or is not configured for use for the identity from
   the IDi payload, then the responder checks whether using PPKs for
   this initiator is mandatory and whether the initiator included a
   NO_PPK_AUTH notification in the message.  If using PPKs is mandatory
   or no NO_PPK_AUTH notification is found, then the responder MUST send
   back an AUTHENTICATION_FAILED notification and then fail the
   negotiation.  Otherwise (when a PPK is optional and the initiator
   included a NO_PPK_AUTH notification), the responder MAY continue the
   regular IKEv2 protocol, except that it uses the data from the
   NO_PPK_AUTH notification as the authentication data (which usually
   resides in the AUTH payload) for the purpose of the initiator
   authentication.  Note that the authentication method is still
   indicated in the AUTH payload.

   Table 1 summarizes the above logic for the responder:

   +==========+=============+============+===========+================+
   | Received | Received    | Configured | PPK is    | Action         |
   | USE_PPK  | NO_PPK_AUTH | with PPK   | Mandatory |                |
   +==========+=============+============+===========+================+
   | No       | *           | No         | *         | Standard IKEv2 |
   |          |             |            |           | protocol       |
   +----------+-------------+------------+-----------+----------------+
   | No       | *           | Yes        | No        | Standard IKEv2 |
   |          |             |            |           | protocol       |
   +----------+-------------+------------+-----------+----------------+
   | No       | *           | Yes        | Yes       | Abort          |
   |          |             |            |           | negotiation    |
   +----------+-------------+------------+-----------+----------------+
   | Yes      | No          | No         | *         | Abort          |
   |          |             |            |           | negotiation    |
   +----------+-------------+------------+-----------+----------------+
   | Yes      | Yes         | No         | Yes       | Abort          |
   |          |             |            |           | negotiation    |
   +----------+-------------+------------+-----------+----------------+
   | Yes      | Yes         | No         | No        | Standard IKEv2 |
   |          |             |            |           | protocol       |
   +----------+-------------+------------+-----------+----------------+
   | Yes      | *           | Yes        | *         | Use PPK        |
   +----------+-------------+------------+-----------+----------------+

                                 Table 1

   If a PPK is in use, then the responder extracts the corresponding PPK
   and computes the following values:

    SK_d  = prf+ (PPK, SK_d')
    SK_pi = prf+ (PPK, SK_pi')
    SK_pr = prf+ (PPK, SK_pr')

   The responder then continues with the IKE_AUTH exchange (validating
   the AUTH payload that the initiator included) as usual and sends back
   a response, which includes the PPK_IDENTITY notification with no data
   to indicate that the PPK is used in the exchange:

   Initiator                       Responder
   ------------------------------------------------------------------
                              <--  HDR, SK {IDr, [CERT,]
                                   AUTH, SAr2,
                                   TSi, TSr, N(PPK_IDENTITY)}

   When the initiator receives the response, it checks for the presence
   of the PPK_IDENTITY notification.  If it receives one, it marks the
   SA as using the configured PPK to generate SK_d, SK_pi, and SK_pr (as
   shown above); the content of the received PPK_IDENTITY (if any) MUST
   be ignored.  If the initiator does not receive the PPK_IDENTITY, it
   MUST either fail the IKE SA negotiation sending the
   AUTHENTICATION_FAILED notification in the INFORMATIONAL exchange (if
   the PPK was configured as mandatory) or continue without using the
   PPK (if the PPK was not configured as mandatory and the initiator
   included the NO_PPK_AUTH notification in the request).

   If the Extensible Authentication Protocol (EAP) is used in the
   IKE_AUTH exchange, then the initiator doesn't include the AUTH
   payload in the first request message; however, the responder sends
   back the AUTH payload in the first reply.  The peers then exchange
   AUTH payloads after EAP is successfully completed.  As a result, the
   responder sends the AUTH payload twice -- in the first and last
   IKE_AUTH reply message -- while the initiator sends the AUTH payload
   only in the last IKE_AUTH request.  See more details about EAP
   authentication in IKEv2 in Section 2.16 of [RFC7296].

   The general rule for using a PPK in the IKE_AUTH exchange, which
   covers the EAP authentication case too, is that the initiator
   includes a PPK_IDENTITY (and optionally a NO_PPK_AUTH) notification
   in the request message containing the AUTH payload.  Therefore, in
   case of EAP, the responder always computes the AUTH payload in the
   first IKE_AUTH reply message without using a PPK (by means of
   SK_pr'), since PPK_ID is not yet known to the responder.  Once the
   IKE_AUTH request message containing the PPK_IDENTITY notification is
   received, the responder follows the rules described above for the
   non-EAP authentication case.

      Initiator                         Responder
      ----------------------------------------------------------------
      HDR, SK {IDi, [CERTREQ,]
          [IDr,] SAi2,
          TSi, TSr}  -->
                                   <--  HDR, SK {IDr, [CERT,] AUTH,
                                            EAP}
      HDR, SK {EAP}  -->
                                   <--  HDR, SK {EAP (success)}
      HDR, SK {AUTH,
          N(PPK_IDENTITY, PPK_ID)
          [, N(NO_PPK_AUTH)]}  -->
                                   <--  HDR, SK {AUTH, SAr2, TSi, TSr
                                        [, N(PPK_IDENTITY)]}

   Note that the diagram above shows both the cases when the responder
   uses a PPK and when it chooses not to use it (provided the initiator
   has included the NO_PPK_AUTH notification); thus, the responder's
   PPK_IDENTITY notification is marked as optional.  Also, note that the
   IKE_SA_INIT exchange using a PPK is as described above (including
   exchange of the USE_PPK notifications), regardless of whether or not
   EAP is employed in the IKE_AUTH.

4.  Upgrade Procedure

   This algorithm was designed so that someone can introduce PPKs into
   an existing IKE network without causing network disruption.

   In the initial phase of the network upgrade, the network
   administrator would visit each IKE node and configure:

   *  The set of PPKs (and corresponding PPK_IDs) that this node would
      need to know.

   *  The PPK that will be used for each peer that this node would
      initiate to.

   *  The value "false" for the mandatory_or_not flag for each peer that
      this node would initiate to (thus indicating that the use of PPKs
      is not mandatory).

   With this configuration, the node will continue to operate with nodes
   that have not yet been upgraded.  This is due to the USE_PPK
   notification and the NO_PPK_AUTH notification; if the initiator has
   not been upgraded, it will not send the USE_PPK notification (and so
   the responder will know that the peers will not use a PPK).  If the
   responder has not been upgraded, it will not send the USE_PPK
   notification (and so the initiator will know to not use a PPK).  If
   both peers have been upgraded but the responder isn't yet configured
   with the PPK for the initiator, then the responder could continue
   with the standard IKEv2 protocol if the initiator sent a NO_PPK_AUTH
   notification.  If both the responder and initiator have been upgraded
   and properly configured, they will both realize it, and the Child SAs
   will be quantum secure.

   As an optional second step, after all nodes have been upgraded, the
   administrator should then go back through the nodes and mark the use
   of a PPK as mandatory.  This will not affect the strength against a
   passive attacker, but it would mean that an active attacker with a
   quantum computer (which is sufficiently fast to be able to break the
   (EC)DH in real time) would not be able to perform a downgrade attack.

5.  PPK

5.1.  PPK_ID Format

   This standard requires that both the initiator and the responder have
   a secret PPK value, with the responder selecting the PPK based on the
   PPK_ID that the initiator sends.  In this standard, both the
   initiator and the responder are configured with fixed PPK and PPK_ID
   values and perform the lookup based on the PPK_ID value.  It is
   anticipated that later specifications will extend this technique to
   allow dynamically changing PPK values.  To facilitate such an
   extension, we specify that the PPK_ID the initiator sends will have
   its first octet be the PPK_ID type value.  This document defines two
   values for the PPK_ID type:

   *  PPK_ID_OPAQUE (1) - For this type, the format of the PPK_ID (and
      the PPK itself) is not specified by this document; it is assumed
      to be mutually intelligible by both the initiator and the
      responder.  This PPK_ID type is intended for those implementations
      that choose not to disclose the type of PPK to active attackers.

   *  PPK_ID_FIXED (2) - In this case, the format of the PPK_ID and the
      PPK are fixed octet strings; the remaining bytes of the PPK_ID are
      a configured value.  We assume that there is a fixed mapping
      between PPK_ID and PPK, which is configured locally to both the
      initiator and the responder.  The responder can use the PPK_ID to
      look up the corresponding PPK value.  Not all implementations are
      able to configure arbitrary octet strings; to improve the
      potential interoperability, it is recommended that, in the
      PPK_ID_FIXED case, both the PPK and the PPK_ID strings be limited
      to the base64 character set [RFC4648].

5.2.  Operational Considerations

   The need to maintain several independent sets of security credentials
   can significantly complicate a security administrator's job and can
   potentially slow down widespread adoption of this specification.  It
   is anticipated that administrators will try to simplify their job by
   decreasing the number of credentials they need to maintain.  This
   section describes some of the considerations for PPK management.

5.2.1.  PPK Distribution

   PPK_IDs of the type PPK_ID_FIXED (and the corresponding PPKs) are
   assumed to be configured within the IKE device in an out-of-band
   fashion.  While the method of distribution is a local matter and is
   out of scope of this document or IKEv2, [RFC6030] describes a format
   for the transport and provisioning of symmetric keys.  That format
   could be reused using the PIN profile (defined in Section 10.2 of
   [RFC6030]) with the "Id" attribute of the <Key> element being the
   PPK_ID (without the PPK_ID type octet for a PPK_ID_FIXED) and the
   <Secret> element containing the PPK.

5.2.2.  Group PPK

   This document doesn't explicitly require that the PPK be unique for
   each pair of peers.  If this is the case, then this solution provides
   full peer authentication, but it also means that each host must have
   as many independent PPKs as peers it is going to communicate with.
   As the number of peers grows, the PPKs will not scale.

   It is possible to use a single PPK for a group of users.  Since each
   peer uses classical public key cryptography in addition to a PPK for
   key exchange and authentication, members of the group can neither
   impersonate each other nor read each other's traffic unless they use
   quantum computers to break public key operations.  However, group
   members can record any traffic they have access to that comes from
   other group members and decrypt it later, when they get access to a
   quantum computer.

   In addition, the fact that the PPK is known to a (potentially large)
   group of users makes it more susceptible to theft.  When an attacker
   equipped with a quantum computer gets access to a group PPK, all
   communications inside the group are revealed.

   For these reasons, using a group PPK is NOT RECOMMENDED.

5.2.3.  PPK-Only Authentication

   If quantum computers become a reality, classical public key
   cryptography will provide little security, so administrators may find
   it attractive not to use it at all for authentication.  This will
   reduce the number of credentials they need to maintain because they
   only need to maintain PPK credentials.  Combining group PPK and PPK-
   only authentication is NOT RECOMMENDED since, in this case, any
   member of the group can impersonate any other member, even without
   the help of quantum computers.

   PPK-only authentication can be achieved in IKEv2 if the NULL
   Authentication method [RFC7619] is employed.  Without PPK, the NULL
   Authentication method provides no authentication of the peers;
   however, since a PPK is stirred into the SK_pi and the SK_pr, the
   peers become authenticated if a PPK is in use.  Using PPKs MUST be
   mandatory for the peers if they advertise support for PPKs in
   IKE_SA_INIT and use NULL Authentication.  Additionally, since the
   peers are authenticated via PPKs, the ID Type in the IDi/IDr payloads
   SHOULD NOT be ID_NULL, despite using the NULL Authentication method.

6.  Security Considerations

   A critical consideration is how to ensure the randomness of this
   post-quantum preshared key.  Quantum computers are able to perform
   Grover's algorithm [GROVER]; that effectively halves the size of a
   symmetric key.  In addition, an adversary impersonating the server,
   even with a conventional computer, can perform a dictionary search
   over plausible post-quantum preshared key values.  The strongest
   practice is to ensure that any post-quantum preshared key contains at
   least 256 bits of entropy; this will provide 128 bits of post-quantum
   security, while providing security against conventional dictionary
   attacks.  That provides the security equivalent to Category 5 as
   defined in the NIST Post-Quantum Cryptography Call for Proposals
   [NISTPQCFP].  Deriving a post-quantum preshared key from a password,
   name, or other low-entropy source is not secure because of these
   known attacks.

   With this protocol, the computed SK_d is a function of the PPK.
   Assuming that the PPK has sufficient entropy (for example, at least
   2^(256) possible values), even if an attacker was able to recover the
   rest of the inputs to the PRF function, it would be infeasible to use
   Grover's algorithm with a quantum computer to recover the SK_d value.
   Similarly, all keys that are a function of SK_d, which include all
   Child SA keys and all keys for subsequent IKE SAs (created when the
   initial IKE SA is rekeyed), are also quantum secure (assuming that
   the PPK was of high enough entropy and that all the subkeys are
   sufficiently long).

   An attacker with a quantum computer that can decrypt the initial IKE
   SA has access to all the information exchanged over it, such as
   identities of the peers, configuration parameters, and all negotiated
   IPsec SA information (including traffic selectors), with the
   exception of the cryptographic keys used by the IPsec SAs, which are
   protected by the PPK.

   Deployments that treat this information as sensitive or that send
   other sensitive data (like cryptographic keys) over IKE SAs MUST
   rekey the IKE SA before the sensitive information is sent to ensure
   this information is protected by the PPK.  It is possible to create a
   childless IKE SA as specified in [RFC6023].  This prevents Child SA
   configuration information from being transmitted in the original IKE
   SA that is not protected by a PPK.  Some information related to IKE
   SA that is sent in the IKE_AUTH exchange, such as peer identities,
   feature notifications, vendor IDs, etc., cannot be hidden from the
   attack described above, even if the additional IKE SA rekey is
   performed.

   In addition, the policy SHOULD be set to negotiate only quantum-
   secure symmetric algorithms; while this RFC doesn't claim to give
   advice as to what algorithms are secure (as that may change based on
   future cryptographical results), below is a list of defined IKEv2 and
   IPsec algorithms that should not be used, as they are known to
   provide less than 128 bits of post-quantum security:

   *  Any IKEv2 encryption algorithm, PRF, or integrity algorithm with a
      key size less than 256 bits.

   *  Any ESP transform with a key size less than 256 bits.

   *  PRF_AES128_XCBC and PRF_AES128_CBC: even though they can use as
      input a key of arbitrary size, such input keys are converted into
      a 128-bit key for internal use.

   Section 3 requires the initiator to abort the initial exchange if
   using PPKs is mandatory for it but the responder does not include the
   USE_PPK notification in the response.  In this situation, when the
   initiator aborts the negotiation, it leaves a half-open IKE SA on the
   responder (because IKE_SA_INIT completes successfully from the
   responder's point of view).  This half-open SA will eventually expire
   and be deleted, but if the initiator continues its attempts to create
   IKE SA with a high enough rate, then the responder may consider it a
   denial-of-service (DoS) attack and take protective measures (see
   [RFC8019] for more details).  In this situation, it is RECOMMENDED
   that the initiator cache the negative result of the negotiation and
   not attempt to create it again for some time.  This period of time
   may vary, but it is believed that waiting for at least few minutes
   will not cause the responder to treat it as a DoS attack.  Note that
   this situation would most likely be a result of misconfiguration, and
   some reconfiguration of the peers would probably be needed.

   If using PPKs is optional for both peers and they authenticate
   themselves using digital signatures, then an attacker in between,
   equipped with a quantum computer capable of breaking public key
   operations in real time, is able to mount a downgrade attack by
   removing the USE_PPK notification from the IKE_SA_INIT and forging
   digital signatures in the subsequent exchange.  If using PPKs is
   mandatory for at least one of the peers or if a preshared key mode is
   used for authentication, then the attack will be detected and the SA
   won't be created.

   If using PPKs is mandatory for the initiator, then an attacker able
   to eavesdrop and inject packets into the network can prevent creation
   of an IKE SA by mounting the following attack.  The attacker
   intercepts the initial request containing the USE_PPK notification
   and injects a forged response containing no USE_PPK.  If the attacker
   manages to inject this packet before the responder sends a genuine
   response, then the initiator would abort the exchange.  To thwart
   this kind of attack, it is RECOMMENDED that, if using PPKs is
   mandatory for the initiator and the received response doesn't contain
   the USE_PPK notification, the initiator not abort the exchange
   immediately.  Instead, it waits for more response messages,
   retransmitting the request as if no responses were received at all,
   until either the received message contains the USE_PPK notification
   or the exchange times out (see Section 2.4 of [RFC7296] for more
   details about retransmission timers in IKEv2).  If none of the
   received responses contains USE_PPK, then the exchange is aborted.

   If using a PPK is optional for both peers, then in case of
   misconfiguration (e.g., mismatched PPK_ID), the IKE SA will be
   created without protection against quantum computers.  It is advised
   that if a PPK was configured but was not used for a particular IKE
   SA, then implementations SHOULD audit this event.

7.  IANA Considerations

   This document defines three new Notify Message Types in the "IKEv2
   Notify Message Types - Status Types" subregistry under the "Internet
   Key Exchange Version 2 (IKEv2) Parameters" registry [IANA-IKEV2]:

          +=======+================================+===========+
          | Value | NOTIFY MESSAGES - STATUS TYPES | Reference |
          +=======+================================+===========+
          | 16435 | USE_PPK                        | RFC 8784  |
          +-------+--------------------------------+-----------+
          | 16436 | PPK_IDENTITY                   | RFC 8784  |
          +-------+--------------------------------+-----------+
          | 16437 | NO_PPK_AUTH                    | RFC 8784  |
          +-------+--------------------------------+-----------+

                                 Table 2

   Per this document, IANA has created a new subregistry titled "IKEv2
   Post-quantum Preshared Key ID Types" under the "Internet Key Exchange
   Version 2 (IKEv2) Parameters" registry [IANA-IKEV2].  This new
   subregistry is for the PPK_ID types used in the PPK_IDENTITY
   notification defined in this specification.  The initial contents of
   the new subregistry are as follows:

            +=========+==========================+===========+
            | Value   | PPK_ID Type              | Reference |
            +=========+==========================+===========+
            | 0       | Reserved                 | RFC 8784  |
            +---------+--------------------------+-----------+
            | 1       | PPK_ID_OPAQUE            | RFC 8784  |
            +---------+--------------------------+-----------+
            | 2       | PPK_ID_FIXED             | RFC 8784  |
            +---------+--------------------------+-----------+
            | 3-127   | Unassigned               | RFC 8784  |
            +---------+--------------------------+-----------+
            | 128-255 | Reserved for Private Use | RFC 8784  |
            +---------+--------------------------+-----------+

                                 Table 3

   The PPK_ID type value 0 is reserved; values 3-127 are to be assigned
   by IANA; and values 128-255 are for private use among mutually
   consenting parties.  To register new PPK_IDs in the Unassigned range,
   a type name, a value between 3 and 127, and a reference specification
   need to be defined.  Changes and additions to the Unassigned range of
   this registry are made using the Expert Review policy [RFC8126].
   Changes and additions to the Reserved for Private Use range of this
   registry are made using the Private Use policy [RFC8126].

8.  References

8.1.  Normative References

   [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
              Requirement Levels", BCP 14, RFC 2119,
              DOI 10.17487/RFC2119, March 1997,
              <https://www.rfc-editor.org/info/rfc2119>.

   [RFC7296]  Kaufman, C., Hoffman, P., Nir, Y., Eronen, P., and T.
              Kivinen, "Internet Key Exchange Protocol Version 2
              (IKEv2)", STD 79, RFC 7296, DOI 10.17487/RFC7296, October
              2014, <https://www.rfc-editor.org/info/rfc7296>.

   [RFC8174]  Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC
              2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174,
              May 2017, <https://www.rfc-editor.org/info/rfc8174>.

8.2.  Informative References

   [C2PQ]     Hoffman, P., "The Transition from Classical to Post-
              Quantum Cryptography", Work in Progress, Internet-Draft,
              draft-hoffman-c2pq-07, 26 May 2020,
              <https://tools.ietf.org/html/draft-hoffman-c2pq-07>.

   [GROVER]   Grover, L., "A Fast Quantum Mechanical Algorithm for
              Database Search", STOC '96: Proceedings of the Twenty-
              Eighth Annual ACM Symposium on the Theory of Computing,
              pp. 212-219", DOI 10.1145/237814.237866, July 1996,
              <https://doi.org/10.1145/237814.237866>.

   [IANA-IKEV2]
              IANA, "Internet Key Exchange Version 2 (IKEv2)
              Parameters",
              <https://www.iana.org/assignments/ikev2-parameters/>.

   [NISTPQCFP]
              NIST, "Submission Requirements and Evaluation Criteria for
              the Post-Quantum Cryptography Standardization Process",
              December 2016, <https://csrc.nist.gov/CSRC/media/Projects/
              Post-Quantum-Cryptography/documents/call-for-proposals-
              final-dec-2016.pdf>.

   [RFC2409]  Harkins, D. and D. Carrel, "The Internet Key Exchange
              (IKE)", RFC 2409, DOI 10.17487/RFC2409, November 1998,
              <https://www.rfc-editor.org/info/rfc2409>.

   [RFC4648]  Josefsson, S., "The Base16, Base32, and Base64 Data
              Encodings", RFC 4648, DOI 10.17487/RFC4648, October 2006,
              <https://www.rfc-editor.org/info/rfc4648>.

   [RFC6023]  Nir, Y., Tschofenig, H., Deng, H., and R. Singh, "A
              Childless Initiation of the Internet Key Exchange Version
              2 (IKEv2) Security Association (SA)", RFC 6023,
              DOI 10.17487/RFC6023, October 2010,
              <https://www.rfc-editor.org/info/rfc6023>.

   [RFC6030]  Hoyer, P., Pei, M., and S. Machani, "Portable Symmetric
              Key Container (PSKC)", RFC 6030, DOI 10.17487/RFC6030,
              October 2010, <https://www.rfc-editor.org/info/rfc6030>.

   [RFC7619]  Smyslov, V. and P. Wouters, "The NULL Authentication
              Method in the Internet Key Exchange Protocol Version 2
              (IKEv2)", RFC 7619, DOI 10.17487/RFC7619, August 2015,
              <https://www.rfc-editor.org/info/rfc7619>.

   [RFC8019]  Nir, Y. and V. Smyslov, "Protecting Internet Key Exchange
              Protocol Version 2 (IKEv2) Implementations from
              Distributed Denial-of-Service Attacks", RFC 8019,
              DOI 10.17487/RFC8019, November 2016,
              <https://www.rfc-editor.org/info/rfc8019>.

   [RFC8126]  Cotton, M., Leiba, B., and T. Narten, "Guidelines for
              Writing an IANA Considerations Section in RFCs", BCP 26,
              RFC 8126, DOI 10.17487/RFC8126, June 2017,
              <https://www.rfc-editor.org/info/rfc8126>.

Appendix A.  Discussion and Rationale

   The primary goal of this document is to augment the IKEv2 protocol to
   provide protection against quantum computers without requiring novel
   cryptographic algorithms.  The idea behind this document is that
   while a quantum computer can easily reconstruct the shared secret of
   an (EC)DH exchange, it cannot as easily recover a secret from a
   symmetric exchange.  This document makes the SK_d (and thus also the
   IPsec KEYMAT and any subsequent IKE SA's SKEYSEED) depend on both the
   symmetric PPK and the Diffie-Hellman exchange.  If we assume that the
   attacker knows everything except the PPK during the key exchange and
   there are 2^(n) plausible PPKs, then a quantum computer (using
   Grover's algorithm) would take O(2^(n/2)) time to recover the PPK.
   So, even if the (EC)DH can be trivially solved, the attacker still
   can't recover any key material (except for the SK_ei, SK_er, SK_ai,
   and SK_ar values for the initial IKE exchange) unless they can find
   the PPK, which is too difficult if the PPK has enough entropy (for
   example, 256 bits).  Note that we do allow an attacker with a quantum
   computer to rederive the keying material for the initial IKE SA; this
   was a compromise to allow the responder to select the correct PPK
   quickly.

   Another goal of this protocol is to minimize the number of changes
   within the IKEv2 protocol, in particular, within the cryptography of
   IKEv2.  By limiting our changes to notifications and only adjusting
   the SK_d, SK_pi, and SK_pr, it is hoped that this would be
   implementable, even on systems that perform most of the IKEv2
   processing in hardware.

   A third goal is to be friendly to incremental deployment in
   operational networks for which we might not want to have a global
   shared key or for which quantum-secure IKEv2 is rolled out
   incrementally.  This is why we specifically try to allow the PPK to
   be dependent on the peer and why we allow the PPK to be configured as
   optional.

   A fourth goal is to avoid violating any of the security properties
   provided by IKEv2.

Acknowledgements

   We would like to thank Tero Kivinen, Paul Wouters, Graham Bartlett,
   Tommy Pauly, Quynh Dang, and the rest of the IPSECME Working Group
   for their feedback and suggestions for the scheme.

Authors' Addresses

   Scott Fluhrer
   Cisco Systems

   Email: sfluhrer@cisco.com


   Panos Kampanakis
   Cisco Systems

   Email: pkampana@cisco.com


   David McGrew
   Cisco Systems

   Email: mcgrew@cisco.com


   Valery Smyslov
   ELVIS-PLUS

   Phone: +7 495 276 0211
   Email: svan@elvis.ru

ISO Plain Language

On this page
PROBLEMA quantum computer large enough to matter would break the Diffie-Hellman exchange inside IKEv2, which would expose recorded VPN traffic.
MECHANISMThe RFC adds a second shared secret, a post-quantum preshared key, and runs three of the IKEv2 subkeys through the pseudorandom function a second time with that secret as the key. New notifications tell both sides which secret is in use.
WHY IT MATTERSIf the shared secret is strong enough, the keys that protect the tunnel are safe from a quantum attack even after the traffic has been recorded, without changing how IKEv2 authenticates the peers.

§1The Problem and the Idea

Recent achievements in developing quantum computers show that it is probably feasible to build one that is cryptographically significant. If such a computer were implemented, many of the cryptographic algorithms and protocols in use today would be insecure. A quantum computer would be able to solve Diffie-Hellman and Elliptic Curve Diffie-Hellman problems in polynomial time, which would mean the security of existing IKEv2 systems would be compromised.

IKEv1, when used with strong preshared keys, is not vulnerable to quantum attacks, because those keys are one of the inputs to the key derivation function. If the preshared key has sufficient entropy and the pseudorandom function, encryption and authentication transforms are quantum secure, the resulting system is believed to be quantum secure, meaning secure against classical attackers of today and against future attackers with a quantum computer.

This document describes a way to give IKEv2 a similar property: assuming that the two end systems share a long secret key, the resulting exchange is quantum secure. Bringing post-quantum security to IKEv2 removes the need to use an obsolete version of IKE to reach that goal.

The general idea is to add a secret shared between the initiator and the responder, in addition to the authentication method already provided within IKEv2. This secret is stirred into the SK_d value, which is used to generate the key material for the child security associations and the SKEYSEED for the IKE security associations created when the initial IKE security association is rekeyed. The secret provides quantum resistance to the IPsec security associations and to any subsequent IKE security associations. It is also stirred into the SK_pi and SK_pr values, which allows both sides to detect a secret mismatch cleanly.

It was considered important to minimize the changes to IKEv2. The existing mechanisms for authentication and key exchange remain in place, so the protocol continues to perform the Diffie-Hellman exchange and, if configured, public key authentication. The document does not replace the authentication checks the protocol does; it strengthens them by using an additional secret key.

Today, two VPN endpoints agree on a key by exchanging numbers over the network and doing arithmetic on them. A powerful quantum computer could undo that arithmetic later, from a recording. The fix in this RFC is that the endpoints already share a secret that never crosses the network, and that secret is folded into the keys they derive. Recording the traffic is no longer enough.

§2What Each Peer Needs

Each IKE peer is assumed to have a list of post-quantum preshared keys, along with their identifiers, and any potential initiator selects which one to use with a specific responder. Implementations also have a configurable flag that determines whether this key is mandatory for the peer in question.

The key is independent of the preshared key, if any, that the IKEv2 protocol uses for authentication, because the preshared key in IKEv2 is not used for any key derivation and therefore does not protect against quantum computers.

The configuration assumed to be on each node consists of the tuple: peer, key, key identifier, and whether it is mandatory. The document assumes the reader is familiar with the payload notation defined in Section 1.2 of RFC 7296.

Each router needs a table: which peer it talks to, which secret it shares with that peer, the name of that secret, and whether the secret has to be used. The flag is what makes the deployment safe to roll out in stages.

§3The Exchange

If the initiator is configured to use a post-quantum preshared key with the responder, whether or not its use is mandatory, it must include a USE_PPK notification in the IKE_SA_INIT request. USE_PPK is a status notification with the type 16435, a protocol ID of 0, no Security Parameter Index and no notification data. If the initiator has to resend that message with a COOKIE notification, the resend includes USE_PPK if the original did.

If the responder does not support the specification or has no such key configured, it ignores the notification, as it would any unknown status notification, and continues with IKEv2 as normal. Otherwise it replies with its IKE_SA_INIT message including a USE_PPK notification.

When the initiator receives the reply it checks whether the responder included USE_PPK. If it did not and the mandatory flag says that using these keys is mandatory for this responder, the initiator must abort the exchange, which happens when the initiator believes it has a mandatory key and the responder either does not support them or has none configured for the initiator. If using a key for this responder is optional, the initiator continues with IKEv2 as normal, without the keys.

If the responder did include USE_PPK, the initiator selects a key and its identifier, and computes a modification of the standard IKEv2 key derivation from Section 2.14 of RFC 7296:

SKEYSEED = prf(Ni | Nr, g^ir)
{SK_d' | SK_ai | SK_ar | SK_ei | SK_er | SK_pi' | SK_pr'}
                = prf+ (SKEYSEED, Ni | Nr | SPIi | SPIr)

SK_d  = prf+ (PPK, SK_d')
SK_pi = prf+ (PPK, SK_pi')
SK_pr = prf+ (PPK, SK_pr')

The standard derivation is used unchanged, except that the three resulting subkeys SK_d, SK_pi and SK_pr, shown with primes in the formula, are then run through the pseudorandom function again, this time using the shared secret as the key. The unprimed versions of these keys are used as inputs to the subsequent steps of the exchange.

Using the prf+ construction ensures that it is always possible to get resulting keys of the same size as the initial ones, even if the underlying pseudorandom function has an output size different from its key size. All the pseudorandom functions currently defined for IKEv2 have an output size equal to their preferred key size, so for those only the first iteration of prf+ is needed: SK_d = prf(PPK, SK_d' | 0x01), and likewise for SK_pi and SK_pr.

The shared secret is used in the SK_d, SK_pi and SK_pr calculations only during the initial IKE security association setup. It must not be used when these subkeys are calculated as the result of a rekey, resumption or similar operations.

The initiator then sends the IKE_AUTH request, including the key identifier in a PPK_IDENTITY notification, which is a status notification with the type 16436, a protocol ID of 0, no SPI and notification data consisting of the identifier PPK_ID. A responder may have some keys but not the one the initiator named. In that case it cannot continue with the key, and in particular cannot authenticate the initiator, but it could continue with ordinary IKEv2 if the initiator supplied authentication data computed the ordinary way. For that purpose, if using the keys is optional for the initiator, the initiator must include a NO_PPK_AUTH notification in the same message. NO_PPK_AUTH is a status notification with the type 16437, a protocol ID of 0 and no SPI, and its data holds the initiator's authentication data computed using SK_pi', which was computed without the shared secret. Because the notification carries no authentication method field, the method used must be the one indicated in the AUTH payload. Including this notification means the initiator computes its authentication data twice, which may cost power when digital signatures are involved.

The responder decrypts and checks the message with SK_ei and SK_ai, then looks for the key identifier in the PPK_IDENTITY notification. If there is no PPK_IDENTITY notification and the peers did exchange USE_PPK notifications, the responder must return an AUTHENTICATION_FAILED notification and fail the negotiation. If the notification carries a key identifier the responder does not know, or one not configured for the identity in the IDi payload, the responder checks whether the keys are mandatory and whether the initiator sent NO_PPK_AUTH. If the keys are mandatory or no NO_PPK_AUTH was sent, the responder must return AUTHENTICATION_FAILED and fail the negotiation. Otherwise it may continue with ordinary IKEv2, using the data from the NO_PPK_AUTH notification as the initiator's authentication data.

When a key is in use, the responder extracts it and computes SK_d, SK_pi and SK_pr with the same formulas, continues with the IKE_AUTH exchange validating the AUTH payload as usual, and sends a reply that includes a PPK_IDENTITY notification with no data to indicate that the key is in use. When the initiator receives the reply it checks for that notification. If it receives one, it marks the security association as using the configured key to generate the three subkeys, and the content of the received notification must be ignored. If it does not receive one, it must either fail the negotiation with an AUTHENTICATION_FAILED notification in an INFORMATIONAL exchange, if the key was configured as mandatory, or continue without the key, if the key was optional and the initiator sent NO_PPK_AUTH in the request.

With EAP the initiator does not include the AUTH payload in the first request, and the responder sends its AUTH payload back in the first reply; the peers exchange AUTH payloads once EAP succeeds, so the responder sends the AUTH payload twice while the initiator sends it once. The general rule, which covers EAP, is that the initiator includes a PPK_IDENTITY notification, and optionally a NO_PPK_AUTH, in the request message that contains the AUTH payload. In the EAP case the responder always computes the AUTH payload in the first IKE_AUTH reply without the shared secret, because PPK_ID is not yet known to it, and once the request carrying PPK_IDENTITY arrives it follows the rules above.

The exchange has three notifications. The initiator says it wants to use a shared secret, the responder says whether it has one, and then the initiator names which one it is using. Three of the derived keys are then run through the pseudorandom function a second time with the shared secret, so an attacker who learns the Diffie-Hellman value still cannot compute them. The initiator can also offer a fallback authentication, in case the responder turns out not to have the named secret.

The IKEv2 exchange with a post-quantum preshared key
InitiatorResponder
  1. IKE_SA_INIT WITH N(USE_PPK)The initiator says it wants to use a post-quantum preshared key.
  2. IKE_SA_INIT WITH N(USE_PPK)The responder confirms that it has one configured.
  3. IKE_AUTH WITH N(PPK_IDENTITY, PPK_ID)The initiator names the key and sends its AUTH payload.
  4. IKE_AUTH WITH N(PPK_IDENTITY)The responder confirms that the key is in use.
The modified key derivation as written in the RFC
Key derivation with a PPK
SKEYSEED = prf(Ni | Nr, g^ir)
{SK_d' | SK_ai | SK_ar | SK_ei | SK_er | SK_pi' | SK_pr'}
                = prf+ (SKEYSEED, Ni | Nr | SPIi | SPIr)

SK_d  = prf+ (PPK, SK_d')
SK_pi = prf+ (PPK, SK_pi')
SK_pr = prf+ (PPK, SK_pr')
What the responder does, from Table 1 of the RFC
USE_PPK receivedNO_PPK_AUTH receivedHas a keyKey mandatoryAction
NoAnyNoAnyStandard IKEv2 protocol
NoAnyYesNoStandard IKEv2 protocol
NoAnyYesYesAbort negotiation
YesNoNoAnyAbort negotiation
YesYesNoYesAbort negotiation
YesYesNoNoStandard IKEv2 protocol
YesAnyYesAnyUse the key

§4Rolling the Change Out

The algorithm was designed so that someone can introduce these keys into an existing IKE network without causing disruption. In the initial phase, the administrator visits each node and configures the set of keys and identifiers it needs to know, the key that will be used for each peer it will initiate to, and the value false for the mandatory flag for each peer it initiates to, so that using the keys is not yet mandatory.

With that configuration a node keeps working with nodes that have not been upgraded. The USE_PPK and NO_PPK_AUTH notifications make this work: an initiator that has not been upgraded sends no USE_PPK, so the responder knows the peers will not use a key; a responder that has not been upgraded sends no USE_PPK, so the initiator knows not to use one. If both peers have been upgraded but the responder has no key configured for the initiator, the responder can still continue with ordinary IKEv2 if the initiator sent a NO_PPK_AUTH notification. If both are upgraded and configured, they both realise it, and the child security associations become quantum secure.

As an optional second step, once all nodes have been upgraded, the administrator goes back through the nodes and marks the use of a key as mandatory. This does not change the strength against a passive attacker, but it does mean that an active attacker with a quantum computer fast enough to break the Diffie-Hellman exchange in real time cannot perform a downgrade attack.

The design lets you add these keys one router at a time. Each router learns whether the other side supports them by the notification in the reply, and falls back to the ordinary exchange when it does not. Only after every router has been converted is it worth making the key mandatory, which closes a downgrade attack.

§5The Key and Its Identifier

Both the initiator and the responder must have the secret value, with the responder selecting the key based on the identifier the initiator sends. Both are configured with fixed key and identifier values and perform the lookup on the identifier. Later specifications are expected to extend this to allow dynamically changing key values, so the identifier the initiator sends has its first octet set to a type value.

Two types are defined. PPK_ID_OPAQUE (1) means that the format of the identifier, and of the key itself, is not specified by this document; it is assumed to be mutually intelligible by both sides. This type is intended for implementations that choose not to disclose the type of key to active attackers. PPK_ID_FIXED (2) means that the identifier and the key are fixed octet strings, with the remaining bytes of the identifier being a configured value, and a fixed mapping between identifier and key configured locally on both sides. Not all implementations can configure arbitrary octet strings, so to improve interoperability it is recommended that in the PPK_ID_FIXED case both the key and the identifier be limited to the base64 character set.

Identifiers of the type PPK_ID_FIXED, and the corresponding keys, are assumed to be configured within the device out of band. RFC 6030 describes a format for the transport and provisioning of symmetric keys, which could be reused with its PIN profile, using the identifier as the Id attribute and the key as the Secret element.

The document does not require the key to be unique for each pair of peers. If it is, the solution provides full peer authentication, but each host then needs as many independent keys as peers it talks to, and that does not scale. It is possible to use a single key for a group of users. Since each peer also uses classical public key cryptography, group members can neither impersonate each other nor read each other's traffic unless they use quantum computers to break public key operations. However, group members can record traffic they have access to and decrypt it later, and a key known to a large group is more susceptible to theft, since an attacker with a quantum computer who gets the group key reveals all the communications inside the group. For these reasons, using a group key is not recommended.

Combining a group key with PPK-only authentication is also not recommended, because in that case any member of the group can impersonate any other member without the help of quantum computers. PPK-only authentication can be achieved in IKEv2 by using the NULL Authentication method of RFC 7619. Without a shared key the NULL method gives no authentication of the peers, but since the key is stirred into SK_pi and SK_pr, the peers become authenticated when a key is in use. Using these keys must be mandatory for peers that advertise support for them in IKE_SA_INIT and use NULL authentication. And since the peers are authenticated through the key, the ID Type in the IDi and IDr payloads should not be ID_NULL, even though the NULL authentication method is used.

The identifier names which secret to use, and its first octet says how it is formatted. Two formats are defined: one that hides what the secret is, and one that is a plain fixed string, recommended to be limited to characters that every implementation can store. The document also says plainly that sharing one secret among a group of peers is a bad idea, because a group member can record traffic and open it later.

§6Security Considerations

A critical consideration is how to ensure the randomness of the shared key. Quantum computers are able to perform Grover's algorithm, which effectively halves the size of a symmetric key. In addition, an adversary impersonating the server, even with a conventional computer, can perform a dictionary search over plausible key values. The strongest practice is to ensure that the key contains at least 256 bits of entropy, which provides 128 bits of post-quantum security while also providing security against conventional dictionary attacks. That is the security equivalent of Category 5 in the NIST Post-Quantum Cryptography Call for Proposals. Deriving the key from a password, a name or another low-entropy source is not secure because of these known attacks.

With this protocol, the computed SK_d is a function of the shared key. Assuming the key has sufficient entropy, for example at least 2^256 possible values, even if an attacker were able to recover the rest of the inputs to the pseudorandom function, it would be infeasible to use Grover's algorithm to recover the SK_d value. All the keys that are a function of SK_d, which include all child security association keys and all keys for subsequent IKE security associations created when the initial one is rekeyed, are therefore quantum secure, assuming the key had enough entropy and the subkeys are sufficiently long.

An attacker with a quantum computer that can decrypt the initial IKE security association has access to everything exchanged over it, such as the identities of the peers, configuration parameters and all negotiated IPsec information including traffic selectors, with the exception of the cryptographic keys used by the IPsec security associations, which are protected by the shared key. Deployments that treat this information as sensitive, or that send other sensitive data such as cryptographic keys over IKE security associations, must rekey the IKE security association before the sensitive information is sent. It is possible to create a childless IKE security association as specified in RFC 6023, which prevents child security association configuration information from being transmitted in the original IKE security association that is not protected by the shared key. Some information, such as peer identities, feature notifications and vendor IDs, cannot be hidden from this attack even with the extra rekey.

The policy should also be set to negotiate only quantum secure symmetric algorithms. The document lists the defined IKEv2 and IPsec algorithms that should not be used, because they are known to provide less than 128 bits of post-quantum security: any IKEv2 encryption algorithm, pseudorandom function or integrity algorithm with a key size less than 256 bits; any ESP transform with a key size less than 256 bits; and the two functions PRF_AES128_XCBC and PRF_AES128_CBC, which, even though they can take an input key of arbitrary size, convert it into a 128-bit key for internal use.

Section 3 requires the initiator to abort the initial exchange if using the keys is mandatory but the responder does not include USE_PPK. In that situation the initiator leaves a half-open IKE security association on the responder, because the IKE_SA_INIT completed successfully from the responder's point of view. It will eventually expire, but if the initiator keeps retrying at a high enough rate the responder may treat it as a denial-of-service attack and take protective measures. It is recommended that the initiator cache the negative result and not try again for some time; waiting at least a few minutes will not cause the responder to treat it as an attack. This situation would most likely be a result of misconfiguration, and some reconfiguration of the peers would probably be needed.

If using the keys is optional for both peers and they authenticate with digital signatures, an attacker in between with a quantum computer able to break public key operations in real time can mount a downgrade attack by removing the USE_PPK notification from the IKE_SA_INIT and forging digital signatures in the subsequent exchange. If using the keys is mandatory for at least one peer, or if a preshared key mode is used for authentication, the attack is detected and the security association is not created.

If using the keys is mandatory for the initiator, an attacker able to eavesdrop and inject packets can prevent the creation of a security association by intercepting the request containing USE_PPK and injecting a forged response without it. If the forged packet arrives before the responder's genuine response, the initiator would abort the exchange. To thwart this, it is recommended that, when using the keys is mandatory for the initiator and the received response does not contain USE_PPK, the initiator does not abort immediately. It waits for more response messages, retransmitting the request as if no responses had been received, until either a received message contains USE_PPK or the exchange times out. If none of the responses contains USE_PPK, the exchange is aborted.

If using a key is optional for both peers, then in case of misconfiguration, such as a mismatched identifier, the security association will be created without protection against quantum computers. It is advised that if a key was configured but not used for a particular security association, implementations should audit this event.

The shared key has to be genuinely random and long: at least 256 bits of entropy, which a quantum attacker can only halve. The RFC also explains what a quantum attacker still learns, which is the metadata of the first handshake but not the keys protecting the traffic, and how to rekey before sending anything sensitive. It warns that an optional key can be removed by an attacker, and that a mismatched configuration silently produces an unprotected tunnel, so the audit matters.

§7Registry Entries

The document defines three new Notify Message Types in the IKEv2 Notify Message Types, Status Types subregistry: 16435 for USE_PPK, 16436 for PPK_IDENTITY and 16437 for NO_PPK_AUTH.

IANA has also created a new subregistry titled IKEv2 Post-quantum Preshared Key ID Types under the IKEv2 Parameters registry, for the identifier types used in the PPK_IDENTITY notification. The initial contents are PPK_ID_OPAQUE with the value 1 and PPK_ID_FIXED with the value 2.

Three new notification numbers are registered for the messages this RFC adds, and a small new registry holds the two identifier formats.

The new IKEv2 status notifications
  • 16435USE_PPK — The initiator asks to use a post-quantum preshared key.
  • 16436PPK_IDENTITY — Carries the identifier of the key in use.
  • 16437NO_PPK_AUTH — Offers fallback authentication when the key is optional.

§8References