<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE rfc SYSTEM "rfc2629.dtd">

<rfc category="std" ipr="trust200902" updates="5723, 6617, 6631, 7296, 8784, 9370, 9838, 9867"  docName="draft-ietf-ipsecme-ikev2-prf-plus-01">

<?xml-stylesheet type='text/xsl' href='rfc2629.xslt' ?>

<?rfc toc="yes" ?>
<?rfc symrefs="yes" ?>
<?rfc sortrefs="no"?>
<?rfc iprnotified="no" ?>
<?rfc strict="yes" ?>

    <front>
        <title abbrev="Variable-Length Output PRFs in IKEv2">Use of Variable-Length Output Pseudo-Random Functions (PRFs) in the Internet Key Exchange Protocol Version 2 (IKEv2)</title>
        <author initials='V.' surname="Smyslov" fullname='Valery Smyslov'>
            <organization>ELVIS-PLUS</organization>
            <address>
                <postal>
                    <street>PO Box 81</street>
                    <city>Moscow (Zelenograd)</city>
                    <code>124460</code>
                    <country>RU</country>
                </postal>
                <phone>+7 495 276 0211</phone>
                <email>svan@elvis.ru</email>
            </address>
        </author>
        <date/>


        <abstract>
            <t> This document specifies the use of variable-length output Pseudo-Random Functions (PRFs) 
            in the Internet Key Exchange Protocol Version 2 (IKEv2). Current IKEv2 specification relies
            on traditional PRFs with fixed output length for key derivation and uses iterative application of a PRF (called "prf+")
            in cases when longer output is required. Appearance of PRFs that can output as much 
            bits as requested allows to streamline the key derivation functions of IKEv2.
            </t>

            <t> This document updates RFCs 5723, 6617, 6631, 7296, 8784, 9370, 9838, 9867 for the cases when variable-length output 
            Pseudo-Random Functions are used in IKEv2 and its extensions.
            </t>
        </abstract>
    </front>

    <middle>
        <section title="Introduction">
            <t> The Internet Key Exchange protocol version 2 (IKEv2) <xref target="RFC7296" /> is used 
            in the IP Security (IPsec) architecture for the Security Association (SA) parameters negotiation
            and for establishing an authenticated shared secret. As part of the SA parameters negotiation
            a Pseudo-Random Function (PRF) is agreed upon. Keying materials for established
            SAs are then derived from the shared secret using the negotiated PRF.
            </t>

            <t> For the purpose of deriving variable-size keying material to accomodate the use of cryptographic
            algorithms with different properties, a construction called prf+ is used in IKEv2. This construction 
            servers the role of a Key Deriation Function (KDF) in IKEv2 and is defined
            in Section 2.13 of <xref target="RFC7296" /> and is provided here for convenience:

