<?xml version='1.0' encoding='utf-8'?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" version="3" category="info" consensus="true" docName="draft-ietf-emu-rfc5448bis-10" indexInclude="true" ipr="trust200902" number="9048" prepTime="2021-10-29T09:11:22" scripts="Common,Latin" sortRefs="true" submissionType="IETF" symRefs="true" tocDepth="3" tocInclude="true" updates="4187, 5448" xml:lang="en">
  <link href="https://datatracker.ietf.org/doc/draft-ietf-emu-rfc5448bis-10" rel="prev"/>
  <link href="https://dx.doi.org/10.17487/rfc9048" rel="alternate"/>
  <link href="urn:issn:2070-1721" rel="alternate"/>
  <front>
    <title abbrev="EAP-AKA'">Improved Extensible Authentication Protocol Method for 3GPP Mobile Network Authentication and Key Agreement (EAP-AKA')</title>
    <seriesInfo name="RFC" value="9048" stream="IETF"/>
    <author initials="J" surname="Arkko" fullname="Jari Arkko">
      <organization showOnFrontPage="true">Ericsson</organization>
      <address>
        <postal>
          <city>Jorvas</city>
          <code>02420</code>
          <country>Finland</country>
        </postal>
        <email>jari.arkko@piuha.net</email>
      </address>
    </author>
    <author initials="V." surname="Lehtovirta" fullname="Vesa Lehtovirta">
      <organization showOnFrontPage="true">Ericsson</organization>
      <address>
        <postal>
          <city>Jorvas</city>
          <code>02420</code>
          <country>Finland</country>
        </postal>
        <email>vesa.lehtovirta@ericsson.com</email>
      </address>
    </author>
    <author initials="V." surname="Torvinen" fullname="Vesa Torvinen">
      <organization showOnFrontPage="true">Ericsson</organization>
      <address>
        <postal>
          <city>Jorvas</city>
          <code>02420</code>
          <country>Finland</country>
        </postal>
        <email>vesa.torvinen@ericsson.com</email>
      </address>
    </author>
    <author initials="P." surname="Eronen" fullname="Pasi Eronen">
      <organization showOnFrontPage="true">Independent</organization>
      <address>
        <postal>
          <country>Finland</country>
        </postal>
        <email>pe@iki.fi</email>
      </address>
    </author>
    <date month="10" year="2021"/>
    <keyword>EAP</keyword>
    <keyword>AKA</keyword>
    <keyword>AKA'</keyword>
    <keyword>3GPP</keyword>
    <abstract pn="section-abstract">
      <t indent="0" pn="section-abstract-1">The 3GPP mobile network Authentication and Key Agreement (AKA) 
  is an authentication mechanism for devices wishing to
  access mobile networks. RFC 4187 (EAP-AKA) made the use of this mechanism
  possible within the Extensible Authentication Protocol (EAP)
  framework. RFC 5448 (EAP-AKA') was an improved version of EAP-AKA.</t>
      <t indent="0" pn="section-abstract-2">This document is the most recent specification of EAP-AKA',
  including, for instance, details about and references related to 
  operating EAP-AKA' in 5G networks. </t>
      <t indent="0" pn="section-abstract-3">EAP-AKA' differs from EAP-AKA by providing a key derivation
  function that binds the keys derived within the method to the name
  of the access network. The key derivation function has been defined
  in the 3rd Generation Partnership Project (3GPP). EAP-AKA' allows
  its use in EAP in an interoperable manner. EAP-AKA' also
  updates the algorithm used in hash functions, as it employs SHA-256 / HMAC-SHA-256 instead of
  SHA-1 / HMAC-SHA-1, which is used in EAP-AKA.</t>
      <t indent="0" pn="section-abstract-4">This version of the EAP-AKA' specification defines the protocol
  behavior for both 4G and 5G deployments, whereas the previous
  version defined protocol behavior for 4G deployments only.
  While EAP-AKA' as defined in RFC 5448 is not obsolete, this document 
  defines the most recent and fully backwards-compatible specification 
  of EAP-AKA'. This document updates both RFCs 4187 and 5448.</t>
    </abstract>
    <boilerplate>
      <section anchor="status-of-memo" numbered="false" removeInRFC="false" toc="exclude" pn="section-boilerplate.1">
        <name slugifiedName="name-status-of-this-memo">Status of This Memo</name>
        <t indent="0" pn="section-boilerplate.1-1">
            This document is not an Internet Standards Track specification; it is
            published for informational purposes.  
        </t>
        <t indent="0" pn="section-boilerplate.1-2">
            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).  Not all documents
            approved by the IESG are candidates for any level of Internet
            Standard; see Section 2 of RFC 7841. 
        </t>
        <t indent="0" pn="section-boilerplate.1-3">
            Information about the current status of this document, any
            errata, and how to provide feedback on it may be obtained at
            <eref target="https://www.rfc-editor.org/info/rfc9048" brackets="none"/>.
        </t>
      </section>
      <section anchor="copyright" numbered="false" removeInRFC="false" toc="exclude" pn="section-boilerplate.2">
        <name slugifiedName="name-copyright-notice">Copyright Notice</name>
        <t indent="0" pn="section-boilerplate.2-1">
            Copyright (c) 2021 IETF Trust and the persons identified as the
            document authors. All rights reserved.
        </t>
        <t indent="0" pn="section-boilerplate.2-2">
            This document is subject to BCP 78 and the IETF Trust's Legal
            Provisions Relating to IETF Documents
            (<eref target="https://trustee.ietf.org/license-info" brackets="none"/>) 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.
        </t>
      </section>
    </boilerplate>
    <toc>
      <section anchor="toc" numbered="false" removeInRFC="false" toc="exclude" pn="section-toc.1">
        <name slugifiedName="name-table-of-contents">Table of Contents</name>
        <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1">
          <li pn="section-toc.1-1.1">
            <t indent="0" keepWithNext="true" pn="section-toc.1-1.1.1"><xref derivedContent="1" format="counter" sectionFormat="of" target="section-1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-introduction">Introduction</xref></t>
          </li>
          <li pn="section-toc.1-1.2">
            <t indent="0" keepWithNext="true" pn="section-toc.1-1.2.1"><xref derivedContent="2" format="counter" sectionFormat="of" target="section-2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-requirements-language">Requirements Language</xref></t>
          </li>
          <li pn="section-toc.1-1.3">
            <t indent="0" pn="section-toc.1-1.3.1"><xref derivedContent="3" format="counter" sectionFormat="of" target="section-3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-eap-aka">EAP-AKA'</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.3.2">
              <li pn="section-toc.1-1.3.2.1">
                <t indent="0" keepWithNext="true" pn="section-toc.1-1.3.2.1.1"><xref derivedContent="3.1" format="counter" sectionFormat="of" target="section-3.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-at_kdf_input">AT_KDF_INPUT</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.2">
                <t indent="0" pn="section-toc.1-1.3.2.2.1"><xref derivedContent="3.2" format="counter" sectionFormat="of" target="section-3.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-at_kdf">AT_KDF</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.3">
                <t indent="0" pn="section-toc.1-1.3.2.3.1"><xref derivedContent="3.3" format="counter" sectionFormat="of" target="section-3.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-key-derivation">Key Derivation</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.4">
                <t indent="0" pn="section-toc.1-1.3.2.4.1"><xref derivedContent="3.4" format="counter" sectionFormat="of" target="section-3.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-hash-functions">Hash Functions</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.3.2.4.2">
                  <li pn="section-toc.1-1.3.2.4.2.1">
                    <t indent="0" pn="section-toc.1-1.3.2.4.2.1.1"><xref derivedContent="3.4.1" format="counter" sectionFormat="of" target="section-3.4.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-prf">PRF'</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.4.2.2">
                    <t indent="0" pn="section-toc.1-1.3.2.4.2.2.1"><xref derivedContent="3.4.2" format="counter" sectionFormat="of" target="section-3.4.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-at_mac">AT_MAC</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.4.2.3">
                    <t indent="0" pn="section-toc.1-1.3.2.4.2.3.1"><xref derivedContent="3.4.3" format="counter" sectionFormat="of" target="section-3.4.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-at_checkcode">AT_CHECKCODE</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.3.2.5">
                <t indent="0" pn="section-toc.1-1.3.2.5.1"><xref derivedContent="3.5" format="counter" sectionFormat="of" target="section-3.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-summary-of-attributes-for-e">Summary of Attributes for EAP-AKA'</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.4">
            <t indent="0" pn="section-toc.1-1.4.1"><xref derivedContent="4" format="counter" sectionFormat="of" target="section-4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-bidding-down-prevention-for">Bidding Down Prevention for EAP-AKA</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.4.2">
              <li pn="section-toc.1-1.4.2.1">
                <t indent="0" pn="section-toc.1-1.4.2.1.1"><xref derivedContent="4.1" format="counter" sectionFormat="of" target="section-4.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-summary-of-attributes-for-ea">Summary of Attributes for EAP-AKA</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.5">
            <t indent="0" pn="section-toc.1-1.5.1"><xref derivedContent="5" format="counter" sectionFormat="of" target="section-5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-peer-identities">Peer Identities</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2">
              <li pn="section-toc.1-1.5.2.1">
                <t indent="0" pn="section-toc.1-1.5.2.1.1"><xref derivedContent="5.1" format="counter" sectionFormat="of" target="section-5.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-username-types-in-eap-aka-i">Username Types in EAP-AKA' Identities</xref></t>
              </li>
              <li pn="section-toc.1-1.5.2.2">
                <t indent="0" pn="section-toc.1-1.5.2.2.1"><xref derivedContent="5.2" format="counter" sectionFormat="of" target="section-5.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-generating-pseudonyms-and-f">Generating Pseudonyms and Fast Re-Authentication Identities</xref></t>
              </li>
              <li pn="section-toc.1-1.5.2.3">
                <t indent="0" pn="section-toc.1-1.5.2.3.1"><xref derivedContent="5.3" format="counter" sectionFormat="of" target="section-5.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-identifier-usage-in-5g">Identifier Usage in 5G</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2.3.2">
                  <li pn="section-toc.1-1.5.2.3.2.1">
                    <t indent="0" pn="section-toc.1-1.5.2.3.2.1.1"><xref derivedContent="5.3.1" format="counter" sectionFormat="of" target="section-5.3.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-key-derivation-2">Key Derivation</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.3.2.2">
                    <t indent="0" pn="section-toc.1-1.5.2.3.2.2.1"><xref derivedContent="5.3.2" format="counter" sectionFormat="of" target="section-5.3.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-eap-identity-response-and-e">EAP Identity Response and EAP-AKA' AT_IDENTITY Attribute</xref></t>
                  </li>
                </ul>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.6">
            <t indent="0" pn="section-toc.1-1.6.1"><xref derivedContent="6" format="counter" sectionFormat="of" target="section-6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-exported-parameters">Exported Parameters</xref></t>
          </li>
          <li pn="section-toc.1-1.7">
            <t indent="0" pn="section-toc.1-1.7.1"><xref derivedContent="7" format="counter" sectionFormat="of" target="section-7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-security-considerations">Security Considerations</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.7.2">
              <li pn="section-toc.1-1.7.2.1">
                <t indent="0" pn="section-toc.1-1.7.2.1.1"><xref derivedContent="7.1" format="counter" sectionFormat="of" target="section-7.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-privacy">Privacy</xref></t>
              </li>
              <li pn="section-toc.1-1.7.2.2">
                <t indent="0" pn="section-toc.1-1.7.2.2.1"><xref derivedContent="7.2" format="counter" sectionFormat="of" target="section-7.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-discovered-vulnerabilities">Discovered Vulnerabilities</xref></t>
              </li>
              <li pn="section-toc.1-1.7.2.3">
                <t indent="0" pn="section-toc.1-1.7.2.3.1"><xref derivedContent="7.3" format="counter" sectionFormat="of" target="section-7.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pervasive-monitoring">Pervasive Monitoring</xref></t>
              </li>
              <li pn="section-toc.1-1.7.2.4">
                <t indent="0" pn="section-toc.1-1.7.2.4.1"><xref derivedContent="7.4" format="counter" sectionFormat="of" target="section-7.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-security-properties-of-bind">Security Properties of Binding Network Names</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.8">
            <t indent="0" pn="section-toc.1-1.8.1"><xref derivedContent="8" format="counter" sectionFormat="of" target="section-8"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-iana-considerations">IANA Considerations</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.8.2">
              <li pn="section-toc.1-1.8.2.1">
                <t indent="0" pn="section-toc.1-1.8.2.1.1"><xref derivedContent="8.1" format="counter" sectionFormat="of" target="section-8.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-type-value">Type Value</xref></t>
              </li>
              <li pn="section-toc.1-1.8.2.2">
                <t indent="0" pn="section-toc.1-1.8.2.2.1"><xref derivedContent="8.2" format="counter" sectionFormat="of" target="section-8.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-attribute-type-values">Attribute Type Values</xref></t>
              </li>
              <li pn="section-toc.1-1.8.2.3">
                <t indent="0" pn="section-toc.1-1.8.2.3.1"><xref derivedContent="8.3" format="counter" sectionFormat="of" target="section-8.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-key-derivation-function-nam">Key Derivation Function Namespace</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.9">
            <t indent="0" pn="section-toc.1-1.9.1"><xref derivedContent="9" format="counter" sectionFormat="of" target="section-9"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-references">References</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.9.2">
              <li pn="section-toc.1-1.9.2.1">
                <t indent="0" pn="section-toc.1-1.9.2.1.1"><xref derivedContent="9.1" format="counter" sectionFormat="of" target="section-9.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-normative-references">Normative References</xref></t>
              </li>
              <li pn="section-toc.1-1.9.2.2">
                <t indent="0" pn="section-toc.1-1.9.2.2.1"><xref derivedContent="9.2" format="counter" sectionFormat="of" target="section-9.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-informative-references">Informative References</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.10">
            <t indent="0" pn="section-toc.1-1.10.1"><xref derivedContent="Appendix A" format="default" sectionFormat="of" target="section-appendix.a"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-changes-from-rfc-5448">Changes from RFC 5448</xref></t>
          </li>
          <li pn="section-toc.1-1.11">
            <t indent="0" pn="section-toc.1-1.11.1"><xref derivedContent="Appendix B" format="default" sectionFormat="of" target="section-appendix.b"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-changes-to-rfc-4187">Changes to RFC 4187</xref></t>
          </li>
          <li pn="section-toc.1-1.12">
            <t indent="0" pn="section-toc.1-1.12.1"><xref derivedContent="Appendix C" format="default" sectionFormat="of" target="section-appendix.c"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-importance-of-explicit-nego">Importance of Explicit Negotiation</xref></t>
          </li>
          <li pn="section-toc.1-1.13">
            <t indent="0" pn="section-toc.1-1.13.1"><xref derivedContent="Appendix D" format="default" sectionFormat="of" target="section-appendix.d"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-test-vectors">Test Vectors</xref></t>
          </li>
          <li pn="section-toc.1-1.14">
            <t indent="0" pn="section-toc.1-1.14.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-appendix.e"/><xref derivedContent="" format="title" sectionFormat="of" target="name-acknowledgments">Acknowledgments</xref></t>
          </li>
          <li pn="section-toc.1-1.15">
            <t indent="0" pn="section-toc.1-1.15.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-appendix.f"/><xref derivedContent="" format="title" sectionFormat="of" target="name-contributors">Contributors</xref></t>
          </li>
          <li pn="section-toc.1-1.16">
            <t indent="0" pn="section-toc.1-1.16.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-appendix.g"/><xref derivedContent="" format="title" sectionFormat="of" target="name-authors-addresses">Authors' Addresses</xref></t>
          </li>
        </ul>
      </section>
    </toc>
  </front>
  <middle>
    <section numbered="true" toc="include" removeInRFC="false" pn="section-1">
      <name slugifiedName="name-introduction">Introduction</name>
      <t indent="0" pn="section-1-1">The 3GPP mobile network Authentication and Key Agreement (AKA) is
  an authentication mechanism for devices wishing to access mobile
  networks. <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/> (EAP-AKA) made the use of this mechanism
  possible within the Extensible Authentication Protocol (EAP)
  framework <xref target="RFC3748" format="default" sectionFormat="of" derivedContent="RFC3748"/>.</t>
      <t indent="0" pn="section-1-2">EAP-AKA' is an improved version of
  EAP-AKA. EAP-AKA' was defined in RFC 5448 <xref target="RFC5448" format="default" sectionFormat="of" derivedContent="RFC5448"/>, and it updated EAP-AKA 
  <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/>. </t>
      <t indent="0" pn="section-1-3">This document is the most recent specification of EAP-AKA',
  including, for instance, details about and references related to 
  operating EAP-AKA' in 5G networks. This document does not obsolete RFC 5448; however, this document is the
  most recent and fully backwards-compatible specification.</t>
      <t indent="0" pn="section-1-4">EAP-AKA' is commonly implemented in mobile phones and network
  equipment. It can be used for authentication to gain network access via
  Wireless LAN networks and, with 5G, also directly to mobile
  networks.</t>
      <t indent="0" pn="section-1-5">EAP-AKA' differs from EAP-AKA by providing a different key
  derivation function. This function binds the keys derived within the
  method to the name of the access network. This limits the effects of
  compromised access network nodes and keys. EAP-AKA' also updates
  the algorithm used for hash functions.</t>
      <t indent="0" pn="section-1-6">The EAP-AKA' method employs the derived keys CK' and IK' from the
  3GPP specification <xref target="TS-3GPP.33.402" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.402"/> and updates the
  hash function that is used to SHA-256 <xref target="FIPS.180-4" format="default" sectionFormat="of" derivedContent="FIPS.180-4"/> and HMAC
  to HMAC-SHA-256. Otherwise, EAP-AKA' is equivalent to EAP-AKA. Given
  that a different EAP method Type value is used for EAP-AKA and
  EAP-AKA', a mutually supported method may be negotiated using the
  standard mechanisms in EAP <xref target="RFC3748" format="default" sectionFormat="of" derivedContent="RFC3748"/>.

      </t>
      <t indent="6" pn="section-1-7">Note that any change of the key derivation must be unambiguous
    to both sides in the protocol. That is, it must not be possible to
    accidentally connect old equipment to new equipment and get the
    key derivation wrong or to attempt to use incorrect keys without getting
    a proper error message. See <xref target="baddesign" format="default" sectionFormat="of" derivedContent="Appendix C"/> for further
    information.</t>
      <t indent="6" pn="section-1-8">Note also that choices in authentication protocols should be
    secure against bidding down attacks that attempt to force the
    participants to use the least secure function. See <xref target="bidding" format="default" sectionFormat="of" derivedContent="Section 4"/> for further information.</t>
      <t indent="0" pn="section-1-9">This specification makes the following changes from RFC 5448:
      </t>
      <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-1-10">
        <li pn="section-1-10.1">Updates the reference that specifies how the Network Name field is
    constructed in the protocol. This update ensures that EAP-AKA' is
    compatible with 5G deployments. RFC 5448 referred to the Release 8
    version of <xref target="TS-3GPP.24.302" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.302"/>. This document points
    to the first 5G version, Release 16.</li>
        <li pn="section-1-10.2">Specifies how EAP and EAP-AKA' use identifiers in 5G. Additional
    identifiers are introduced in 5G, and for interoperability, it is
    necessary that the right identifiers are used as inputs in the key
    derivation.  In addition, for identity privacy it is important that
    when privacy-friendly identifiers in 5G are used, no trackable, permanent
    identifiers are passed in EAP-AKA', either.</li>
        <li pn="section-1-10.3">Specifies session identifiers and other exported parameters, as
    those were not specified in <xref target="RFC5448" format="default" sectionFormat="of" derivedContent="RFC5448"/> despite
    requirements set forward in <xref target="RFC5247" format="default" sectionFormat="of" derivedContent="RFC5247"/> to do so.
    Also, while <xref target="RFC5247" format="default" sectionFormat="of" derivedContent="RFC5247"/> specified session identifiers
    for EAP-AKA, it only did so for the full authentication case, not
    for the case of fast re-authentication.</li>
        <li pn="section-1-10.4">Updates the requirements on generating pseudonym usernames and
    fast re-authentication identities to ensure identity privacy.</li>
        <li pn="section-1-10.5">Describes what has been learned about any vulnerabilities
    in AKA or EAP-AKA'.</li>
        <li pn="section-1-10.6">Describes the privacy and pervasive monitoring considerations
    related to EAP-AKA'.</li>
        <li pn="section-1-10.7">Adds summaries of the attributes.</li>
      </ul>
      <t indent="0" pn="section-1-11">Some of the updates are small. For instance, 
  the reference update to <xref target="TS-3GPP.24.302" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.302"/> does not change the 3GPP specification number,
  only the version. But this reference is crucial for the correct calculation
  of the keys that result from running the EAP-AKA' method, so an
  RFC update pointing to the newest version was warranted.
      </t>
      <t indent="6" pn="section-1-12">Note: Any further updates in 3GPP specifications that affect,
    for instance, key derivation is something that EAP-AKA'
    implementations need to take into account. Upon such updates, there
    will be a need to update both this specification and the
    implementations.</t>
      <t indent="0" pn="section-1-13">It is an explicit non-goal of this specification to include any other
  technical modifications, addition of new features, or other
  changes. The EAP-AKA' base protocol is stable and needs to stay that
  way. If there are any extensions or variants, those need to be
  proposed as standalone extensions or even as different authentication
  methods.</t>
      <t indent="0" pn="section-1-14">The rest of this specification is structured as follows. <xref target="prime" format="default" sectionFormat="of" derivedContent="Section 3"/> defines the EAP-AKA' method. <xref target="bidding" format="default" sectionFormat="of" derivedContent="Section 4"/> adds support to EAP-AKA to prevent bidding down
  attacks from EAP-AKA'. <xref target="identities" format="default" sectionFormat="of" derivedContent="Section 5"/> specifies
  requirements regarding the use of peer identities, including how
  5G identifiers are used in the EAP-AKA' context. <xref target="exported-parameters" format="default" sectionFormat="of" derivedContent="Section 6"/> specifies which parameters EAP-AKA'
  exports out of the method.
  <xref target="security" format="default" sectionFormat="of" derivedContent="Section 7"/>
  explains the security differences between EAP-AKA and EAP-AKA'. <xref target="iana" format="default" sectionFormat="of" derivedContent="Section 8"/> describes the IANA considerations, and <xref target="diff2" format="default" sectionFormat="of" derivedContent="Appendix A"/> and <xref target="diff" format="default" sectionFormat="of" derivedContent="Appendix B"/> explain the updates to
  RFC 5448 (EAP-AKA') and RFC 4187 (EAP-AKA) that have been made in this
  specification. <xref target="baddesign" format="default" sectionFormat="of" derivedContent="Appendix C"/> explains some of the design
  rationale for creating EAP-AKA'. Finally, <xref target="testvectors" format="default" sectionFormat="of" derivedContent="Appendix D"/>
  provides test vectors.</t>
    </section>
    <section numbered="true" toc="include" removeInRFC="false" pn="section-2">
      <name slugifiedName="name-requirements-language">Requirements Language</name>
      <t indent="0" pn="section-2-1">The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL NOT</bcp14>",
"<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>", "<bcp14>MAY</bcp14>", and
"<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as described in BCP 14 <xref target="RFC2119" format="default" sectionFormat="of" derivedContent="RFC2119"/> <xref target="RFC8174" format="default" sectionFormat="of" derivedContent="RFC8174"/> when, and only
when, they appear in all capitals, as shown here.</t>
    </section>
    <section anchor="prime" numbered="true" toc="include" removeInRFC="false" pn="section-3">
      <name slugifiedName="name-eap-aka">EAP-AKA'</name>
      <t indent="0" pn="section-3-1">EAP-AKA' is an EAP method that follows the EAP-AKA specification
<xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/> in all respects except the following:

</t>
      <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3-2">
        <li pn="section-3-2.1">It uses the Type code 0x32, not 0x17 (which is used by
EAP-AKA).</li>
        <li pn="section-3-2.2">It carries the AT_KDF_INPUT attribute, as defined in
<xref target="netbind" format="default" sectionFormat="of" derivedContent="Section 3.1"/>, to ensure that both the peer and server know
the name of the access network.</li>
        <li pn="section-3-2.3">It supports key derivation function negotiation via the AT_KDF
attribute (<xref target="keyderiv" format="default" sectionFormat="of" derivedContent="Section 3.2"/>) to allow for future
extensions.</li>
        <li pn="section-3-2.4">It calculates keys as defined in <xref target="key" format="default" sectionFormat="of" derivedContent="Section 3.3"/>, not as
defined in EAP-AKA.</li>
        <li pn="section-3-2.5">It employs SHA-256 / HMAC-SHA-256 <xref target="FIPS.180-4" format="default" sectionFormat="of" derivedContent="FIPS.180-4"/>, not SHA-1 / HMAC-SHA-1 <xref target="RFC2104" format="default" sectionFormat="of" derivedContent="RFC2104"/> (see <xref target="hashup" format="default" sectionFormat="of" derivedContent="Section 3.4"/>).</li>
      </ul>
      <t indent="0" pn="section-3-3"><xref target="EAP-fig" format="default" sectionFormat="of" derivedContent="Figure 1"/> shows an example of the authentication process. Each
message AKA'-Challenge and so on represents the corresponding message
from EAP-AKA, but with the EAP-AKA' Type code. The definition of these
messages, along with the definition of attributes AT_RAND, AT_AUTN,
AT_MAC, and AT_RES can be found in <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/>.</t>
      <figure anchor="EAP-fig" align="left" suppress-title="false" pn="figure-1">
        <name slugifiedName="name-eap-aka-authentication-proc">EAP-AKA' Authentication Process</name>
        <artwork name="" type="" align="left" alt="" pn="section-3-4.1">
 Peer                                                    Server
    |                       EAP-Request/Identity             |
    |&lt;-------------------------------------------------------|
    |                                                        |
    |  EAP-Response/Identity                                 |
    |  (Includes user's Network Access Identifier, NAI)      |
    |-------------------------------------------------------&gt;|
    |         +--------------------------------------------------+
    |         | Server determines the network name and ensures   |
    |         | that the given access network is authorized to   |
    |         | use the claimed name.  The server then runs the  |
    |         | AKA' algorithms generating RAND and AUTN, and    |
    |         | derives session keys from CK' and IK'.  RAND and |
    |         | AUTN are sent as AT_RAND and AT_AUTN attributes, |
    |         | whereas the network name is transported in the   |
    |         | AT_KDF_INPUT attribute.  AT_KDF signals the used |
    |         | key derivation function.  The session keys are   |
    |         | used in creating the AT_MAC attribute.           |
    |         +--------------------------------------------------+
    |                         EAP-Request/AKA'-Challenge     |
    |        (AT_RAND, AT_AUTN, AT_KDF, AT_KDF_INPUT, AT_MAC)|
    |&lt;-------------------------------------------------------|
+------------------------------------------------------+     |
| The peer determines what the network name should be, |     |
| based on, e.g., what access technology it is using.  |     |
| The peer also retrieves the network name sent by     |     |
| the network from the AT_KDF_INPUT attribute.  The    |     |
| two names are compared for discrepancies, and if     |     |
| necessary, the authentication is aborted.  Otherwise,|     |
| the network name from AT_KDF_INPUT attribute is      |     |
| used in running the AKA' algorithms, verifying AUTN  |     |
| from AT_AUTN and MAC from AT_MAC attributes.  The    |     |
| peer then generates RES.  The peer also derives      |     |
| session keys from CK'/IK'.  The AT_RES and AT_MAC    |     |
| attributes are constructed.                          |     |
+------------------------------------------------------+     |
    | EAP-Response/AKA'-Challenge                            |
    | (AT_RES, AT_MAC)                                       |
    |-------------------------------------------------------&gt;|
    |         +--------------------------------------------------+
    |         | Server checks the RES and MAC values received    |
    |         | in AT_RES and AT_MAC, respectively.  Success     |
    |         | requires both to be found correct.               |
    |         +--------------------------------------------------+
    |                                           EAP-Success  |
    |&lt;-------------------------------------------------------|
</artwork>
      </figure>
      <t indent="0" pn="section-3-5">EAP-AKA' can operate on the same credentials as EAP-AKA and
   employ the same identities.  However, EAP-AKA' employs different
   leading characters than EAP-AKA for the conventions given in <xref target="RFC4187" section="4.1.1" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-4.1.1" derivedContent="RFC4187"/> for usernames based on International Mobile
   Subscriber Identifier (IMSI).  For 4G networks, EAP-AKA' <bcp14>MUST</bcp14> use
   the leading character "6" (ASCII 36 hexadecimal) instead of "0" for
   IMSI-based permanent usernames.
   For 5G networks, the leading character "6" is not used for IMSI-based permanent usernames.
   Identifier usage in 5G is specified in <xref target="identifiersin5g" format="default" sectionFormat="of" derivedContent="Section 5.3"/>. All
   other usage and processing of the leading characters, usernames,
   and identities is as defined by EAP-AKA <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/>.
   For instance, the pseudonym and fast re-authentication usernames
   need to be constructed so that the server can recognize them.  As
   an example, a pseudonym could begin with a leading "7" character
   (ASCII 37 hexadecimal) and a fast re-authentication username could
   begin with "8" (ASCII 38 hexadecimal).  Note that a server that
   implements only EAP-AKA may not recognize these leading characters.
   According to <xref target="RFC4187" section="4.1.4" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-4.1.4" derivedContent="RFC4187"/>, such a
   server will re-request the identity via the EAP-Request/AKA-Identity 
   message, making obvious to the peer that
   EAP-AKA and associated identity are expected.</t>
      <section anchor="netbind" numbered="true" toc="include" removeInRFC="false" pn="section-3.1">
        <name slugifiedName="name-at_kdf_input">AT_KDF_INPUT</name>
        <t indent="0" pn="section-3.1-1">The format of the AT_KDF_INPUT attribute is shown below.</t>
        <artwork name="" type="" align="left" alt="" pn="section-3.1-2">
    0                   1                   2                   3
    0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   | AT_KDF_INPUT  | Length        | Actual Network Name Length    |
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |                                                               |
   .                        Network Name                           .
   .                                                               .
   |                                                               |
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
</artwork>
        <t indent="0" pn="section-3.1-3">The fields are as follows:</t>
        <dl newline="true" spacing="normal" indent="3" pn="section-3.1-4">
          <dt pn="section-3.1-4.1">AT_KDF_INPUT</dt>
          <dd pn="section-3.1-4.2">This is set to 23.</dd>
          <dt pn="section-3.1-4.3">Length</dt>
          <dd pn="section-3.1-4.4">The length of the
attribute, calculated as defined in <xref target="RFC4187" section="8.1" sectionFormat="comma" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-8.1" derivedContent="RFC4187"/>.</dd>
          <dt pn="section-3.1-4.5">Actual Network Name Length</dt>
          <dd pn="section-3.1-4.6">This is
a 2-byte actual length field, needed due to the requirement that
the previous field is expressed in multiples of 4 bytes per the usual
EAP-AKA rules. The Actual Network Name Length field
provides the length of the network name in bytes.</dd>
          <dt pn="section-3.1-4.7">Network Name</dt>
          <dd pn="section-3.1-4.8">This field contains
the network name of the access network for which the authentication is
being performed. The name does not include any terminating null
characters. Because the length of the entire attribute must be a
multiple of 4 bytes, the sender pads the name with 1, 2, or 3
bytes of all zero bits when necessary.</dd>
        </dl>
        <t indent="0" pn="section-3.1-5">Only the server sends the AT_KDF_INPUT attribute. The value is sent
as specified in <xref target="TS-3GPP.24.302" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.302"/> for both non-3GPP access
networks and for 5G
access networks. Per <xref target="TS-3GPP.33.402" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.402"/>, the server
always verifies the authorization of a given access network to use a
particular name before sending it to the peer over EAP-AKA'. The value
of the AT_KDF_INPUT attribute from the server <bcp14>MUST</bcp14> be non-empty, with
a greater than zero length in the Actual Network  Name Length
field. If the AT_KDF_INPUT attribute
is empty, the peer behaves as if AUTN had been incorrect and
authentication fails. See Section <xref target="RFC4187" section="3" sectionFormat="bare" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-3" derivedContent="RFC4187"/> and Figure 3 of <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/> for an overview of how authentication failures are
handled.</t>
        <t indent="0" pn="section-3.1-6">In addition, the peer <bcp14>MAY</bcp14> check the received value against its own
understanding of the network name. Upon detecting a discrepancy, the
peer either warns the user and continues, or fails the authentication
process. More specifically, the peer <bcp14>SHOULD</bcp14> have a configurable policy
that it can follow under these circumstances. If the policy indicates
that it can continue, the peer <bcp14>SHOULD</bcp14> log a warning message or display
it to the user.  If the peer chooses to proceed, it <bcp14>MUST</bcp14> use the
network name as received in the AT_KDF_INPUT attribute.  If the policy
indicates that the authentication should fail, the peer behaves as if
AUTN had been incorrect and authentication fails.</t>
        <t indent="0" pn="section-3.1-7">The Network Name field contains a UTF-8 string. This string <bcp14>MUST</bcp14>
be constructed as specified in <xref target="TS-3GPP.24.302" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.302"/> for
"Access Network Identity". The string is structured as fields
separated by colons (:). The algorithms and mechanisms to construct
the identity string depend on the used access technology.</t>
        <t indent="0" pn="section-3.1-8">On the network side, the network name construction is a
configuration issue in an access network and an authorization check in
the authentication server. On the peer, the network name is
constructed based on the local observations. For instance, the peer
knows which access technology it is using on the link, it can see
information in a link-layer beacon, and so on. The construction rules
specify how this information maps to an access network
name. Typically, the network name consists of the name of the access
technology or the name of the access technology followed by some operator
identifier that was advertised in a link-layer beacon.  In all cases,
<xref target="TS-3GPP.24.302" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.302"/> is the normative specification for the
construction in both the network and peer side. If the peer policy
allows running EAP-AKA' over an access technology for which that
specification does not provide network name construction rules, the
peer <bcp14>SHOULD</bcp14> rely only on the information from the AT_KDF_INPUT
attribute and not perform a comparison.</t>
        <t indent="0" pn="section-3.1-9">If a comparison of the locally determined network name and the one
received over EAP-AKA' is performed on the peer, it <bcp14>MUST</bcp14> be done as
follows. First, each name is broken down to the fields separated by
colons. If one of the names has more colons and fields than the other
one, the additional fields are ignored. The remaining sequences of
fields are compared, and they match only if they are equal character
by character. This algorithm allows a prefix match where the peer
would be able to match "", "FOO", and "FOO:BAR" against the value
"FOO:BAR" received from the server. This capability is important in
order to allow possible updates to the specifications that dictate how
the network names are constructed. For instance, if a peer knows that
it is running on access technology "FOO", it can use the string "FOO"
even if the server uses an additional, more accurate description, e.g.,
"FOO:BAR", that contains more information.</t>
        <t indent="0" pn="section-3.1-10">The allocation procedures in <xref target="TS-3GPP.24.302" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.302"/> ensure
that conflicts potentially arising from using the same name in
different types of networks are avoided. The specification also has
detailed rules about how a client can determine these based on
information available to the client, such as the type of protocol used
to attach to the network, beacons sent out by the network, and so
on. Information that the client cannot directly observe (such as the
type or version of the home network) is not used by this
algorithm.</t>
        <t indent="0" pn="section-3.1-11">The AT_KDF_INPUT attribute <bcp14>MUST</bcp14> be sent and processed as explained
above when AT_KDF attribute has the value 1. Future definitions of new
AT_KDF values <bcp14>MUST</bcp14> define how this attribute is sent and
processed.</t>
      </section>
      <section anchor="keyderiv" numbered="true" toc="include" removeInRFC="false" pn="section-3.2">
        <name slugifiedName="name-at_kdf">AT_KDF</name>
        <t indent="0" pn="section-3.2-1">AT_KDF is an attribute that the server uses to reference a specific
key derivation function. It offers a negotiation capability that can
be useful for future evolution of the key derivation functions.</t>
        <t indent="0" pn="section-3.2-2">The format of the AT_KDF attribute is shown below.</t>
        <artwork name="" type="" align="left" alt="" pn="section-3.2-3">
    0                   1                   2                   3
    0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   | AT_KDF        | Length        |    Key Derivation Function    |
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
</artwork>
        <t indent="0" pn="section-3.2-4">The fields are as follows:</t>
        <dl newline="true" spacing="normal" indent="3" pn="section-3.2-5">
          <dt pn="section-3.2-5.1">AT_KDF</dt>
          <dd pn="section-3.2-5.2">This is set to 24.</dd>
          <dt pn="section-3.2-5.3">Length</dt>
          <dd pn="section-3.2-5.4">The length of the
attribute, calculated as defined in <xref target="RFC4187" section="8.1" sectionFormat="comma" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-8.1" derivedContent="RFC4187"/>. 
For AT_KDF, the Length field <bcp14>MUST</bcp14> be set to 1.</dd>
          <dt pn="section-3.2-5.5">Key Derivation Function</dt>
          <dd pn="section-3.2-5.6">An
enumerated value representing the key derivation function that the
server (or peer) wishes to use. Value 1 represents the default key
derivation function for EAP-AKA', i.e., employing CK' and IK' as
defined in <xref target="key" format="default" sectionFormat="of" derivedContent="Section 3.3"/>.</dd>
        </dl>
        <t indent="0" pn="section-3.2-6">Servers <bcp14>MUST</bcp14> send one or more AT_KDF attributes in the
EAP-Request/AKA'-Challenge message. These attributes represent the
desired functions ordered by preference, the most preferred function
being the first attribute.</t>
        <t indent="0" pn="section-3.2-7">Upon receiving a set of these attributes, if the peer supports and
is willing to use the key derivation function indicated by the first
attribute, the function is taken into use without any further
negotiation.  However, if the peer does not support this function or
is unwilling to use it, it does not process the received
EAP-Request/AKA'-Challenge in
any way except by responding with the EAP-Response/AKA'-Challenge
message that contains only one attribute,
AT_KDF with the value set to the selected alternative.  If there is no
suitable alternative, the peer behaves as if AUTN had been incorrect
and authentication fails (see Figure 3 of
<xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/>). The peer fails the authentication also if
there are any duplicate values within the list of AT_KDF attributes
(except where the duplication is due to a request to change the key
derivation function; see below for further information).</t>
        <t indent="0" pn="section-3.2-8">Upon receiving an EAP-Response/AKA'-Challenge with AT_KDF from the
peer, the server checks that the suggested AT_KDF value was one of the
alternatives in its offer. The first AT_KDF value in the message from
the server is not a valid alternative since the peer should have accepted it without further negotiation. If the peer has replied with
the first AT_KDF value, the server behaves as if AT_MAC of the
response had been incorrect and fails the authentication. For an
overview of the failed authentication process in the server side, see
Section <xref target="RFC4187" section="3" sectionFormat="bare" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-3" derivedContent="RFC4187"/> and Figure 2 of <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/>. Otherwise, the
server re-sends the EAP-Response/AKA'-Challenge message, but adds the
selected alternative to the beginning of the list of AT_KDF
attributes and retains the entire list following it. Note that this
means that the selected alternative appears twice in the set of AT_KDF
values. Responding to the peer's request to change the key derivation
function is the only legal situation where such duplication may
occur.</t>
        <t indent="0" pn="section-3.2-9">When the peer receives the new EAP-Request/AKA'-Challenge message,
it <bcp14>MUST</bcp14> check that the requested change, and only the requested
change, occurred in the list of AT_KDF attributes.  If so, it
continues with processing the received EAP-Request/AKA'-Challenge as
specified in <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/> and <xref target="netbind" format="default" sectionFormat="of" derivedContent="Section 3.1"/> of
this document.  If not, it behaves as if AT_MAC had been incorrect and
fails the authentication.  If the peer receives multiple
EAP-Request/AKA'-Challenge messages with differing AT_KDF attributes
without having requested negotiation, the peer <bcp14>MUST</bcp14> behave as if
AT_MAC had been incorrect and fail the authentication.</t>
        <t indent="0" pn="section-3.2-10">Note that the peer may also request sequence number
   resynchronization <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/>. This happens after
   AT_KDF negotiation has already completed.  That is, the
   EAP-Request/AKA'-Challenge and, possibly, the
   EAP-Response/AKA'-Challenge messages are exchanged first to determine 
   a mutually acceptable key derivation function, and only then
   is the possible AKA'-Synchronization-Failure message sent.  The
   AKA'-Synchronization-Failure message is sent as a response to the
   newly received EAP-Request/AKA'-Challenge, which is the last message
   of the AT_KDF negotiation. Note that if the first proposed KDF is
   acceptable, then the first
   EAP-Request/AKA'-Challenge message is also the last message. The
   AKA'-Synchronization-Failure message <bcp14>MUST</bcp14> contain the AUTS
   parameter as specified in <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/> and a copy the
   AT_KDF attributes as they appeared in the last message of the
   AT_KDF negotiation.  If the AT_KDF attributes are found to differ
   from their earlier values, the peer and server <bcp14>MUST</bcp14> behave as if
   AT_MAC had been incorrect and fail the authentication.</t>
      </section>
      <section anchor="key" numbered="true" toc="include" removeInRFC="false" pn="section-3.3">
        <name slugifiedName="name-key-derivation">Key Derivation</name>
        <t indent="0" pn="section-3.3-1">Both the peer and server <bcp14>MUST</bcp14> derive the keys as follows.

</t>
        <dl newline="true" spacing="normal" indent="3" pn="section-3.3-2">
          <dt pn="section-3.3-2.1">AT_KDF parameter has the value 1</dt>
          <dd pn="section-3.3-2.2">
            <t indent="0" pn="section-3.3-2.2.1">

In this case, MK is derived and used as
follows:</t>
            <artwork name="" type="" align="left" alt="" pn="section-3.3-2.2.2">
    MK = PRF'(IK'|CK',"EAP-AKA'"|Identity)
    K_encr = MK[0..127]
    K_aut  = MK[128..383]
    K_re   = MK[384..639]
    MSK    = MK[640..1151]
    EMSK   = MK[1152..1663]
</artwork>
            <t indent="0" pn="section-3.3-2.2.3">Here [n..m] denotes the substring from bit n to m, including
   bits n and m. PRF' is a new
   pseudorandom function specified in <xref target="hashup" format="default" sectionFormat="of" derivedContent="Section 3.4"/>.  The first 1664 bits
   from its output are used for K_encr (encryption key, 128 bits), K_aut
   (authentication key, 256 bits), K_re (re-authentication key, 256
   bits), MSK (Master Session Key, 512 bits), and EMSK (Extended Master
   Session Key, 512 bits).  These keys are used by the subsequent
   EAP-AKA' process.  K_encr is used by the AT_ENCR_DATA attribute, and
   K_aut by the AT_MAC attribute.  K_re is used later in this section.
   MSK and EMSK are outputs from a successful EAP method run <xref target="RFC3748" format="default" sectionFormat="of" derivedContent="RFC3748"/>.</t>
            <t indent="0" pn="section-3.3-2.2.4">IK' and CK' are derived as specified in <xref target="TS-3GPP.33.402" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.402"/>.  The functions
   that derive IK' and CK' take the following parameters:  CK and IK
   produced by the AKA algorithm, and value of the Network Name field
   comes from the AT_KDF_INPUT attribute (without length or padding).</t>
            <t indent="0" pn="section-3.3-2.2.5">The value "EAP-AKA'" is an eight-characters-long ASCII string.  It is
   used as is, without any trailing NUL characters.</t>
            <t indent="0" pn="section-3.3-2.2.6">Identity is the peer identity as specified in <xref target="RFC4187" section="7" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-7" derivedContent="RFC4187"/>
   and in <xref target="id5guse" format="default" sectionFormat="of" derivedContent="Section 5.3.2"/> of in this document for
   the 5G cases.</t>
            <t indent="0" pn="section-3.3-2.2.7">When the server creates an AKA challenge and corresponding AUTN, CK,
   CK', IK, and IK' values, it <bcp14>MUST</bcp14> set the Authentication Management
   Field (AMF) separation bit to 1 in the AKA algorithm <xref target="TS-3GPP.33.102" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.102"/>.
   Similarly, the peer <bcp14>MUST</bcp14> check that the AMF separation bit is set to
   1.  If the bit is not set to 1, the peer behaves as if the AUTN had
   been incorrect and fails the authentication.</t>
            <t indent="0" pn="section-3.3-2.2.8">On fast re-authentication, the following keys are calculated:
</t>
            <artwork name="" type="" align="left" alt="" pn="section-3.3-2.2.9">
    MK = PRF'(K_re,"EAP-AKA' re-auth"|Identity|counter|NONCE_S)
    MSK  = MK[0..511]
    EMSK = MK[512..1023]
</artwork>
            <t indent="0" pn="section-3.3-2.2.10">MSK and EMSK are the resulting 512-bit keys, taking the first 1024
bits from the result of PRF'. Note that K_encr and K_aut are not
re-derived on fast re-authentication. K_re is the re-authentication
key from the preceding full authentication and stays unchanged over
any fast re-authentication(s) that may happen based on it. The value
"EAP-AKA' re-auth" is a sixteen-characters-long ASCII string, again
represented without any trailing NUL characters.  Identity is the fast
re-authentication identity, counter is the value from the AT_COUNTER
attribute, NONCE_S is the nonce value from the AT_NONCE_S attribute,
all as specified in <xref target="RFC4187" section="7" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-7" derivedContent="RFC4187"/>. To prevent
the use of compromised keys in other places, it is forbidden to change
the network name when going from the full to the fast
re-authentication process. The peer <bcp14>SHOULD NOT</bcp14> attempt fast
re-authentication when it knows that the network name in the current
access network is different from the one in the initial, full
authentication. Upon seeing a re-authentication request with a changed
network name, the server <bcp14>SHOULD</bcp14> behave as if the re-authentication
identifier had been unrecognized, and fall back to full
authentication. The server observes the change in the name by
comparing where the fast re-authentication and full authentication EAP
transactions were received at the Authentication, Authorization,
and Accounting (AAA) protocol level.
            </t>
          </dd>
          <dt pn="section-3.3-2.3">AT_KDF has any other value</dt>
          <dd pn="section-3.3-2.4">

Future variations of key derivation functions may be defined, and they
will be represented by new values of AT_KDF. If the peer does not
recognize the value, it cannot calculate the keys and behaves as
explained in <xref target="keyderiv" format="default" sectionFormat="of" derivedContent="Section 3.2"/>.</dd>
          <dt pn="section-3.3-2.5">AT_KDF is missing</dt>
          <dd pn="section-3.3-2.6">

The peer behaves as if the AUTN had been incorrect and <bcp14>MUST</bcp14> fail the
authentication.</dd>
        </dl>
        <t indent="0" pn="section-3.3-3">If the peer supports a given key derivation function but is
unwilling to perform it for policy reasons, it refuses to calculate
the keys and behaves as explained in <xref target="keyderiv" format="default" sectionFormat="of" derivedContent="Section 3.2"/>.</t>
      </section>
      <section anchor="hashup" numbered="true" toc="include" removeInRFC="false" pn="section-3.4">
        <name slugifiedName="name-hash-functions">Hash Functions</name>
        <t indent="0" pn="section-3.4-1">EAP-AKA' uses SHA-256 / HMAC-SHA-256, not SHA-1 / HMAC-SHA-1 (see
<xref target="FIPS.180-4" format="default" sectionFormat="of" derivedContent="FIPS.180-4"/> and <xref target="RFC2104" format="default" sectionFormat="of" derivedContent="RFC2104"/>) as in
EAP-AKA. This requires a change to the pseudorandom function (PRF) as
well as the AT_MAC and AT_CHECKCODE attributes.</t>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-3.4.1">
          <name slugifiedName="name-prf">PRF'</name>
          <t indent="0" pn="section-3.4.1-1">The PRF' construction is the same one IKEv2 uses (see
          <xref target="RFC7296" section="2.13" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7296#section-2.13" derivedContent="RFC7296"/>;
          the definition of this function has not changed since <xref target="RFC4306" format="default" sectionFormat="of" derivedContent="RFC4306"/>, which was referenced by <xref target="RFC5448" format="default" sectionFormat="of" derivedContent="RFC5448"/>).
          The function takes two arguments. K is a 256-bit value
          and S is a byte string of arbitrary length. PRF' is defined
          as follows:</t>
          <artwork name="" type="" align="left" alt="" pn="section-3.4.1-2">
PRF'(K,S) = T1 | T2 | T3 | T4 | ...

   where:
   T1 = HMAC-SHA-256 (K, S | 0x01)
   T2 = HMAC-SHA-256 (K, T1 | S | 0x02)
   T3 = HMAC-SHA-256 (K, T2 | S | 0x03)
   T4 = HMAC-SHA-256 (K, T3 | S | 0x04)
   ...
</artwork>
          <t indent="0" pn="section-3.4.1-3">PRF' produces as many bits of output as is needed.  HMAC-SHA-256 is
the application of HMAC <xref target="RFC2104" format="default" sectionFormat="of" derivedContent="RFC2104"/> to SHA-256.</t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-3.4.2">
          <name slugifiedName="name-at_mac">AT_MAC</name>
          <t indent="0" pn="section-3.4.2-1">When used within EAP-AKA', the AT_MAC attribute is changed as
follows. The MAC algorithm is HMAC-SHA-256-128, a keyed hash value.
The HMAC-SHA-256-128 value is obtained from the 32-byte HMAC-SHA-256
value by truncating the output to the first 16 bytes. Hence, the
length of the MAC is 16 bytes.</t>
          <t indent="0" pn="section-3.4.2-2">Otherwise, the use of AT_MAC in EAP-AKA' follows
<xref target="RFC4187" section="10.15" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-10.15" derivedContent="RFC4187"/>.</t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-3.4.3">
          <name slugifiedName="name-at_checkcode">AT_CHECKCODE</name>
          <t indent="0" pn="section-3.4.3-1">When used within EAP-AKA', the AT_CHECKCODE attribute is changed as
follows. First, a 32-byte value is needed to accommodate a 256-bit
hash output:</t>
          <artwork name="" type="" align="left" alt="" pn="section-3.4.3-2">
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| AT_CHECKCODE  | Length        |           Reserved            |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                                                               |
|                     Checkcode (0 or 32 bytes)                 |
|                                                               |
|                                                               |
|                                                               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
</artwork>
          <t indent="0" pn="section-3.4.3-3">Second, the checkcode is a hash value, calculated with SHA-256
<xref target="FIPS.180-4" format="default" sectionFormat="of" derivedContent="FIPS.180-4"/>, over the data specified in <xref target="RFC4187" section="10.13" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-10.13" derivedContent="RFC4187"/>.</t>
        </section>
      </section>
      <section anchor="attrtable" numbered="true" toc="include" removeInRFC="false" pn="section-3.5">
        <name slugifiedName="name-summary-of-attributes-for-e">Summary of Attributes for EAP-AKA'</name>
        <t indent="0" pn="section-3.5-1"><xref target="attribute-table" format="default" sectionFormat="of" derivedContent="Table 1"/> identifies which attributes may be found
   in which kinds of messages, and in what quantity.</t>
        <t indent="0" pn="section-3.5-2">Messages are denoted with numbers as follows:
        </t>
        <dl spacing="normal" indent="3" newline="false" pn="section-3.5-3">
          <dt pn="section-3.5-3.1">1</dt>
          <dd pn="section-3.5-3.2">EAP-Request/AKA-Identity</dd>
          <dt pn="section-3.5-3.3">2</dt>
          <dd pn="section-3.5-3.4">EAP-Response/AKA-Identity</dd>
          <dt pn="section-3.5-3.5">3</dt>
          <dd pn="section-3.5-3.6">EAP-Request/AKA-Challenge</dd>
          <dt pn="section-3.5-3.7">4</dt>
          <dd pn="section-3.5-3.8">EAP-Response/AKA-Challenge</dd>
          <dt pn="section-3.5-3.9">5</dt>
          <dd pn="section-3.5-3.10">EAP-Request/AKA-Notification</dd>
          <dt pn="section-3.5-3.11">6</dt>
          <dd pn="section-3.5-3.12">EAP-Response/AKA-Notification</dd>
          <dt pn="section-3.5-3.13">7</dt>
          <dd pn="section-3.5-3.14">EAP-Response/AKA-Client-Error</dd>
          <dt pn="section-3.5-3.15">8</dt>
          <dd pn="section-3.5-3.16">EAP-Request/AKA-Reauthentication</dd>
          <dt pn="section-3.5-3.17">9</dt>
          <dd pn="section-3.5-3.18">EAP-Response/AKA-Reauthentication</dd>
          <dt pn="section-3.5-3.19">10</dt>
          <dd pn="section-3.5-3.20">EAP-Response/AKA-Authentication-Reject</dd>
          <dt pn="section-3.5-3.21">11</dt>
          <dd pn="section-3.5-3.22">EAP-Response/AKA-Synchronization-Failure</dd>
        </dl>
        <t indent="0" pn="section-3.5-4">The column denoted with "E" indicates whether the attribute is a nested attribute that <bcp14>MUST</bcp14> be included within AT_ENCR_DATA.</t>
        <t indent="0" pn="section-3.5-5">In addition, the numbered columns indicate the quantity of the attribute within the message as follows:
        </t>
        <dl spacing="normal" indent="8" newline="false" pn="section-3.5-6">
          <dt pn="section-3.5-6.1">"0"</dt>
          <dd pn="section-3.5-6.2">Indicates that the attribute <bcp14>MUST NOT</bcp14>
          be included in the message.</dd>
          <dt pn="section-3.5-6.3">"1"</dt>
          <dd pn="section-3.5-6.4">Indicates that the attribute <bcp14>MUST</bcp14> be
          included in the message.</dd>
          <dt pn="section-3.5-6.5">"0-1"</dt>
          <dd pn="section-3.5-6.6">Indicates that the attribute is sometimes included
          in the message</dd>
          <dt pn="section-3.5-6.7">"0+"</dt>
          <dd pn="section-3.5-6.8">Indicates that zero or more copies of the attribute
   <bcp14>MAY</bcp14> be included in the message.</dd>
          <dt pn="section-3.5-6.9">"1+"</dt>
          <dd pn="section-3.5-6.10">Indicates that there <bcp14>MUST</bcp14> be at least one attribute
   in the message but more than one <bcp14>MAY</bcp14> be included in the message.</dd>
          <dt pn="section-3.5-6.11">"0*"</dt>
          <dd pn="section-3.5-6.12">Indicates that the attribute is not included in the
   message in cases specified in this document, but <bcp14>MAY</bcp14> be included in
   the future versions of the protocol.</dd>
        </dl>
        <t indent="0" pn="section-3.5-7">The attribute table is shown below. The table is largely the
   same as in the EAP-AKA attribute table (<xref target="RFC4187" section="10.1" sectionFormat="comma" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-10.1" derivedContent="RFC4187"/>),
   but changes how many times AT_MAC may appear in an
   EAP-Response/AKA'-Challenge message as it does not appear there
   when AT_KDF has to be sent from the peer to the server. The table
	also adds the AT_KDF and AT_KDF_INPUT attributes.</t>
        <table anchor="attribute-table" align="center" pn="table-1">
          <name slugifiedName="name-the-attribute-table">The Attribute Table</name>
          <thead>
            <tr>
              <th align="left" colspan="1" rowspan="1">Attribute</th>
              <th align="left" colspan="1" rowspan="1">1</th>
              <th align="left" colspan="1" rowspan="1">2</th>
              <th align="left" colspan="1" rowspan="1">3</th>
              <th align="left" colspan="1" rowspan="1">4</th>
              <th align="left" colspan="1" rowspan="1">5</th>
              <th align="left" colspan="1" rowspan="1">6</th>
              <th align="left" colspan="1" rowspan="1">7</th>
              <th align="left" colspan="1" rowspan="1">8</th>
              <th align="left" colspan="1" rowspan="1">9</th>
              <th align="left" colspan="1" rowspan="1">10</th>
              <th align="left" colspan="1" rowspan="1">11</th>
              <th align="left" colspan="1" rowspan="1">E</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_PERMANENT_ID_REQ</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_ANY_ID_REQ</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_FULLAUTH_ID_REQ</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_IDENTITY</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_RAND</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_AUTN</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_RES</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_AUTS</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_NEXT_PSEUDONYM</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">Y</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_NEXT_REAUTH_ID</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">Y</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_IV</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0*</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_ENCR_DATA</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0*</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_PADDING</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0*</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">Y</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_CHECKCODE</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_RESULT_IND</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_MAC</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_COUNTER</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">Y</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_COUNTER_TOO_SMALL</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0-1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">Y</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_NONCE_S</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">Y</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_NOTIFICATION</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_CLIENT_ERROR_CODE</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_KDF</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1+</td>
              <td align="left" colspan="1" rowspan="1">0+</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1+</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_KDF_INPUT</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
          </tbody>
        </table>
      </section>
    </section>
    <section anchor="bidding" numbered="true" toc="include" removeInRFC="false" pn="section-4">
      <name slugifiedName="name-bidding-down-prevention-for">Bidding Down Prevention for EAP-AKA</name>
      <t indent="0" pn="section-4-1">As discussed in <xref target="RFC3748" format="default" sectionFormat="of" derivedContent="RFC3748"/>, negotiation of methods
within EAP is insecure. That is, a man-in-the-middle attacker may
force the endpoints to use a method that is not the strongest that they
both support. This is a problem, as we expect EAP-AKA and EAP-AKA' to
be negotiated via EAP.</t>
      <t indent="0" pn="section-4-2">In order to prevent such attacks, this RFC specifies a 
mechanism for EAP-AKA that allows the endpoints to securely discover
the capabilities of each other. This mechanism comes in the form of
the AT_BIDDING attribute. This allows both endpoints to communicate
their desire and support for EAP-AKA' when exchanging EAP-AKA
messages. This attribute is not included in EAP-AKA' messages. It is
only included in EAP-AKA messages, which are protected with
the AT_MAC attribute.  This approach is
based on the assumption that EAP-AKA' is always preferable (see
<xref target="security" format="default" sectionFormat="of" derivedContent="Section 7"/>). If during the EAP-AKA authentication
process it is discovered that both endpoints would have been able to
use EAP-AKA', the authentication process <bcp14>SHOULD</bcp14> be aborted, as a
bidding down attack may have happened.</t>
      <t indent="0" pn="section-4-3">The format of the AT_BIDDING attribute is shown below.</t>
      <artwork name="" type="" align="left" alt="" pn="section-4-4">
    0                   1                   2                   3
    0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   | AT_BIDDING    | Length        |D|          Reserved           |
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
</artwork>
      <t indent="0" pn="section-4-5">The fields are as follows:</t>
      <dl newline="true" spacing="normal" indent="3" pn="section-4-6">
        <dt pn="section-4-6.1">AT_BIDDING</dt>
        <dd pn="section-4-6.2">This is set to 136.</dd>
        <dt pn="section-4-6.3">Length</dt>
        <dd pn="section-4-6.4">The length of the
attribute, calculated as defined in <xref target="RFC4187" format="default" section="8.1" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-8.1" derivedContent="RFC4187"/>.  For AT_BIDDING, the Length <bcp14>MUST</bcp14> be set to 1.</dd>
        <dt pn="section-4-6.5">D</dt>
        <dd pn="section-4-6.6">This bit is set to 1 if the
sender supports EAP-AKA', is willing to use it, and prefers it
over EAP-AKA. Otherwise, it should be set to zero.</dd>
        <dt pn="section-4-6.7">Reserved</dt>
        <dd pn="section-4-6.8">This field <bcp14>MUST</bcp14> be set
to zero when sent and ignored on receipt.</dd>
      </dl>
      <t indent="0" pn="section-4-7">The server sends this attribute in the EAP-Request/AKA-Challenge
message. If the peer supports EAP-AKA', it compares the received value
to its own capabilities. If it turns out that both the server and peer
would have been able to use EAP-AKA' and preferred it over EAP-AKA,
the peer behaves as if AUTN had been incorrect and fails the
authentication (see Figure 3 of <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/>). A peer not
supporting EAP-AKA' will simply ignore this attribute.  In all cases,
the attribute is protected by the integrity mechanisms of EAP-AKA, so
it cannot be removed by a man-in-the-middle attacker.</t>
      <t indent="0" pn="section-4-8">Note that we assume (<xref target="security" format="default" sectionFormat="of" derivedContent="Section 7"/>) that EAP-AKA' is
always stronger than EAP-AKA. As a result, this specification does not provide protection against bidding "down" attacks in the other direction, i.e., attackers forcing
the endpoints to use EAP-AKA'.</t>
      <section anchor="attrtable2" numbered="true" toc="include" removeInRFC="false" pn="section-4.1">
        <name slugifiedName="name-summary-of-attributes-for-ea">Summary of Attributes for EAP-AKA</name>
        <t indent="0" pn="section-4.1-1">The appearance of the AT_BIDDING attribute in EAP-AKA exchanges
  is shown below, using the notation from <xref target="attrtable" format="default" sectionFormat="of" derivedContent="Section 3.5"/>:</t>
        <table anchor="att-table" align="center" pn="table-2">
          <name slugifiedName="name-at_bidding-attribute-appear">AT_BIDDING Attribute Appearance</name>
          <thead>
            <tr>
              <th align="left" colspan="1" rowspan="1">Attribute</th>
              <th align="left" colspan="1" rowspan="1">1</th>
              <th align="left" colspan="1" rowspan="1">2</th>
              <th align="left" colspan="1" rowspan="1">3</th>
              <th align="left" colspan="1" rowspan="1">4</th>
              <th align="left" colspan="1" rowspan="1">5</th>
              <th align="left" colspan="1" rowspan="1">6</th>
              <th align="left" colspan="1" rowspan="1">7</th>
              <th align="left" colspan="1" rowspan="1">8</th>
              <th align="left" colspan="1" rowspan="1">9</th>
              <th align="left" colspan="1" rowspan="1">10</th>
              <th align="left" colspan="1" rowspan="1">11</th>
              <th align="left" colspan="1" rowspan="1">E</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left" colspan="1" rowspan="1">AT_BIDDING</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">N</td>
            </tr>
          </tbody>
        </table>
      </section>
    </section>
    <section anchor="identities" numbered="true" toc="include" removeInRFC="false" pn="section-5">
      <name slugifiedName="name-peer-identities">Peer Identities</name>
      <t indent="0" pn="section-5-1">EAP-AKA' peer identities are as specified in <xref target="RFC4187" format="default" section="4.1" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-4.1" derivedContent="RFC4187"/>, with the addition of some
      requirements specified in this section.</t>
      <t indent="0" pn="section-5-2">EAP-AKA' includes optional identity privacy support
  that can be used to hide the cleartext permanent identity and
  thereby make the subscriber's EAP exchanges untraceable to
  eavesdroppers. EAP-AKA' can also use the privacy-friendly identifiers
  specified for 5G networks.</t>
      <t indent="0" pn="section-5-3">The permanent identity is usually based on the IMSI. Exposing the
  IMSI is undesirable because, as a permanent identity, it is easily
  trackable. In addition, since IMSIs may be used in other contexts as
  well, there would be additional opportunities for such tracking.</t>
      <t indent="0" pn="section-5-4">In EAP-AKA', identity privacy is based on temporary
  usernames or pseudonym usernames. These are similar to, but
  separate from, the Temporary Mobile Subscriber Identities (TMSI) that
  are used on cellular networks.</t>
      <section anchor="untypes" numbered="true" toc="include" removeInRFC="false" pn="section-5.1">
        <name slugifiedName="name-username-types-in-eap-aka-i">Username Types in EAP-AKA' Identities</name>
        <t indent="0" pn="section-5.1-1"> <xref target="RFC4187" section="4.1.1.3" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-4.1.1.3" derivedContent="RFC4187"/> specifies that there
    are three types of usernames: permanent, pseudonym, and fast
    re-authentication usernames.  This specification extends this
    definition as follows. There are four types of usernames:
    
        </t>
        <ol type="(%d)" spacing="normal" indent="adaptive" start="1" pn="section-5.1-2">
          <li pn="section-5.1-2.1" derivedCounter="(1)">
            <t indent="0" pn="section-5.1-2.1.1">Regular usernames. These are external names given to
      EAP-AKA' peers.  The regular usernames are further subdivided into to
      categories:
            </t>
            <ol type="(%c)" spacing="normal" indent="adaptive" start="1" pn="section-5.1-2.1.2">
              <li pn="section-5.1-2.1.2.1" derivedCounter="(a)">Permanent usernames, for instance, IMSI-based
	usernames.</li>
              <li pn="section-5.1-2.1.2.2" derivedCounter="(b)">Privacy-friendly temporary usernames, for instance, 5G
              GUTI (5G Globally Unique Temporary Identifier) or 5G privacy identifiers  (see <xref target="id5guse" format="default" sectionFormat="of" derivedContent="Section 5.3.2"/>) such as SUCI 
	               (Subscription Concealed Identifier).</li>
            </ol>
          </li>
          <li pn="section-5.1-2.2" derivedCounter="(2)"> EAP-AKA' pseudonym usernames.  For example,
      2s7ah6n9q@example.com might be a valid pseudonym identity.  In
      this example, 2s7ah6n9q is the pseudonym username.</li>
          <li pn="section-5.1-2.3" derivedCounter="(3)">EAP-AKA' fast re-authentication usernames.  For example,
      43953754@example.com might be a valid fast re-authentication
      identity and 43953754 the fast re-authentication
      username.</li>
        </ol>
        <t indent="0" pn="section-5.1-3">The permanent, privacy-friendly temporary, and pseudonym
    usernames are only used with full authentication, and fast
    re-authentication usernames only with fast re-authentication.
    Unlike permanent usernames and pseudonym usernames, privacy-friendly 
    temporary usernames and fast re-authentication usernames
    are one-time identifiers, which are not reused across EAP
    exchanges.</t>
      </section>
      <section anchor="genpfr" numbered="true" toc="include" removeInRFC="false" pn="section-5.2">
        <name slugifiedName="name-generating-pseudonyms-and-f">Generating Pseudonyms and Fast Re-Authentication Identities</name>
        <t indent="0" pn="section-5.2-1">This section provides some additional guidance to 
    implementations for producing secure pseudonyms and fast
    re-authentication identities. It does not impact backwards
    compatibility because each server consumes only the identities that it
    generates itself. However, adherence to the guidance will provide
    better security.
        </t>
        <t indent="0" pn="section-5.2-2">As specified by <xref target="RFC4187" format="default" section="4.1.1.7" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-4.1.1.7" derivedContent="RFC4187"/>,
    pseudonym usernames and fast re-authentication identities are
    generated by the EAP server in an implementation-dependent
    manner. RFC 4187 provides some general requirements on how these
    identities are transported, how they map to the NAI syntax, how
    they are distinguished from each other, and so on.
        </t>
        <t indent="0" pn="section-5.2-3">However, to enhance privacy, some additional requirements need to
    be applied.</t>
        <t indent="0" pn="section-5.2-4">The pseudonym usernames and fast re-authentication identities
    <bcp14>MUST</bcp14> be generated in a cryptographically secure way so that
    it is computationally infeasible for an attacker to differentiate
    two identities belonging to the same user from two identities
    belonging to different users. This can be achieved, for instance,
    by using random or pseudorandom identifiers such as random byte
    strings or ciphertexts. See also <xref target="RFC4086" format="default" sectionFormat="of" derivedContent="RFC4086"/> for guidance
    on random number generation.</t>
        <t indent="0" pn="section-5.2-5">Note that the pseudonym and fast re-authentication usernames
    also <bcp14>MUST NOT</bcp14> include substrings that can be used to relate the
    username to a particular entity or a particular permanent
    identity. For instance, the usernames cannot include any
    subscriber-identifying part of an IMSI or other permanent
    identifier. Similarly, no part of the username can be formed by a
    fixed mapping that stays the same across multiple different
    pseudonyms or fast re-authentication identities for the same
    subscriber.</t>
        <t indent="0" pn="section-5.2-6">When the identifier used to identify a subscriber in an
    EAP-AKA' authentication exchange is a privacy-friendly identifier
    that is used only once, the EAP-AKA' peer <bcp14>MUST NOT</bcp14> use a pseudonym
    provided in that authentication exchange in subsequent exchanges
    more than once. To ensure that this does not happen, the EAP-AKA'
    server <bcp14>MAY</bcp14> decline to provide a pseudonym in such authentication
    exchanges. An important case where such privacy-friendly
    identifiers are used is in 5G networks (see <xref target="identifiersin5g" format="default" sectionFormat="of" derivedContent="Section 5.3"/>).</t>
      </section>
      <section anchor="identifiersin5g" numbered="true" toc="include" removeInRFC="false" pn="section-5.3">
        <name slugifiedName="name-identifier-usage-in-5g">Identifier Usage in 5G</name>
        <t indent="0" pn="section-5.3-1">In EAP-AKA', the peer identity may be communicated to the server
  in one of three ways:
  
        </t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-5.3-2">
          <li pn="section-5.3-2.1">As a part of link-layer establishment procedures, externally to
    EAP.</li>
          <li pn="section-5.3-2.2">With the EAP-Response/Identity message in the beginning of the
    EAP exchange, but before the selection of EAP-AKA'.</li>
          <li pn="section-5.3-2.3">Transmitted from the peer to the server using EAP-AKA' messages
    instead of EAP-Response/Identity.  In this case, the server
    includes an identity-requesting attribute (AT_ANY_ID_REQ,
    AT_FULLAUTH_ID_REQ, or AT_PERMANENT_ID_REQ) in the
    EAP-Request/AKA-Identity message, and the peer includes the
    AT_IDENTITY attribute, which contains the peer's identity, in the
    EAP-Response/AKA-Identity message.</li>
        </ul>
        <t indent="0" pn="section-5.3-3">The identity carried above may be a permanent identity, privacy-friendly 
    identity, pseudonym identity, or fast re-authentication
  identity as defined in <xref target="untypes" format="default" sectionFormat="of" derivedContent="Section 5.1"/>.</t>
        <t indent="0" pn="section-5.3-4">5G supports the concept of privacy identifiers, and it is
  important for interoperability that the right type of identifier is
  used.</t>
        <t indent="0" pn="section-5.3-5">5G defines the SUbscription Permanent Identifier (SUPI) and
  SUbscription Concealed Identifier (SUCI) <xref target="TS-3GPP.23.501" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.501"/> <xref target="TS-3GPP.33.501" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.501"/> <xref target="TS-3GPP.23.003" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.003"/>. SUPI is globally unique and allocated to
  each subscriber. However, it is only used internally in the 5G
  network and is privacy sensitive. The SUCI is a privacy-preserving
  identifier containing the concealed SUPI, using public key
  cryptography to encrypt the SUPI.</t>
        <t indent="0" pn="section-5.3-6">Given the choice between these two types of identifiers,
  EAP-AKA' ensures interoperability as follows:

        </t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-5.3-7">
          <li pn="section-5.3-7.1">Where identifiers are used within EAP-AKA' (such as key
    derivation) determine the exact values of the identity to be used,
    to avoid ambiguity (see <xref target="kd5g" format="default" sectionFormat="of" derivedContent="Section 5.3.1"/>).</li>
          <li pn="section-5.3-7.2">Where identifiers are carried within EAP-AKA' packets
    (such as in the AT_IDENTITY attribute) determine which identifiers
    should be filled in (see <xref target="id5guse" format="default" sectionFormat="of" derivedContent="Section 5.3.2"/>).</li>
        </ul>
        <t indent="0" pn="section-5.3-8">In 5G, the normal mode of operation is that identifiers are only
  transmitted outside EAP. However, in a system involving terminals
  from many generations and several connectivity options via 5G and
  other mechanisms, implementations and the EAP-AKA' specification
  need to prepare for many different situations, including sometimes
  having to communicate identities within EAP.</t>
        <t indent="0" pn="section-5.3-9">The following sections clarify which identifiers are used and
  how.</t>
        <section anchor="kd5g" numbered="true" toc="include" removeInRFC="false" pn="section-5.3.1">
          <name slugifiedName="name-key-derivation-2">Key Derivation</name>
          <t indent="0" pn="section-5.3.1-1">In EAP-AKA', the peer identity is used in the key derivation formula found in <xref target="key" format="default" sectionFormat="of" derivedContent="Section 3.3"/>.</t>
          <t indent="0" pn="section-5.3.1-2">The identity needs  to be represented in exactly the correct format
    for the key derivation formula to produce correct results.</t>
          <t indent="0" pn="section-5.3.1-3">If the AT_KDF_INPUT parameter contains the prefix "5G:", the
    AT_KDF parameter has the value 1, and this authentication is not a
    fast re-authentication, then the peer identity used in the key
    derivation <bcp14>MUST</bcp14> be as specified in Annex F.3 of <xref target="TS-3GPP.33.501" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.501"/> and Clause 2.2 of <xref target="TS-3GPP.23.003" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.003"/>. This is in contrast to <xref target="RFC5448" format="default" sectionFormat="of" derivedContent="RFC5448"/>, which uses the identity as communicated in
    EAP and represented as a NAI. Also, in contrast to <xref target="RFC5448" format="default" sectionFormat="of" derivedContent="RFC5448"/>, in 5G EAP-AKA' does not use the "0" nor the "6"
    prefix in front of the identifier.</t>
          <t indent="0" pn="section-5.3.1-4">For an example of the format of the identity, see Clause 2.2 of <xref target="TS-3GPP.23.003" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.003"/>.</t>
          <t indent="0" pn="section-5.3.1-5">In all other cases, the following applies:

          </t>
          <t indent="6" pn="section-5.3.1-6">The identity used in the key derivation formula <bcp14>MUST</bcp14> be
      exactly the one sent in the EAP-AKA' AT_IDENTITY attribute, if one
      was sent, regardless of the kind of identity that it may have
      been. If no AT_IDENTITY was sent, the identity <bcp14>MUST</bcp14> be
      exactly the one sent in the generic EAP Identity exchange, if
      one was made.</t>
          <t indent="6" pn="section-5.3.1-7">If no identity was communicated inside EAP, then the identity
      is the one communicated outside EAP in link-layer messaging.</t>
          <t indent="6" pn="section-5.3.1-8">In this case, the used identity <bcp14>MUST</bcp14> be the identity most
      recently communicated by the peer to the network, again regardless
      of what type of identity it may have been.</t>
        </section>
        <section anchor="id5guse" numbered="true" toc="include" removeInRFC="false" pn="section-5.3.2">
          <name slugifiedName="name-eap-identity-response-and-e">EAP Identity Response and EAP-AKA' AT_IDENTITY Attribute</name>
          <t indent="0" pn="section-5.3.2-1">The EAP authentication option is only available in 5G when the
    new 5G core network is also in use. However, in other networks, an
    EAP-AKA' peer may be connecting to other types of networks and
    existing equipment.</t>
          <t indent="0" pn="section-5.3.2-2">When the EAP server is in a 5G network, the 5G procedures for
    EAP-AKA' apply. <xref target="TS-3GPP.33.501" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.501"/> specifies when the EAP server is in a 5G network.
          </t>
          <t indent="6" pn="section-5.3.2-3">Note: Currently, the following conditions are specified: when the
    EAP peer uses the 5G Non-Access Stratum (NAS) protocol <xref target="TS-3GPP.24.501" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.501"/> or when the EAP peer attaches to a network
    that advertises 5G connectivity without NAS <xref target="TS-3GPP.23.501" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.501"/>. Possible future conditions
    may also be specified by 3GPP.</t>
          <t indent="0" pn="section-5.3.2-4">When the 5G procedures for EAP-AKA' apply, EAP identity
    exchanges are generally not used as the identity is already made
    available on previous link-layer exchanges.</t>
          <t indent="0" pn="section-5.3.2-5">In this situation, the EAP Identity Response and EAP-AKA'
    AT_IDENTITY attribute are handled as specified in Annex F.2 of
    <xref target="TS-3GPP.33.501" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.501"/>.</t>
          <t indent="0" pn="section-5.3.2-6">When used in EAP-AKA', the format of the SUCI <bcp14>MUST</bcp14> be as
    specified in <xref target="TS-3GPP.23.003" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.003"/>, Section 28.7.3, with the semantics defined in
    <xref target="TS-3GPP.23.003" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.003"/>, Section 2.2B. Also, in contrast to <xref target="RFC5448" format="default" sectionFormat="of" derivedContent="RFC5448"/>, in 5G EAP-AKA' does not use the "0" nor the "6"
    prefix in front of the identifier.</t>
          <t indent="0" pn="section-5.3.2-7">For an example of an IMSI in NAI format, see <xref target="TS-3GPP.23.003" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.003"/>, Section 28.7.3.</t>
          <t indent="0" pn="section-5.3.2-8">Otherwise, the peer <bcp14>SHOULD</bcp14> employ an IMSI, SUPI, or NAI <xref target="RFC7542" format="default" sectionFormat="of" derivedContent="RFC7542"/> as it is
    configured to use.</t>
        </section>
      </section>
    </section>
    <section anchor="exported-parameters" numbered="true" toc="include" removeInRFC="false" pn="section-6">
      <name slugifiedName="name-exported-parameters">Exported Parameters</name>
      <t indent="0" pn="section-6-1">When not using fast re-authentication, the EAP-AKA' Session-Id is the concatenation of the EAP-AKA' Type value 
  (0x32, one byte) with the contents of the RAND field from the AT_RAND attribute
  followed by the contents of the AUTN field in the AT_AUTN attribute:
  
      </t>
      <artwork name="" type="" align="left" alt="" pn="section-6-2">
      Session-Id = 0x32 || RAND || AUTN
</artwork>
      <t indent="0" pn="section-6-3">When using fast re-authentication, the EAP-AKA' Session-Id is the
  concatenation of the EAP-AKA' Type value (0x32) with the contents of the
  NONCE_S field from the AT_NONCE_S attribute followed by the
  contents of the MAC field from the AT_MAC attribute from the
  EAP-Request/AKA-Reauthentication:
  
      </t>
      <artwork name="" type="" align="left" alt="" pn="section-6-4">
      Session-Id = 0x32 || NONCE_S || MAC
</artwork>
      <t indent="0" pn="section-6-5">The Peer-Id is the contents of the Identity field from the
  AT_IDENTITY attribute, using only the Actual Identity Length bytes
  from the beginning.  Note that the contents are used as they are
  transmitted, regardless of whether the transmitted identity was a
  permanent, pseudonym, or fast EAP re-authentication identity. If no
  AT_IDENTITY attribute was exchanged, the exported Peer-Id is the
  identity provided from the EAP Identity Response packet. If no EAP
  Identity Response was provided either, the exported Peer-Id is the null
  string (zero length).</t>
      <t indent="0" pn="section-6-6">The Server-Id is the null string (zero length).</t>
    </section>
    <section anchor="security" numbered="true" toc="include" removeInRFC="false" pn="section-7">
      <name slugifiedName="name-security-considerations">Security Considerations</name>
      <t indent="0" pn="section-7-1">A summary of the security properties of EAP-AKA' follows. These