<figure align="center">
    <artwork align="left"><![CDATA[
   prf+ (K,S) = T1 | T2 | T3 | T4 | ...

   where:
   T1 = prf (K, S | 0x01)
   T2 = prf (K, T1 | S | 0x02)
   T3 = prf (K, T2 | S | 0x03)
   T4 = prf (K, T3 | S | 0x04)
]]></artwork>
</figure>

            This construction allows to get more output bits than the output length of the negotiated PRF
            by applying it iteratively.
            </t>

            <t> Modern achievements in cryptography bore new class of cryptographic primitives - 
            PRFs with variable-length output. These functions are able to produce as many pseudorandom bits as requested in one call.
            One example of such PRFs is KMAC <xref target="SP-800-185" />.
            </t>

            <t> When variable-length output PRFs are considered for the use in IKEv2 for the key derivation purposes,
            it is possible either to keep the prf+ construction always performung exactly one iteration with the PRF producing the needed number 
            of output bits at once, or to remove the prf+ construction completely and replace it with a single call to the PRF, that would
            also produce the needed number of output bits. This is discussed in Section 8.3.2 of <xref target="I-D.salter-ipsecme-sha3" /> for the case of KMAC.
            </t>

            <t> Since it is envisioned that more variable-length output PRFs could appear in future, 
            this specification aims establish a uniform approach for using them in IKEv2.
            This document updates a number of RFCs specified IKEv2 and its extensions for the cases 
            when variable-length output Pseudo-Random Functions are used: <xref target="RFC7296" />,
            <xref target="RFC5723" />, <xref target="RFC6617" />, <xref target="RFC6631" />,
            <xref target="RFC8784" />, <xref target="RFC9370" />, <xref target="RFC9838" /> and <xref target="RFC9867" />.
            </t>
        </section>

        <section anchor="mustshouldmay" title="Terminology and Notation">
            <t> The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", 
            "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted 
            as described in BCP 14 <xref target="RFC2119" /> <xref target="RFC8174" /> when, and only when, 
            they appear in all capitals, as shown here.
            </t>
        </section>

        <section anchor="prfplus" title="Use of Variable-Length Output PRFs in IKEv2">
            <t> When a new pseudo-random function is introduced for use in IKEv2, the corresponding
            document must define whether the pseudo-random function has fixed or variable output length.
            This doesn't affect the process of code point allocation for this prf, but affects
            the way it is used in IKEv2 for the purposes of key derivation.
            </t>

            <t> In particular, when a variable-length output pseudo-random function is negotiated in IKEv2 in the 
            Pseudo-random Function (PRF) transform type, then the following rules have affect.
            </t>

            <ol>
                <li><t> When such a PRF is defined for the use in IKEv2, a preferred key size for this function <bcp14>MUST</bcp14> be specified.
                </t></li>

                <li><t> When such a PRF is used in the context of "prf", then its output length <bcp14>MUST</bcp14> be set
                to the preferred key size of this PRF.
                </t></li>

                <li><t> When such a PRF is used in the context of "prf+", then the prf+ construction <bcp14>MUST NOT</bcp14> be used.
                Instead, the PRF output length <bcp14>MUST</bcp14> be set to the required number of pseudorandom bits in the current context
                and the use of prf+ is replaced with a single call to this PRF. 
                </t></li>

                <li><t> If an API to such a PRF includes additional inputs, like "customization string" in KMAC,
                then these inputs <bcp14>MUST</bcp14> be null (e.g. zero-length string).
                </t></li>
            </ol>
        </section>

        <section anchor="security" title="Security Considerations">
            <t> It is assumed that variable-output length PRFs are cryptographically strong and doesn't decrease
            the entropy of the input key if the output length is at least the size of the key.
            </t>
        </section>

        <section anchor="iana" title="IANA Considerations">
            <t> This specification makes no request to IANA.
            </t>
        </section>

        <section anchor="ack" title="Acknowledgements">
            <t> This document was inspired  by draft-salter-ipsecme-sha3 (Use of SHA-3 in the Internet Key Exchange Protocol Version 2 (IKEv2) and IPsec).
            </t>
        </section>

    </middle>

    <back>
        <references title='Normative References'>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml" ?>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml" ?>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.7296.xml" ?>
        </references>

        <references title='Informative References'>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.5723.xml" ?>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.6617.xml" ?>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.6631.xml" ?>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.8784.xml" ?>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.9370.xml" ?>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.9838.xml" ?>
            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.9867.xml" ?>
            <reference anchor="SP-800-185">
              <front>
                <title>SHA-3 derived functions: cSHAKE, KMAC, TupleHash and ParallelHash</title>
                <author fullname="John Kelsey" initials="J." surname="Kelsey">
                  <organization/>
                </author>
                <author fullname="Shu-jen Change" initials="S." surname="Change">
                  <organization/>
                </author>
                <author fullname="Ray Perlner" initials="R." surname="Perlner">
                  <organization/>
                </author>
                <date month="December" year="2016"/>
              </front>
              <seriesInfo name="DOI" value="10.6028/nist.sp.800-185"/>
            <refcontent>National Institute of Standards and Technology</refcontent>
            </reference>

            <?rfc include="https://xml2rfc.ietf.org/public/rfc/bibxml3/reference.I-D.salter-ipsecme-sha3.xml" ?>
        </references>
    </back>
</rfc>