properties are very similar to those in EAP-AKA. We assume that
HMAC SHA-256 is at least as secure as HMAC SHA-1 (see also <xref target="RFC6194" format="default" sectionFormat="of" derivedContent="RFC6194"/>). This is called the SHA-256
assumption in the remainder of this section.  Under this assumption,
EAP-AKA' is at least as secure as EAP-AKA.</t>
      <t indent="0" pn="section-7-2">If the AT_KDF attribute has value 1, then the security properties
of EAP-AKA' are as follows:

</t>
      <dl newline="true" spacing="normal" indent="3" pn="section-7-3">
        <dt pn="section-7-3.1">Protected ciphersuite negotiation</dt>
        <dd pn="section-7-3.2">
          <t indent="0" pn="section-7-3.2.1"> EAP-AKA' has no ciphersuite
negotiation mechanisms. It does have a negotiation mechanism for
selecting the key derivation functions.  This mechanism is secure
against bidding down attacks from EAP-AKA' to EAP-AKA. The negotiation mechanism allows
changing the offered key derivation function, but the change is
visible in the final EAP-Request/AKA'-Challenge message that the
server sends to the peer. This message is authenticated via the AT_MAC
attribute, and carries both the chosen alternative and the initially
offered list. The peer refuses to accept a change it did not initiate.
As a result, both parties are aware that a change is being made and
what the original offer was. </t>
          <t indent="0" pn="section-7-3.2.2">

Per assumptions in <xref target="bidding" format="default" sectionFormat="of" derivedContent="Section 4"/>, there is no protection
against bidding down attacks from EAP-AKA to EAP-AKA' should EAP-AKA'
somehow be considered less secure some day than EAP-AKA. Such
protection was not provided in RFC 5448 implementations and
consequently neither does this specification provide it. If such
support is needed, it would have to be added as a separate new
feature. </t>
          <t indent="0" pn="section-7-3.2.3">
In general, it is expected that the current negotiation
capabilities in EAP-AKA' are sufficient for some types of
extensions, including adding Perfect Forward Secrecy
<xref target="I-D.ietf-emu-aka-pfs" format="default" sectionFormat="of" derivedContent="EMU-AKA-PFS"/> and perhaps others.  However, some larger changes may require a new EAP method type, which is how EAP-AKA' itself happened.  One example of such change would be the introduction of new algorithms. </t>
        </dd>
        <dt pn="section-7-3.3">Mutual authentication</dt>
        <dd pn="section-7-3.4"> Under the
SHA-256 assumption, the properties of EAP-AKA' are at least as good as
those of EAP-AKA in this respect. Refer to <xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further details.</dd>
        <dt pn="section-7-3.5">Integrity protection</dt>
        <dd pn="section-7-3.6"> Under the
SHA-256 assumption, the properties of EAP-AKA' are at least as good
(most likely better) as those of EAP-AKA in this respect.  Refer to
<xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further details. The only
difference is that a stronger hash algorithm and keyed MAC, SHA-256 /
HMAC-SHA-256, is used instead of SHA-1 / HMAC-SHA-1.</dd>
        <dt pn="section-7-3.7">Replay protection</dt>
        <dd pn="section-7-3.8"> Under the
SHA-256 assumption, the properties of EAP-AKA' are at least as good as
those of EAP-AKA in this respect. Refer to <xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further details.</dd>
        <dt anchor="confidentiality" pn="section-7-3.9">Confidentiality</dt>
        <dd pn="section-7-3.10"> The properties
of EAP-AKA' are exactly the same as those of EAP-AKA in this
respect. Refer to <xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further
details.</dd>
        <dt pn="section-7-3.11">Key derivation</dt>
        <dd pn="section-7-3.12">
          <t indent="0" pn="section-7-3.12.1"> EAP-AKA' supports key derivation with an effective key strength
          against brute-force attacks equal to the minimum of the length of
          the derived keys and the length of the AKA base key, i.e., 128 bits
          or more.  The key hierarchy is specified in <xref target="key" format="default" sectionFormat="of" derivedContent="Section 3.3"/>.</t>
          <t indent="0" pn="section-7-3.12.2"> The Transient EAP Keys
used to protect EAP-AKA packets (K_encr, K_aut, K_re), the MSK, and
the EMSK are cryptographically separate. If we make the assumption
that SHA-256 behaves as a pseudorandom function, an attacker is
incapable of deriving any non-trivial information about any of these
keys based on the other keys.  An attacker also cannot calculate the
pre-shared secret from IK, CK, IK', CK', K_encr, K_aut, K_re, MSK, or
EMSK by any practically feasible means.</t>
          <t indent="0" pn="section-7-3.12.3">

EAP-AKA' adds an additional layer of key derivation functions within
itself to protect against the use of compromised keys. This is
discussed further in
<xref target="bindprop" format="default" sectionFormat="of" derivedContent="Section 7.4"/>.</t>
          <t indent="0" pn="section-7-3.12.4">

	    EAP-AKA' uses a pseudorandom function modeled after the one used in
IKEv2 <xref target="RFC7296" format="default" sectionFormat="of" derivedContent="RFC7296"/> together with SHA-256.</t>
        </dd>
        <dt pn="section-7-3.13">Key strength</dt>
        <dd pn="section-7-3.14"> See above.</dd>
        <dt pn="section-7-3.15">Dictionary attack resistance</dt>
        <dd pn="section-7-3.16">
Under the SHA-256 assumption, the properties of EAP-AKA' are at least
as good as those of EAP-AKA in this respect. Refer to
<xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further details.</dd>
        <dt pn="section-7-3.17">Fast reconnect</dt>
        <dd pn="section-7-3.18"> Under the SHA-256
assumption, the properties of EAP-AKA' are at least as good as those
of EAP-AKA in this respect. Refer to <xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further details. Note that implementations <bcp14>MUST</bcp14> prevent
performing a fast reconnect across method types.</dd>
        <dt pn="section-7-3.19">Cryptographic binding</dt>
        <dd pn="section-7-3.20"> Note that
this term refers to a very specific form of binding, something that is
performed between two layers of authentication. It is not the same as
the binding to a particular network name. The properties of EAP-AKA'
are exactly the same as those of EAP-AKA in this respect, i.e., as it is not a
tunnel method, this property is not applicable to it. Refer to
<xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further details.</dd>
        <dt pn="section-7-3.21">Session independence</dt>
        <dd pn="section-7-3.22"> The
properties of EAP-AKA' are exactly the same as those of EAP-AKA in
this respect. Refer to <xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further
details.</dd>
        <dt pn="section-7-3.23">Fragmentation</dt>
        <dd pn="section-7-3.24"> The properties of
EAP-AKA' are exactly the same as those of EAP-AKA in this
respect. Refer to <xref target="RFC4187" format="default" section="12" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-12" derivedContent="RFC4187"/>, for further
details.</dd>
        <dt pn="section-7-3.25">Channel binding</dt>
        <dd pn="section-7-3.26">
          <t indent="0" pn="section-7-3.26.1"> EAP-AKA', like
EAP-AKA, does not provide channel bindings as they're defined in
<xref target="RFC3748" format="default" sectionFormat="of" derivedContent="RFC3748"/> and <xref target="RFC5247" format="default" sectionFormat="of" derivedContent="RFC5247"/>. New skippable
attributes can be used to add channel binding support in the future,
if required.  </t>
          <t indent="0" pn="section-7-3.26.2">

However, including the Network Name field in the AKA' algorithms
(which are also used for other purposes than EAP-AKA') provides a form
of cryptographic separation between different network names, which
resembles channel bindings. However, the network name does not
typically identify the EAP (pass-through) authenticator. See <xref target="bindprop" format="default" sectionFormat="of" derivedContent="Section 7.4"/> for more discussion.</t>
        </dd>
      </dl>
      <section anchor="priv" numbered="true" toc="include" removeInRFC="false" pn="section-7.1">
        <name slugifiedName="name-privacy">Privacy</name>
        <t indent="0" pn="section-7.1-1"><xref target="RFC6973" format="default" sectionFormat="of" derivedContent="RFC6973"/> suggests that the privacy considerations
  of IETF protocols be documented.</t>
        <t indent="0" pn="section-7.1-2">The confidentiality properties of EAP-AKA' itself have been
  discussed above under <xref target="confidentiality" format="default" sectionFormat="of" derivedContent="Section 7">"Confidentiality"</xref>.</t>
        <t indent="0" pn="section-7.1-3">EAP-AKA' uses several different types of identifiers to identify
  the authenticating peer. It is strongly <bcp14>RECOMMENDED</bcp14> to use the
  privacy-friendly temporary or hidden identifiers, i.e., the 5G GUTI or SUCI,
  pseudonym usernames, and fast re-authentication usernames. The use
  of permanent identifiers such as the IMSI or SUPI may lead to an ability to
  track the peer and/or user associated with the peer. The use of
  permanent identifiers such as the IMSI or SUPI is strongly <bcp14>NOT RECOMMENDED</bcp14>.</t>
        <t indent="0" pn="section-7.1-4">As discussed in <xref target="identifiersin5g" format="default" sectionFormat="of" derivedContent="Section 5.3"/>, when
  authenticating to a 5G network, only the SUCI identifier is normally
  used. The use of EAP-AKA' pseudonyms in this situation is at best
  limited because the SUCI already provides a stronger mechanism.
  In fact, reusing the same pseudonym multiple times
  will result in a tracking opportunity for observers that see the
  pseudonym pass by. To avoid this, the peer and server need to follow
  the guidelines given in <xref target="genpfr" format="default" sectionFormat="of" derivedContent="Section 5.2"/>.</t>
        <t indent="0" pn="section-7.1-5">When authenticating to a 5G network, per <xref target="kd5g" format="default" sectionFormat="of" derivedContent="Section 5.3.1"/>,
  both the EAP-AKA' peer and server need to employ the permanent
  identifier SUPI as an input to key derivation. However, this use
  of the SUPI is only internal. As such, the SUPI need not be
  communicated in EAP messages. Therefore, SUPI <bcp14>MUST NOT</bcp14> be
  communicated in EAP-AKA' when authenticating to a 5G network.</t>
        <t indent="0" pn="section-7.1-6">While the use of SUCI in 5G networks generally provides identity
  privacy, this is not true if the null-scheme encryption is used to
  construct the SUCI (see <xref target="TS-3GPP.33.501" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.501"/>, Annex C). The use
  of this scheme makes the use of SUCI equivalent to the use of SUPI
  or IMSI. The use of the null scheme is <bcp14>NOT RECOMMENDED</bcp14> where
  identity privacy is important.</t>
        <t indent="0" pn="section-7.1-7">The use of fast re-authentication identities when authenticating
  to a 5G network does not have the same problems as the use of
  pseudonyms, as long as the 5G authentication server generates the
  fast re-authentication identifiers in a proper manner specified in
  <xref target="genpfr" format="default" sectionFormat="of" derivedContent="Section 5.2"/>.</t>
        <t indent="0" pn="section-7.1-8">Outside 5G, the peer can freely choose between the use of permanent, pseudonym, or fast
  re-authentication identifiers:
  
        </t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-7.1-9">
          <li pn="section-7.1-9.1">
            <t indent="0" pn="section-7.1-9.1.1">A peer that has not yet performed any EAP-AKA' exchanges does
    not typically have a pseudonym available. If the peer does not
    have a pseudonym available, then the privacy mechanism cannot be
    used, and the permanent identity will have to be sent in the
    clear.
            </t>
            <t indent="0" pn="section-7.1-9.1.2">

    The terminal <bcp14>SHOULD</bcp14> store the pseudonym in nonvolatile
    memory so that it can be maintained across reboots.  An active
    attacker that impersonates the network may use the
    AT_PERMANENT_ID_REQ attribute (<xref target="RFC4187" format="default" section="4.1.2" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-4.1.2" derivedContent="RFC4187"/>) to learn the subscriber's IMSI. However, as discussed in
    <xref target="RFC4187" format="default" section="4.1.2" sectionFormat="comma" derivedLink="https://rfc-editor.org/rfc/rfc4187#section-4.1.2" derivedContent="RFC4187"/>, the terminal can refuse to
    send the cleartext permanent identity if it believes that the
    network should be able to recognize the pseudonym.</t>
          </li>
          <li pn="section-7.1-9.2">
            <t indent="0" pn="section-7.1-9.2.1">When pseudonyms and fast re-authentication identities are used,
    the peer relies on the properly created identifiers by the server.
            </t>
            <t indent="0" pn="section-7.1-9.2.2">

    It is essential that an attacker cannot link a
    privacy-friendly identifier to the user in any way or determine that
    two identifiers belong to the same user as outlined in <xref target="genpfr" format="default" sectionFormat="of" derivedContent="Section 5.2"/>. The pseudonym usernames and fast
    re-authentication identities <bcp14>MUST NOT</bcp14> be used for other
    purposes (e.g., in other protocols).</t>
          </li>
        </ul>
        <t indent="0" pn="section-7.1-10">If the peer and server cannot guarantee that
  SUCI can be used or that pseudonyms will be available,
  generated properly, and maintained reliably, and identity privacy
  is required, then additional protection from an external security
  mechanism such as tunneled EAP methods like Tunneled Transport Layer Security (TTLS) <xref target="RFC5281" format="default" sectionFormat="of" derivedContent="RFC5281"/> or Tunnel Extensible Authentication Protocol (TEAP) <xref target="RFC7170" format="default" sectionFormat="of" derivedContent="RFC7170"/> 
  may be used.  The benefits and the security considerations of using an external security
  mechanism with EAP-AKA are beyond the scope of this document.</t>
        <t indent="0" pn="section-7.1-11">Finally, as with other EAP methods, even when privacy-friendly
  identifiers or EAP tunneling is used, typically the domain part of
  an identifier (e.g., the home operator) is visible to external
  parties.</t>
      </section>
      <section anchor="vuln" numbered="true" toc="include" removeInRFC="false" pn="section-7.2">
        <name slugifiedName="name-discovered-vulnerabilities">Discovered Vulnerabilities</name>
        <t indent="0" pn="section-7.2-1">There have been no published attacks that violate the primary
  secrecy or authentication properties defined for Authentication and
  Key Agreement (AKA) under the originally assumed trust model. The
  same is true of EAP-AKA'.</t>
        <t indent="0" pn="section-7.2-2">However, there have been attacks when a different trust model is
  in use, with characteristics not originally provided by the design,
  or when participants in the protocol leak information to outsiders
  on purpose, and there have been some privacy-related attacks.</t>
        <t indent="0" pn="section-7.2-3">For instance, the original AKA protocol does not prevent an insider
  supplying keys to a third party, e.g., as described by
  <contact fullname="Mjølsnes"/> and Tsay in <xref target="MT2012" format="default" sectionFormat="of" derivedContent="MT2012"/> where a serving network
  lets an authentication run succeed, but then it misuses the session
  keys to send traffic on the authenticated user's behalf. This
  particular attack is not different from any on-path entity (such as
  a router) pretending to send traffic, but the general issue of
  insider attacks can be a problem, particularly in a large group of
  collaborating operators.</t>
        <t indent="0" pn="section-7.2-4">Another class of attacks is the use of tunneling of traffic from
  one place to another, e.g., as done by Zhang and Fang in <xref target="ZF2005" format="default" sectionFormat="of" derivedContent="ZF2005"/> to leverage security policy differences between
  different operator networks, for instance. To gain something in such
  an attack, the attacker needs to trick the user into believing it is
  in another location. If policies between locations differ,
  for instance, if payload traffic is not required to be encrypted in some location,
  the attacker may trick the user into
  opening a vulnerability. As an authentication
  mechanism, EAP-AKA' is not directly affected by most of these 
  attacks. EAP-AKA' network name binding can also help alleviate some
  of the attacks.  In any case, it is recommended that EAP-AKA'
  configuration not be dependent on the location of request origin,
  unless the location information can be cryptographically
  confirmed, e.g., with the network name binding.</t>
        <t indent="0" pn="section-7.2-5">Zhang and Fang also looked at denial-of-service attacks <xref target="ZF2005" format="default" sectionFormat="of" derivedContent="ZF2005"/>. A serving network may request large numbers of
  authentication runs for a particular subscriber from a home
  network. While the resynchronization process can help recover from this,
  eventually it is possible to exhaust the sequence number space and
  render the subscriber's card unusable. This attack is possible for
  both original AKA and EAP-AKA'. However, it requires the collaboration
  of a serving network in an attack. It is recommended that EAP-AKA'
  implementations provide the means to track, detect, and limit excessive
  authentication attempts to combat this problem.</t>
        <t indent="0" pn="section-7.2-6">There have also been attacks related to the use of AKA without the
  generated session keys (e.g., <xref target="BT2013" format="default" sectionFormat="of" derivedContent="BT2013"/>). Some of
  those attacks relate to the use of 
  HTTP Digest AKAv1 <xref target="RFC3310" format="default" sectionFormat="of" derivedContent="RFC3310"/>, which was originally vulnerable to man-in-the-middle attacks. This has
  since been corrected in <xref target="RFC4169" format="default" sectionFormat="of" derivedContent="RFC4169"/>. The EAP-AKA'
  protocol uses session keys and provides channel binding, and as
  such, it is resistant to the above attacks except where the protocol
  participants leak information to outsiders.</t>
        <t indent="0" pn="section-7.2-7">Basin, et al. <xref target="Basin2018" format="default" sectionFormat="of" derivedContent="Basin2018"/> have performed formal
  analysis and concluded that the AKA protocol would have benefited
  from additional security requirements such as key confirmation.</t>
        <t indent="0" pn="section-7.2-8">In the context of pervasive monitoring revelations, there were
  also reports of compromised long-term pre-shared keys used in SIM
  and AKA <xref target="Heist2015" format="default" sectionFormat="of" derivedContent="Heist2015"/>. While no protocol can survive
  the theft of key material associated with its credentials, there
  are some things that alleviate the impacts in such situations.
  These are discussed further in <xref target="pm" format="default" sectionFormat="of" derivedContent="Section 7.3"/>.</t>
        <t indent="0" pn="section-7.2-9">Arapinis, et al. <xref target="Arapinis2012" format="default" sectionFormat="of" derivedContent="Arapinis2012"/> describe an attack
  that uses the AKA resynchronization protocol to attempt to detect
  whether a particular subscriber is in a given area. This attack
  depends on the attacker setting up a false base station
  in the given area and on the subscriber performing at least one
  authentication between the time the attack is set up and run.</t>
        <t indent="0" pn="section-7.2-10">Borgaonkar, et al. discovered that the AKA resynchronization
  protocol may also be used to predict the authentication frequency of
  a subscriber if a non-time-based sequence number (SQN) generation scheme is used <xref target="Borgaonkar2018" format="default" sectionFormat="of" derivedContent="Borgaonkar2018"/>. The attacker can force the reuse of the
  keystream that is used to protect the SQN in the AKA
  resynchronization protocol. The attacker then guesses the
  authentication frequency based on the lowest bits of two XORed
  SQNs. The researchers' concern was that the authentication frequency
  would reveal some information about the phone usage behavior, e.g.,
  number of phone calls made or number of SMS messages sent.
  There are a number of possible triggers for authentication, so
  such an information leak is not direct, but it can be a concern.
  The impact
  of the attack differs depending on whether the
  SQN generation scheme that is used is time-based or not.</t>
        <t indent="0" pn="section-7.2-11">Similar attacks are possible outside AKA in the cellular paging
  protocols where the attacker can simply send application-layer data, send 
  short messages, or make phone calls to the intended victim and
  observe the air interface (e.g., <xref target="Kune2012" format="default" sectionFormat="of" derivedContent="Kune2012"/> and <xref target="Shaik2016" format="default" sectionFormat="of" derivedContent="Shaik2016"/>). Hussain,
  et al. demonstrated a slightly more sophisticated version of the
  attack that exploits the fact that the 4G paging protocol uses the IMSI
  to calculate the paging timeslot <xref target="Hussain2019" format="default" sectionFormat="of" derivedContent="Hussain2019"/>. As this attack is
  outside AKA, it does not impact EAP-AKA'.</t>
        <t indent="0" pn="section-7.2-12">Finally, bad implementations of EAP-AKA' may not produce pseudonym
  usernames or fast re-authentication identities in a manner that is
  sufficiently secure. While it is not a problem with the protocol
  itself, following the recommendations in <xref target="genpfr" format="default" sectionFormat="of" derivedContent="Section 5.2"/> can mitigate this concern.</t>
      </section>
      <section anchor="pm" numbered="true" toc="include" removeInRFC="false" pn="section-7.3">
        <name slugifiedName="name-pervasive-monitoring">Pervasive Monitoring</name>
        <t indent="0" pn="section-7.3-1">As required by <xref target="RFC7258" format="default" sectionFormat="of" derivedContent="RFC7258"/>, work on IETF protocols
  needs to consider the effects of pervasive monitoring and mitigate
  them when possible.</t>
        <t indent="0" pn="section-7.3-2">As described in <xref target="vuln" format="default" sectionFormat="of" derivedContent="Section 7.2"/>, after the publication of RFC 5448, new
  information has come to light regarding the use of pervasive
  monitoring techniques against many security technologies, including
  AKA-based authentication.</t>
        <t indent="0" pn="section-7.3-3">For AKA, these attacks relate to theft of the long-term, shared-secret 
  key material stored on the cards. Such attacks are
  conceivable, for instance, during the manufacturing process of
  cards, through coercion of the card manufacturers, or during the
  transfer of cards and associated information to an operator. Since
  the publication of reports about such attacks, manufacturing and
  provisioning processes have gained much scrutiny and have
  improved.</t>
        <t indent="0" pn="section-7.3-4">In particular, it is crucial that manufacturers limit access to
  the secret information and the cards only to necessary systems and
  personnel. It is also crucial that secure mechanisms be used to store and
  communicate the secrets between the manufacturer and the operator
  that adopts those cards for their customers.</t>
        <t indent="0" pn="section-7.3-5">Beyond these operational considerations, there are also technical
  means to improve resistance to these attacks. One approach is to
  provide Perfect Forward Secrecy (PFS). This would prevent any
  passive attacks merely based on the long-term secrets and
  observation of traffic. Such a mechanism can be defined as a
  backwards-compatible extension of EAP-AKA' and is pursued
  separately from this specification <xref target="I-D.ietf-emu-aka-pfs" format="default" sectionFormat="of" derivedContent="EMU-AKA-PFS"/>. Alternatively, EAP-AKA'
  authentication can be run inside a PFS-capable, tunneled
  authentication method. In any case, the use of some PFS-capable
  mechanism is recommended. </t>
      </section>
      <section anchor="bindprop" numbered="true" toc="include" removeInRFC="false" pn="section-7.4">
        <name slugifiedName="name-security-properties-of-bind">Security Properties of Binding Network Names</name>
        <t indent="0" pn="section-7.4-1">The ability of EAP-AKA' to bind the network name into the used keys
provides some additional protection against key leakage to
inappropriate parties. The keys used in the protocol are specific to a
particular network name. If key leakage occurs due to an accident,
access node compromise, or another attack, the leaked keys are only
useful when providing access with that name. For instance, a malicious
access point cannot claim to be network Y if it has stolen keys from
network X.  Obviously, if an access point is compromised, the
malicious node can still represent the compromised node. As a result,
neither EAP-AKA' nor any other extension can prevent such attacks; however,
the binding to a particular name limits the attacker's choices, allows
better tracking of attacks, makes it possible to identify compromised
networks, and applies good cryptographic hygiene.</t>
        <t indent="0" pn="section-7.4-2">The server receives the EAP transaction from a given access
network, and verifies that the claim from the access network
corresponds to the name that this access network should be using. It
becomes impossible for an access network to claim over AAA that it is
another access network. In addition, if the peer checks that the
information it has received locally over the network-access link-layer
matches with the information the server has given it via EAP-AKA', it
becomes impossible for the access network to tell one story to the AAA
network and another one to the peer. These checks prevent some "lying
NAS" (Network Access Server) attacks. For instance, a roaming partner,
R, might claim that it is the home network H in an effort to lure
peers to connect to itself. Such an attack would be beneficial for the
roaming partner if it can attract more users, and damaging for the
users if their access costs in R are higher than those in other
alternative networks, such as H.</t>
        <t indent="0" pn="section-7.4-3">Any attacker who gets hold of the keys CK and IK, produced by the AKA
algorithm, can compute the keys CK' and IK' and, hence, the Master Key (MK)
according to the rules in <xref target="key" format="default" sectionFormat="of" derivedContent="Section 3.3"/>. The attacker could
then act as a lying NAS. In 3GPP systems in general, the keys CK and
IK have been distributed to, for instance, nodes in a visited access
network where they may be vulnerable. In order to reduce this risk,
the AKA algorithm <bcp14>MUST</bcp14> be computed
with the AMF separation bit set to 1, and the peer <bcp14>MUST</bcp14> check that
this is indeed the case whenever it runs EAP-AKA'. Furthermore,
<xref target="TS-3GPP.33.402" format="default" sectionFormat="of" derivedContent="TS-3GPP.33.402"/> requires that no CK or IK keys computed in this
way ever leave the home subscriber system.</t>
        <t indent="0" pn="section-7.4-4">The additional security benefits obtained from the binding depend
obviously on the way names are assigned to different access
networks. This is specified in <xref target="TS-3GPP.24.302" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.302"/>. See also
<xref target="TS-3GPP.23.003" format="default" sectionFormat="of" derivedContent="TS-3GPP.23.003"/>. Ideally, the names allow separating each
different access technology, each different access network, and each
different NAS within a domain.  If this is not possible, the full
benefits may not be achieved. For instance, if the names identify just
an access technology, use of compromised keys in a different
technology can be prevented, but it is not possible to prevent their
use by other domains or devices using the same technology.</t>
      </section>
    </section>
    <section anchor="iana" numbered="true" toc="include" removeInRFC="false" pn="section-8">
      <name slugifiedName="name-iana-considerations">IANA Considerations</name>
      <t indent="0" pn="section-8-1">IANA has updated the "Extensible Authentication Protocol (EAP)
  Registry" and the "EAP-AKA and EAP-SIM Parameters" registry so that entries
  that pointed to RFC 5448 now point to this RFC instead.</t>
      <section anchor="typev" numbered="true" toc="include" removeInRFC="false" pn="section-8.1">
        <name slugifiedName="name-type-value">Type Value</name>
        <t indent="0" pn="section-8.1-1">IANA has updated the reference for EAP-AKA' (0x32) in the "Method Types"
  subregistry under the "Extensible Authentication Protocol (EAP) Registry" to point to this document.  
  Per 
  <xref target="RFC3748" section="6.2" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc3748#section-6.2" derivedContent="RFC3748"/>, this allocation can be made with
  Specification Required <xref target="RFC8126" format="default" sectionFormat="of" derivedContent="RFC8126"/>.</t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-8.2">
        <name slugifiedName="name-attribute-type-values">Attribute Type Values</name>
        <t indent="0" pn="section-8.2-1">EAP-AKA' shares its attribute space and subtypes with EAP-SIM
<xref target="RFC4186" format="default" sectionFormat="of" derivedContent="RFC4186"/> and EAP-AKA <xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/>. No new
registries are needed.</t>
        <t indent="0" pn="section-8.2-2">IANA has updated the reference for AT_KDF_INPUT (23) and AT_KDF (24)  
  in the "Attribute Types (Non-Skippable Attributes 0-127)" subregistry under the "EAP-AKA and
  EAP-SIM Parameters" registry to point to this document.
  AT_KDF_INPUT and AT_KDF are defined in Sections <xref target="netbind" format="counter" sectionFormat="of" derivedContent="3.1"/> and <xref target="keyderiv" format="counter" sectionFormat="of" derivedContent="3.2"/>, respectively, of this document.</t>
        <t indent="0" pn="section-8.2-3">IANA has also updated the reference for AT_BIDDING (136) in the  
  "Attribute Types (Skippable Attributes 128-255)" subregistry of the 
  "EAP-AKA and EAP-SIM Parameters" registry to point to this document.
  AT_BIDDING is defined in <xref target="bidding" format="default" sectionFormat="of" derivedContent="Section 4"/>.</t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-8.3">
        <name slugifiedName="name-key-derivation-function-nam">Key Derivation Function Namespace</name>
        <t indent="0" pn="section-8.3-1">IANA has updated the reference for the "EAP-AKA' AT_KDF Key Derivation Function Values" 
  subregistry to point to this document.  This subregistry appears under the 
  "EAP-AKA and EAP-SIM Parameters" registry.  The references for following entries have 
  also been updated to point to this document. New values can be created through the 
  Specification Required policy <xref target="RFC8126" format="default" sectionFormat="of" derivedContent="RFC8126"/>.</t>
        <table align="center" pn="table-3">
          <name slugifiedName="name-eap-aka-at_kdf-key-derivati">EAP-AKA' AT_KDF Key Derivation Function Values</name>
          <thead>
            <tr>
              <th align="left" colspan="1" rowspan="1">Value</th>
              <th align="left" colspan="1" rowspan="1">Description</th>
              <th align="left" colspan="1" rowspan="1">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left" colspan="1" rowspan="1">0</td>
              <td align="left" colspan="1" rowspan="1">Reserved</td>
              <td align="left" colspan="1" rowspan="1">RFC 9048</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">1</td>
              <td align="left" colspan="1" rowspan="1">EAP-AKA' with CK'/IK'</td>
              <td align="left" colspan="1" rowspan="1">RFC 9048</td>
            </tr>
          </tbody>
        </table>
      </section>
    </section>
  </middle>
  <back>
    <displayreference target="I-D.ietf-emu-aka-pfs" to="EMU-AKA-PFS"/>
    <references pn="section-9">
      <name slugifiedName="name-references">References</name>
      <references pn="section-9.1">
        <name slugifiedName="name-normative-references">Normative References</name>
        <reference anchor="FIPS.180-4" target="https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf" quoteTitle="true" derivedAnchor="FIPS.180-4">
          <front>
            <title>Secure Hash Standard</title>
            <author>
              <organization showOnFrontPage="true">National Institute of Standards and Technology</organization>
            </author>
            <date month="August" year="2015"/>
          </front>
          <seriesInfo name="FIPS" value="PUB 180-4"/>
          <seriesInfo name="DOI" value="10.6028/NIST.FIPS.180-4"/>
        </reference>
        <reference anchor="RFC2104" target="https://www.rfc-editor.org/info/rfc2104" quoteTitle="true" derivedAnchor="RFC2104">
          <front>
            <title>HMAC: Keyed-Hashing for Message Authentication</title>
            <author initials="H." surname="Krawczyk" fullname="H. Krawczyk">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Bellare" fullname="M. Bellare">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="R." surname="Canetti" fullname="R. Canetti">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="1997" month="February"/>
            <abstract>
              <t indent="0">This document describes HMAC, a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any iterative cryptographic hash function, e.g., MD5, SHA-1, in combination with a secret shared key.  The cryptographic strength of HMAC depends on the properties of the underlying hash function.  This memo provides information for the Internet community.  This memo does not specify an Internet standard of any kind</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2104"/>
          <seriesInfo name="DOI" value="10.17487/RFC2104"/>
        </reference>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119" quoteTitle="true" derivedAnchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author initials="S." surname="Bradner" fullname="S. Bradner">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="1997" month="March"/>
            <abstract>
              <t indent="0">In many standards track documents several words are used to signify the requirements in the specification.  These words are often capitalized. This document defines these words as they should be interpreted in IETF documents.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC3748" target="https://www.rfc-editor.org/info/rfc3748" quoteTitle="true" derivedAnchor="RFC3748">
          <front>
            <title>Extensible Authentication Protocol (EAP)</title>
            <author initials="B." surname="Aboba" fullname="B. Aboba">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="L." surname="Blunk" fullname="L. Blunk">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Vollbrecht" fullname="J. Vollbrecht">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Carlson" fullname="J. Carlson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="H." surname="Levkowetz" fullname="H. Levkowetz" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2004" month="June"/>
            <abstract>
              <t indent="0">This document defines the Extensible Authentication Protocol (EAP), an authentication framework which supports multiple authentication methods.  EAP typically runs directly over data link layers such as Point-to-Point Protocol (PPP) or IEEE 802, without requiring IP.  EAP provides its own support for duplicate elimination and retransmission, but is reliant on lower layer ordering guarantees.  Fragmentation is not supported within EAP itself; however, individual EAP methods may support this.  This document obsoletes RFC 2284.  A summary of the changes between this document and RFC 2284 is available in Appendix A.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3748"/>
          <seriesInfo name="DOI" value="10.17487/RFC3748"/>
        </reference>
        <reference anchor="RFC4187" target="https://www.rfc-editor.org/info/rfc4187" quoteTitle="true" derivedAnchor="RFC4187">
          <front>
            <title>Extensible Authentication Protocol Method for 3rd Generation Authentication and Key Agreement (EAP-AKA)</title>
            <author initials="J." surname="Arkko" fullname="J. Arkko">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="H." surname="Haverinen" fullname="H. Haverinen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2006" month="January"/>
            <abstract>
              <t indent="0">This document specifies an Extensible Authentication Protocol (EAP) mechanism for authentication and session key distribution that uses the Authentication and Key Agreement (AKA) mechanism.  AKA is used in the 3rd generation mobile networks Universal Mobile Telecommunications System (UMTS) and CDMA2000.  AKA is based on symmetric keys, and typically runs in a Subscriber Identity Module, which is a UMTS Subscriber Identity Module, USIM, or a (Removable) User Identity Module, (R)UIM, similar to a smart card.</t>
              <t indent="0">EAP-AKA includes optional identity privacy support, optional result indications, and an optional fast re-authentication procedure.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4187"/>
          <seriesInfo name="DOI" value="10.17487/RFC4187"/>
        </reference>
        <reference anchor="RFC7542" target="https://www.rfc-editor.org/info/rfc7542" quoteTitle="true" derivedAnchor="RFC7542">
          <front>
            <title>The Network Access Identifier</title>
            <author initials="A." surname="DeKok" fullname="A. DeKok">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2015" month="May"/>
            <abstract>
              <t indent="0">In order to provide inter-domain authentication services, it is necessary to have a standardized method that domains can use to identify each other's users.  This document defines the syntax for the Network Access Identifier (NAI), the user identifier submitted by the client prior to accessing resources.  This document is a revised version of RFC 4282.  It addresses issues with international character sets and makes a number of other corrections to RFC 4282.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7542"/>
          <seriesInfo name="DOI" value="10.17487/RFC7542"/>
        </reference>
        <reference anchor="RFC8126" target="https://www.rfc-editor.org/info/rfc8126" quoteTitle="true" derivedAnchor="RFC8126">
          <front>
            <title>Guidelines for Writing an IANA Considerations Section in RFCs</title>
            <author initials="M." surname="Cotton" fullname="M. Cotton">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B." surname="Leiba" fullname="B. Leiba">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T." surname="Narten" fullname="T. Narten">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2017" month="June"/>
            <abstract>
              <t indent="0">Many protocols make use of points of extensibility that use constants to identify various protocol parameters.  To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper.  For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA).</t>
              <t indent="0">To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed.  This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry.</t>
              <t indent="0">This is the third edition of this document; it obsoletes RFC 5226.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="26"/>
          <seriesInfo name="RFC" value="8126"/>
          <seriesInfo name="DOI" value="10.17487/RFC8126"/>
        </reference>
        <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174" quoteTitle="true" derivedAnchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author initials="B." surname="Leiba" fullname="B. Leiba">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2017" month="May"/>
            <abstract>
              <t indent="0">RFC 2119 specifies common key words that may be used in protocol  specifications.  This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the  defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
        <reference anchor="TS-3GPP.23.003" quoteTitle="true" derivedAnchor="TS-3GPP.23.003">
          <front>
            <title>3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Numbering, addressing and identification (Release 16)</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date month="June" year="2021"/>
          </front>
          <seriesInfo name="3GPP Technical Specification" value="23.003"/>
          <refcontent>Version 16.7.0</refcontent>
        </reference>
        <reference anchor="TS-3GPP.23.501" quoteTitle="true" derivedAnchor="TS-3GPP.23.501">
          <front>
            <title>3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for the 5G System (5GS); (Release 16)</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date month="June" year="2021"/>
          </front>
          <seriesInfo name="3GPP Technical Specification" value="23.501"/>
          <refcontent>Version 16.9.0</refcontent>
        </reference>
        <reference anchor="TS-3GPP.24.302" quoteTitle="true" derivedAnchor="TS-3GPP.24.302">
          <front>
            <title>3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Access to the 3GPP Evolved Packet Core (EPC) via non-3GPP access networks; Stage 3; (Release 16)</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date month="July" year="2020"/>
          </front>
          <seriesInfo name="3GPP Technical Specification" value="24.302"/>
          <refcontent>Version 16.4.0</refcontent>
        </reference>
        <reference anchor="TS-3GPP.24.501" quoteTitle="true" derivedAnchor="TS-3GPP.24.501">
          <front>
            <title>3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Non-Access-Stratum (NAS) protocol for 5G System (5GS); Stage 3; (Release 16)</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date month="June" year="2021"/>
          </front>
          <seriesInfo name="3GPP Draft Technical Specification" value="24.501"/>
          <refcontent>Version 16.9.0</refcontent>
        </reference>
        <reference anchor="TS-3GPP.33.102" quoteTitle="true" derivedAnchor="TS-3GPP.33.102">
          <front>
            <title>3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; 3G Security; Security architecture (Release 16)</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date month="July" year="2020"/>
          </front>
          <seriesInfo name="3GPP Technical Specification" value="33.102"/>
          <refcontent>Version 16.0.0</refcontent>
        </reference>
        <reference anchor="TS-3GPP.33.402" quoteTitle="true" derivedAnchor="TS-3GPP.33.402">
          <front>
            <title>3GPP System Architecture Evolution (SAE); Security aspects of non-3GPP accesses (Release 16)</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date month="July" year="2020"/>
          </front>
          <seriesInfo name="3GPP Technical Specification" value="33.402"/>
          <refcontent>Version 16.0.0</refcontent>
        </reference>
        <reference anchor="TS-3GPP.33.501" quoteTitle="true" derivedAnchor="TS-3GPP.33.501">
          <front>
            <title>3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; 3G Security; Security architecture and procedures for 5G System (Release 16)</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date month="July" year="2021"/>
          </front>
          <seriesInfo name="3GPP Technical Specification" value="33.501"/>
          <refcontent>Version 16.7.1</refcontent>
        </reference>
      </references>
      <references pn="section-9.2">
        <name slugifiedName="name-informative-references">Informative References</name>
        <reference anchor="Arapinis2012" quoteTitle="true" target="https://doi.org/10.1145/2382196.2382221" derivedAnchor="Arapinis2012">
          <front>
            <title>New Privacy Issues in Mobile Telephony: Fix and Verification</title>
            <author initials="M." surname="Arapinis"/>
            <author initials="L." surname="Mancini"/>
            <author initials="E." surname="Ritter"/>
            <author initials="M." surname="Ryan"/>
            <author initials="N." surname="Golde"/>
            <author initials="R." surname="Redon"/>
            <author initials="R." surname="Borgaonkar"/>
            <date month="October" year="2012"/>
          </front>
          <refcontent>in CCS '12: Proceedings of the 2012 ACM Conference on Computer and Communications Security, Raleigh, North Carolina, USA</refcontent>
          <seriesInfo name="DOI" value="10.1145/2382196.2382221"/>
        </reference>
        <reference anchor="Basin2018" quoteTitle="true" target="https://doi.org/10.1145/3243734.3243846" derivedAnchor="Basin2018">
          <front>
            <title>A Formal Analysis of 5G Authentication</title>
            <author initials="D." surname="Basin"/>
            <author initials="J." surname="Dreier"/>
            <author initials="L." surname="Hirschi"/>
            <author initials="S." surname="Radomirović"/>
            <author initials="R." surname="Sasse"/>
            <author initials="V." surname="Stettler"/>
            <date month="August" year="2018"/>
          </front>
          <refcontent>arXiv:1806.10360</refcontent>
          <seriesInfo name="DOI" value="10.1145/3243734.3243846"/>
        </reference>
        <reference anchor="Borgaonkar2018" quoteTitle="true" derivedAnchor="Borgaonkar2018">
          <front>
            <title>New Privacy Threat on 3G, 4G, and Upcoming 5G AKA Protocols</title>
            <author initials="R." surname="Borgaonkar"/>
            <author initials="L." surname="Hirschi"/>
            <author initials="S." surname="Park"/>
            <author initials="A." surname="Shaik"/>
            <date year="2018"/>
          </front>
          <refcontent>in IACR Cryptology ePrint Archive</refcontent>
        </reference>
        <reference anchor="BT2013" quoteTitle="true" derivedAnchor="BT2013">
          <front>
            <title>Breaking Cell Phone Authentication: Vulnerabilities in AKA, IMS and Android</title>
            <author initials="J. G." surname="Beekman"/>
            <author initials="C." surname="Thompson"/>
            <date month="August" year="2013"/>
          </front>
          <refcontent>in 7th USENIX Workshop on Offensive Technologies, WOOT '13</refcontent>
        </reference>
        <reference anchor="I-D.ietf-emu-aka-pfs" quoteTitle="true" target="https://datatracker.ietf.org/doc/html/draft-ietf-emu-aka-pfs-05" derivedAnchor="EMU-AKA-PFS">
          <front>
            <title>Perfect-Forward Secrecy for the Extensible Authentication Protocol Method for Authentication and Key Agreement (EAP-AKA' PFS)</title>
            <author fullname="Jari Arkko">
              <organization showOnFrontPage="true">Ericsson</organization>
            </author>
            <author fullname="Karl Norrman">
              <organization showOnFrontPage="true">Ericsson</organization>
            </author>
            <author fullname="Vesa Torvinen">
              <organization showOnFrontPage="true">Ericsson</organization>
            </author>
            <date month="October" day="30" year="2020"/>
            <abstract>
              <t indent="0">   Many different attacks have been reported as part of revelations
   associated with pervasive surveillance.  Some of the reported attacks
   involved compromising smart cards, such as attacking SIM card
   manufacturers and operators in an effort to compromise shared secrets
   stored on these cards.  Since the publication of those reports,
   manufacturing and provisioning processes have gained much scrutiny
   and have improved.  However, the danger of resourceful attackers for
   these systems is still a concern.

   This specification is an optional extension to the EAP-AKA'
   authentication method which was defined in [I-D.ietf-emu-rfc5448bis].
   The extension, when negotiated, provides Perfect Forward Secrecy for
   the session key generated as a part of the authentication run in EAP-
   AKA'.  This prevents an attacker who has gained access to the long-
   term pre-shared secret in a SIM card from being able to decrypt any
   past communications.  In addition, if the attacker stays merely a
   passive eavesdropper, the extension prevents attacks against future
   sessions.  This forces attackers to use active attacks instead.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-emu-aka-pfs-05"/>
          <format type="TXT" target="https://www.ietf.org/archive/id/draft-ietf-emu-aka-pfs-05.txt"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="FIPS.180-1" target="https://csrc.nist.gov/publications/detail/fips/180/1/archive/1995-04-17" quoteTitle="true" derivedAnchor="FIPS.180-1">
          <front>
            <title>Secure Hash Standard</title>
            <author>
              <organization showOnFrontPage="true">National Institute of Standards and Technology</organization>
            </author>
            <date month="April" year="1995"/>
          </front>
          <seriesInfo name="FIPS" value="PUB 180-1"/>
          <seriesInfo name="DOI" value="10.6028/NIST.FIPS.180-1"/>
        </reference>
        <reference anchor="FIPS.180-2" target="https://csrc.nist.gov/publications/detail/fips/180/2/archive/2002-08-01" quoteTitle="true" derivedAnchor="FIPS.180-2">
          <front>
            <title>Secure Hash Standard</title>
            <author>
              <organization showOnFrontPage="true">National Institute of Standards and Technology</organization>
            </author>
            <date month="August" year="2002"/>
          </front>
          <seriesInfo name="FIPS" value="PUB 180-2"/>
        </reference>
        <reference anchor="Heist2015" target="https://firstlook.org/theintercept/2015/02/19/great-sim-heist/" quoteTitle="true" derivedAnchor="Heist2015">
          <front>
            <title>How Spies Stole the Keys to the Encryption Castle</title>
            <author initials="J." surname="Scahill"/>
            <author initials="J." surname="Begley"/>
            <date month="February" year="2015"/>
          </front>
        </reference>
        <reference anchor="Hussain2019" quoteTitle="true" derivedAnchor="Hussain2019">
          <front>
            <title>Privacy Attacks to the 4G and 5G Cellular Paging Protocols Using Side Channel Information</title>
            <author initials="S." surname="Hussain"/>
            <author initials="M." surname="Echeverria"/>
            <author initials="O." surname="Chowdhury"/>
            <author initials="N." surname="Li"/>
            <author initials="E." surname="Bertino"/>
            <date year="2019"/>
          </front>
          <refcontent>in the proceedings of NDSS '19, held 24-27 February, 2019, San Diego, California</refcontent>
        </reference>
        <reference anchor="Kune2012" quoteTitle="true" derivedAnchor="Kune2012">
          <front>
            <title>Location Leaks on the GSM Air Interface</title>
            <author initials="D." surname="Kune"/>
            <author initials="J." surname="Koelndorfer"/>
            <author initials="N." surname="Hopper"/>
            <author initials="Y." surname="Kim"/>
            <date year="2012"/>
          </front>
          <refcontent>in the proceedings of NDSS '12, held 5-8 February, 2012, San Diego, California</refcontent>
        </reference>
        <reference anchor="MT2012" quoteTitle="true" target="https://doi.org/10.1007/978-3-642-33704-8_6" derivedAnchor="MT2012">
          <front>
            <title>A Vulnerability in the UMTS and LTE Authentication and Key Agreement Protocols</title>
            <author initials="S. F." surname="Mjølsnes"/>
            <author initials="J-K." surname="Tsay"/>
            <date month="October" year="2012"/>
          </front>
          <refcontent>in Computer Network Security, Proceedings of the 6th International Conference on Mathematical Methods, Models and Architectures for Computer Network Security, Lecture Notes in Computer Science, Vol. 7531, pp. 65-76</refcontent>
          <seriesInfo name="DOI" value="10.1007/978-3-642-33704-8_6"/>
        </reference>
        <reference anchor="RFC3310" target="https://www.rfc-editor.org/info/rfc3310" quoteTitle="true" derivedAnchor="RFC3310">
          <front>
            <title>Hypertext Transfer Protocol (HTTP) Digest Authentication Using Authentication and Key Agreement (AKA)</title>
            <author initials="A." surname="Niemi" fullname="A. Niemi">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Arkko" fullname="J. Arkko">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="V." surname="Torvinen" fullname="V. Torvinen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2002" month="September"/>
          </front>
          <seriesInfo name="RFC" value="3310"/>
          <seriesInfo name="DOI" value="10.17487/RFC3310"/>
        </reference>
        <reference anchor="RFC4086" target="https://www.rfc-editor.org/info/rfc4086" quoteTitle="true" derivedAnchor="RFC4086">
          <front>
            <title>Randomness Requirements for Security</title>
            <author initials="D." surname="Eastlake 3rd" fullname="D. Eastlake 3rd">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Schiller" fullname="J. Schiller">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Crocker" fullname="S. Crocker">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2005" month="June"/>
            <abstract>
              <t indent="0">Security systems are built on strong cryptographic algorithms that foil pattern analysis attempts.  However, the security of these systems is dependent on generating secret quantities for passwords, cryptographic keys, and similar quantities.  The use of pseudo-random processes to generate secret quantities can result in pseudo-security. A sophisticated attacker may find it easier to reproduce the environment that produced the secret quantities and to search the resulting small set of possibilities than to locate the quantities in the whole of the potential number space.</t>
              <t indent="0">Choosing random quantities to foil a resourceful and motivated adversary is surprisingly difficult.  This document points out many pitfalls in using poor entropy sources or traditional pseudo-random number generation techniques for generating such quantities.  It recommends the use of truly random hardware techniques and shows that the existing hardware on many systems can be used for this purpose. It provides suggestions to ameliorate the problem when a hardware solution is not available, and it gives examples of how large such quantities need to be for some applications.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="106"/>
          <seriesInfo name="RFC" value="4086"/>
          <seriesInfo name="DOI" value="10.17487/RFC4086"/>
        </reference>
        <reference anchor="RFC4169" target="https://www.rfc-editor.org/info/rfc4169" quoteTitle="true" derivedAnchor="RFC4169">
          <front>
            <title>Hypertext Transfer Protocol (HTTP) Digest Authentication Using Authentication and Key Agreement (AKA) Version-2</title>
            <author initials="V." surname="Torvinen" fullname="V. Torvinen">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Arkko" fullname="J. Arkko">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Naslund" fullname="M. Naslund">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2005" month="November"/>
            <abstract>
              <t indent="0">HTTP Digest, as specified in RFC 2617, is known to be vulnerable to man-in-the-middle attacks if the client fails to authenticate the server in TLS, or if the same passwords are used for authentication in some other context without TLS.  This is a general problem that exists not just with HTTP Digest, but also with other IETF protocols that use tunneled authentication.  This document specifies version 2 of the HTTP Digest AKA algorithm (RFC 3310).  This algorithm can be implemented in a way that it is resistant to the man-in-the-middle attack.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4169"/>
          <seriesInfo name="DOI" value="10.17487/RFC4169"/>
        </reference>
        <reference anchor="RFC4186" target="https://www.rfc-editor.org/info/rfc4186" quoteTitle="true" derivedAnchor="RFC4186">
          <front>
            <title>Extensible Authentication Protocol Method for Global System for Mobile Communications (GSM) Subscriber Identity Modules (EAP-SIM)</title>
            <author initials="H." surname="Haverinen" fullname="H. Haverinen" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Salowey" fullname="J. Salowey" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2006" month="January"/>
            <abstract>
              <t indent="0">This document specifies an Extensible Authentication Protocol (EAP) mechanism for authentication and session key distribution using the Global System for Mobile Communications (GSM) Subscriber Identity Module (SIM).  GSM is a second generation mobile network standard. The EAP-SIM mechanism specifies enhancements to GSM authentication and key agreement whereby multiple authentication triplets can be combined to create authentication responses and session keys of greater strength than the individual GSM triplets.  The mechanism also includes network authentication, user anonymity support, result indications, and a fast re-authentication procedure.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4186"/>
          <seriesInfo name="DOI" value="10.17487/RFC4186"/>
        </reference>
        <reference anchor="RFC4284" target="https://www.rfc-editor.org/info/rfc4284" quoteTitle="true" derivedAnchor="RFC4284">
          <front>
            <title>Identity Selection Hints for the Extensible Authentication Protocol (EAP)</title>
            <author initials="F." surname="Adrangi" fullname="F. Adrangi">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="V." surname="Lortz" fullname="V. Lortz">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="F." surname="Bari" fullname="F. Bari">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="P." surname="Eronen" fullname="P. Eronen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2006" month="January"/>
            <abstract>
              <t indent="0">The Extensible Authentication Protocol (EAP) is defined in RFC 3748. This document defines a mechanism that allows an access network to provide identity selection hints to an EAP peer -- the end of the link that responds to the authenticator.  The purpose is to assist the EAP peer in selecting an appropriate Network Access Identifier (NAI).  This is useful in situations where the peer does not receive a lower-layer indication of what network it is connecting to, or when there is no direct roaming relationship between the access network and the peer's home network.  In the latter case, authentication is typically accomplished via a mediating network such as a roaming consortium or broker.</t>
              <t indent="0">The mechanism defined in this document is limited in its scalability. It is intended for access networks that have a small to moderate number of direct roaming partners.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4284"/>
          <seriesInfo name="DOI" value="10.17487/RFC4284"/>
        </reference>
        <reference anchor="RFC4306" target="https://www.rfc-editor.org/info/rfc4306" quoteTitle="true" derivedAnchor="RFC4306">
          <front>
            <title>Internet Key Exchange (IKEv2) Protocol</title>
            <author initials="C." surname="Kaufman" fullname="C. Kaufman" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2005" month="December"/>
            <abstract>
              <t indent="0">This document describes version 2 of the Internet Key Exchange (IKE) protocol.  IKE is a component of IPsec used for performing mutual authentication and establishing and maintaining security associations (SAs).</t>
              <t indent="0">This version of the IKE specification combines the contents of what were previously separate documents, including Internet Security Association and Key Management Protocol (ISAKMP, RFC 2408), IKE (RFC 2409), the Internet Domain of Interpretation (DOI, RFC 2407), Network Address Translation (NAT) Traversal, Legacy authentication, and remote address acquisition.</t>
              <t indent="0">Version 2 of IKE does not interoperate with version 1, but it has enough of the header format in common that both versions can unambiguously run over the same UDP port.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4306"/>
          <seriesInfo name="DOI" value="10.17487/RFC4306"/>
        </reference>
        <reference anchor="RFC5113" target="https://www.rfc-editor.org/info/rfc5113" quoteTitle="true" derivedAnchor="RFC5113">
          <front>
            <title>Network Discovery and Selection Problem</title>
            <author initials="J." surname="Arkko" fullname="J. Arkko">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B." surname="Aboba" fullname="B. Aboba">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Korhonen" fullname="J. Korhonen" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="F." surname="Bari" fullname="F. Bari">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2008" month="January"/>
            <abstract>
              <t indent="0">When multiple access networks are available, users may have difficulty in selecting which network to connect to and how to authenticate with that network.  This document defines the network discovery and selection problem, dividing it into multiple sub- problems.  Some constraints on potential solutions are outlined, and the limitations of several solutions (including existing ones) are discussed.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5113"/>
          <seriesInfo name="DOI" value="10.17487/RFC5113"/>
        </reference>
        <reference anchor="RFC5247" target="https://www.rfc-editor.org/info/rfc5247" quoteTitle="true" derivedAnchor="RFC5247">
          <front>
            <title>Extensible Authentication Protocol (EAP) Key Management Framework</title>
            <author initials="B." surname="Aboba" fullname="B. Aboba">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="D." surname="Simon" fullname="D. Simon">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="P." surname="Eronen" fullname="P. Eronen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2008" month="August"/>
            <abstract>
              <t indent="0">The Extensible Authentication Protocol (EAP), defined in RFC 3748, enables extensible network access authentication.  This document specifies the EAP key hierarchy and provides a framework for the transport and usage of keying material and parameters generated by EAP authentication algorithms, known as "methods".  It also provides a detailed system-level security analysis, describing the conditions under which the key management guidelines described in RFC 4962 can be satisfied.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5247"/>
          <seriesInfo name="DOI" value="10.17487/RFC5247"/>
        </reference>
        <reference anchor="RFC5281" target="https://www.rfc-editor.org/info/rfc5281" quoteTitle="true" derivedAnchor="RFC5281">
          <front>
            <title>Extensible Authentication Protocol Tunneled Transport Layer Security Authenticated Protocol Version 0 (EAP-TTLSv0)</title>
            <author initials="P." surname="Funk" fullname="P. Funk">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Blake-Wilson" fullname="S. Blake-Wilson">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2008" month="August"/>
            <abstract>
              <t indent="0">EAP-TTLS is an EAP (Extensible Authentication Protocol) method that encapsulates a TLS (Transport Layer Security) session, consisting of a handshake phase and a data phase.  During the handshake phase, the server is authenticated to the client (or client and server are mutually authenticated) using standard TLS procedures, and keying material is generated in order to create a cryptographically secure tunnel for information exchange in the subsequent data phase.  During the data phase, the client is authenticated to the server (or client and server are mutually authenticated) using an arbitrary authentication mechanism encapsulated within the secure tunnel.  The encapsulated authentication mechanism may itself be EAP, or it may be another authentication protocol such as PAP, CHAP, MS-CHAP, or MS-CHAP-V2.  Thus, EAP-TTLS allows legacy password-based authentication protocols to be used against existing authentication databases, while protecting the security of these legacy protocols against eavesdropping, man-in-the-middle, and other attacks.  The data phase may also be used for additional, arbitrary data exchange.  This memo  provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5281"/>
          <seriesInfo name="DOI" value="10.17487/RFC5281"/>
        </reference>
        <reference anchor="RFC5448" target="https://www.rfc-editor.org/info/rfc5448" quoteTitle="true" derivedAnchor="RFC5448">
          <front>
            <title>Improved Extensible Authentication Protocol Method for 3rd Generation Authentication and Key Agreement (EAP-AKA')</title>
            <author initials="J." surname="Arkko" fullname="J. Arkko">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="V." surname="Lehtovirta" fullname="V. Lehtovirta">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="P." surname="Eronen" fullname="P. Eronen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2009" month="May"/>
            <abstract>
              <t indent="0">This specification defines a new EAP method, EAP-AKA', which is a small revision of the EAP-AKA (Extensible Authentication Protocol Method for 3rd Generation Authentication and Key Agreement) method. The change is a new key derivation function that binds the keys derived within the method to the name of the access network.  The new key derivation mechanism has been defined in the 3rd Generation Partnership Project (3GPP).  This specification allows its use in EAP in an interoperable manner.  In addition, EAP-AKA' employs SHA-256 instead of SHA-1.</t>
              <t indent="0">This specification also updates RFC 4187, EAP-AKA, to prevent bidding down attacks from EAP-AKA'.  This memo provides information for the  Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5448"/>
          <seriesInfo name="DOI" value="10.17487/RFC5448"/>
        </reference>
        <reference anchor="RFC6194" target="https://www.rfc-editor.org/info/rfc6194" quoteTitle="true" derivedAnchor="RFC6194">
          <front>
            <title>Security Considerations for the SHA-0 and SHA-1 Message-Digest Algorithms</title>
            <author initials="T." surname="Polk" fullname="T. Polk">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="L." surname="Chen" fullname="L. Chen">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Turner" fullname="S. Turner">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="P." surname="Hoffman" fullname="P. Hoffman">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2011" month="March"/>
            <abstract>
              <t indent="0">This document includes security considerations for the SHA-0 and SHA-1 message digest algorithm.  This document is not an Internet  Standards Track specification; it is published for informational  purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6194"/>
          <seriesInfo name="DOI" value="10.17487/RFC6194"/>
        </reference>
        <reference anchor="RFC6973" target="https://www.rfc-editor.org/info/rfc6973" quoteTitle="true" derivedAnchor="RFC6973">
          <front>
            <title>Privacy Considerations for Internet Protocols</title>
            <author initials="A." surname="Cooper" fullname="A. Cooper">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="H." surname="Tschofenig" fullname="H. Tschofenig">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B." surname="Aboba" fullname="B. Aboba">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Peterson" fullname="J. Peterson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Morris" fullname="J. Morris">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Hansen" fullname="M. Hansen">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="R." surname="Smith" fullname="R. Smith">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2013" month="July"/>
            <abstract>
              <t indent="0">This document offers guidance for developing privacy considerations for inclusion in protocol specifications.  It aims to make designers, implementers, and users of Internet protocols aware of privacy-related design choices.  It suggests that whether any individual RFC warrants a specific privacy considerations section will depend on the document's content.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6973"/>
          <seriesInfo name="DOI" value="10.17487/RFC6973"/>
        </reference>
        <reference anchor="RFC7170" target="https://www.rfc-editor.org/info/rfc7170" quoteTitle="true" derivedAnchor="RFC7170">
          <front>
            <title>Tunnel Extensible Authentication Protocol (TEAP) Version 1</title>
            <author initials="H." surname="Zhou" fullname="H. Zhou">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="N." surname="Cam-Winget" fullname="N. Cam-Winget">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Salowey" fullname="J. Salowey">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Hanna" fullname="S. Hanna">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2014" month="May"/>
            <abstract>
              <t indent="0">This document defines the Tunnel Extensible Authentication Protocol (TEAP) version 1.  TEAP is a tunnel-based EAP method that enables secure communication between a peer and a server by using the Transport Layer Security (TLS) protocol to establish a mutually authenticated tunnel.  Within the tunnel, TLV objects are used to convey authentication-related data between the EAP peer and the EAP server.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7170"/>
          <seriesInfo name="DOI" value="10.17487/RFC7170"/>
        </reference>
        <reference anchor="RFC7258" target="https://www.rfc-editor.org/info/rfc7258" quoteTitle="true" derivedAnchor="RFC7258">
          <front>
            <title>Pervasive Monitoring Is an Attack</title>
            <author initials="S." surname="Farrell" fullname="S. Farrell">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="H." surname="Tschofenig" fullname="H. Tschofenig">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2014" month="May"/>
            <abstract>
              <t indent="0">Pervasive monitoring is a technical attack that should be mitigated in the design of IETF protocols, where possible.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="188"/>
          <seriesInfo name="RFC" value="7258"/>
          <seriesInfo name="DOI" value="10.17487/RFC7258"/>
        </reference>
        <reference anchor="RFC7296" target="https://www.rfc-editor.org/info/rfc7296" quoteTitle="true" derivedAnchor="RFC7296">
          <front>
            <title>Internet Key Exchange Protocol Version 2 (IKEv2)</title>
            <author initials="C." surname="Kaufman" fullname="C. Kaufman">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="P." surname="Hoffman" fullname="P. Hoffman">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="Y." surname="Nir" fullname="Y. Nir">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="P." surname="Eronen" fullname="P. Eronen">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T." surname="Kivinen" fullname="T. Kivinen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2014" month="October"/>
            <abstract>
              <t indent="0">This document describes version 2 of the Internet Key Exchange (IKE) protocol.  IKE is a component of IPsec used for performing mutual authentication and establishing and maintaining Security Associations (SAs).  This document obsoletes RFC 5996, and includes all of the errata for it.  It advances IKEv2 to be an Internet Standard.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="79"/>
          <seriesInfo name="RFC" value="7296"/>
          <seriesInfo name="DOI" value="10.17487/RFC7296"/>
        </reference>
        <reference anchor="Shaik2016" quoteTitle="true" derivedAnchor="Shaik2016">
          <front>
            <title>Practical attacks against Privacy and Availability in 4G/LTE Mobile Communication Systems</title>
            <author initials="A." surname="Shaik"/>
            <author initials="J." surname="Seifert"/>
            <author initials="R." surname="Borgaonkar"/>
            <author initials="N." surname="Asokan"/>
            <author initials="V." surname="Niemi"/>
            <date year="2012"/>
          </front>
          <refcontent>in the proceedings of NDSS '16 held 21-24 February, 2016, San Diego, California</refcontent>
        </reference>
        <reference anchor="TS-3GPP.35.208" quoteTitle="true" derivedAnchor="TS-3GPP.35.208">
          <front>
            <title>3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; 3G Security; Specification of the MILENAGE Algorithm Set: An example algorithm set for the 3GPP authentication and key generation functions f1, f1*, f2, f3, f4, f5 and f5*; Document 4: Design Conformance Test Data (Release 14)</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date month="July" year="2020"/>
          </front>
          <seriesInfo name="3GPP Technical Specification" value="35.208"/>
          <refcontent>Version 16.0.0</refcontent>
        </reference>
        <reference anchor="ZF2005" quoteTitle="true" target="https://doi.org/10.1109/TWC.2004.842941" derivedAnchor="ZF2005">
          <front>
            <title>Security analysis and enhancements of 3GPP authentication and key agreement protocol</title>
            <author initials="M." surname="Zhang"/>
            <author initials="Y." surname="Fang"/>
            <date month="March" year="2005"/>
          </front>
          <refcontent>IEEE Transactions on Wireless Communications, Vol. 4, No. 2</refcontent>
          <seriesInfo name="DOI" value="10.1109/TWC.2004.842941"/>
        </reference>
      </references>
    </references>
    <section anchor="diff2" numbered="true" toc="include" removeInRFC="false" pn="section-appendix.a">
      <name slugifiedName="name-changes-from-rfc-5448">Changes from RFC 5448</name>
      <t indent="0" pn="section-appendix.a-1">The change from RFC 5448 was to refer to a newer version
  of <xref target="TS-3GPP.24.302" format="default" sectionFormat="of" derivedContent="TS-3GPP.24.302"/>. This RFC
  includes an updated definition of the Network Name field to
  include 5G.</t>
      <t indent="0" pn="section-appendix.a-2">Identifier usage for 5G has been specified in <xref target="identifiersin5g" format="default" sectionFormat="of" derivedContent="Section 5.3"/>. Also, the requirements for generating
  pseudonym usernames and fast re-authentication identities have been
  updated from the original definition in RFC 5448, which referenced
  RFC 4187. See <xref target="identities" format="default" sectionFormat="of" derivedContent="Section 5"/>.</t>
      <t indent="0" pn="section-appendix.a-3">Exported parameters for EAP-AKA' have been defined in
  <xref target="exported-parameters" format="default" sectionFormat="of" derivedContent="Section 6"/>, as required by <xref target="RFC5247" format="default" sectionFormat="of" derivedContent="RFC5247"/>, including the definition of those parameters for
  both full authentication and fast re-authentication.</t>
      <t indent="0" pn="section-appendix.a-4">The security, privacy, and pervasive monitoring considerations
  have been updated or added. See <xref target="security" format="default" sectionFormat="of" derivedContent="Section 7"/>.</t>
      <t indent="0" pn="section-appendix.a-5">The references to <xref target="RFC2119" format="default" sectionFormat="of" derivedContent="RFC2119"/>, <xref target="RFC4306" format="default" sectionFormat="of" derivedContent="RFC4306"/>, <xref target="RFC7296" format="default" sectionFormat="of" derivedContent="RFC7296"/>, <xref target="FIPS.180-1" format="default" sectionFormat="of" derivedContent="FIPS.180-1"/> and <xref target="FIPS.180-2" format="default" sectionFormat="of" derivedContent="FIPS.180-2"/> have been updated to their most recent
  versions, and language in this document has been changed
  accordingly. However, these are merely reference updates to newer specifications;
  the actual protocol functions are the same as defined in the earlier RFCs. </t>
      <t indent="0" pn="section-appendix.a-6"> Similarly, references to all 3GPP technical specifications have been
updated to their 5G versions (Release 16) or otherwise most recent
version when there has not been a 5G-related update.</t>
      <t indent="0" pn="section-appendix.a-7">Finally, a number of clarifications have been made, including a
  summary of where attributes may appear.</t>
    </section>
    <section anchor="diff" numbered="true" toc="include" removeInRFC="false" pn="section-appendix.b">
      <name slugifiedName="name-changes-to-rfc-4187">Changes to RFC 4187</name>
      <t indent="0" pn="section-appendix.b-1">In addition to specifying EAP-AKA', this document also mandates a
  change to another EAP method -- EAP-AKA that was defined in RFC 4187.
  This change was already mandated in RFC 5448 but repeated here to
  ensure that the latest EAP-AKA' specification contains the instructions
  about the necessary bidding down prevention feature in EAP-AKA as well.</t>
      <t indent="0" pn="section-appendix.b-2">The changes to RFC 4187 relate only to the bidding down
  prevention support defined in <xref target="bidding" format="default" sectionFormat="of" derivedContent="Section 4"/>. In
  particular, this document does not change how the Master Key (MK) is
  calculated or any other aspect of EAP-AKA. The provisions in this
  specification for EAP-AKA' do not apply to EAP-AKA, outside of <xref target="bidding" format="default" sectionFormat="of" derivedContent="Section 4"/>.</t>
    </section>
    <section anchor="baddesign" numbered="true" toc="include" removeInRFC="false" pn="section-appendix.c">
      <name slugifiedName="name-importance-of-explicit-nego">Importance of Explicit Negotiation</name>
      <t indent="0" pn="section-appendix.c-1">Choosing between the traditional and revised AKA key derivation
functions is easy when their use is unambiguously tied to a particular
radio access network, e.g., Long Term Evolution (LTE) as defined by 3GPP
or evolved High Rate Packet Data (eHRPD) as defined by 3GPP2. There is
no possibility for interoperability problems if this radio access
network is always used in conjunction with new protocols that cannot
be mixed with the old ones; clients will always know whether they are
connecting to the old or new system.</t>
      <t indent="0" pn="section-appendix.c-2">However, using the new key derivation functions over EAP introduces
several degrees of separation, making the choice of the correct key
derivation functions much harder. Many different types of networks
employ EAP. Most of these networks have no means to carry any
information about what is expected from the authentication process.
EAP itself is severely limited in carrying any additional information,
as noted in <xref target="RFC4284" format="default" sectionFormat="of" derivedContent="RFC4284"/> and
<xref target="RFC5113" format="default" sectionFormat="of" derivedContent="RFC5113"/>. Even if these networks or EAP were extended
to carry additional information, it would not affect millions of
deployed access networks and clients attaching to them.</t>
      <t indent="0" pn="section-appendix.c-3">Simply changing the key derivation functions that EAP-AKA
<xref target="RFC4187" format="default" sectionFormat="of" derivedContent="RFC4187"/> uses would cause interoperability problems
with all of the existing implementations. Perhaps it would be possible
to employ strict separation into domain names that should be used by
the new clients and networks. Only these new devices would then employ
the new key derivation function. While this can be made to work for
specific cases, it would be an extremely brittle mechanism, ripe to
result in problems whenever client configuration, routing of
authentication requests, or server configuration does not match
expectations. It also does not help to assume that the EAP client and
server are running a particular release of 3GPP network
specifications. Network vendors often provide features from future
releases early or do not provide all features of the current
release. And obviously, there are many EAP and even some EAP-AKA
implementations that are not bundled with the 3GPP network
offerings. In general, these approaches are expected to lead to
hard-to-diagnose problems and increased support calls.</t>
    </section>
    <section anchor="testvectors" numbered="true" toc="include" removeInRFC="false" pn="section-appendix.d">
      <name slugifiedName="name-test-vectors">Test Vectors</name>
      <t indent="0" pn="section-appendix.d-1">Test vectors are provided below for four different cases.  The test
   vectors may be useful for testing implementations.  In the first two
   cases, we employ the MILENAGE algorithm and the algorithm
   configuration parameters (the subscriber key K and operator algorithm
   variant configuration value OP) from test set 19 in <xref target="TS-3GPP.35.208" format="default" sectionFormat="of" derivedContent="TS-3GPP.35.208"/>.</t>
      <t indent="0" pn="section-appendix.d-2">The last two cases use artificial values as the output of AKA, which are
   useful only for testing the computation of values within EAP-AKA',
      not AKA itself.</t>
      <t indent="0" pn="section-appendix.d-3">Case 1</t>
      <sourcecode type="test-vectors" markers="false" pn="section-appendix.d-4">
   The parameters for the AKA run are as follows:

      Identity:     "0555444333222111"

      Network name: "WLAN"

      RAND:         81e9 2b6c 0ee0 e12e bceb a8d9 2a99 dfa5

      AUTN:         bb52 e91c 747a c3ab 2a5c 23d1 5ee3 51d5

      IK:           9744 871a d32b f9bb d1dd 5ce5 4e3e 2e5a

      CK:           5349 fbe0 9864 9f94 8f5d 2e97 3a81 c00f

      RES:          28d7 b0f2 a2ec 3de5

   Then the derived keys are generated as follows:

      CK':          0093 962d 0dd8 4aa5 684b 045c 9edf fa04

      IK':          ccfc 230c a74f cc96 c0a5 d611 64f5 a76c

      K_encr:       766f a0a6 c317 174b 812d 52fb cd11 a179

      K_aut:        0842 ea72 2ff6 835b fa20 3249 9fc3 ec23
                    c2f0 e388 b4f0 7543 ffc6 77f1 696d 71ea

      K_re:         cf83 aa8b c7e0 aced 892a cc98 e76a 9b20
                    95b5 58c7 795c 7094 715c b339 3aa7 d17a

      MSK:          67c4 2d9a a56c 1b79 e295 e345 9fc3 d187
                    d42b e0bf 818d 3070 e362 c5e9 67a4 d544
                    e8ec fe19 358a b303 9aff 03b7 c930 588c
                    055b abee 58a0 2650 b067 ec4e 9347 c75a

      EMSK:         f861 703c d775 590e 16c7 679e a387 4ada
                    8663 11de 2907 64d7 60cf 76df 647e a01c
                    313f 6992 4bdd 7650 ca9b ac14 1ea0 75c4
                    ef9e 8029 c0e2 90cd bad5 638b 63bc 23fb
</sourcecode>
      <t indent="0" pn="section-appendix.d-5">Case 2</t>
      <sourcecode type="test-vectors" markers="false" pn="section-appendix.d-6">
   The parameters for the AKA run are as follows:

      Identity:     "0555444333222111"

      Network name: "HRPD"

      RAND:         81e9 2b6c 0ee0 e12e bceb a8d9 2a99 dfa5

      AUTN:         bb52 e91c 747a c3ab 2a5c 23d1 5ee3 51d5

      IK:           9744 871a d32b f9bb d1dd 5ce5 4e3e 2e5a

      CK:           5349 fbe0 9864 9f94 8f5d 2e97 3a81 c00f

      RES:          28d7 b0f2 a2ec 3de5

   Then the derived keys are generated as follows:

      CK':          3820 f027 7fa5 f777 32b1 fb1d 90c1 a0da

      IK':          db94 a0ab 557e f6c9 ab48 619c a05b 9a9f

      K_encr:       05ad 73ac 915f ce89 ac77 e152 0d82 187b

      K_aut:        5b4a caef 62c6 ebb8 882b 2f3d 534c 4b35
                    2773 37a0 0184 f20f f25d 224c 04be 2afd

      K_re:         3f90 bf5c 6e5e f325 ff04 eb5e f653 9fa8
                    cca8 3981 94fb d00b e425 b3f4 0dba 10ac

      MSK:          87b3 2157 0117 cd6c 95ab 6c43 6fb5 073f
                    f15c f855 05d2 bc5b b735 5fc2 1ea8 a757
                    57e8 f86a 2b13 8002 e057 5291 3bb4 3b82
                    f868 a961 17e9 1a2d 95f5 2667 7d57 2900

      EMSK:         c891 d5f2 0f14 8a10 0755 3e2d ea55 5c9c
                    b672 e967 5f4a 66b4 bafa 0273 79f9 3aee
                    539a 5979 d0a0 042b 9d2a e28b ed3b 17a3
                    1dc8 ab75 072b 80bd 0c1d a612 466e 402c
</sourcecode>
      <t indent="0" pn="section-appendix.d-7">Case 3</t>
      <sourcecode type="test-vectors" markers="false" pn="section-appendix.d-8">
   The parameters for the AKA run are as follows:

      Identity:     "0555444333222111"

      Network name: "WLAN"

      RAND:         e0e0 e0e0 e0e0 e0e0 e0e0 e0e0 e0e0 e0e0

      AUTN:         a0a0 a0a0 a0a0 a0a0 a0a0 a0a0 a0a0 a0a0

      IK:           b0b0 b0b0 b0b0 b0b0 b0b0 b0b0 b0b0 b0b0

      CK:           c0c0 c0c0 c0c0 c0c0 c0c0 c0c0 c0c0 c0c0

      RES:          d0d0 d0d0 d0d0 d0d0 d0d0 d0d0 d0d0 d0d0

   Then the derived keys are generated as follows:

      CK':          cd4c 8e5c 68f5 7dd1 d7d7 dfd0 c538 e577

      IK':          3ece 6b70 5dbb f7df c459 a112 80c6 5524

      K_encr:       897d 302f a284 7416 488c 28e2 0dcb 7be4

      K_aut:        c407 00e7 7224 83ae 3dc7 139e b0b8 8bb5
                    58cb 3081 eccd 057f 9207 d128 6ee7 dd53

      K_re:         0a59 1a22 dd8b 5b1c f29e 3d50 8c91 dbbd
                    b4ae e230 5189 2c42 b6a2 de66 ea50 4473

      MSK:          9f7d ca9e 37bb 2202 9ed9 86e7 cd09 d4a7
                    0d1a c76d 9553 5c5c ac40 a750 4699 bb89
                    61a2 9ef6 f3e9 0f18 3de5 861a d1be dc81
                    ce99 1639 1b40 1aa0 06c9 8785 a575 6df7

      EMSK:         724d e00b db9e 5681 87be 3fe7 4611 4557
                    d501 8779 537e e37f 4d3c 6c73 8cb9 7b9d
                    c651 bc19 bfad c344 ffe2 b52c a78b d831
                    6b51 dacc 5f2b 1440 cb95 1552 1cc7 ba23
</sourcecode>
      <t indent="0" pn="section-appendix.d-9">Case 4</t>
      <sourcecode type="test-vectors" markers="false" pn="section-appendix.d-10">
   The parameters for the AKA run are as follows:

      Identity:     "0555444333222111"

      Network name: "HRPD"

      RAND:         e0e0 e0e0 e0e0 e0e0 e0e0 e0e0 e0e0 e0e0

      AUTN:         a0a0 a0a0 a0a0 a0a0 a0a0 a0a0 a0a0 a0a0

      IK:           b0b0 b0b0 b0b0 b0b0 b0b0 b0b0 b0b0 b0b0

      CK:           c0c0 c0c0 c0c0 c0c0 c0c0 c0c0 c0c0 c0c0

      RES:          d0d0 d0d0 d0d0 d0d0 d0d0 d0d0 d0d0 d0d0

   Then the derived keys are generated as follows:

      CK':          8310 a71c e6f7 5488 9613 da8f 64d5 fb46

      IK':          5adf 1436 0ae8 3819 2db2 3f6f cb7f 8c76

      K_encr:       745e 7439 ba23 8f50 fcac 4d15 d47c d1d9

      K_aut:        3e1d 2aa4 e677 025c fd86 2a4b e183 61a1
                    3a64 5765 5714 63df 833a 9759 e809 9879

      K_re:         99da 835e 2ae8 2462 576f e651 6fad 1f80
                    2f0f a119 1655 dd0a 273d a96d 04e0 fcd3

      MSK:          c6d3 a6e0 ceea 951e b20d 74f3 2c30 61d0
                    680a 04b0 b086 ee87 00ac e3e0 b95f a026
                    83c2 87be ee44 4322 94ff 98af 26d2 cc78
                    3bac e75c 4b0a f7fd feb5 511b a8e4 cbd0

      EMSK:         7fb5 6813 838a dafa 99d1 40c2 f198 f6da
                    cebf b6af ee44 4961 1054 02b5 08c7 f363
                    352c b291 9644 b504 63e6 a693 5415 0147
                    ae09 cbc5 4b8a 651d 8787 a689 3ed8 536d
</sourcecode>
    </section>
    <section numbered="false" toc="include" removeInRFC="false" pn="section-appendix.e">
      <name slugifiedName="name-acknowledgments">Acknowledgments</name>
      <t indent="0" pn="section-appendix.e-1">The authors would like to thank <contact fullname="Guenther       Horn"/>, <contact fullname="Joe Salowey"/>, <contact fullname="Mats Naslund"/>, <contact fullname="Adrian Escott"/>,
      <contact fullname="Brian Rosenberg"/>, <contact fullname="Laksminath Dondeti"/>, <contact fullname="Ahmad       Muhanna"/>, <contact fullname="Stefan Rommer"/>, <contact fullname="Miguel Garcia"/>, <contact fullname="Jan Kall"/>,
      <contact fullname="Ankur Agarwal"/>, <contact fullname="Jouni       Malinen"/>, <contact fullname="John Mattsson"/>, <contact fullname="Jesus De Gregorio"/>, <contact fullname="Brian       Weis"/>, <contact fullname="Russ Housley"/>, <contact fullname="Alfred Hoenes"/>, <contact fullname="Anand       Palanigounder"/>, <contact fullname="Michael Richardson"/>,
      <contact fullname="Roman Danyliw"/>, <contact fullname="Dan       Romascanu"/>, <contact fullname="Kyle Rose"/>, <contact fullname="Benjamin Kaduk"/>, <contact fullname="Alissa       Cooper"/>, <contact fullname="Erik Kline"/>, <contact fullname="Murray Kucherawy"/>, <contact fullname="Robert       Wilton"/>, <contact fullname="Warren Kumari"/>, <contact fullname="Andreas Kunz"/>, <contact fullname="Marcus Wong"/>,
      <contact fullname="Kalle Jarvinen"/>, <contact fullname="Daniel       Migault"/>, and <contact fullname="Mohit Sethi"/> for their
      in-depth reviews and interesting discussions in this problem
      space.</t>
    </section>
    <section numbered="false" toc="include" removeInRFC="false" pn="section-appendix.f">
      <name slugifiedName="name-contributors">Contributors</name>
      <t indent="0" pn="section-appendix.f-1">The test vectors in <xref target="testvectors" format="default" sectionFormat="of" derivedContent="Appendix D"/> were provided by <contact fullname="Yogendra Pal"/> and
   <contact fullname="Jouni Malinen"/>, based on two independent implementations of this
   specification.</t>
      <t indent="0" pn="section-appendix.f-2"><contact fullname="Jouni Malinen"/> provided suggested text for <xref target="exported-parameters" format="default" sectionFormat="of" derivedContent="Section 6"/>. <contact fullname="John Mattsson"/> provided much of the
   text for <xref target="priv" format="default" sectionFormat="of" derivedContent="Section 7.1"/>. Karl Norrman was the source of
   much of the information in <xref target="vuln" format="default" sectionFormat="of" derivedContent="Section 7.2"/>.</t>
    </section>
    <section anchor="authors-addresses" numbered="false" removeInRFC="false" toc="include" pn="section-appendix.g">
      <name slugifiedName="name-authors-addresses">Authors' Addresses</name>
      <author initials="J" surname="Arkko" fullname="Jari Arkko">
        <organization showOnFrontPage="true">Ericsson</organization>
        <address>
          <postal>
            <city>Jorvas</city>
            <code>02420</code>
            <country>Finland</country>
          </postal>
          <email>jari.arkko@piuha.net</email>
        </address>
      </author>
      <author initials="V." surname="Lehtovirta" fullname="Vesa Lehtovirta">
        <organization showOnFrontPage="true">Ericsson</organization>
        <address>
          <postal>
            <city>Jorvas</city>
            <code>02420</code>
            <country>Finland</country>
          </postal>
          <email>vesa.lehtovirta@ericsson.com</email>
        </address>
      </author>
      <author initials="V." surname="Torvinen" fullname="Vesa Torvinen">
        <organization showOnFrontPage="true">Ericsson</organization>
        <address>
          <postal>
            <city>Jorvas</city>
            <code>02420</code>
            <country>Finland</country>
          </postal>
          <email>vesa.torvinen@ericsson.com</email>
        </address>
      </author>
      <author initials="P." surname="Eronen" fullname="Pasi Eronen">
        <organization showOnFrontPage="true">Independent</organization>
        <address>
          <postal>
            <country>Finland</country>
          </postal>
          <email>pe@iki.fi</email>
        </address>
      </author>
    </section>
  </back>
</rfc>
