<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.31 (Ruby 3.2.3) -->
<?rfc rfcedstyle="yes"?>
<?rfc tocindent="yes"?>
<?rfc strict="yes"?>
<?rfc comments="yes"?>
<?rfc inline="yes"?>
<?rfc text-list-symbols="-o*+"?>
<?rfc docmapping="yes"?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-tls-extended-key-update-09" category="std" consensus="true" submissionType="IETF" updates="9261, 8446" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.31.0 -->
  <front>
    <title abbrev="Extended Key Update for TLS">Extended Key Update for Transport Layer Security (TLS) 1.3</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-tls-extended-key-update-09"/>
    <author initials="H." surname="Tschofenig" fullname="Hannes Tschofenig">
      <organization>Siemens</organization>
      <address>
        <email>hannes.tschofenig@gmx.net</email>
      </address>
    </author>
    <author initials="M." surname="Tüxen" fullname="Michael Tüxen">
      <organization>Münster Univ. of Applied Sciences</organization>
      <address>
        <email>tuexen@fh-muenster.de</email>
      </address>
    </author>
    <author initials="T." surname="Reddy" fullname="Tirumaleswar Reddy">
      <organization>Nokia</organization>
      <address>
        <email>kondtir@gmail.com</email>
      </address>
    </author>
    <author initials="S." surname="Fries" fullname="Steffen Fries">
      <organization>Siemens</organization>
      <address>
        <email>steffen.fries@siemens.com</email>
      </address>
    </author>
    <author initials="Y." surname="Rosomakho" fullname="Yaroslav Rosomakho">
      <organization>Zscaler</organization>
      <address>
        <email>yrosomakho@zscaler.com</email>
      </address>
    </author>
    <date year="2026" month="February" day="19"/>
    <area>Security</area>
    <workgroup>Transport Layer Security</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 77?>

<t>TLS 1.3 ensures forward secrecy by performing an ephemeral Diffie-Hellman key exchange
during the initial handshake, protecting past communications even if a party's
long-term keys (typically a private key with a corresponding certificate) are later compromised. While the built-in KeyUpdate mechanism allows
application traffic keys to be refreshed during a session, it does not incorporate
fresh entropy from a new key exchange and therefore does not provide post-compromise security.
This limitation can pose a security risk in long-lived sessions, such as
those found in industrial IoT or telecommunications environments.</t>
      <t>To address this, this specification defines an extended key update mechanism that
performs a fresh Diffie-Hellman exchange within an active session, thereby
ensuring post-compromise security. By forcing attackers
to exfiltrate new key material repeatedly, this approach mitigates the risks
associated with static key compromise. Regular renewal of session keys helps
contain the impact of such compromises. The extension is applicable to both TLS 1.3
and DTLS 1.3.</t>
    </abstract>
  </front>
  <middle>
    <?line 95?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>The Transport Layer Security (TLS) 1.3 protocol provides forward secrecy by using
an ephemeral Diffie-Hellman (DHE) key exchange during the initial handshake. This
ensures that encrypted communication remains confidential even if an attacker
later obtains a party's long-term private key, protecting against passive adversaries
who record encrypted traffic for later decryption.</t>
      <t>TLS 1.3 also includes a KeyUpdate mechanism that allows traffic keys to be refreshed
during an established session. However, this mechanism does not provide
post-compromise security, as it applies only a key derivation function to the
previous application traffic key as input. While this design is generally sufficient
for short-lived connections, it may present security limitations in scenarios where
sessions persist for extended periods, such as in industrial IoT or telecommunications
systems, where continuous availability is critical and session renegotiation or resumption
is impractical.</t>
      <t>Earlier versions of TLS supported session renegotiation, which allowed peers to negotiate
fresh keying material, including performing new Diffie-Hellman exchanges during the
session lifetime. Due to protocol complexity and known vulnerabilities, renegotiation
was first restricted by <xref target="TLS-RENEGOTIATION"/> and ultimately removed in TLS 1.3. While the
KeyUpdate message was introduced to offer limited rekeying functionality, it does
not fulfill the same cryptographic role as renegotiation and cannot refresh
the TLS main secret and consequently cannot derive new secrets from fresh DHE input.</t>
      <t>Security guidance from national agencies, such as ANSSI (France <xref target="ANSSI"/>), recommends the
periodic renewal of cryptographic keys during long-lived sessions to limit the
impact of key compromise. This approach encourages designs that force an
attacker to perform dynamic key exfiltration, as defined in <xref target="CONFIDENTIALITY"/>. Dynamic
key exfiltration refers to attack scenarios where an adversary must repeatedly
extract fresh keying material to maintain access to protected data, increasing
operational cost and risk for the attacker. In contrast, static key exfiltration,
where the TLS main secret is extracted once and reused, poses a greater long-term
threat, especially when session keys are not refreshed with fresh key exchange input
rather than key derivation.</t>
      <t>This specification defines a TLS extension that introduces an extended key update
mechanism. Unlike the standard key update, this mechanism allows peers to perform a
fresh Diffie-Hellman exchange within an active session using one of the groups
negotiated during the initial handshake. By periodically rerunning (EC)DHE, this
extension enables the derivation of new traffic keys that are independent of
prior key material. As noted in <xref section="F" sectionFormat="of" target="TLS"/>, this
approach mitigates the risk of static key exfiltration and shifts the attacker
burden toward dynamic key exfiltration.</t>
      <t>The proposed extension is applicable to both TLS 1.3 <xref target="TLS"/> and DTLS 1.3  <xref target="DTLS"/>. For clarity,
the term "TLS" is used throughout this document to refer to both protocols unless
otherwise specified.</t>
    </section>
    <section anchor="term">
      <name>Terminology and Requirements Language</name>
      <t>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"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
      <?line -18?>

<t>To distinguish the key update procedure defined in <xref target="TLS"/>
from the key update procedure specified in this document, we use the terms
"standard key update" and "extended key update", respectively.</t>
      <t>In this document, we use the term post-compromise security, as defined in
<xref target="CCG16"/>. We assume that an adversary may obtain
access to the application traffic keys.</t>
      <t>Unless otherwise specified, all references to traffic keys in this document
refer to application traffic keys and because the Extended Key Update procedure
occurs after the handshake phase has completed, no handshake traffic keys
are involved.</t>
      <t>In this document, send key refers to the [sender]_write_key, and receive key
refers to the [receiver]_write_key. These keys are derived from the active
client_application_traffic_secret_N and server_application_traffic_secret_N,
as defined in (D)TLS 1.3 <xref target="TLS"/>, and are replaced with new ones
after each successful Extended Key Update.</t>
    </section>
    <section anchor="negotiating-the-extended-key-update">
      <name>Negotiating the Extended Key Update</name>
      <t>Client and servers use the TLS flags extension
<xref target="TLS-FLAGS"/> to indicate support for the functionality
defined in this document.  We call this flag "Extended_Key_Update"
flag.</t>
      <t>The "Extended_Key_Update" flag proposed by the client in the
ClientHello (CH) <bcp14>MUST</bcp14> be acknowledged in the EncryptedExtensions
(EE), if the server also supports the functionality defined in this
document and is configured to use it.</t>
      <t>If the "Extended_Key_Update" flag is not set, servers ignore any of the
functionality specified in this document and applications that
require post-compromise security will have to initiate a full
handshake.</t>
    </section>
    <section anchor="ext-key-update">
      <name>Extended Key Update Messages</name>
      <t>If the client and server agree to use the extended key update mechanism,
the standard key update <bcp14>MUST NOT</bcp14> be used. In this case, the extended key
update fully replaces the standard key update functionality.</t>
      <t>Implementations that receive a classic <tt>KeyUpdate</tt> message after
successfully negotiating the Extended Key Update functionality <bcp14>MUST</bcp14>
terminate the connection with an <tt>"unexpected_message"</tt> alert.</t>
      <t>The extended key update messages are signaled in a new handshake message named
<tt>ExtendedKeyUpdate</tt> (EKU), with an internal uint8 message subtype indicating its role.
This specification defines three ExtendedKeyUpdate message subtypes:</t>
      <ul spacing="normal">
        <li>
          <t><tt>key_update_request</tt> (0)</t>
        </li>
        <li>
          <t><tt>key_update_response</tt> (1)</t>
        </li>
        <li>
          <t><tt>new_key_update</tt> (2)</t>
        </li>
      </ul>
      <t>New ExtendedKeyUpdate message subtypes are assigned by IANA as described in <xref target="iana-eku-registry"/>.</t>
      <t>A TLS peer which receives a ExtendedKeyUpdate with an unexpected message subtype <bcp14>MUST</bcp14>
abort the connection with an <tt>"unexpected_message"</tt> alert.</t>
      <t>The extended key update process can be initiated by either peer after it has
sent a <tt>Finished</tt> message. Implementations that receive an <tt>ExtendedKeyUpdate</tt>
message prior to the sender having sent <tt>Finished</tt> <bcp14>MUST</bcp14> terminate the connection with
an <tt>"unexpected_message"</tt> alert.</t>
      <t>The <tt>KeyShareEntry</tt> carried in a <tt>key_update_request</tt> and in
a <tt>key_update_response</tt> <bcp14>MUST</bcp14> use the group that was negotiated by the client
and server during the initial handshake. An implementation that receives an
algorithm other than previously negotiated <bcp14>MUST</bcp14> terminate the connection
with an <tt>"illegal_parameter"</tt> alert.</t>
      <t><xref target="fig-key-update"/> shows the interaction graphically. First, support
for the functionality in this specification is negotiated in the
<tt>ClientHello</tt> and the <tt>EncryptedExtensions</tt> messages. Then, the
<tt>ExtendedKeyUpdate</tt> exchange is sent to update the application traffic
secrets.</t>
      <t>The extended key update exchange is performed between the initiator
and the responder; either the TLS client or the TLS server may act
as initiator.</t>
      <figure anchor="fig-key-update">
        <name>Extended Key Update Message Exchange in TLS 1.3.</name>
        <artwork><![CDATA[
       Client                                           Server

Key  ^ ClientHello
Exch | + key_share
     | + signature_algorithms
     v + extended_key_update   -------->
                                                  ServerHello  ^ Key
                                                  + key_share  | Exch
                                                               v
                                        {EncryptedExtensions   ^ Server
                                       + extended_key_update}  | Params
                                         {CertificateRequest}  v
                                                {Certificate}  ^
                                          {CertificateVerify}  | Auth
                                                   {Finished}  v
                               <--------
     ^ {Certificate}
Auth | {CertificateVerify}
     v {Finished}              -------->
       [Application Data]N     <------->  [Application Data]N
                                  ...
  [EKU(key_update_request)]N   -------->
                               <--------  [EKU(key_update_response)]N
      [EKU(new_key_update)]N   -------->
                                  ...
       [Application Data]N+1   <------->  [Application Data]N+1

Legend:

    +   Indicates noteworthy extensions sent in the
    previously noted message.

    -   Indicates optional or situation-dependent
    messages/extensions that are not always sent.

    () Indicates messages protected using keys
    derived from a client_early_traffic_secret.

    {} Indicates messages protected using keys
    derived from a [sender]_handshake_traffic_secret.

    []N Indicates messages protected using keys
    derived from [sender]_application_traffic_secret_N.
]]></artwork>
      </figure>
      <t>The <tt>ExtendedKeyUpdate</tt> wire format is:</t>
      <artwork><![CDATA[
enum {
   key_update_request(0),
   key_update_response(1),
   new_key_update(2),
   (255)
} ExtendedKeyUpdateType;

struct {
   ExtendedKeyUpdateType eku_type;
   select (eku_type) {
      case key_update_request: {
          KeyShareEntry key_share;
      }
      case key_update_response: {
          KeyShareEntry key_share;
      }
      case new_key_update: {
          /* empty */
      }
   };
} ExtendedKeyUpdate;
]]></artwork>
      <t>Fields:</t>
      <ul spacing="normal">
        <li>
          <t><tt>eku_type</tt>: the subtype of the <tt>ExtendedKeyUpdate</tt> message.</t>
        </li>
        <li>
          <t><tt>key_share</tt>: key share information. The contents of this field is
determined by the specified group and its corresponding definition
(see <xref section="4.2.8" sectionFormat="of" target="TLS"/>).</t>
        </li>
      </ul>
    </section>
    <section anchor="TLSC">
      <name>TLS 1.3 Considerations</name>
      <t>The following steps are taken by a TLS 1.3 implementation; the steps
executed with DTLS 1.3 differ slightly.</t>
      <ol spacing="normal" type="1"><li>
          <t>The initiator sends <tt>ExtendedKeyUpdate(key_update_request)</tt> carrying a
<tt>KeyShareEntry</tt>. While an extended key update is in progress, the
initiator <bcp14>MUST NOT</bcp14> initiate another key update.</t>
        </li>
        <li>
          <t>Upon receipt, the responder sends its own <tt>KeyShareEntry</tt> in a
<tt>ExtendedKeyUpdate(key_update_response)</tt> message. While an extended
key update is in progress, the responder <bcp14>MUST NOT</bcp14> initiate another
key update. The responder <bcp14>MAY</bcp14> defer sending a response if system load or resource
constraints prevent immediate processing. In such cases, the response <bcp14>MUST</bcp14>
be sent once sufficient resources become available.</t>
        </li>
        <li>
          <t>After the responder sends <tt>ExtendedKeyUpdate(key_update_response)</tt> it
<bcp14>MUST</bcp14> update its send keys.</t>
        </li>
        <li>
          <t>Upon receipt of an <tt>ExtendedKeyUpdate(key_update_response)</tt> the initiator
derives the new secrets from the exchanged key shares. The initiator then updates
its receive keys and sends an empty ExtendedKeyUpdate(new_key_update) message to
complete the process. The initiator <bcp14>MUST NOT</bcp14> defer derivation of the secrets and
sending the ExtendedKeyUpdate(new_key_update) message as it would stall the
communication.</t>
        </li>
        <li>
          <t>After sending <tt>ExtendedKeyUpdate(new_key_update)</tt> initiator <bcp14>MUST</bcp14> update its
send keys.</t>
        </li>
        <li>
          <t>After receiving the initiator’s <tt>ExtendedKeyUpdate(new_key_update)</tt>,
the responder <bcp14>MUST</bcp14> update its receive keys.</t>
        </li>
      </ol>
      <t>Both initiator and responder <bcp14>MUST</bcp14> encrypt their <tt>ExtendedKeyUpdate</tt> messages
with the old keys. Responder <bcp14>MUST</bcp14> ensure that the <tt>ExtendedKeyUpdate(new_key_update)</tt>
encrypted with the old key is received before accepting any messages encrypted with
the new key.</t>
      <t>If TLS peers independently initiate the extended key update and the
requests cross in flight, the <tt>ExtendedKeyUpdate(key_update_request)</tt> with the
lower lexicographic order of the <tt>key_exchange</tt> value in
<tt>KeyShareEntry</tt> <bcp14>MUST</bcp14> be ignored. This prevents each
side from advancing keys by two generations. If the tie-break comparison yields
equality (an event that should be impossible for genuine
asymmetric key pairs), the endpoint <bcp14>MUST</bcp14> treat this as a protocol violation,
send an "unexpected_message" alert, and close the connection.</t>
      <t>The handshake framing uses a single <tt>HandshakeType</tt> for this message
(see <xref target="fig-handshake"/>).</t>
      <figure anchor="fig-handshake">
        <name>TLS 1.3 Handshake Structure.</name>
        <artwork><![CDATA[
      struct {
          HandshakeType msg_type;    /* handshake type */
          uint24 length;             /* bytes in message */
          select (Handshake.msg_type) {
              case client_hello:          ClientHello;
              case server_hello:          ServerHello;
              case end_of_early_data:     EndOfEarlyData;
              case encrypted_extensions:  EncryptedExtensions;
              case certificate_request:   CertificateRequest;
              case certificate:           Certificate;
              case certificate_verify:    CertificateVerify;
              case finished:              Finished;
              case new_session_ticket:    NewSessionTicket;
              case key_update:            KeyUpdate;
              case extended_key_update:   ExtendedKeyUpdate;
          };
      } Handshake;
]]></artwork>
      </figure>
      <section anchor="tls-13-extended-key-update-example">
        <name>TLS 1.3 Extended Key Update Example</name>
        <t>While <xref target="fig-key-update"/> shows the high-level interaction between a
TLS 1.3 client and server, this section shows an example message exchange
with information about the updated keys added.</t>
        <t>There are two phases:</t>
        <ol spacing="normal" type="1"><li>
            <t>The support for the functionality in this specification
is negotiated in the ClientHello and the EncryptedExtensions
messages.</t>
          </li>
          <li>
            <t>Once the initial handshake is completed, a key update can be
triggered.</t>
          </li>
        </ol>
        <t><xref target="fig-key-update2"/> provides an overview of the exchange starting
with the initial negotiation followed by the key update.</t>
        <figure anchor="fig-key-update2">
          <name>Extended Key Update Example.</name>
          <artwork><![CDATA[
       Client                                           Server

Key  ^ ClientHello
Exch | + key_share
     | + signature_algorithms
     v + extended_key_update
                             -------->
                                                  ServerHello  ^ Key
                                                  + key_share  | Exch
                                                               v
                                        {EncryptedExtensions   ^ Server
                                       + extended_key_update}  | Params
                                         {CertificateRequest}  v
                                                {Certificate}  ^
                                          {CertificateVerify}  | Auth
                                                   {Finished}  v
                               <--------
     ^ {Certificate}
Auth | {CertificateVerify}
     v {Finished}              -------->
                                  ...
                              some time later
                                  ...
 [EKU(key_update_request       -------->
       (with key_share))]
                               <-------- [EKU(key_update_response
                                           (with key_share))]
                                        # Server derives new secrets
                                        # and updates SEND keys here
# Client derives new secrets
# and updates RECEIVE keys here
        [EKU(new_key_update)]  -------->
# Client updates SEND keys here
                                    # Server updates RECEIVE keys here
]]></artwork>
        </figure>
      </section>
    </section>
    <section anchor="DTLSC">
      <name>DTLS 1.3 Considerations</name>
      <t>Unlike TLS 1.3, DTLS 1.3 implementations must take into account that handshake
messages are not transmitted over a reliable transport protocol.</t>
      <t>EKU messages <bcp14>MUST</bcp14> be transmitted reliably, like other DTLS handshake messages. If necessary, EKU messages <bcp14>MAY</bcp14> be fragmented as described in <xref section="5.5" sectionFormat="of" target="DTLS"/>.
Due to the possibility of an <tt>ExtendedKeyUpdate</tt> messages being
lost and thereby preventing the sender of that message from updating its keying
material, receivers <bcp14>MUST</bcp14> retain the pre-update keying material until receipt
and successful decryption of a message using the new keys.</t>
      <t>Due to packet loss and/or reordering, DTLS 1.3 peers <bcp14>MAY</bcp14> receive records from an
earlier epoch. If the necessary keys are available, implementations <bcp14>SHOULD</bcp14> attempt
to process such records; however, they <bcp14>MAY</bcp14> choose to discard them. The exchange
has the following steps:</t>
      <ol spacing="normal" type="1"><li>
          <t>The initiator sends an <tt>ExtendedKeyUpdate(key_update_request)</tt> message, which contains a
key share. While an extended key update is in progress, the initiator <bcp14>MUST NOT</bcp14>
initiate further key updates. This message is subject to DTLS handshake
retransmission, but delivery is only confirmed when the initiator either receives the
corresponding <tt>ExtendedKeyUpdate(key_update_response)</tt> or an ACK.</t>
        </li>
        <li>
          <t>Upon receipt, the responder sends its own <tt>KeyShareEntry</tt> in a
<tt>ExtendedKeyUpdate(key_update_response)</tt> message. While an extended key update
is in progress, the responder <bcp14>MUST NOT</bcp14> initiate further key updates. The responder <bcp14>MAY</bcp14> defer
sending a response if system load or resource constraints prevent immediate processing.
In such cases, the responder <bcp14>MUST</bcp14> acknowledge receipt of the key_update_request with an ACK and, once
sufficient resources become available, retransmit the key_update_response until it is acknowledged by the
initiator.</t>
        </li>
        <li>
          <t>On receipt of <tt>ExtendedKeyUpdate(key_update_response)</tt> the initiator derives a secret key based on the
exchanged key shares. This message also serves as an implicit acknowledgment of the
initiator's <tt>ExtendedKeyUpdate(key_update_request)</tt>, so no separate ACK is required. The initiator <bcp14>MUST</bcp14>
update its receive keys and epoch value. The initiator <bcp14>MUST NOT</bcp14> defer derivation of the secrets.</t>
        </li>
        <li>
          <t>The initiator transmits an <tt>ExtendedKeyUpdate(new_key_update)</tt> message. This message is subject to DTLS
retransmission until acknowledged.</t>
        </li>
        <li>
          <t>The responder <bcp14>MUST</bcp14> acknowledge the received message by sending an ACK message.</t>
        </li>
        <li>
          <t>After the responder receives the initiator's <tt>ExtendedKeyUpdate(new_key_update)</tt>,
the responder <bcp14>MUST</bcp14> update its send key and epoch value. With the receipt of
that message, the responder <bcp14>MUST</bcp14> also update its receive keys.</t>
        </li>
        <li>
          <t>On receipt of the ACK message, the initiator updates its send key and epoch
value. If this ACK is not received, the initiator re-transmits its
<tt>ExtendedKeyUpdate(new_key_update)</tt> until ACK is received. The key update is
complete once this ACK is processed by the initiator.</t>
        </li>
      </ol>
      <t>The handshake framing uses a single <tt>HandshakeType</tt> for this message
(see <xref target="fig-dtls-handshake"/>).</t>
      <figure anchor="fig-dtls-handshake">
        <name>DTLS 1.3 Handshake Structure.</name>
        <artwork><![CDATA[
       enum {
           client_hello(1),
           server_hello(2),
           new_session_ticket(4),
           end_of_early_data(5),
           encrypted_extensions(8),
           request_connection_id(9),
           new_connection_id(10),
           certificate(11),
           certificate_request(13),
           certificate_verify(15),
           finished(20),
           key_update(24),
           extended_key_update(TBD),  /* new */
           message_hash(254),
           (255)
       } HandshakeType;

       struct {
           HandshakeType msg_type;    /* handshake type */
           uint24 length;             /* bytes in message */
           uint16 message_seq;        /* DTLS-required field */
           uint24 fragment_offset;    /* DTLS-required field */
           uint24 fragment_length;    /* DTLS-required field */
           select (msg_type) {
               case client_hello:          ClientHello;
               case server_hello:          ServerHello;
               case end_of_early_data:     EndOfEarlyData;
               case encrypted_extensions:  EncryptedExtensions;
               case certificate_request:   CertificateRequest;
               case certificate:           Certificate;
               case certificate_verify:    CertificateVerify;
               case finished:              Finished;
               case new_session_ticket:    NewSessionTicket;
               case key_update:            KeyUpdate;
               case extended_key_update:   ExtendedKeyUpdate;
               case request_connection_id: RequestConnectionId;
               case new_connection_id:     NewConnectionId;
           } body;
       } DTLSHandshake;
]]></artwork>
      </figure>
      <section anchor="dtls-13-extended-key-update-example">
        <name>DTLS 1.3 Extended Key Update Example</name>
        <t>The following example illustrates a successful extended key update,
including how the epochs change during the exchange.</t>
        <figure anchor="dtls-key-update">
          <name>Example DTLS 1.3 Extended Key Update: Message Exchange.</name>
          <artwork><![CDATA[
Client                            Server
(Initiator)                       (Responder)

  /---------------------------------------\
 |           Initial Handshake             |
  \---------------------------------------/

[C: tx=3, rx=3]                   [S: tx=3, rx=3]
[Application Data]               -------->
[C: tx=3, rx=3]                   [S: tx=3, rx=3]

[C: tx=3, rx=3]                   [S: tx=3, rx=3]
                                  <--------   [Application Data]
[C: tx=3, rx=3]                   [S: tx=3, rx=3]

  /---------------------------------------\
 |           Some time later ...           |
  \---------------------------------------/

[C: tx=3, rx=3]                   [S: tx=3, rx=3]
[EKU(key_update_request)]  -------->
                                  # no epoch change yet

                           <-------- [EKU(key_update_response)]
# Sent under OLD epoch. Server does NOT bump yet.

# Step 3: initiator bumps RECEIVE epoch on
# receiving key update response-in:
# (rx:=rx+1; tx still old)
[C: tx=3, rx=4]                   [S: tx=3, rx=3]

[EKU(new_key_update)]      -------->
# Sender's NKU is tagged with OLD tx (3).

# Epoch switch point:
# Step 6: responder bumps BOTH tx and rx on NKU-in:
[C: tx=3, rx=4]                   [S: tx=4, rx=4]

                           <-------- [ACK] (tag=new)

# Step 7: initiator bumps SEND epoch on ACK-in:
[C: tx=4, rx=4]                   [S: tx=4, rx=4]

[Application Data]         -------->
[C: tx=4, rx=4]                   [S: tx=4, rx=4]

                           <--------   [Application Data]
[C: tx=4, rx=4]                   [S: tx=4, rx=4]
]]></artwork>
        </figure>
        <t><xref target="dtls-table"/> shows the steps, the message in flight, and the epoch changes on both sides.
The A/B -&gt; X/Y notation indicates the change of epoch values for tx/rx before and after
the message transmission.</t>
        <figure anchor="dtls-table">
          <name>Example DTLS 1.3 Extended Key Update: Epoch Changes.</name>
          <artwork><![CDATA[
+--------------------+----------------+--------------+
| Message            | Client tx/rx   | Server tx/rx |
+--------------------+----------------+--------------+
| APP ------------>  | 3/3 -> 3/3     | 3/3 -> 3/3   |
| <------------ APP  | 3/3 -> 3/3     | 3/3 -> 3/3   |
| req -------------> | 3/3 -> 3/3     | 3/3 -> 3/3   |
| <------------ resp | 3/3 -> 3/4     | 3/3 -> 3/3   | <- step 3
| NKU  ------------> | 3/4 -> 3/4     | 3/3 -> 4/4   | <- step 6
| <------------- ACK | 3/4 -> 4/4     | 4/4 -> 4/4   | <- step 7
| APP -------------> | 4/4 -> 4/4     | 4/4 -> 4/4   |
| <------------- APP | 4/4 -> 4/4     | 4/4 -> 4/4   |
+--------------------+----------------+--------------+
]]></artwork>
        </figure>
      </section>
    </section>
    <section anchor="key_update">
      <name>Updating Traffic Keys</name>
      <t>When the extended key update message exchange is completed both peers
have successfully updated their application traffic keys. The
key derivation function described in this document is used to perform
this update.</t>
      <t>The design of the key derivation function for computing the next
generation of application_traffic_secret is motivated by the desire
to include</t>
      <ul spacing="normal">
        <li>
          <t>a secret derived from the (EC)DHE exchange (or from the hybrid
key exchange / PQ-KEM exchange),</t>
        </li>
        <li>
          <t>a secret that allows the new key exchange to be cryptographically
bound to the previously established secret,</t>
        </li>
        <li>
          <t>a transcript hash that is updated after each Extended Key Update exchange
by hashing together the previous transcript hash value and the current
ExtendedKeyUpdate(key_update_request) and ExtendedKeyUpdate(key_update_response)
messages, which contain the key shares, thereby binding the encapsulated shared
secret ciphertext to the IKM in the case of PQ/T hybrid or PQC key exchange and
cryptographically binding the newly derived secrets to the prior handshake
transcript and all preceding EKU exchanges, as well as to the current EKU
exchange, and</t>
        </li>
        <li>
          <t>new label strings to distinguish it from the key derivation used in
TLS 1.3.</t>
        </li>
      </ul>
      <t>The transcript_hash_N denotes the transcript hash value associated with
generation N. During each Extended Key Update exchange, the transcript
hash value for the next generation is computed as follows:</t>
      <artwork><![CDATA[
 transcript_hash_N+1 = Transcript-Hash(transcript_hash_N ||
                                       EKU(key_update_request) ||
                                       EKU(key_update_response))
]]></artwork>
      <t>Once transcript_hash_N+1 has been computed, transcript_hash_N can be deleted.
No prior transcript hash values need to be retained for future EKU exchanges.
transcript_hash_0 denotes the transcript hash of the initial TLS handshake,
covering all messages from the ClientHello up to and including the
client Finished message.</t>
      <t>The following diagram shows the key derivation hierarchy.</t>
      <artwork><![CDATA[

       Main Secret N
             |
             v
       Derive-Secret(., "derived", "")
             |
             v
 (EC)DHE -> HKDF-Extract = Main Secret N+1
             |
             +-----> Derive-Secret(., "c ap traffic",
             |                     transcript_hash_N+1)
             |                = client_application_traffic_secret_N+1
             |
             +-----> Derive-Secret(., "s ap traffic",
             |                     transcript_hash_N+1)
             |                = server_application_traffic_secret_N+1
             |
             +-----> Derive-Secret(., "exp master",
             |                     transcript_hash_N+1)
             |                = exporter_secret_N+1
             |
             +-----> Derive-Secret(., "res master",
             |                     transcript_hash_N+1)
                              = resumption_main_secret_N+1
]]></artwork>
      <t>During the initial handshake, the Main Secret is generated (see
<xref section="7.1" sectionFormat="of" target="TLS"/>). Since the Main Secret
is discarded during the key derivation procedure, a derived value is
stored. This stored value then serves as the input salt to the first
key update procedure that incorporates the ephemeral (EC)DHE-
established value as input keying material (IKM) to produce
main_secret_{N+1}. The derived value from this new master secret
serves as input salt to the subsequent key update procedure, which
also incorporates a fresh ephemeral (EC)DHE value as IKM. This
process is repeated for each additional key update procedure.</t>
      <t>The traffic keys are re-derived from
client_application_traffic_secret_N+1 and
server_application_traffic_secret_N+1, as described in
<xref section="7.3" sectionFormat="of" target="TLS"/>.</t>
      <t>Once client_/server_application_traffic_secret_N+1 and its associated
traffic keys have been computed, implementations <bcp14>SHOULD</bcp14> delete
client_/server_application_traffic_secret_N and its associated
traffic keys as soon as possible. Note: The
client_/server_application_traffic_secret_N and its associated
traffic keys can only be deleted by the responder after receiving the
<tt>ExtendedKeyUpdate(new_key_update)</tt> message.</t>
      <t>Once client_/server_application_traffic_secret_N+1 and the corresponding traffic
keys are in use, all subsequent records, including alerts and post-handshake
messages <bcp14>MUST</bcp14> be protected using those keys.</t>
      <t>When using this extension, it is important to consider its interaction with
ticket-based session resumption. If resumption occurs without a new (EC)DH
exchange that provides forward secrecy, an attacker could potentially revert
the security context to an earlier state, thereby negating the benefits of
the extended key update. To preserve the security guarantees provided by key
updates, endpoints <bcp14>MUST</bcp14> either invalidate any session tickets issued prior
to the key update or ensure that resumption always involves a fresh (EC)DH
exchange.</t>
      <t>If session tickets cannot be stored securely, developers <bcp14>SHOULD</bcp14> consider
disabling ticket-based resumption in their deployments. While this approach
may impact performance, it provides improved security properties.</t>
    </section>
    <section anchor="post-quantum-cryptography-considerations">
      <name>Post-Quantum Cryptography Considerations</name>
      <t>Hybrid key exchange refers to the simultaneous use of multiple key
exchange algorithms, with the resulting shared secret derived by
combining the outputs of each. The goal of this approach is to maintain
security even if all but one of the component algorithms are later found
to be vulnerable.</t>
      <t>The transition to post-quantum cryptography has motivated the adoption of
hybrid key exchanges in TLS, as described in
<xref target="TLS-HYBRID"/>. Specific hybrid groups
have been registered in <xref target="TLS-ECDHE-MLKEM"/>.
When hybrid key exchange is used, the <tt>key_exchange</tt> field of each
<tt>KeyShareEntry</tt> in the initial handshake is formed by concatenating
the <tt>key_exchange</tt> fields of the constituent algorithms. This same
approach is reused during the Extended Key Update, when new key
shares are exchanged.</t>
      <t>The specification in <xref target="TLS-MLKEM"/> registers the lattice-based
ML-KEM algorithm and its variants, such as ML-KEM-512, ML-KEM-768 and
ML-KEM-1024. The KEM encapsulation key or KEM ciphertext is represented
as a 'KeyShareEntry' field. This same approach is reused during the
Extended Key Update, when new key shares are exchanged.</t>
    </section>
    <section anchor="sslkeylogfile-update">
      <name>SSLKEYLOGFILE Update</name>
      <t>As a successful extended key update exchange invalidates previous secrets,
SSLKEYLOGFILE <xref target="TLS-KEYLOGFILE"/> needs to be populated with new
entries. As a result, two additional secret labels are utilized in the
SSLKEYLOGFILE:</t>
      <ol spacing="normal" type="1"><li>
          <t><tt>CLIENT_TRAFFIC_SECRET_N+1</tt>: identifies the
client_application_traffic_secret_N+1 in the key schedule</t>
        </li>
        <li>
          <t><tt>SERVER_TRAFFIC_SECRET_N+1</tt>: identifies the
server_application_traffic_secret_N+1 in the key schedule</t>
        </li>
        <li>
          <t><tt>EXPORTER_SECRET_N+1</tt>: identifies the
exporter_secret_N+1 in the key schedule</t>
        </li>
      </ol>
      <t>Similar to other entries in the SSLKEYLOGFILE, the label is followed by the
32-byte value of the Random field from the ClientHello message that
established the TLS connection, and the corresponding secret encoded in
hexadecimal.</t>
      <t>SSLKEYLOGFILE entries for the extended key update <bcp14>MUST NOT</bcp14> be produced if
SSLKEYLOGFILE was not used for other secrets in the handshake.</t>
      <t>Note that each successful Extended Key Update invalidates all previous
SSLKEYLOGFILE secrets including past iterations of <tt>CLIENT_TRAFFIC_SECRET_</tt>,
<tt>SERVER_TRAFFIC_SECRET_</tt> and <tt>EXPORTER_SECRET_</tt>.</t>
    </section>
    <section anchor="exporter">
      <name>Exporter</name>
      <section anchor="post-compromise-security-for-the-initial-exporter-secret">
        <name>Post-Compromise Security for the Initial Exporter Secret</name>
        <t>The TLS 1.3 Key Schedule, see Figure 5 of <xref target="TLS"/>, derives the exporter_secret from the main secret. This
exporter_secret is static for the lifetime of the connection and is not updated by a standard key update.</t>
        <t>A core design goal of this specification is not met if the exporter_secret does not change.
Therefore, this document defines an exporter interface that derives a fresh exporter secret
whenever new application traffic keys are updated through the EKU.</t>
        <t>If the initial exporter secret for this new interface were identical to exporter_secret,
then compromising exporter_secret at any point during the lifetime of the connection
would enable an attacker to recompute all exporter outputs derived from it.
This would break post-compromise security for exported keying material.</t>
        <t>Therefore, the initial exporter secret used by the exporter interface defined in
this document, i.e., the exporter output available prior to the first Extended
Key Update, <bcp14>MUST</bcp14> be distinct from the exporter_secret. This separation
ensures that compromise of the TLS exporter interface does not compromise outputs
derived from the exporter interface defined in this document.</t>
        <t>Prior to the first Extended Key Update, the exporter interface provides an
initial exporter secret, denoted exporter_secret_0. This secret is derived
from the TLS main secret and the handshake transcript, but is cryptographically
independent of the TLS exporter_secret. It is computed as follows:</t>
        <artwork><![CDATA[
exporter_secret_0 =
Derive-Secret(Main Secret,
"exporter eku",
Transcript-Hash(ClientHello..server Finished))
]]></artwork>
        <t>Applications that require post-compromise security <bcp14>MUST</bcp14> use the exporter
interface defined in this document. This exporter interface is independent of
the TLS exporter defined in <xref section="7.5" sectionFormat="of" target="TLS"/>, which continues to use a
static <tt>exporter_secret</tt> for the lifetime of the connection for compatiblity with "legacy" applications.</t>
      </section>
      <section anchor="exporter-usage-after-extended-key-update">
        <name>Exporter Usage After Extended Key Update</name>
        <t>Protocols such as DTLS-SRTP and DTLS-over-SCTP rely on TLS or DTLS for
key establishment, but reuse portions of the derived keying material for
their own specific purposes. These protocols use the TLS exporter defined
in <xref section="7.5" sectionFormat="of" target="TLS"/>. Exporters are also used for deriving
authentication related values such as nonces, as described in <xref target="RFC9729"/>.</t>
        <t>Once the Extended Key Update mechanism is complete, such protocols would
need to use the newly derived exporter secret to generate Exported Keying Material
(EKM) to protect packets. The "sk" derived in the <xref target="key_update"/> will be
used as the "Secret" in the exporter function, defined in
<xref section="7.5" sectionFormat="of" target="TLS"/>, to generate EKM, ensuring that
the exported keying material is aligned with the updated security context.
The newly derived exporter secret is cryptographically independent of
previous exporter secrets.</t>
        <t>When a new exporter secret becomes active following a successful Extended
Key Update, the TLS or DTLS implementation would have to provide an
asynchronous notification to the application indicating that:</t>
        <ul spacing="normal">
          <li>
            <t>A new epoch has become active, and the (D)TLS implementation can
include the corresponding epoch identifier. Applications receiving an
epoch identifier can use it to request keying material for that
specific epoch through an epoch-aware exporter interface.
In TLS, this identifier represents a local logical counter that may differ between peers.</t>
          </li>
        </ul>
        <t>Applications are notified that a new epoch is active only after both peers have completed
the Extended Key Update exchange and switched to the new traffic keys.</t>
        <ul spacing="normal">
          <li>
            <t>In TLS, the initiator triggers notification after Step 5 in <xref target="TLSC"/>,
and the responder triggers notification after Step 4 in <xref target="TLSC"/>.</t>
          </li>
          <li>
            <t>In DTLS, the initiator triggers notification to the application
after Step 7 in <xref target="DTLSC"/>, and the responder triggers notification
after Step 9 in <xref target="DTLSC"/>.</t>
          </li>
        </ul>
        <t>The corresponding EKM is obtained by the application through the TLS/DTLS exporter
interface using its chosen label and context values as defined in <xref section="4" sectionFormat="of" target="RFC5705"/>.</t>
        <t>To prevent desynchronization, the application will have to retain both the
previous and the newly derived exporter secrets for a short period. For TLS,
the previous exporter secret would be discarded once data derived from the
new exporter has been successfully processed, and no records protected with
the old exporter secret are expected to arrive. For DTLS, the previous exporter
secret needs to be retained until the retention timer expires for the prior epoch,
to allow for processing of packets that may arrive out of order.  The retention policy
for exporter secrets is application-specific. For example, in DTLS-SRTP,
the application might retain the previous exporter secret until its
replay window no longer accepts packets protected with keys derived from that
secret, as described in Section 3.3.2 of <xref target="RFC3711"/>.</t>
      </section>
    </section>
    <section anchor="exported">
      <name>Use of Post-Handshake Authentication and Exported Authenticators with Extended Key Update</name>
      <t>EKU provides fresh traffic secrets, but EKU alone does not authenticate that both endpoints
derived the same updated keys. An attacker that temporarily compromises an endpoint
may later act as an active MitM capable of interfering with the EKU exchange.
Such an attacker can cause the peers to transition to divergent traffic secrets without detection,
but cannot compromise the endpoint to derive secrets after the new epoch is established.
To confirm that both peers transitioned to the same new key state, TLS 1.3 provides two
mechanisms: Post-Handshake Certificate-Based Client Authentication and
Exported Authenticators <xref target="RFC9261"/>.</t>
      <section anchor="post-handshake-certificate-based-client-authentication">
        <name>Post-Handshake Certificate-Based Client Authentication</name>
        <t>When Post-Handshake Certificate-Based Client Authentication (Section 4.6.2 of <xref target="TLS"/>) is
performed after an Extended Key Update (EKU) is complete, the Handshake Context used for
the transcript hash is updated. It consists of transcript_hash_N+1 concatenated
with the CertificateRequest message. The Finished message is computed using a
MAC key derived from the Base Key of the new epoch (client_application_traffic_secret_N+1).
This confirms that both peers are operating with the same updated traffic keys
and completes an authenticated transition after the EKU.</t>
        <t>To prevent cryptographic state ambiguity, the following constraints apply:</t>
        <ul spacing="normal">
          <li>
            <t>A TLS server <bcp14>MUST NOT</bcp14> initiate a post-handshake CertificateRequest while an EKU
exchange is in progress.</t>
          </li>
          <li>
            <t>If a CertificateRequest has been sent but the corresponding Finished message has not
yet been received, the peers <bcp14>MUST NOT</bcp14> initiate an EKU exchange.</t>
          </li>
        </ul>
      </section>
      <section anchor="exported-authenticators">
        <name>Exported Authenticators</name>
        <t>This document updates Section 5.1 of <xref target="RFC9261"/> to specify that, after an
Extended Key Update has completed, the Handshake Context and Finished MAC Key used for
Exported Authenticators <bcp14>MUST</bcp14> be derived from the exporter secret associated with the current epoch.
Implementations that support the epoch-aware Exported Authenticators interface <bcp14>MUST</bcp14> provide a means
for applications to request the generation or validation of Exported Authenticators using
the exporter secret for a specific epoch.</t>
        <t>The Handshake Context and Finished MAC Key used in both the CertificateVerify message
(Section 5.2.2 of <xref target="RFC9261"/>) and the Finished message (Section 5.2.3 of <xref target="RFC9261"/>)
are derived from the exporter secret associated with the current epoch.
If a MitM interferes with the EKU exchange and causes the peers to derive different traffic
and exporter secrets, their Handshake Contexts and Finished MAC Keys will differ.
As a result, validation procedures specified in Section 5.2.4 of <xref target="RFC9261"/> will fail, thereby
detecting the divergence of key state between peers.</t>
        <t>A new optional API <bcp14>SHOULD</bcp14> be defined to permit applications to request or verify
Exported Authenticators for a specific exporter epoch. As discussed in Section 7
of <xref target="RFC9261"/>, this can, as an exception, be implemented at the application
layer when the epoch-aware TLS exporter is available. The APIs defined in <xref target="RFC9261"/>
remain unchanged, so existing applications continue to operate without
modification. The epoch-aware API accepts an epoch identifier; when present,
the (D)TLS implementation <bcp14>MUST</bcp14> derive the Handshake Context and Finished MAC Key
from the exporter secret associated with that epoch. When Exported Authenticators
are generated using the epoch-aware Exported Authenticators interface, the
epoch identifier used for their derivation can be conveyed in the
certificate_request_context field, allowing the peer, particularly in
DTLS where records may be reordered, to determine the correct exporter
secret for validation.</t>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>This section discusses additional security and operational aspects introduced by the Extended Key Update mechanism. All security considerations of TLS 1.3 <xref target="TLS"/> and DTLS.13 <xref target="DTLS"/> continue to apply.</t>
      <section anchor="scope">
        <name>Scope of Key Compromise</name>
        <t>Extended Key Update assumes a transient compromise of the current application
traffic keys, not a persistent attacker with ongoing access to key material.
The procedure itself does not rely on long-term private keys; those are assumed
to remain secure, as they are typically stored in a secure element, such as a
Trusted Execution Environment (TEE), Hardware Security Module (HSM),
or Trusted Platform Module (TPM). In contrast, application traffic
keys are stored within the rich operating system, where short-term exposure due
to memory disclosure or transient compromise may occur. Post-compromise security
can be re-established, provided the compromise is no longer active when an
Extended Key Update is performed.</t>
        <t>Extended Key Update can restore confidentiality only if the attacker no longer
has access to either peer. If an adversary retains access to current application traffic
keys and can act as a man-in-the-middle during the Extended Key Update, then the
update cannot restore security unless <xref target="exported"/> is used.</t>
        <t>If one of the mechanisms defined in <xref target="exported"/> is not used, the attacker can
impersonate each endpoint, substitute EKU messages, and maintain control
of the communication. When Post-handshake Certificate-Based Client Authentication
or the modified Exported Authenticator mechanism is used, the authentication messages
are bound to the keys established after the EKU. Any modification or substitution of
EKU messages therefore becomes detectable, preventing this attack.</t>
        <t>If a compromise occurs before the handshake completes, the ephemeral key exchange,
client_handshake_traffic_secret, server_handshake_traffic_secret, and the initial
client_/server_application_traffic_secret could be exposed. In that case, only the
initial handshake messages and the application data encrypted under the initial
client_/server_application_traffic_secret can be decrypted until the Extended Key
Update procedure completes. The Extended Key Update procedure derives fresh
application_traffic_secrets from a new ephemeral key exchange, ensuring that all
subsequent application data remains confidential.</t>
      </section>
      <section anchor="post-compromise-security">
        <name>Post-Compromise Security</name>
        <t>Extended Key Update provides post-compromise security for long-lived TLS sessions.
To ensure post-compromise security guarantees:</t>
        <ul spacing="normal">
          <li>
            <t>Each update <bcp14>MUST</bcp14> use freshly generated ephemeral key-exchange material. Implementations <bcp14>MUST NOT</bcp14> reuse
ephemeral key-exchange material across updates or across TLS sessions.</t>
          </li>
        </ul>
      </section>
      <section anchor="denial-of-service-dos">
        <name>Denial-of-Service (DoS)</name>
        <t>The Extended Key Update mechanism increases computational and state-management overhead. A malicious peer could attempt to exhaust CPU or memory resources by initiating excessive update requests.</t>
        <t>Implementations <bcp14>SHOULD</bcp14> apply the following mitigations:</t>
        <ul spacing="normal">
          <li>
            <t>Limit the frequency of accepted Extended Key Update requests per session.</t>
          </li>
          <li>
            <t>A peer that has sent an Extended Key Update <bcp14>MUST NOT</bcp14> initiate another until the previous update completes.
If a peer violates this rule, the receiving peer <bcp14>MUST</bcp14> treat it as a protocol violation, send an "unexpected_message" alert, and terminate the connection.</t>
          </li>
        </ul>
      </section>
      <section anchor="operational-guidance">
        <name>Operational Guidance</name>
        <t>Deployments <bcp14>SHOULD</bcp14> evaluate Extended Key Update performance under load and fault conditions, such as high-frequency or concurrent updates. TLS policies <bcp14>SHOULD</bcp14> define explicit rate limits that balance post-compromise security benefits against potential DoS exposure.</t>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <section anchor="tls-flags">
        <name>TLS Flags</name>
        <t>IANA is requested to add the following entry to the "TLS Flags"
extension registry <xref target="TLS-Ext-Registry"/>:</t>
        <ul spacing="normal">
          <li>
            <t>Value: TBD1</t>
          </li>
          <li>
            <t>Flag Name: extended_key_update</t>
          </li>
          <li>
            <t>Messages: CH, EE</t>
          </li>
          <li>
            <t>Recommended: Y</t>
          </li>
          <li>
            <t>Reference: [This document]</t>
          </li>
        </ul>
      </section>
      <section anchor="tls-handshaketype">
        <name>TLS HandshakeType</name>
        <t>IANA is requested to add the following entry to the "TLS HandshakeType"
registry <xref target="TLS-Ext-Registry"/>:</t>
        <ul spacing="normal">
          <li>
            <t>Value: TBD2</t>
          </li>
          <li>
            <t>Description: extended_key_update</t>
          </li>
          <li>
            <t>DTLS-OK: Y</t>
          </li>
          <li>
            <t>Reference: [This document]</t>
          </li>
        </ul>
      </section>
      <section anchor="iana-eku-registry">
        <name>ExtendedKeyUpdate Message Subtypes Registry</name>
        <t>IANA is requested to create a new registry "TLS ExtendedKeyUpdate Message Subtypes", within the
existing "Transport Layer Security (TLS) Parameters" registry <xref target="TLS-Ext-Registry"/>.
This new registry reserves types used for Extended Key Update entries.
The initial contents of this registry are as follows.</t>
        <table>
          <thead>
            <tr>
              <th align="left">Value</th>
              <th align="left">Description</th>
              <th align="left">DTLS-OK</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">0</td>
              <td align="left">key_update_request</td>
              <td align="left">Y</td>
              <td align="left">This document</td>
            </tr>
            <tr>
              <td align="left">1</td>
              <td align="left">key_update_response</td>
              <td align="left">Y</td>
              <td align="left">This document</td>
            </tr>
            <tr>
              <td align="left">2</td>
              <td align="left">new_key_update</td>
              <td align="left">Y</td>
              <td align="left">This document</td>
            </tr>
            <tr>
              <td align="left">3-255</td>
              <td align="left">Unassigned</td>
              <td align="left"> </td>
              <td align="left"> </td>
            </tr>
          </tbody>
        </table>
        <t>New assignments in the "TLS ExtendedKeyUpdate Types" registry will be administered by
IANA through Specification Required procedure <xref target="RFC8126"/>.  The role of the
designated expert is described in <xref section="17" sectionFormat="of" target="RFC8447"/>.  The designated expert
<xref target="RFC8126"/> ensures that the specification is publicly available.  It is sufficient to
have an Internet-Draft (that is posted and never published as an RFC) or to cite a
document from another standards body, industry consortium, or any other location.
An expert may provide more in-depth reviews, but their approval should not be taken as an
endorsement of the ExtendedKeyUpdate Message Subtype.</t>
      </section>
      <section anchor="sslkeylogfile-labels">
        <name>SSLKEYLOGFILE labels</name>
        <t>IANA is requested to add the following entries to the "TLS SSLKEYLOGFILE Labels"
extension registry <xref target="TLS-Ext-Registry"/>:</t>
        <table>
          <thead>
            <tr>
              <th align="left">Value</th>
              <th align="left">Description</th>
              <th align="left">Reference</th>
              <th align="left">Comment</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">CLIENT_TRAFFIC_SECRET_N+1</td>
              <td align="left">Secret protecting client records after Extended Key Update</td>
              <td align="left">This document</td>
              <td align="left">N represents iteration of Extended Key Update</td>
            </tr>
            <tr>
              <td align="left">SERVER_TRAFFIC_SECRET_N+1</td>
              <td align="left">Secret protecting server records after Extended Key Update</td>
              <td align="left">This document</td>
              <td align="left">N represents iteration of Extended Key Update</td>
            </tr>
            <tr>
              <td align="left">EXPORTER_SECRET_N+1</td>
              <td align="left">Exporter secret after Extended Key Update</td>
              <td align="left">This document</td>
              <td align="left">N represents iteration of Extended Key Update</td>
            </tr>
          </tbody>
        </table>
      </section>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="TLS">
          <front>
            <title>The Transport Layer Security (TLS) Protocol Version 1.3</title>
            <author fullname="Eric Rescorla" initials="E." surname="Rescorla">
              <organization>Independent</organization>
            </author>
            <date day="13" month="September" year="2025"/>
            <abstract>
              <t>   This document specifies version 1.3 of the Transport Layer Security
   (TLS) protocol.  TLS allows client/server applications to communicate
   over the Internet in a way that is designed to prevent eavesdropping,
   tampering, and message forgery.

   This document updates RFCs 5705, 6066, 7627, and 8422 and obsoletes
   RFCs 5077, 5246, 6961, 8422, and 8446.  This document also specifies
   new requirements for TLS 1.2 implementations.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-tls-rfc8446bis-14"/>
        </reference>
        <reference anchor="DTLS">
          <front>
            <title>The Datagram Transport Layer Security (DTLS) Protocol Version 1.3</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
            <author fullname="H. Tschofenig" initials="H." surname="Tschofenig"/>
            <author fullname="N. Modadugu" initials="N." surname="Modadugu"/>
            <date month="April" year="2022"/>
            <abstract>
              <t>This document specifies version 1.3 of the Datagram Transport Layer Security (DTLS) protocol. DTLS 1.3 allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery.</t>
              <t>The DTLS 1.3 protocol is based on the Transport Layer Security (TLS) 1.3 protocol and provides equivalent security guarantees with the exception of order protection / non-replayability. Datagram semantics of the underlying transport are preserved by the DTLS protocol.</t>
              <t>This document obsoletes RFC 6347.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9147"/>
          <seriesInfo name="DOI" value="10.17487/RFC9147"/>
        </reference>
        <reference anchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>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="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>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="TLS-FLAGS">
          <front>
            <title>A Flags Extension for TLS 1.3</title>
            <author fullname="Yoav Nir" initials="Y." surname="Nir">
              <organization>Dell Technologies</organization>
            </author>
            <date day="14" month="September" year="2025"/>
            <abstract>
              <t>   A number of extensions are proposed in the TLS working group that
   carry no interesting information except the 1-bit indication that a
   certain optional feature is supported.  Such extensions take 4 octets
   each.  This document defines a flags extension that can provide such
   indications at an average marginal cost of 1 bit each.  More
   precisely, it provides as many flag extensions as needed at 4 + the
   order of the last set bit divided by 8.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-tls-tlsflags-16"/>
        </reference>
        <reference anchor="RFC9729">
          <front>
            <title>The Concealed HTTP Authentication Scheme</title>
            <author fullname="D. Schinazi" initials="D." surname="Schinazi"/>
            <author fullname="D. Oliver" initials="D." surname="Oliver"/>
            <author fullname="J. Hoyland" initials="J." surname="Hoyland"/>
            <date month="February" year="2025"/>
            <abstract>
              <t>Most HTTP authentication schemes are probeable in the sense that it is possible for an unauthenticated client to probe whether an origin serves resources that require authentication. It is possible for an origin to hide the fact that it requires authentication by not generating Unauthorized status codes; however, that only works with non-cryptographic authentication schemes: cryptographic signatures require a fresh nonce to be signed. Prior to this document, there was no existing way for the origin to share such a nonce without exposing the fact that it serves resources that require authentication. This document defines a new non-probeable cryptographic authentication scheme.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9729"/>
          <seriesInfo name="DOI" value="10.17487/RFC9729"/>
        </reference>
        <reference anchor="RFC5705">
          <front>
            <title>Keying Material Exporters for Transport Layer Security (TLS)</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
            <date month="March" year="2010"/>
            <abstract>
              <t>A number of protocols wish to leverage Transport Layer Security (TLS) to perform key establishment but then use some of the keying material for their own purposes. This document describes a general mechanism for allowing that. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5705"/>
          <seriesInfo name="DOI" value="10.17487/RFC5705"/>
        </reference>
        <reference anchor="RFC3711">
          <front>
            <title>The Secure Real-time Transport Protocol (SRTP)</title>
            <author fullname="M. Baugher" initials="M." surname="Baugher"/>
            <author fullname="D. McGrew" initials="D." surname="McGrew"/>
            <author fullname="M. Naslund" initials="M." surname="Naslund"/>
            <author fullname="E. Carrara" initials="E." surname="Carrara"/>
            <author fullname="K. Norrman" initials="K." surname="Norrman"/>
            <date month="March" year="2004"/>
            <abstract>
              <t>This document describes the Secure Real-time Transport Protocol (SRTP), a profile of the Real-time Transport Protocol (RTP), which can provide confidentiality, message authentication, and replay protection to the RTP traffic and to the control traffic for RTP, the Real-time Transport Control Protocol (RTCP). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3711"/>
          <seriesInfo name="DOI" value="10.17487/RFC3711"/>
        </reference>
        <reference anchor="RFC9261">
          <front>
            <title>Exported Authenticators in TLS</title>
            <author fullname="N. Sullivan" initials="N." surname="Sullivan"/>
            <date month="July" year="2022"/>
            <abstract>
              <t>This document describes a mechanism that builds on Transport Layer Security (TLS) or Datagram Transport Layer Security (DTLS) and enables peers to provide proof of ownership of an identity, such as an X.509 certificate. This proof can be exported by one peer, transmitted out of band to the other peer, and verified by the receiving peer.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9261"/>
          <seriesInfo name="DOI" value="10.17487/RFC9261"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="ANSSI" target="https://cyber.gouv.fr/sites/default/files/2012/09/NT_IPsec_EN.pdf">
          <front>
            <title>Recommendations for securing networks with IPsec, Technical Report</title>
            <author>
              <organization>ANSSI</organization>
            </author>
            <date year="2015" month="August"/>
          </front>
        </reference>
        <reference anchor="TLS-Ext-Registry" target="https://www.iana.org/assignments/tls-extensiontype-values">
          <front>
            <title>Transport Layer Security (TLS) Extensions</title>
            <author>
              <organization>IANA</organization>
            </author>
            <date year="2023" month="November"/>
          </front>
        </reference>
        <reference anchor="CCG16" target="https://doi.org/10.1109/csf.2016.19">
          <front>
            <title>On Post-compromise Security</title>
            <author>
              <organization>IEEE</organization>
            </author>
            <date year="2016" month="August"/>
          </front>
        </reference>
        <reference anchor="TLS-RENEGOTIATION">
          <front>
            <title>Transport Layer Security (TLS) Renegotiation Indication Extension</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
            <author fullname="M. Ray" initials="M." surname="Ray"/>
            <author fullname="S. Dispensa" initials="S." surname="Dispensa"/>
            <author fullname="N. Oskov" initials="N." surname="Oskov"/>
            <date month="February" year="2010"/>
            <abstract>
              <t>Secure Socket Layer (SSL) and Transport Layer Security (TLS) renegotiation are vulnerable to an attack in which the attacker forms a TLS connection with the target server, injects content of his choice, and then splices in a new TLS connection from a client. The server treats the client's initial TLS handshake as a renegotiation and thus believes that the initial data transmitted by the attacker is from the same entity as the subsequent client data. This specification defines a TLS extension to cryptographically tie renegotiations to the TLS connections they are being performed over, thus preventing this attack. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5746"/>
          <seriesInfo name="DOI" value="10.17487/RFC5746"/>
        </reference>
        <reference anchor="CONFIDENTIALITY">
          <front>
            <title>Confidentiality in the Face of Pervasive Surveillance: A Threat Model and Problem Statement</title>
            <author fullname="R. Barnes" initials="R." surname="Barnes"/>
            <author fullname="B. Schneier" initials="B." surname="Schneier"/>
            <author fullname="C. Jennings" initials="C." surname="Jennings"/>
            <author fullname="T. Hardie" initials="T." surname="Hardie"/>
            <author fullname="B. Trammell" initials="B." surname="Trammell"/>
            <author fullname="C. Huitema" initials="C." surname="Huitema"/>
            <author fullname="D. Borkmann" initials="D." surname="Borkmann"/>
            <date month="August" year="2015"/>
            <abstract>
              <t>Since the initial revelations of pervasive surveillance in 2013, several classes of attacks on Internet communications have been discovered. In this document, we develop a threat model that describes these attacks on Internet confidentiality. We assume an attacker that is interested in undetected, indiscriminate eavesdropping. The threat model is based on published, verified attacks.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7624"/>
          <seriesInfo name="DOI" value="10.17487/RFC7624"/>
        </reference>
        <reference anchor="TLS-HYBRID">
          <front>
            <title>Hybrid key exchange in TLS 1.3</title>
            <author fullname="Douglas Stebila" initials="D." surname="Stebila">
              <organization>University of Waterloo</organization>
            </author>
            <author fullname="Scott Fluhrer" initials="S." surname="Fluhrer">
              <organization>Cisco Systems</organization>
            </author>
            <author fullname="Shay Gueron" initials="S." surname="Gueron">
              <organization>University of Haifa and Meta</organization>
            </author>
            <date day="7" month="September" year="2025"/>
            <abstract>
              <t>   Hybrid key exchange refers to using multiple key exchange algorithms
   simultaneously and combining the result with the goal of providing
   security even if a way is found to defeat the encryption for all but
   one of the component algorithms.  It is motivated by transition to
   post-quantum cryptography.  This document provides a construction for
   hybrid key exchange in the Transport Layer Security (TLS) protocol
   version 1.3.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-tls-hybrid-design-16"/>
        </reference>
        <reference anchor="TLS-ECDHE-MLKEM">
          <front>
            <title>Post-quantum hybrid ECDHE-MLKEM Key Agreement for TLSv1.3</title>
            <author fullname="Kris Kwiatkowski" initials="K." surname="Kwiatkowski">
              <organization>PQShield</organization>
            </author>
            <author fullname="Panos Kampanakis" initials="P." surname="Kampanakis">
              <organization>AWS</organization>
            </author>
            <author fullname="Bas Westerbaan" initials="B." surname="Westerbaan">
              <organization>Cloudflare</organization>
            </author>
            <author fullname="Douglas Stebila" initials="D." surname="Stebila">
              <organization>University of Waterloo</organization>
            </author>
            <date day="8" month="February" year="2026"/>
            <abstract>
              <t>   This draft defines three hybrid key agreement mechanisms for TLS 1.3
   - X25519MLKEM768, SecP256r1MLKEM768, and SecP384r1MLKEM1024 - that
   combine the post-quantum ML-KEM (Module-Lattice-Based Key
   Encapsulation Mechanism) with an ECDHE (Elliptic Curve Diffie-
   Hellman) exchange.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-tls-ecdhe-mlkem-04"/>
        </reference>
        <reference anchor="TLS-MLKEM">
          <front>
            <title>ML-KEM Post-Quantum Key Agreement for TLS 1.3</title>
            <author fullname="Deirdre Connolly" initials="D." surname="Connolly">
              <organization>SandboxAQ</organization>
            </author>
            <date day="12" month="February" year="2026"/>
            <abstract>
              <t>   This memo defines ML-KEM-512, ML-KEM-768, and ML-KEM-1024 as
   NamedGroups and and registers IANA values in the TLS Supported Groups
   registry for use in TLS 1.3 to achieve post-quantum (PQ) key
   establishment.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-tls-mlkem-07"/>
        </reference>
        <reference anchor="TLS-KEYLOGFILE">
          <front>
            <title>The SSLKEYLOGFILE Format for TLS</title>
            <author fullname="Martin Thomson" initials="M." surname="Thomson">
              <organization>Mozilla</organization>
            </author>
            <author fullname="Yaroslav Rosomakho" initials="Y." surname="Rosomakho">
              <organization>Zscaler</organization>
            </author>
            <author fullname="Hannes Tschofenig" initials="H." surname="Tschofenig">
              <organization>University of Applied Sciences Bonn-Rhein-Sieg</organization>
            </author>
            <date day="9" month="June" year="2025"/>
            <abstract>
              <t>   A format that supports logging information about the secrets used in
   a TLS connection is described.  Recording secrets to a file in
   SSLKEYLOGFILE format allows diagnostic and logging tools that use
   this file to decrypt messages exchanged by TLS endpoints.  This
   format is intended for use in systems where TLS only protects test
   data.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-tls-keylogfile-05"/>
        </reference>
        <reference anchor="RFC8126">
          <front>
            <title>Guidelines for Writing an IANA Considerations Section in RFCs</title>
            <author fullname="M. Cotton" initials="M." surname="Cotton"/>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <date month="June" year="2017"/>
            <abstract>
              <t>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>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>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="RFC8447">
          <front>
            <title>IANA Registry Updates for TLS and DTLS</title>
            <author fullname="J. Salowey" initials="J." surname="Salowey"/>
            <author fullname="S. Turner" initials="S." surname="Turner"/>
            <date month="August" year="2018"/>
            <abstract>
              <t>This document describes a number of changes to TLS and DTLS IANA registries that range from adding notes to the registry all the way to changing the registration policy. These changes were mostly motivated by WG review of the TLS- and DTLS-related registries undertaken as part of the TLS 1.3 development process.</t>
              <t>This document updates the following RFCs: 3749, 5077, 4680, 5246, 5705, 5878, 6520, and 7301.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8447"/>
          <seriesInfo name="DOI" value="10.17487/RFC8447"/>
        </reference>
      </references>
    </references>
    <?line 1062?>

<section anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>We would like to thank the members of the "TSVWG DTLS for SCTP
Requirements Design Team" for their discussion. The members, in
no particular order, were:</t>
      <ul spacing="normal">
        <li>
          <t>Marcelo Ricardo Leitner</t>
        </li>
        <li>
          <t>Zaheduzzaman Sarker</t>
        </li>
        <li>
          <t>Magnus Westerlund</t>
        </li>
        <li>
          <t>John Mattsson</t>
        </li>
        <li>
          <t>Claudio Porfiri</t>
        </li>
        <li>
          <t>Xin Long</t>
        </li>
        <li>
          <t>Michael Tüxen</t>
        </li>
        <li>
          <t>Hannes Tschofenig</t>
        </li>
        <li>
          <t>K Tirumaleswar Reddy</t>
        </li>
        <li>
          <t>Bertrand Rault</t>
        </li>
      </ul>
      <t>Additionally, we would like to thank the chairs of the
Transport and Services Working Group (tsvwg) Gorry Fairhurst and
Marten Seemann as well as the responsible area director Martin Duke.</t>
      <t>Finally, we would like to thank Martin Thomson, Ilari Liusvaara,
Benjamin Kaduk, Scott Fluhrer, Dennis Jackson, David Benjamin,
Matthijs van Duin, Rifaat Shekh-Yusef, Joe Birr-Pixton, Eric Rescorla,
and Thom Wiggers for their review comments.</t>
    </section>
    <section anchor="state-machines">
      <name>State Machines</name>
      <t>The sections below describe the state machines for the extended key update
operation for TLS 1.3 and DTLS 1.3.</t>
      <t>The state machine diagrams in the Appendix are provided for illustrative
purposes only to aid understanding of the protocol flow. They are not normative.
In case of any discrepancy between the Appendix diagrams and the protocol
behavior specified in the main body of this document, the text in the
draft takes precedence.</t>
      <t>For editorial reasons we abbreviate the protocol message types:</t>
      <ul spacing="normal">
        <li>
          <t>Req - ExtendedKeyUpdate(request)</t>
        </li>
        <li>
          <t>Resp - ExtendedKeyUpdate(response)</t>
        </li>
        <li>
          <t>NKU - ExtendedKeyUpdate(new_key_update)</t>
        </li>
        <li>
          <t>ACK - Acknowledgement message from <xref section="7" sectionFormat="of" target="DTLS"/></t>
        </li>
        <li>
          <t>APP - application data payloads</t>
        </li>
      </ul>
      <t>In the (D)TLS 1.3 state machines discussed below, the terms SEND and RECEIVE keys
refer to the send and receive key variables defined in <xref target="term"/>.</t>
      <t>The TLS state machine diagrams use the following notation:</t>
      <ul spacing="normal">
        <li>
          <t>Numbered labels (1), (2), … denote normal protocol transitions in the order they occur.</t>
        </li>
        <li>
          <t>Lettered labels (A), (B), … denote exceptional or conditional transitions.</t>
        </li>
        <li>
          <t>Self-loops indicate that the state does not change as a result of the event.</t>
        </li>
      </ul>
      <section anchor="tls-13-state-machines">
        <name>TLS 1.3 State Machines</name>
        <t>This section describes the initiator and responder state machines.</t>
        <section anchor="initiator-state-machine">
          <name>Initiator State Machine</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="576" width="536" viewBox="0 0 536 576" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,112" fill="none" stroke="black"/>
                <path d="M 8,192 L 8,496" fill="none" stroke="black"/>
                <path d="M 8,528 L 8,560" fill="none" stroke="black"/>
                <path d="M 192,32 L 192,112" fill="none" stroke="black"/>
                <path d="M 192,192 L 192,240" fill="none" stroke="black"/>
                <path d="M 192,528 L 192,560" fill="none" stroke="black"/>
                <path d="M 8,32 L 192,32" fill="none" stroke="black"/>
                <path d="M 8,112 L 192,112" fill="none" stroke="black"/>
                <path d="M 8,192 L 192,192" fill="none" stroke="black"/>
                <path d="M 8,240 L 192,240" fill="none" stroke="black"/>
                <path d="M 8,528 L 192,528" fill="none" stroke="black"/>
                <path d="M 8,560 L 192,560" fill="none" stroke="black"/>
                <path d="M 28,248 L 72,336" fill="none" stroke="black"/>
                <circle cx="96" cy="352" r="6" class="closeddot" fill="black"/>
                <circle cx="96" cy="368" r="6" class="closeddot" fill="black"/>
                <g class="text">
                  <text x="40" y="52">START</text>
                  <text x="88" y="68">send_key=current,</text>
                  <text x="96" y="84">receive_key=current</text>
                  <text x="60" y="100">updating=0</text>
                  <text x="56" y="132">|</text>
                  <text x="16" y="148">(1)</text>
                  <text x="52" y="148">send</text>
                  <text x="88" y="148">Req</text>
                  <text x="124" y="148">with</text>
                  <text x="168" y="148">local</text>
                  <text x="248" y="148">KeyShareEntry</text>
                  <text x="48" y="164">set</text>
                  <text x="108" y="164">updating=1</text>
                  <text x="56" y="180">v</text>
                  <text x="56" y="212">WAIT_RESP</text>
                  <text x="60" y="228">updating=1</text>
                  <text x="64" y="276">(A)</text>
                  <text x="100" y="276">recv</text>
                  <text x="140" y="276">peer</text>
                  <text x="176" y="276">Req</text>
                  <text x="228" y="276">(crossed</text>
                  <text x="304" y="276">updates):</text>
                  <text x="96" y="292">compare</text>
                  <text x="200" y="292">peer.key_exchange</text>
                  <text x="284" y="292">to</text>
                  <text x="372" y="292">local.key_exchange</text>
                  <text x="80" y="308">-</text>
                  <text x="100" y="308">if</text>
                  <text x="132" y="308">peer</text>
                  <text x="160" y="308">&lt;</text>
                  <text x="196" y="308">local:</text>
                  <text x="252" y="308">IGNORE</text>
                  <text x="300" y="308">peer</text>
                  <text x="336" y="308">Req</text>
                  <text x="376" y="308">(send</text>
                  <text x="436" y="308">nothing)</text>
                  <text x="80" y="324">-</text>
                  <text x="100" y="324">if</text>
                  <text x="132" y="324">peer</text>
                  <text x="164" y="324">==</text>
                  <text x="204" y="324">local:</text>
                  <text x="256" y="324">ABORT</text>
                  <text x="364" y="324">"unexpected_message"</text>
                  <text x="88" y="340">-</text>
                  <text x="108" y="340">if</text>
                  <text x="140" y="340">peer</text>
                  <text x="168" y="340">&gt;</text>
                  <text x="204" y="340">local:</text>
                  <text x="264" y="340">ABANDON</text>
                  <text x="320" y="340">local</text>
                  <text x="376" y="340">update:</text>
                  <text x="120" y="356">set</text>
                  <text x="180" y="356">updating=0</text>
                  <text x="120" y="372">act</text>
                  <text x="148" y="372">as</text>
                  <text x="204" y="372">RESPONDER:</text>
                  <text x="268" y="372">send</text>
                  <text x="308" y="372">Resp</text>
                  <text x="348" y="372">with</text>
                  <text x="428" y="372">KeyShareEntry,</text>
                  <text x="132" y="388">derive</text>
                  <text x="176" y="388">new</text>
                  <text x="228" y="388">secrets,</text>
                  <text x="284" y="388">then</text>
                  <text x="336" y="388">proceed</text>
                  <text x="380" y="388">as</text>
                  <text x="404" y="388">in</text>
                  <text x="456" y="388">responder</text>
                  <text x="516" y="388">flow</text>
                  <text x="40" y="420">(2)</text>
                  <text x="76" y="420">recv</text>
                  <text x="116" y="420">Resp</text>
                  <text x="156" y="420">with</text>
                  <text x="220" y="420">key_share:</text>
                  <text x="84" y="436">derive</text>
                  <text x="128" y="436">new</text>
                  <text x="176" y="436">secrets</text>
                  <text x="76" y="452">send</text>
                  <text x="112" y="452">NKU</text>
                  <text x="172" y="452">(encrypted</text>
                  <text x="240" y="452">under</text>
                  <text x="280" y="452">old</text>
                  <text x="320" y="452">keys)</text>
                  <text x="84" y="468">update</text>
                  <text x="132" y="468">SEND</text>
                  <text x="168" y="468">key</text>
                  <text x="224" y="468">(send_key</text>
                  <text x="276" y="468">:=</text>
                  <text x="308" y="468">new)</text>
                  <text x="84" y="484">update</text>
                  <text x="144" y="484">RECEIVE</text>
                  <text x="192" y="484">key</text>
                  <text x="260" y="484">(receive_key</text>
                  <text x="324" y="484">:=</text>
                  <text x="356" y="484">new)</text>
                  <text x="72" y="500">set</text>
                  <text x="132" y="500">updating=0</text>
                  <text x="64" y="516">v</text>
                  <text x="52" y="548">FINISHED</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+----------------------+
| START                |
| send_key=current,    |
| receive_key=current  |
| updating=0           |
+----------------------+
      |
(1) send Req with local KeyShareEntry
    set updating=1
      v
+----------------------+
| WAIT_RESP            |
| updating=1           |
+----------------------+
|  \
|   \ (A) recv peer Req (crossed updates):
|    \  compare peer.key_exchange to local.key_exchange
|     \  - if peer < local: IGNORE peer Req (send nothing)
|      \ - if peer == local: ABORT "unexpected_message"
|       \ - if peer > local: ABANDON local update:
|          * set updating=0
|          * act as RESPONDER: send Resp with KeyShareEntry,
|            derive new secrets, then proceed as in responder flow
|
|  (2) recv Resp with key_share:
|      derive new secrets
|      send NKU (encrypted under old keys)
|      update SEND key (send_key := new)
|      update RECEIVE key (receive_key := new)
|      set updating=0
       v
+----------------------+
| FINISHED             |
+----------------------+
]]></artwork>
          </artset>
          <t>Notes:</t>
          <ul spacing="normal">
            <li>
              <t>NKU message is sent under old keys.</t>
            </li>
            <li>
              <t>If a classic KeyUpdate arrives (EKU negotiated), ABORT "unexpected_message".</t>
            </li>
            <li>
              <t>Crossed-requests: ignore the request with LOWER lexicographic key_exchange; if equal, abort.</t>
            </li>
          </ul>
        </section>
        <section anchor="responder-state-machine">
          <name>Responder State Machine</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="544" width="360" viewBox="0 0 360 544" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,112" fill="none" stroke="black"/>
                <path d="M 8,192 L 8,320" fill="none" stroke="black"/>
                <path d="M 8,352 L 8,400" fill="none" stroke="black"/>
                <path d="M 8,496 L 8,528" fill="none" stroke="black"/>
                <path d="M 192,32 L 192,112" fill="none" stroke="black"/>
                <path d="M 192,192 L 192,224" fill="none" stroke="black"/>
                <path d="M 192,352 L 192,400" fill="none" stroke="black"/>
                <path d="M 192,496 L 192,528" fill="none" stroke="black"/>
                <path d="M 8,32 L 192,32" fill="none" stroke="black"/>
                <path d="M 8,112 L 192,112" fill="none" stroke="black"/>
                <path d="M 8,192 L 192,192" fill="none" stroke="black"/>
                <path d="M 8,224 L 192,224" fill="none" stroke="black"/>
                <path d="M 32,320 L 48,320" fill="none" stroke="black"/>
                <path d="M 8,352 L 192,352" fill="none" stroke="black"/>
                <path d="M 8,400 L 192,400" fill="none" stroke="black"/>
                <path d="M 8,496 L 192,496" fill="none" stroke="black"/>
                <path d="M 8,528 L 192,528" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="56,320 44,314.4 44,325.6" fill="black" transform="rotate(0,48,320)"/>
                <g class="text">
                  <text x="40" y="52">START</text>
                  <text x="88" y="68">send_key=current,</text>
                  <text x="96" y="84">receive_key=current</text>
                  <text x="60" y="100">updating=0</text>
                  <text x="56" y="132">|</text>
                  <text x="16" y="148">(1)</text>
                  <text x="52" y="148">recv</text>
                  <text x="88" y="148">Req</text>
                  <text x="48" y="164">set</text>
                  <text x="108" y="164">updating=1</text>
                  <text x="56" y="180">v</text>
                  <text x="48" y="212">RESPOND</text>
                  <text x="44" y="244">send</text>
                  <text x="84" y="244">Resp</text>
                  <text x="124" y="244">with</text>
                  <text x="200" y="244">KeyShareEntry</text>
                  <text x="44" y="260">(may</text>
                  <text x="88" y="260">defer</text>
                  <text x="144" y="260">sending</text>
                  <text x="188" y="260">if</text>
                  <text x="224" y="260">under</text>
                  <text x="272" y="260">load;</text>
                  <text x="52" y="276">must</text>
                  <text x="92" y="276">send</text>
                  <text x="132" y="276">once</text>
                  <text x="192" y="276">resources</text>
                  <text x="256" y="276">free)</text>
                  <text x="52" y="292">derive</text>
                  <text x="96" y="292">new</text>
                  <text x="144" y="292">secrets</text>
                  <text x="52" y="308">update</text>
                  <text x="100" y="308">SEND</text>
                  <text x="140" y="308">keys</text>
                  <text x="200" y="308">(send_key</text>
                  <text x="252" y="308">:=</text>
                  <text x="284" y="308">new)</text>
                  <text x="100" y="324">WAIT_I_NKU</text>
                  <text x="56" y="340">v</text>
                  <text x="60" y="372">WAIT_I_NKU</text>
                  <text x="60" y="388">updating=1</text>
                  <text x="56" y="420">|</text>
                  <text x="16" y="436">(2)</text>
                  <text x="52" y="436">recv</text>
                  <text x="88" y="436">NKU</text>
                  <text x="148" y="436">(encrypted</text>
                  <text x="216" y="436">under</text>
                  <text x="256" y="436">old</text>
                  <text x="296" y="436">keys)</text>
                  <text x="60" y="452">update</text>
                  <text x="120" y="452">RECEIVE</text>
                  <text x="172" y="452">keys</text>
                  <text x="244" y="452">(receive_key</text>
                  <text x="308" y="452">:=</text>
                  <text x="340" y="452">new)</text>
                  <text x="48" y="468">set</text>
                  <text x="108" y="468">updating=0</text>
                  <text x="56" y="484">v</text>
                  <text x="52" y="516">FINISHED</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+----------------------+
| START                |
| send_key=current,    |
| receive_key=current  |
| updating=0           |
+----------------------+
      |
(1) recv Req
    set updating=1
      v
+----------------------+
| RESPOND              |
+----------------------+
|  send Resp with KeyShareEntry
|  (may defer sending if under load;
|   must send once resources free)
|  derive new secrets
|  update SEND keys (send_key := new)
|  --> WAIT_I_NKU
      v
+----------------------+
| WAIT_I_NKU           |
| updating=1           |
+----------------------+
      |
(2) recv NKU (encrypted under old keys)
    update RECEIVE keys (receive_key := new)
    set updating=0
      v
+----------------------+
| FINISHED             |
+----------------------+
]]></artwork>
          </artset>
          <t>Notes:</t>
          <ul spacing="normal">
            <li>
              <t>Responder may defer Resp under load (no status reply), then must send it once resources are free.</t>
            </li>
            <li>
              <t>If a classic KeyUpdate arrives (EKU negotiated), ABORT "unexpected_message".</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="dtls-13-state-machines">
        <name>DTLS 1.3 State Machines</name>
        <t>This section describes the initiator and responder state machines.</t>
        <section anchor="terms-and-abbreviations">
          <name>Terms and Abbreviations</name>
          <t>The following variables and abbreviations are used in the state machine diagrams.</t>
          <ul spacing="normal">
            <li>
              <t>rx - current, accepted receive epoch.</t>
            </li>
            <li>
              <t>tx - current transmit epoch used for tagging outgoing messages.</t>
            </li>
            <li>
              <t>E - initial epoch value.</t>
            </li>
            <li>
              <t>updating - true while a key-update handshake is in progress.</t>
            </li>
            <li>
              <t>old_rx - the previous receive epoch remembered during retention.</t>
            </li>
            <li>
              <t>retain_old - when true, receiver accepts tags old_rx and rx.</t>
            </li>
            <li>
              <t>tag=... - the TX-epoch value written on an outgoing message.</t>
            </li>
            <li>
              <t>e==... - the epoch tag carried on an incoming message (what the peer sent).</t>
            </li>
            <li>
              <t>FINISHED / START / WAIT_RESP / WAIT_I_NKU / WAIT_R_NKU / ACTIVATE RETENTION / RESPOND / WAIT_ACK - diagram states; FINISHED denotes the steady state after success.</t>
            </li>
          </ul>
          <t>Crossed requests. If both peers independently initiate the extended key update and the key_update_request messages cross in flight, compare the KeyShareEntry.key_exchange values. The request with the lower lexicographic value must be ignored. If the values are equal, the endpoint must abort with an "unexpected_message" alert. If the peer's value is higher than the local one, the endpoint abandons its in-flight update and processes the peer's request as responder.</t>
        </section>
        <section anchor="state-machine-initiator">
          <name>State Machine (Initiator)</name>
          <t>The initiator starts in the START state with matching epochs (rx := E; tx := E). It sends a Req and enters WAIT_RESP (updating := 1). While waiting, APP data may be sent at any time (tagged with the current tx) and received according to the APP acceptance rule below.</t>
          <t>Once the responder returns Resp with a tag matching the current rx, the initiator derives new key material. It then sends NKU still tagged with the old tx. The initiator activates retention mode: the old epoch is remembered, the receive epoch is incremented, and application data is accepted under both epochs for a transition period. Initiator moves to WAIT_ACK.</t>
          <t>If a peer key_update_request arrives while in WAIT_RESP (crossed updates), apply the crossed-request rule above. If the peer's key_exchange is higher, abandon the local update (updating := 0) and continue as responder: send key_update_response, derive new secrets, then proceed with the responder flow. If lower, ignore the peer's request; if equal, abort with "unexpected_message".</t>
          <t>Upon receiving the responder's ACK matching the updated epoch, the initiator completes the transition by synchronizing transmit and receive epochs (tx := rx), disabling retention, and clearing the update flag. The state machine returns to FINISHED, ready for subsequent updates.</t>
          <t>Throughout the process:</t>
          <ul spacing="normal">
            <li>
              <t>Duplicate messages are tolerated (for retransmission handling).</t>
            </li>
            <li>
              <t>Temporary epoch mismatches are permitted while an update is in progress.</t>
            </li>
            <li>
              <t>Application data flows continuously, subject to epoch acceptance rules.</t>
            </li>
          </ul>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="832" width="560" viewBox="0 0 560 832" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,80" fill="none" stroke="black"/>
                <path d="M 8,160 L 8,192" fill="none" stroke="black"/>
                <path d="M 8,512 L 8,576" fill="none" stroke="black"/>
                <path d="M 8,640 L 8,672" fill="none" stroke="black"/>
                <path d="M 8,784 L 8,816" fill="none" stroke="black"/>
                <path d="M 16,200 L 16,432" fill="none" stroke="black"/>
                <path d="M 56,200 L 56,320" fill="none" stroke="black"/>
                <path d="M 56,352 L 56,400" fill="none" stroke="black"/>
                <path d="M 56,680 L 56,720" fill="none" stroke="black"/>
                <path d="M 88,464 L 88,504" fill="none" stroke="black"/>
                <path d="M 96,200 L 96,368" fill="none" stroke="black"/>
                <path d="M 184,512 L 184,576" fill="none" stroke="black"/>
                <path d="M 192,200 L 192,256" fill="none" stroke="black"/>
                <path d="M 256,160 L 256,192" fill="none" stroke="black"/>
                <path d="M 256,640 L 256,672" fill="none" stroke="black"/>
                <path d="M 280,32 L 280,80" fill="none" stroke="black"/>
                <path d="M 352,784 L 352,816" fill="none" stroke="black"/>
                <path d="M 8,32 L 280,32" fill="none" stroke="black"/>
                <path d="M 8,80 L 280,80" fill="none" stroke="black"/>
                <path d="M 8,160 L 256,160" fill="none" stroke="black"/>
                <path d="M 8,192 L 256,192" fill="none" stroke="black"/>
                <path d="M 192,256 L 208,256" fill="none" stroke="black"/>
                <path d="M 96,368 L 112,368" fill="none" stroke="black"/>
                <path d="M 56,400 L 72,400" fill="none" stroke="black"/>
                <path d="M 16,432 L 32,432" fill="none" stroke="black"/>
                <path d="M 8,512 L 184,512" fill="none" stroke="black"/>
                <path d="M 8,576 L 184,576" fill="none" stroke="black"/>
                <path d="M 8,640 L 256,640" fill="none" stroke="black"/>
                <path d="M 8,672 L 256,672" fill="none" stroke="black"/>
                <path d="M 8,784 L 352,784" fill="none" stroke="black"/>
                <path d="M 8,816 L 352,816" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="200,200 188,194.4 188,205.6" fill="black" transform="rotate(270,192,200)"/>
                <polygon class="arrowhead" points="104,200 92,194.4 92,205.6" fill="black" transform="rotate(270,96,200)"/>
                <polygon class="arrowhead" points="96,504 84,498.4 84,509.6" fill="black" transform="rotate(90,88,504)"/>
                <polygon class="arrowhead" points="64,200 52,194.4 52,205.6" fill="black" transform="rotate(270,56,200)"/>
                <polygon class="arrowhead" points="24,200 12,194.4 12,205.6" fill="black" transform="rotate(270,16,200)"/>
                <g class="text">
                  <text x="40" y="52">START</text>
                  <text x="28" y="68">rx</text>
                  <text x="52" y="68">:=</text>
                  <text x="76" y="68">E;</text>
                  <text x="100" y="68">tx</text>
                  <text x="124" y="68">:=</text>
                  <text x="148" y="68">E,</text>
                  <text x="196" y="68">updating</text>
                  <text x="244" y="68">:=</text>
                  <text x="264" y="68">0</text>
                  <text x="56" y="100">|</text>
                  <text x="16" y="116">(1)</text>
                  <text x="52" y="116">send</text>
                  <text x="88" y="116">Req</text>
                  <text x="140" y="116">[tag=tx]</text>
                  <text x="48" y="132">set</text>
                  <text x="100" y="132">updating</text>
                  <text x="148" y="132">:=</text>
                  <text x="168" y="132">1</text>
                  <text x="56" y="148">v</text>
                  <text x="56" y="180">WAIT_RESP</text>
                  <text x="232" y="260">(A)</text>
                  <text x="268" y="260">recv</text>
                  <text x="308" y="260">peer</text>
                  <text x="344" y="260">Req</text>
                  <text x="404" y="260">(crossed):</text>
                  <text x="236" y="276">if</text>
                  <text x="268" y="276">peer</text>
                  <text x="296" y="276">&lt;</text>
                  <text x="328" y="276">local</text>
                  <text x="372" y="276">-&gt;</text>
                  <text x="412" y="276">IGNORE</text>
                  <text x="488" y="276">(Self-Loop)</text>
                  <text x="236" y="292">if</text>
                  <text x="268" y="292">peer</text>
                  <text x="300" y="292">==</text>
                  <text x="336" y="292">local</text>
                  <text x="372" y="292">-&gt;</text>
                  <text x="408" y="292">ABORT</text>
                  <text x="472" y="292">(Error)</text>
                  <text x="236" y="308">if</text>
                  <text x="268" y="308">peer</text>
                  <text x="296" y="308">&gt;</text>
                  <text x="328" y="308">local</text>
                  <text x="372" y="308">-&gt;</text>
                  <text x="416" y="308">ABANDON</text>
                  <text x="480" y="308">update;</text>
                  <text x="420" y="324">updating</text>
                  <text x="468" y="324">:=</text>
                  <text x="492" y="324">0;</text>
                  <text x="136" y="340">|</text>
                  <text x="440" y="340">act</text>
                  <text x="468" y="340">as</text>
                  <text x="520" y="340">RESPONDER</text>
                  <text x="136" y="372">APP</text>
                  <text x="172" y="372">send</text>
                  <text x="232" y="372">(anytime)</text>
                  <text x="400" y="372">(Self-Loop)</text>
                  <text x="96" y="404">APP</text>
                  <text x="136" y="404">recv:</text>
                  <text x="204" y="404">retain_old</text>
                  <text x="260" y="404">&amp;&amp;</text>
                  <text x="280" y="404">e</text>
                  <text x="300" y="404">==</text>
                  <text x="340" y="404">old_rx</text>
                  <text x="432" y="404">(Self-Loop)</text>
                  <text x="56" y="436">APP</text>
                  <text x="96" y="436">recv:</text>
                  <text x="128" y="436">e</text>
                  <text x="148" y="436">==</text>
                  <text x="172" y="436">rx</text>
                  <text x="440" y="436">(Self-Loop)</text>
                  <text x="116" y="468">recv</text>
                  <text x="156" y="468">Resp</text>
                  <text x="188" y="468">[e</text>
                  <text x="212" y="468">==</text>
                  <text x="240" y="468">rx]</text>
                  <text x="124" y="484">derive</text>
                  <text x="184" y="484">secrets</text>
                  <text x="52" y="532">ACTIVATE</text>
                  <text x="128" y="532">RETENTION</text>
                  <text x="60" y="548">old_rx=rx;</text>
                  <text x="72" y="564">retain_old=1;</text>
                  <text x="148" y="564">rx++</text>
                  <text x="88" y="596">|</text>
                  <text x="16" y="612">(2)</text>
                  <text x="52" y="612">send</text>
                  <text x="88" y="612">NKU</text>
                  <text x="140" y="612">[tag=old</text>
                  <text x="192" y="612">tx]</text>
                  <text x="88" y="628">v</text>
                  <text x="52" y="660">WAIT_ACK</text>
                  <text x="128" y="660">(updating</text>
                  <text x="176" y="660">=</text>
                  <text x="196" y="660">1)</text>
                  <text x="88" y="708">APP</text>
                  <text x="144" y="708">send/recv</text>
                  <text x="216" y="708">allowed</text>
                  <text x="16" y="740">(3)</text>
                  <text x="52" y="740">recv</text>
                  <text x="88" y="740">ACK</text>
                  <text x="136" y="740">[e==rx]</text>
                  <text x="60" y="756">tx=rx;</text>
                  <text x="144" y="756">retain_old=0;</text>
                  <text x="236" y="756">updating</text>
                  <text x="284" y="756">:=</text>
                  <text x="304" y="756">0</text>
                  <text x="56" y="772">v</text>
                  <text x="52" y="804">FINISHED</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+---------------------------------+
| START                           |
| rx := E; tx := E, updating := 0 |
+---------------------------------+
      |
(1) send Req [tag=tx]
    set updating := 1
      v
+------------------------------+
| WAIT_RESP                    |
+------------------------------+
 ^    ^    ^           ^
 |    |    |           |
 |    |    |           |
 |    |    |           +-- (A) recv peer Req (crossed):
 |    |    |                if peer < local  -> IGNORE (Self-Loop)
 |    |    |                if peer == local -> ABORT  (Error)
 |    |    |                if peer > local  -> ABANDON update;
 |    |    |                                    updating := 0;
 |         |    |                                    act as RESPONDER
 |    |    |
 |    |    +-- APP send (anytime)           (Self-Loop)
 |    |
 |    +-- APP recv: retain_old && e == old_rx   (Self-Loop)
 |
 +-- APP recv: e == rx                           (Self-Loop)

          | recv Resp [e == rx]
          | derive secrets
          v
+---------------------+
| ACTIVATE RETENTION  |
| old_rx=rx;          |
| retain_old=1; rx++  |
+---------------------+
          |
(2) send NKU [tag=old tx]
          v
+------------------------------+
| WAIT_ACK (updating = 1)      |
+------------------------------+
      |
      |  APP send/recv allowed
      |
(3) recv ACK [e==rx]
    tx=rx; retain_old=0; updating := 0
      v
+------------------------------------------+
| FINISHED                                 |
+------------------------------------------+
]]></artwork>
          </artset>
        </section>
        <section anchor="state-machine-responder">
          <name>State Machine (Responder)</name>
          <t>The responder starts in the START state with synchronized transmit and receive epochs (rx := E; tx := E) and no update in progress. Application data can be transmitted at any time using the sender's current transmit epoch. A receiver must accept application data if the epoch tag on the DTLS record equals the receiver's current receive epoch. If the receiver has retention active (retain_old == true), the receiver must also accept DTLS records whose epoch tag equals the remembered previous epoch.</t>
          <t>Upon receiving an <tt>ExtendedKeyUpdate(key_update_request)</tt> (Req), the responder transitions to RESPOND. The responder may defer sending <tt>ExtendedKeyUpdate(key_update_response)</tt> under load; in that case it must acknowledge the request with an ACK and retransmit the response until it is acknowledged by the initiator, as specified in DTLS considerations. When sent, <tt>ExtendedKeyUpdate(key_update_response)</tt> is tagged with the current tx.</t>
          <t>After an <tt>ExtendedKeyUpdate(new_key_update)</tt> (NKU) is received with the correct epoch, the responder:</t>
          <ol spacing="normal" type="1"><li>
              <t>activates retention (old_rx := rx; retain_old := 1),</t>
            </li>
            <li>
              <t>increments both epochs (rx++, tx++),</t>
            </li>
            <li>
              <t>sends ACK tagged with the new tx (which now equals the new rx),</t>
            </li>
            <li>
              <t>clears updating and enters FINISHED.</t>
            </li>
          </ol>
          <t>Retention at the responder ends automatically on the first APP received under the new rx (then retain_old := 0). APP traffic is otherwise permitted at any time; reordering is tolerated by the acceptance rule.</t>
          <t>APP acceptance rule (receiver): accept if e == rx or (retain_old &amp;&amp; e == old_rx). If retain_old is set and an APP with the new rx arrives, clear retain_old.</t>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="624" width="536" viewBox="0 0 536 624" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,80" fill="none" stroke="black"/>
                <path d="M 8,160 L 8,192" fill="none" stroke="black"/>
                <path d="M 8,288 L 8,336" fill="none" stroke="black"/>
                <path d="M 8,400 L 8,480" fill="none" stroke="black"/>
                <path d="M 8,560 L 8,608" fill="none" stroke="black"/>
                <path d="M 56,200 L 56,280" fill="none" stroke="black"/>
                <path d="M 136,288 L 136,336" fill="none" stroke="black"/>
                <path d="M 184,400 L 184,480" fill="none" stroke="black"/>
                <path d="M 192,160 L 192,192" fill="none" stroke="black"/>
                <path d="M 280,32 L 280,80" fill="none" stroke="black"/>
                <path d="M 352,560 L 352,608" fill="none" stroke="black"/>
                <path d="M 8,32 L 280,32" fill="none" stroke="black"/>
                <path d="M 8,80 L 280,80" fill="none" stroke="black"/>
                <path d="M 8,160 L 192,160" fill="none" stroke="black"/>
                <path d="M 8,192 L 192,192" fill="none" stroke="black"/>
                <path d="M 8,288 L 136,288" fill="none" stroke="black"/>
                <path d="M 8,336 L 136,336" fill="none" stroke="black"/>
                <path d="M 8,400 L 184,400" fill="none" stroke="black"/>
                <path d="M 8,480 L 184,480" fill="none" stroke="black"/>
                <path d="M 8,560 L 352,560" fill="none" stroke="black"/>
                <path d="M 8,608 L 352,608" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="64,280 52,274.4 52,285.6" fill="black" transform="rotate(90,56,280)"/>
                <g class="text">
                  <text x="40" y="52">START</text>
                  <text x="28" y="68">rx</text>
                  <text x="52" y="68">:=</text>
                  <text x="76" y="68">E;</text>
                  <text x="100" y="68">tx</text>
                  <text x="124" y="68">:=</text>
                  <text x="148" y="68">E,</text>
                  <text x="196" y="68">updating</text>
                  <text x="244" y="68">:=</text>
                  <text x="264" y="68">0</text>
                  <text x="56" y="100">|</text>
                  <text x="16" y="116">(1)</text>
                  <text x="52" y="116">recv</text>
                  <text x="88" y="116">Req</text>
                  <text x="136" y="116">[e==rx]</text>
                  <text x="48" y="132">set</text>
                  <text x="100" y="132">updating</text>
                  <text x="148" y="132">:=</text>
                  <text x="168" y="132">1</text>
                  <text x="56" y="148">v</text>
                  <text x="48" y="180">RESPOND</text>
                  <text x="84" y="228">send</text>
                  <text x="124" y="228">Resp</text>
                  <text x="180" y="228">[tag=tx]</text>
                  <text x="84" y="244">(may</text>
                  <text x="132" y="244">defer;</text>
                  <text x="172" y="244">if</text>
                  <text x="224" y="244">deferred,</text>
                  <text x="280" y="244">ACK</text>
                  <text x="312" y="244">Req</text>
                  <text x="344" y="244">and</text>
                  <text x="384" y="244">later</text>
                  <text x="452" y="244">retransmit</text>
                  <text x="516" y="244">Resp</text>
                  <text x="96" y="260">until</text>
                  <text x="172" y="260">acknowledged</text>
                  <text x="236" y="260">by</text>
                  <text x="264" y="260">the</text>
                  <text x="324" y="260">initiator)</text>
                  <text x="60" y="308">WAIT_I_NKU</text>
                  <text x="68" y="324">(updating=1)</text>
                  <text x="56" y="356">|</text>
                  <text x="16" y="372">(2)</text>
                  <text x="52" y="372">recv</text>
                  <text x="88" y="372">NKU</text>
                  <text x="136" y="372">[e==rx]</text>
                  <text x="240" y="372">(assert</text>
                  <text x="312" y="372">accepted)</text>
                  <text x="56" y="388">|</text>
                  <text x="52" y="420">ACTIVATE</text>
                  <text x="128" y="420">RETENTION</text>
                  <text x="60" y="436">old_rx=rx;</text>
                  <text x="72" y="452">retain_old=1;</text>
                  <text x="40" y="468">rx=rx</text>
                  <text x="76" y="468">1;</text>
                  <text x="120" y="468">tx=tx+1</text>
                  <text x="56" y="500">|</text>
                  <text x="16" y="516">(3)</text>
                  <text x="52" y="516">send</text>
                  <text x="88" y="516">ACK</text>
                  <text x="140" y="516">[tag=tx]</text>
                  <text x="48" y="532">set</text>
                  <text x="100" y="532">updating</text>
                  <text x="148" y="532">:=</text>
                  <text x="172" y="532">0;</text>
                  <text x="212" y="532">assert</text>
                  <text x="268" y="532">tx==rx</text>
                  <text x="56" y="548">v</text>
                  <text x="52" y="580">FINISHED</text>
                  <text x="72" y="596">(retain_old=0</text>
                  <text x="152" y="596">after</text>
                  <text x="200" y="596">first</text>
                  <text x="240" y="596">APP</text>
                  <text x="268" y="596">at</text>
                  <text x="296" y="596">new</text>
                  <text x="328" y="596">rx)</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+---------------------------------+
| START                           |
| rx := E; tx := E, updating := 0 |
+---------------------------------+
      |
(1) recv Req [e==rx]
    set updating := 1
      v
+----------------------+
| RESPOND              |
+----------------------+
      |
      | send Resp [tag=tx]
      | (may defer; if deferred, ACK Req and later retransmit Resp
      |  until acknowledged by the initiator)
      v
+---------------+
| WAIT_I_NKU    |
| (updating=1)  |
+-------+-------+
      |
(2) recv NKU [e==rx]      (assert accepted)
      |
+---------------------+
| ACTIVATE RETENTION  |
| old_rx=rx;          |
| retain_old=1;       |
| rx=rx+1; tx=tx+1    |
+----------+----------+
      |
(3) send ACK [tag=tx]
    set updating := 0; assert tx==rx
      v
+------------------------------------------+
| FINISHED                                 |
| (retain_old=0 after first APP at new rx) |
+------------------------------------------+
]]></artwork>
          </artset>
        </section>
      </section>
    </section>
    <section anchor="overview-of-security-goals">
      <name>Overview of Security Goals</name>
      <t>A complete security analysis of the EKU is outside the scope of this document. This appendix provides an informal description of the primary security goals that EKU is designed to achieve.</t>
      <section anchor="post-compromise-security-pcs">
        <name>Post-Compromise Security (PCS)</name>
        <t>Extended Key Update supports post-compromise security under the assumptions described in <xref target="scope"/>. If an attacker temporarily compromises an endpoint and obtains the traffic keys in use before an Extended Key Update takes place, but the compromise does not persist after the EKU completes, the attacker cannot derive the new keying material established by EKU. This property follows from the use of fresh ephemeral key exchange material during each Extended Key Update, which produces new traffic keys that are independent of the previous ones. This
property provides only best-effort post-compromise security, as it assumes the attacker is not acting as a MiTM
during the Extended Key Update.</t>
        <t>As a result, confidentiality of application data encrypted after the Extended Key Update is preserved even if the earlier traffic keys were exposed.</t>
      </section>
      <section anchor="key-freshness-and-cryptographic-independence">
        <name>Key Freshness and Cryptographic Independence</name>
        <t>Each Extended Key Update derives new traffic keys from ephemeral key exchange material. This ensures strong separation between successive traffic keys:</t>
        <ul spacing="normal">
          <li>
            <t>The new traffic keys established by an Extended Key Update are independent of the previous traffic keys.</t>
          </li>
          <li>
            <t>Compromise of one of traffic keys does not allow recovery of any earlier or later traffic keys.</t>
          </li>
          <li>
            <t>Application data protected under one of the traffic keys cannot be decrypted using keys from another.</t>
          </li>
        </ul>
      </section>
      <section anchor="elimination-of-standard-keyupdate">
        <name>Elimination of Standard KeyUpdate</name>
        <t>Once Extended Key Update has been negotiated for a session, peers rely exclusively on EKU rather than the standard TLS 1.3 KeyUpdate mechanism. Relying solely on Extended Key Update helps maintain PCS properties throughout the lifetime of the TLS session.</t>
      </section>
      <section anchor="detecting-divergent-key-state">
        <name>Detecting Divergent Key State</name>
        <t>As described in <xref target="exported"/>, both Post-handshake Certificate-Based Client Authentication and Exported Authenticators can be used after an Extended Key Update to confirm that both endpoints derived the same
traffic keys. Because the authentication messages produced by these mechanisms depend on values
derived from the updated traffic keys, any divergence in those traffic keys causes validation to fail,
revealing interference by an active attacker.</t>
      </section>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+192XIb2ZXg+/2K26yINlkCIFFLLZRlmyKpElsSJZOUy9Xl
MpUEEkBaiUw4F5KwREf/xrzN03xFP03/SX/JnO1uuYCUqtwRPdF0WEVm5t3P
PfsyHA5VlVRpvKMPrqo4m8QT/SJe6bfLSVTFepoX+rSIsnKZF5V+Ga3iQp/E
47pIqpXePH15sqW3Rw+Uis7Pi/hiTR8vT9QkH2fRAgaaFNG0GiZxNR1WaTmM
pc3wfbwa1tRmmMI/ZaXG8J9ZXqx2dFlNFL8rd/S397/aHuhvHj78SqlkWezo
qqjL6v69e9/eu6/K+nyRlGWSZ9VqCaMdHpw+U1ERRzt6w0x9Q13mxftZkddL
eNq3wA0FM4IPJ9BJVsVFFlfDfZy7UmUVZZOzKM0zGGEVl2qZ7Citi+k4npTV
KpWnWlf52Ps1gXVmlXlQwpBFPC3t36tF8GdVJGP78ThfLKCtfZtkaZK5YWAT
h2lSVkPo5DxP4bNh/uUdeAO7voiWyySb8bdRXc3zAiY7hJf4k2Tw8fORPi3H
83waZ8lMXvBhPY+yLC7bb+NFlKQ7ek6vR5V9/bvZ4moEOyWf5QWMe5LEMPey
MeYrGPM//v0qzoLxXiXjeRSn4SsZrKpjePa76Xy4qKE/OJLRJPYHevUf/06P
9dssuRjpfKp3l8s0AXg8GSdxNo6bczgd6eN4MlkFUzhNinoRpXF5GRXBa5nG
+zybVEkBK4U/R3Aw/hSO8vdJ1BjlZKSfFQkdlBvlpIqnsGPBGxmg5FejKb76
Xcm71xyoe1M3foAV5WW+iN7P8w15M63TlAf9ISryMo0u3DeuyyhL/hZVcG92
9L+WY1h/Ec5qVZg2v/sbv6cpqSwvFtDuIt6B25hN3V9a7x6dnBzucDcW8LS3
CPqAHwkWOo4Z0ic0lZKwR0kXMptpgCu8uKW+TKq5PnwDLwb6NB7PswQmBG3x
Fkt3UTGL4fbMq2pZ7ty9O16dw4RneX0B23q3TACR3J3E06hOq7vTBA777v17
2/fv3vv27tHpGfV8dnA0Wk6m3B1iHphuPQNEo+HLR/AYkNoQEN7wOJ7BzQMs
tWahh7tHu8E6b8CqhEgRiZXdy7m8vBwlURaNoPe7EaC7WUbo4a7FqAYDDi+i
tDYQxss4yi/iBWwHLOT+A3ixt/fd9ldrZ39wcBDMfuN1pt/kgG7gsJZFDgg3
9tBm54wneUKT3b432t6GbR6X0xFs5Fej7W+7txiQuxoOhzo6h82NxoB1YWeQ
3GhYXF3EBBtwRScIH0U8XunzlV7GBUIgAkuU6Xg5h0tSAGjsJ9NpEg+fx2m6
gBeA2HV8BZgmm8VqwsBVzWO4Q0mVwOfwYlLOo/fxQMPyqnhc4RfLCGaG4Fkj
vDF8xhdwh5OpjuBtUa1+VSogCrMhIKEFjlLqTTgEhM50hd8UyQXSRByfYDiC
/gpYyxJwCg4xjosqmWLv8ZYGqqWREhbabfNkpL+fA7zSdM/rJAVKmiG5FWq7
iHFVSbnQMGR+CQgfMSDPFuhkBNsw5olVuT6PNVAcGH4OKFK2IYLtJPI50EkF
5AP2Ocsr2BmYKMArjKGoBZxCVeTLlZ7CxKBVFl8G2wr7P8FJwgA5rMN2BOu4
SCaxXjbApxTwGanTeVLqNFkkFc96DAcGX8c0NbklRVK+hzlp2uwU0M3ETLsc
6LIew86WCiC5RP6jhpnAt0B9aySqcL6H+SlANpDNNG6eZ3aRFDlfphGAXK6j
yQTWC/sF0xrQv7pcxmM+JZwfoJEEaSQCnOF/cCfq5olU86hSAqHwueZ9bICm
3T+ED5g1PALghxW6c6FdPV8pugcEmH17qZ+u8JaM6WCrKhq/jwvYlxxGAaRX
4Wnag1sgpOHmFPEyht8n6UqWCyBU5BHsKRxJMkMejKAPzwDgqyyBscHvGaJL
PDUCMQ9qkczO6hToaRHDeDAI0GZZD0PjPE6XpRoDzopg0XQXF0tYOH2I5+k6
K4FxgPcWy2meIkL5OV4MgOscJiLYQiEc7ssfI0Ypi2QySWOlvtDI2RX5pB7j
ScJxQ78387uEE/Jxnhpg7kRFdQm7rtZhoc395wdb4aVZh4tw2UmpDPZDaAJw
HRerJW5+AMewzUC0AZxhQ6cJMp3Yk8VVmQUGxfglP6/oc4vFtMNiHs4KsGE0
wyYVYsUSwTOaXABwRcTOXM5zmAJgjIk3Q4N9kKTzsJOY3sGERw67R2mZI7pJ
a9zYqBO30doZwa1Faga34ykAYJ4Dizx3qGKkn+eXsCmFwLnrv4mtVN8NGwCe
QTxJ8Adt8ozwPJ7pJKaNw9OY1tmYEXCOR6uWICwleW3BtomcqdNsWVcO2cP0
YDuAzCO0z+ASFURSyhrbAG9bKeKUgHZXgg/h6LOYhi0JlS8iII+wLfCtw6MO
zeKIuhzHGZxgDhwW4hhlcCrS1RKYHDo7i+TgYZJPHMK9LZJV5QpY3AU0pFFw
pgBRNW3IBfCa0XmS4uRgpWOYJfF2eIsNwkAcMssBpGnfckQqZb0gOFLQBhAH
8gvYDMDqICrgZAqNwElLAYSCoFbWS7zkcU+3OLcEV4VARmuF9nh+5htDBuG4
EMIM9hwI6BJadswIItkeRF96l95sOJzLNK6SBdz5/ZpQmkU5CIRpfIX7g3vy
PssvM31RpwgRtG8AhoNwLeoSzmaaFHB+MGUSK2FFgKI+fPgtMrHHB0cH370+
Pdw9PXx99OT42d6jrx9+dX1N/QN/nODaANYAp+QIWHDKBp06XkT517QsIyRg
BBGMXvH657D1UzgJgjl4UMSyd+Z6RCndKGE7FN4/EF2AUKWEEEsQYTQhjHxW
REs4Hl3kMDoME0IEzhuYBmwvmEBhe5w0YkVG0hV/BhAR/xWkyQoWKG3o4jJd
5C9L5nGEXD8/kLuplCUNszqZRCBf8odZxKsBFAnYj87D3BASePTms4K+/vCB
/r6+3hoQuiTBp2QUQXcLl+gIZrh2wncCOh1sEO437TR154hpkzCfBhQe5pvX
RURQSehG6AwyEcjSKUM4CCYZvvVkBdKlYC7LWNAdikrhjghqANz2Xh89O9w/
OAJge3l4+gMC29df3X94fQ2Azr2oZi94hnL3ePAmliJ6JsQH2JiawNywMAqw
FWID3XlbsVMECWI6ovGY+LzcUDlkiqMqoitdxBHR8xwWbY53DESBoIi4UUSN
CGZmh0bAWxBqK0BsGPh8UbBHitfQBaBwMDJ7mEmejZmnLuIaxIABscRIH2dF
TMTUUmwAdnw0AJKHfCrRCRgkCxkuFC68G2LYN7tNjichaFcw3Tke+1zEJ0fe
kHav4YppWY5ZI3CyaKGPa1aWFo/02yxN3vMOkd4N+Sz3ZYt2C1tgEbaB0kh9
Hr/NjBzsf4zXB2dBikPAT4YSTG5g256utLnOdBhFXNRZhg02D/a2AKHwGpTb
JIBvYGWZzfb4CBgfsVLI8RArVODAE4B60jDCh8BjJACQPmM/0rvE1JjLuLvE
z5Mr/Qw7/ic4pieHw/2RVcwW0zHqWM+T8vpaZrhGEiBGvRvGmXjPk2lVBjdE
ndcFTBcOiXjnPjQyYr4cRkaQn9yW8YcVwm9CxowAoOHpP+EfiHm+3X74NWKe
Z7BRYxBOkPoQpSC+dwO+2sAh8LrBvOHQZ/O8roQZy8c1Cok4KiEoO7yh1NAw
gzMsVY4X55K4Rr4hIMSj7HEaI2+Qp/mMSfkxEKKkiEn0BNkjm9VIRT98gbO5
5j0gvQFw1aXeePX25HRjwP/VR6/p9+OD3789PD7Yx99Pnu++fGl/UfLFyfPX
b1/uu99cy73Xr14dHO1zY3iqg0dq49XuD/AG57nx+g0yCrsvNzSJav5uICAy
D56gyhz4TQQ3kMWBmgAvd86w93Tvzf/939sP8SzgGO5vb38Lx8R/fLP9NVAD
wlc8GnHU/Cfs4wpBMAY5Em8q8AXjaAn8a1oSqQHuF3ghRKewv1/+iDvz047+
9fl4uf3wN/IAFxw8NHsWPKQ9az9pNeZN7HjUMYzdzeB5Y6fD+e7+EPxt9t17
+OvfohlAD7e/+e1vFKkrJsCmA2qpQdKhy+ZpIgAygRGrURvjE2W6JYo4l94G
FnJbRw6McoxXRJuLU6qNDjS9waDTgeo3kPfB/hHppis4usObhuhVeDQ4DvXh
A+k28ZJ/j4wiiAmxYMyAZwDRiEVg5ZgAwlQ9yjOY5Fu63Lrjcg8IMgkpkM2B
OvNRdnMLlUUgvco63LzzeByZXegytNnTUvkYtgMaTauYeRJLjPRyHpX4dymC
RIXzzXLvC39cxYTlIk8vCGm1TwbEST5Mx6XhgD/i87j46ewSjiU+I90BMy/j
GGkrPFCNFvLKb0OKnjJ2DAuz5hNtgZVJtRqnKAKfedt3Jss4Y17q7EgkyAJG
WPvdQIVM6+b+VoOg8EpwOsBmptHYsE5ImoFLgE2jfY+RTgLfj/AEYkzXkREZ
ODKSizAQHd8ptUcL9NZQ2guBs5um0ax0hBHgHsn58NnL3e8aRB3+Tx8Djq1Q
zTIhXbORhi0TG4hkytuO4PhHGq8VMjX8HHvWG2YBZ7CAM17AhsJXQsg7P+C2
lsaDcIrT4HPlcWPZBGTccr2593xLE0I/RyhAMTiNJzMzSdhGo3fyTCmbBwcg
aSXMxfE+srpJll+2164ba1eO1KFWWTRsM7h1JOHioSQoGh7yIGvWmrCGqYzp
FvGZgsCVk0CzEl5ThZPpR8MMkw6umTGEO0Y8RS/CBMhNkVe9iBkcEmJoUTdd
p6lyPCwCahfOecWyfglsCpqgnQn/2m7BuAm6IBYXcWx2qzKq3D61ObNkHSRF
G3qOIFCTacTgpzEguUGra/EgoLWtzOUt+wSLEA7wSBFf4l57G2wRWoQcJMgL
Y/3OakLeWVUIYQTlkAEMn9187RuQiMtVFTGN+JL21ur4xJyU6XcbdRZfLUl8
PZPxN95ptNdWcgG7t1sOEvEaCv7QgKCMLTuOPJgloUF5ot6ZaXuL3jx48Rau
mZkQMYIoLtfw2ze2fVmfo3nSoCDchgQuIGp0RuvkSRRu3W61tU7Sb7mj1FC/
gxWe8QrP8CrEZQXzu7fVeoUGuBLnvk3vYMln7j08vr+l1BHsw83j0gayRZbx
GJp+mS3xOOAPH9B6O4zf18NCzMfApCi1S+gcZVfRPwp8oRzdHttssTvx1vYS
0ETniNt/WYAhbqMsyTp3HlvUQUuOE9IV0DKYGCYV8hyKlM+RfvcMPkedg70h
cHXX3i6YZhvSlFksy7rCSDDngTgNYYpG9MYjnLH2Eqnb7Qle85M5HPZBBof3
DvahKBJzZTrhjggGcJg9oEczMxiRVAy8B6hG9VQNAWVUHlZdr4PYzVAv7u1w
sMElqfbSWQ40Yb5gppZVPcZU4WEsmMTaXVQOsoC4xLMoPVtGBaALaOBt4ocP
QDd9inFNAlwpK4CPIz4UUXii6gRkdVRjDwzBVp38iiWOIQZJgn0UnuKdx1S8
MzZrALY292Bhle2PLI92IkCnOSsZ/pDU8a3pESqUKJrX3De/U1FpITTE1WUc
Z96pV3mhzDLEsSAuHpsraRhGIcq5eyJQhKIQOluQ7l76g1n9/e9/Ny4hwore
/ueEelZoIdD6z9rbcHUAi9If9R1c6FmJt4lHwUdEhCpgrM4sYIoXywW8NVvk
oWl4M5Sf36g181k7TeYuYZow28/oxFsJrgLX9xm9BD8Xt+7gQwfUalyLnMAt
u+nc3Gtczhu8xuXtF/Rhz7mzHDMavP6UBXX1Ax38+RM68Jv+AaTH6YpWsltX
n3UwHwwluc06fm3AkT/8c7gOhXOAqXTM0IC5P5r/0wLzH3c9nLIfVdFPR8EM
ftP5yS02YDQawVc/Ake32SZpWzTKre+c3Y6uDpkKbtlJ0RchG/aJw9nZ9+3Q
ne0bd+jOtlIv4xlcBmAnsZs7Gl1GWGhmZfolkKH5ysnegvKFvGAbn4TmHo82
4i6HQZf5UoxLaM1PqppmM7SafWph6NBdb1BrBkCZMkovoxVPRAbZ3PLGsLy+
s3OxjYNUPvh5oGeJhFqcxVGRrhoKE+n/w/XP6d9qiyzD0j3KjwABnz2MHWSd
9mdElO7Djv4iZE7Y8fHJxhoZmJC9GMysgXxDFPddbMIlCubsLwtEfYeJbJzV
C/0BZ9++byC4DFpv+OKA3EKvwhsDYgs93bz/6NGWum5LEKcgIjxGd/aiHlc8
bOc3GgSVs4o+hk9K9Oio9KZ5uMUt4Qfl7o6J79gP8CdgnB29fCyfXPf2xUv9
/M7CzQn7ufuljhdL4B2/vOs3vX7ctW2P6ajUsyROJ3hwX+p3Zi/e7bAQIuKX
WAy7jt9igS9ZIKB5Q3Pk+ZiBsN7U6Kp0yjx2RdYh6hYVbjgDjVqpmLlxJyA4
VRHLEiR9VGXD35Sk6oS49s0yRo+EExGFHo7uj74RZ5nr6y22WIkidA/OIZmI
IRx1P/BiTyB9mqP9lUSvKl6yOFzBjc5wYpHtIhRGHosSBhqo+Coe19ad0Bru
Jgk5j5RpMptXZCbY5k2xbCpJfmXHXneRLhbYyBkgUg1Zzri19Dh0JqTBB6Qz
Q79QFgPcJKxSyinTMpanXBc8+bdLcm4AAWxZDUJ+XZaC54UmraasiTJmh+TR
SVE9Ebu1KrV+Vd58elfldcHH4bXZ/QHhS1bDvsVmWqiEZS8wnebRRJy48roY
x+gEih7fCQI60k4ipwuQdhJP7wDdkbqPfUPhdgdTLkXxcR4zNSbnCecrZ8cq
0aiSL2Ljd5bK0exay0nzSG6960mlWKKX7a1Kaysp2+ePF61TydHTeyjvMZ1j
ybnltsRaUCZNE4ddyubtqdBFRGKsFKninK2mFPUt7gDCD2HK9lwb/JpVRlW5
MtYmmo6cYXMGFsgYakLHB1bt8LpgMsrAlK87vXkm7K15mdeANsuKDRcIcZ57
og8BZpCOc2mM8K65DnfuqnHu3DXvbqixgcb/+W//qxPImsOxVrxxQT1Y8w8P
hn2KngluhmyKC9qKny7OJinWEayS9Ts4fJ7KuvRxszP0UWamtJv+tRaknKNw
s3/ETbIe1HhQPAHaaZfsh5ytHCsYdqLMhUBbIhkkjHa19N1l0pVDa33mCFGp
KKEf6Jmal4Qyp0SRBn3r7KQ9ZoUKnUsLjf6cY+vYlxe4j4ZzwPbm+r7TFMyD
WsQmSTCmMLYgTcSvT9BnScZIhTRbWO7JRZSNDa9MLMNlLm7FRNMBt/L4VRIP
z4s4ek/24qhISriOK2J8FCyH9W2biBMIT9OJl3O6X+fkww+7lKB3DmrqYIAa
eBQVlSvA5+iISlu8jJKi3BJ7TTZZ5oD6RcWIjmwShEDe6cYLFgSqVPzn6HbB
BLpUtqxsZIPtOM3LpqpS9G3OujEtIvLXrdm3DskMzP3dc/MBMsPvxEqaWBHE
8E4oM9i+mGlyijOfyZafoFu9KGfMYws/6pnk8bVlTPEHbSn3HwLgZLNq/jgQ
eqHl+QrlI4BNg/aCtoZ9t6OPzMhbwews3yzi3xxVYzvunafIe9zVTIztzWae
nq2zGRznWT4VYRP9L7ntQTZ5PUVn7hWK5j0t5fKfOcF4R3dZgjube7FXTnCB
ZbZ0WDe19hbrt75x0AvS/uw0mrFOqLPxVNRDO+E7ozXqbIN4Vzwbz6pk/D6m
Reqj+PKEn57Sw862vvDk/XhyUdeptJWJ2LpDqHINr6385u7I40A09y4HS+ZG
TrDf6xO6cECHSAr/wokvXUL8wVWEDIpSzCSvNU7MAeEPU0B4aWCnMLr4yIay
tEzfJn5MZCzukhhyGt3eVxubSITCkwN1dM4uiLEQpomwZ5MJOeicskM00l5A
6OTsgwKqiEprvTy6rSaqy2riX31rM+lyuLAWE6Xuj/Rr5MI77VPsSGH9kSKf
8rKBUQG1mM3iglbZPJ37cDw2FAs+z2GrLxJ0x5kG7C+yfAUyDY6FMVPx4wdY
hHWidCC4/XewhKxXjf6PkeR/jCT9Tf//NZKs+fEMBT0/JWoJMCKLQxdv22eP
5aRvipuEl+zt2Nr66fZGlT6byqec4KePb3++kAukjTLCU0R8QicUc8ZKCH1y
cLRvooMBH35hEG7XCGHL44O9g8M/HHiNzQiddiX/JOwoPbP4pL3on0+3meH+
OjuDsCjMzWinGW1pY/dFHSuBM/LdwLVIGr42FDNVER3O0At5PM5rI8xZGq0C
FzE0M1UYKb1IKgpPIsc+ENPThIMxbBS1kdkwFvPFWyeqG4nV70WarwaaZs56
U5p2ywGNRVSQ4/DPAlqEne/+gH2DODfDdVIMQtMDy2i6H40eIaOwT4rukZKA
S9JTkfDKwah9CjqnF4EBkbVITVRYxWH6Rgg3qh7xTyLWBPbXsHwklxMUGFe4
9xSrplxkqfGQlr0DuDex8jCEMVS9b0S4wUEmqVEzsr+Q80l2Adi0PjsZtqN5
2hPk4EwkKsbuVDpF9Qd0d5dUt6SzgDYekLGaBQ/C6KI4IlzUklGmYgnNjZf5
eG41DvZIndu31c4OWqAr4RYRgM8C1sfBe+SYRpphGfKxnrtIb7hROKvxPCeF
AIVMjNH3E14tTG4B4b/RUb5qWzV2eq0Pt1DiGiWQbLaJNJbcB9CF2PhYT/vp
xogOjSr2aFVc07po2CNKUReZ40choD7/C2oJYHvC+4ddAeTxpZWEFOc1ImWM
Py1IWUcxO+QYTU5KFHwYTkzckaz7mdjKQ+PUrbXhpNHUu3svfhHDCszjF7Ct
+MGMuPufaF7pOaRO+wrbZD/BxKJvbWLBrnutLHbmnv+9b9AQ2anJ+xj3QDgv
RCADss7QGm5joBk46KvaI8jSGeklFEIbBAewROddB/Ju20bZ1J/559lhLGMS
mQhePL3zqKTwXTNwny3Gu38ck4AsBOs92XcTtqbyVrPgQM/Wen51axPoALha
jP0pY/TPhIPHEyFdOwUNTLrsMzhUj5mBiB7hclZTf655p8u0a068D8G2rDH2
Yt6A2NroTIDHBxs3ozWAz/dCrBRmQIA3ezMZ4p3zT4+d0ceJN51q2yoEy1lv
GLIBW63T+t7oRNxF4O4cl9J9+xFa+01PsMzG7cI+vK1oEi3DNHfPlhhwmfGh
uEEI3HI4O59As1NgkBwMJSKS3AaQGBrszeDeGRgCMkwdWitnzqouNzfBqU6p
5OOfX9oGMcFIr15DhHY+RubH1/AbVyLz46vxjUOR+Wkrkzcfhl+0tPmbj5of
tJX2m9+E3wjGOnOGm7Nksvltey7hB9v3wi88Xfvm9nbvO+tutf2g/xvW1W9u
N1ZjNPKb9xtj+05ZzS1qK5I2T5/ubw3IloMMeGC+MQd+BrzpfPP+o0Zv7Osl
f1yHJqbHyrzoMEb9DGvUzzJHUePtr+yyyvivj73GiKSHhiKJw1Pn4EbWA3Cb
lnH1+LPbe6u4VXtjT+u3on2uGe1z7Wg/w5D2cy1pP9OU9rm2tJ9nTPssa9rP
Mqd9nj3t8w1qrnUnLt3Rch579unhmgU32sqCe9te6/N84jb9mu5Uj10vJF1G
HbZ/C+ve/q3Me6GLorG7JWmKWcuI7Yh8BUmHNDdQLsPXPL9kAxNyJqVuJ/Ez
zL4Q4JstRmKF2Dw07MFWz4eb1uVmC7H63eHtfv6k9Eevl0Mxf7l99X8+Qsd/
umXHd5X6cW9HV1dPHoCIBv/+1DHpH0+CL1Tb5b7RwOllP73zz2jSeyz2xwti
6AgY+JxZfvbZnYQmCTQ4eG//8WfXFxTyaaaXL1ACZTlErs8qrtS6hjebPLZ+
UqiCRyU+iSmvX+4bJaMxUmCCRwodrxdLHJH8m0+qeKkf7HhiA7526nueZp7B
p859z5MCzPjDJNuBbzaLq50nxdWd7cewccByYah9nk62ws1+eDtY7rZb4I/b
bVo0LBiExaMXb1HsqKLZzHjU4S7APDYfsDP3AS2mhFfwH/K52jFb8NWOJ+Px
Fjx9ffocW5Pn4BWqM2AEWuetF/NQvrjt4YLk9JPehBU8gXVv2fP5un0+ZKIx
h4MSlz+xh58wsTX4qIWJPqXfWy14HUL5hMEMNSVK+r4jgoVJ3jpyudOKaSEi
++ED9Yl5VEOHGNKJs8RtNS3OMdI4iPiXHHXEnC4LTVfliOjy7t2nevgb/ce7
P6AoL0G7NtyHPPcYQ+RTX3PBSeKrq7sAl8Y7FF0CKeeCPydfyyME+U4XOmw9
bDy4oz7aDfJ+PhrLIU8FHwi24QcfP3+03TdvtP/sN9j5g7sPcLvwPzx88OAj
NPu134Y6uVUzwOTBaPDy00dDBOJ/9bCzGTQi6NEPoAPEWbo97sPODh7SA9fB
V80ZDEn1Yjt4aDt46D9wHXzdsc80g4frO+gYF3q5udlnAkNwvSu2tX7KzWa0
v8e3kK41INa3xu54KsmfXqA+98MXnmsLesaJGWdN/pAgTN16dEliPDQIKso1
E2RCMY5s7Hnem3ILVW4UbdKVWDkw7YaJcWwGP5sKUtEH1qMLUY/kVnZGi85R
EM/gourKmUevKuX8psmK2hteiFNZ5BWl07Z6QBy5iFVlc15jOJk1ILQSXknG
SLfPmzAn+3a+Oi+SiaRQlQ/u6je/H744eGWfbA38EYJU2s7g69pzOr8g9yym
YlDnlFffWMpdjGuYaBvH4PEI+8IhLSkVyJwHtucg+JqzZnVJcNYkq3HnsAc6
g3wW28QGNq12cyj2mjd0aFwXBYfS3spMQu1uZw9SLja3YdW1YMX2HpvDX58n
LowlzsbRsqxT2g76cKK0OadxsoQmWOjH7Pnhi1fGH5Mkc4C9N7+/eypAgPa+
N7/fa9VkgB5bZxnMAgAgXVnAMyE39pwx04pvDPb2mqhuilnxgTmm/tAnw+a5
puR8lzF8ENn+5CzwQ+VMY8QzKNZ9ptF5nFIxpGxWirXeJjhMKh3kLfQuLd35
JDO+uHLP3WxJfXp2BE0wKJthvwduwgoH/nU/wvzcJOzfCLeDxgjKG8H44yI2
8aIwDA6txX+F9RYmUli1F3NnWz/h+gX0dPgcNcTtJX/8eFuHrB4R7+f0IFdl
i9fALsEd60DHi3P0pjYbMOg4O8k9NImJyozUUW5SAXUdJDqMMR2gEgF4LRGz
Iv6sUZEUQutINce7txZWhHQYf+LAZ2KgxugfRVZAAH/rMGRh1/enxrw/uSQL
MnomClJj5tKoIz1DYqjTmiQRXO2Fx543bsY8AfgqxvOV8MBWPHmFiOqE0U0j
OUTjvK1X5z6hiSE32hwN9IYgDswiu7F1UyeGmgFb9PzF/jMsp0TJup+Ec7mz
vbajO8KqtSczBmpsuIiNQaOTTnjtgMXmKppNnuhbpJ/87CWU/zVLuEVmzM9e
Qny11IsIC7P9AxcAg2A5h+LnTxeLq/yy0239PPFKVpxhynd/1nQn99cWpcLH
/g2xNUGQUqAhWDn3xq9H214Yvz5JTBSG1wFGeYgXXJjNvIE6bIpZjNEwLILE
JJaqrLzQQ/5DXlacft44tPCqAK3rMkotP0MVKvyQdJd+WJLG2xJUpSgUTGEd
wSND5TOfhnrLUE3HyE3gn7Yk2z+molf+OXyAg7hmK3+4TEHZCXsfM5gIk6Tc
AtuLK+tzKTTRmWBZ2EVlit+4hZoyUa3FuvXBQqQ2kPF9JFcFLoHAJVuQO4km
k0SSy3RNwXFIXtphSnI79KWQ2+TaBfrNIdq3wCmDpmduALoPLOiOhFmQ4e/e
qnOb9cLxcCpYIEmjDT6jx8WUuQz1CePfODrmLM8xqKvUJk52pI9yFNNP57/s
UMgqkVum45eMBOpUvVE7Mr0rzUSvs9VnHxFH5fq+nyYxngXDhFh6zq3tXSZx
8PXL7lDML3ujUdrbDg9243vezBzEFePEcYn0HeZ54qVXHohnIUY3F1XECf7G
4oVPp+CHBXIgOlmBh+wL6AoOGRpArkzuTy0JvLEphvtxDla+98oJ5ogU+yqQ
DfwqXzA5DMhe5hVXAqPst3A0lRK3O84FTOllWL5ER1bxzsaiDrETWLN45pLW
ngPRmZIz7VT1aIYAM+Vcd6q4iHUw3qyOgHRWMadwwmUQTL63mXrhWE08uJyZ
+A0nGSC/RALzV3ZDeZcR/ZU11mxCWUAJAvZQHiJEL0GBt++SOEsynjvk29h6
ziXQHFXKB2HOEaZ9tNAYoxkmGCyKpWMsNjHgooDsIsXCDfVhxJsUy/gJekwu
03zFpQn9wmCmKofC5I1S6UdUXVhmiMDVwglWx8ovzOzwGDDpNnpIUJjmF1zX
8/c1HEy90HtOVbBqBJoo9ZwVDYGGIUzqXiaLOoUbEqNWpmYdBT5JUE+J5+w0
EzayceDyP+AmpARsrA1pasXOV5i64zzJDDzCZQEkTvmRkOQxAZ/lXD4prGWY
lH7xH2V3wxbJAzyDfu1e3RckEfAnRvTa2XpFOqnQpGLx0hTkSmNf8ZCYInCE
l/4qezz29xjlXqcjxFGjSW4iNNS8veOlpBvroqNU3ev5D0+PD/fDLPDcz5C1
nlgd4URifo3ySErcOPLIWYox/lYqOVH12z1kul69fHHwKuw/Hk/m8XCRvo8X
SLkJk3bM3ehmB12pLtjVSk6yle8iybp5Y+zS5EYljIbGo4wwluobpHQHnJVV
UtXhERuGNlrEygcfLsTkc8sd+p8BRz+IVlWx+o+AxvqBC4Q0ktXaTe7YXtlY
eyjMDgMUAgqJGYGoVy9J6euS+hoO4SIC9hdQiCtKxp8OH23fH5jfv/7qG2Lh
5M/te/cf8mUiRbLVUyZcTQoxKr7wdJTMgXK5QZgNZe/4VXCGv+LN93ZXr91d
dePu6p7d/UKfnMAm/vDy9XfPDl8e2KIKuzc7+/hVsAzJKZ2iWbSjAxUOICfn
noTHB92n+QyrTsMZok7K1K1c5kvR/pqCEgqr7CJm1jRZRogDCu732HlBi6Qq
5eXXVZImf3NpjoP5cfTSu72XhwdHp2enx7vPnh3unZ0c7B0fnCJL9m5Hc83Q
aSKhObfj+X019xgksBodrnCkk4PjPxwc32qk2/GMvSMd/PHN6+NTGGvdGB2q
gu4eT5JFgkVrsXQh8R1yGubrYFcHcglRXZ2UzSQC6sH9IfrBitQmCOcY7hhW
FiRU16kNtLZrrObgS7f4IWVytl53gx5WWqADS/tNmDLM46toAthmQRUyQ9g1
SzQ66a5L4RdeWJr6jsm00RMlLgeGiO4xdsd7aCwKsod+jQkUfZgnu0XxlOBG
itmBbmVjGm48W5cT63gnlY2YxYCf7svwbqB6gJdzhbfg7Z1UymAAI79E4qf2
2nXS7Q4bHzzTyuhkuBqx2HJx3ScCmFgvJNbPqOqIpthVW5nGzwTXAHMHX16N
QVNTuPEp6W+olpuZpClI6pFKkzRfCqHQUYstj1I9dtTUoAoHY6oHzgbXgDdr
p2vPMfKkMhVbmrO0VXoNV35qyo0PGjbgoES37DLJaNNoLBDnYrdE32K+E+UO
EhqUmYjY9NdpKmLPnk0l45gzePHWFYUxTEtjCBfSgUO46V1iShdGYWMuWdnY
CMoFl7mqnuzZGu4VlbxasZ+Xz7L0n6viLHlcijCQJisu7kz6Erp5diGG/w7M
1lgPh2g8d8jZxHoL0nCFYSnN29DZmQQ35oj7t7L2Im06TtwrEdaoZ5WM4tEg
bMaLchGIYbkJrqtr8JPyeROjZWCL5bjy8zEGp2N4II7Dw70Pinx72ySnxCU1
28uyF8JrwUeiWp4Ea7clvD+w72/61xzwYz09e9l5VM+ZDcS8Nmmp8u/Z/THI
SRbjitZ11fYNqIunped4ZSou3fRpCGtotrbaHtdhtdY2+/cWi3FPP1GhpcHT
vg/Uht2L+H29MVBNG67HEYxGUqnBGALZlPp3wKzN6k/6xupPQc0RMwd1C4Dg
A+k46CTIrGj0QgG8BsUHnar3kVX1+r4TSVZzBT2cZaSEKr1r7O+729Ap470D
PZynXPsKmOwNrFAyXm0ExbNGRLktQX5LLBgHa3aWZ3tja34amYrChk6OT9/Y
8qNDNAEPT/bgESqF0AEStyWXBBcwO/bbMTwe4yMEVRKFNM7FsCuVZ5do2jWw
I9YXYYS7oal6WRdUMdjU1PPKlHqF5JqHpHoPaWS3R3I0UBSoYfVocihzRzXS
psoQS1g50UYxyJvdyjBesmypMKQm6Ldf3//WGQB6BG2vArDneiZCrlss0SBl
HAHM0kOflyYxqWxqzNgsmkbGbX8l2642D5w5CXXKkidDovY3yvcbtn/hfD98
8NzrrrkS23msaA/FSLbBCGLDNLEzMy5pg7DaZfdtCub/4tWAtZ/MAUSV8jpu
QxOqzFKuZWXVcobBaSqO2Yt3/V52od0mxrDidaOxVcqzPrzZNWcKKE35ZucR
EXVJEqpJtfzL2CiVxIyLqZIntIxKJpWrbAxsXoazBeLluNeOAqJepTPcd8ob
v8srIZ9MdnnhbAe0BCfQSRHKxrTGMANt3AY7BD/u1gq/xUgHJMLZeaif5tdk
MuJ6hszxcfaGDnTDYKQdruGuDP+LTDc+GEaXrJlpEg3MMnEoSkwiM94krBIJ
OfM0RwY4zWfECFOSIq5TVVHdIkkRb/Iwkr/pqEEXJXcRZ8Zn30fvCBILPWQr
Y3uYc15lELBuraoPFfn+dhJhEVtXyWYFb6xV7C0/zHpAOQ8boMWzoliIR9pU
8N2Diw7b2Kr8dHMfD/0+RjyX/VtPpg3nOAvX+9fc+75M8bYTDDv5NuhE9KUh
rB+gM2QpVXwd7x8Iap48Bj3d3fcJnsf0sMmPaiWgOTATnQ7lEBYLmZCvsFKs
VzuBCqoD5Xr09b1HPOHc5lkBAidII/kbpzBuzTQoyilpnggKUZFksaPZyrUI
lxU5EXqDFZWUoeeK53jEBMF96NbIa7HnGkJ5DTCWuOWZrAKUbN33Ak9vmwSB
4SDLbUooZ4i1ebsx+XdzRoI/+Es0UxY4CV6Pg9nWgqS8WqBrtQ6AnOCBYZLs
o2TSW8QkhiaFpwpjuY8wxQDtPOQ1TW9dxhw8eaH8DjHxNFEUw9eUK2ukJZ+I
GXKZw/GvlCf+eqqy0gePocGzvG6JYUULuOM6+WR9mFpgME4jZ1j3sZvkOaWi
EqnIJ2cTWCgcV5oDVisk+XppFxqeHmtCGvARVcqIeU0mz9yaB6MHo/uszcK7
8+Dr7W26OxifIO7NKMe4UNXdkLdkP23hY7x3uVjSO1E11q3lJtecn84Z1EkN
ZDC10fQTQ47fRSlaBq3E7fG5olCiC2vN11b+JrMoGjv8/L1Un9HpVyhtfoze
BVGRUCotI7qxCks6JXsv2x7R5MuZgoR+vUqqV0DBl6SwgK1j9MY+qJaR8x1e
R+qEmHHfayBCHsPwyEwBuZa5Z8qcYNavGYU9hVtlvRewNg0zqwo3T8zknjhK
DKjJ+45d0la5ag82SU5AqD1l+Ajxq+Qb8zZfZmyn62gwHYC1GrGDg81bZwCg
usyVFSrKnSb0eVkFhk/JZi/hX22wVH1gKfLN/a8Y0o22+JMHEb74M2e46Wr+
fGVuILsLolefKzbJBwFA0XWRqOpvKHrhTnuzEdppZETCUE0vahcPQkoW8pIo
peBRh5e4s+8CN2bBup1mwk8HFbdcqANdDlP/SL3a3XPej77eDHeSFp5PG0C5
eSsz2ZZoQwVeyxbAIpFDjwwWFeyqAqThM5CKORPedcYBHjKa+PfVXSVWSHts
SSCV8Z3Q0eI8mdUg4fFZOonKzx+Hq12JMOMVEu2oGNRwx+o6p0uTRi8MCGmk
zyMuFfNVdvTgOA9c1Xlt6h77zGILAOZsqoIRVyRIxlkjkZQks+yogtRAop7e
qHnbFZ+7NUrYBLM2D+m2o36MExBfMbVfEZgM7B3ssobTMrw06t33D6HFbgBC
OXZgL2UfprK67F41smHRwmgZ3n2J8uEY/O5C6iY3PfXpiYt9E3L8Ok3NCuVw
pgDuxEdFgULUibA4hB+zV2gxJEoEX9+QhBpU16KFxw7kXxFTPuUAPDa/nbTG
JfpyAHPfZ5gYZLasXNCC8qDhg1ZDFRW/0Pni1SQGxHAdcdnNdLBQFVGms4DH
EBaAJXqPuSBc1+SPCdKTor3VZedelyxfcd8jFThWeIBgHaNLr5aex67iJj5s
XVjqeholqfWYVML/iMHN8EtjYsss/9HWWhBhseVAd98cGtfBc6eX55hWzITZ
B+sI3AQ+vTe7CbvWEsEJM3Y5MqAuy3D5X6vG0kV3A+zdQFhROOV4yRIu1wLi
W4+cRNXSGoCgQUXvTYyxhwJCa1fpFWsjcg5b05DD3aRAhCGzUJ2JOxDlvIyv
OIYw3DVjbiB3jyWrS4WHVYt8YnUTkiLYmyAejpGJjLbLU2I95mWJIotFs26N
HqEygf3bY2/1CZc1MrdUE8fYR6pwVS6ixKWD/iTMzKURW3pFaySoxKvVhpdI
PB8cxEW8cs5LHdnEzowmhlxnBiyKm0niFRqAcAqtxnWKmc5QO07qnkuqj2K0
Dig/kSqARHIimbm2pTQd4wDCVVOVMA2oBnl9OM+OpqOssV5yqLrcprLhwcVN
8XyF+aMXEV5M9ig3jjai2lprA4F7m6aBgt5PEc+mAZJ2hNO3VqrRNj77J/z1
Cd6i7Ydfw1v/ahC/x4zOyTjnGqc4Bc/F5cMXJb5BibpjkgCUNenphTMl7rNl
4jY0xccRPtc7YLEb8R+KCPSpEVwJ1vNsltMdJwUUzhyRrXMlOJ37EUZJVcbp
1MnzxkSHGo8hAgRqf9AplwbHeqUYKUCGL1oOOf4KsmG/74EYcVZcjme1FGOH
OIdjqmn5UseMA5xHZqROi7rEu3VA1VARbg6yi6TIM2IdN08PDrYGgB6KCV1F
C3mvcnQQ0pvPT15tDRRq+aSfN2lUoRhnvzh982qLKmji2RZRibxl26vFxV/I
tHFrRYFUoI3WCSqca3ogV4z0jbxxeHXI235SU56DRbzIixXdg5RfmIjdJijg
/aRQiBGLth0mbCU4o4iHnkJg4AIK+BLbduRV5PRYpCsh7NzDUmPqViMAj7rh
GWcAqB33h4W6CUdZUNUANCOI+5IFTzsBSi/v4FOCGxB9UUAISnITzPePyfBZ
c+d/3nFDGsdGzFVmlUOwn9kwyYYV+mYnk0ka3+i8XAk9Vq4YE98OXq5FMHWW
4qw+fLDatGvj3M1+T54bvdOphFQ7bGo8Bwfh3qHNC4gmbEqekakFHQWN8mhA
kUHowV3FQT0I1jcbZ38G+TxVzq/fK/+pnSqlU1Rdq4cRTTGzC3GfPjK0VXur
DPUytuAm3r8g3QYdr+8NGgr2ehdrYnosC1WTN1sjsQRBvYzKuFVZKypzrZxx
PahggQwYnQYfbBTgbo5bkixMVeCAYzUU4iRk4xn9iICBcTXuqwQ/sOlQez8w
8o/4Gd0+jE7CpM6ZjypJB5WJC1aEsWd0mytb7jntqEpiR/dvJRlMXGlSTkr3
mVM0KQ9cZ8Z84V9g9bYZQmu3n9nXLkTmPjbOkKQDV/3TMbU8RAnWeaKhtwFy
asqL32ttE9PQMsCko7WOtN1Y2apx13oaEnlPSeJl3RWFdJWkUJYYsd72LnyN
tF8HiIl8B2lUnNMGAtA4XjrYpaEVhC1fopvaEat0IjcgMtSv7QHQPZWmNeol
FO/4SbhCTpoaZ9BkmE+HmKosGaNgkp9sseriBi8bgOcYS0KI7tRyrNmERdoh
kBu4ElynAMB6Hkdwo3ZholjKAC1PSOnk0kkBF/ZunUdYkGjvzVtNuJLYBa8i
hC3Xy46uZHm7iF0SRq7Qi+ipp1gMcrANjSbI0MmMP6PTfJmY+hJT6jAbcwkg
kvLiSefe2NrAS5LAJM8c6kVpoVJOqWTNZI8avb98vLvo1nJniLK92uhIMSWm
GBpwjVxC7hhPQ47jbOY0fh/0mVdoN6l6y+zq25bZZeEpqjpK7QK8vfZEm+9q
kJ6w9Ifad4GN5oxiNLGzw1XH3XbBjYJMqcIJDj+N6pTsBixaeVFOVLXTO8yC
rAfCQ7kSK1ggGk2xGANhI7+RS0GiwDU4SDOQJlRKgJX3UUpz6UUVNk42miFy
q1worobrZjlkEiMPd492WxKkVC99lkYz+Is+kUIdcWls4ZNJA6YxlGNlWIYN
235D2UhmiSCDr0gOxPwrw2N5dH1NF0H/AX0ddvTp0/1t/BO70EfRAh51VZ6E
LyQ1Yrmj954P9MEBPjtGrmJBX+/oH/gJafbG0M+PgV78J7vaICH9z1h10M+G
+qQ138c/92M2PMGO9a6aTO+vX9xuda2YeptP8qQ+xxzypT62s/wiATw6jN/X
QzPz657NQIRMhhYkx3aZtAc3j7gx8IQ7ZVVkG6e2kttLUtFZWXMT+t3icpeo
Mik31kOTmL2CqUlYeKl5zVYz1OlUJZFwRJoMA0ZqoEwMhITmTNcsmhu/bLhZ
H/lU9Uf/OPEvPjj4zR4aJXXETI4d/8Kbe/B7OysWPPwB/h/aePDz7ebnUqSo
7/v78DRMsdD76YPh/UeP4M3bLCpL9tL8iP9T6gijVOgZo1WR2Xtg4ZQAwG2e
+KLC7VqgrpHjfs9XDHXGj+okCNc5NiUSHBf54cNvj5/tfbN9/yt0F2Z/lzw1
cqDiEKBIPP6BgLBnf2eNvu2vsRV19xA1UtJdqwv14YMdUgdBFGRCbQYYLWsQ
oMbo6edUyuLc7xWjqnIOhAbqd4i6zSyuhvvAB1d60yQxRMwfMwXiKCHqmUUz
0gnDrLY0R1AACUFXdnuQUg5PouMkaKqknPno1DOp6UhQhYce4PViwPXOVhJP
h06RTGB3M7ORqDgxFrFFTtkzhhNgXLAgHhZGFj+WymTchE9RCTknVkySGGA9
yIxnrwBc8qKMvZJTNyMUUREGsXgcofpJqDyJywCZhx2+pA4/haL1oQHv8qMq
016xfjTQGz9LiX9JWhPHKDKZp4mXr0QE9i4817rn+sj3grVxi2yp7GgPU+sN
uO2cmljs/2um1hGhSzWgG4aLf+AcFB7geTR+j9zWblBPDUDz+1j8HqkCKUFe
lL0XxdXiHO2TcgM2Tk/+8P13NnpDY2iHEjTISHefgxxP42ix4Vs82AJgTUnS
L152leWe4YJdBQcUAciMyasIRKA018cJOmTm+mWcVCBZ4qt/jTA69G9/i4Av
1idR8Z4fv4pmGYgK3+M1K9Ka8mrqf8nnGYYuVGWZZ/hgL43qSZKDjF1MkyLB
R38EBPwSxGPqJAGpL0716X/8+1VMDYCnwoDK03I8z6cgRNJnL/RpUtQg38Xl
Jcz+OJ5MVvj8KeCkAnHjMXLnSu1awwcmR7ns33EYNbEbrhwngn2JwApLy4v3
CMbfYc4KQMnlxeVsS3+XF4AEnkH7eV1wRVYFuwcAAS1j2KMsSEdqXZIpCxNy
DxGcE5p+sHIdVY3X+zVFKT9L1k9cvj6d54sSJadDOMkEBMq6vIiAWRqop3H2
FyzxpV9Ek/r9AM0oVQWMdT0v8LRBJgeaq/8FIJTa70eAx7VpNFB4bvPkL5jJ
AecEjwAcphEQopN5/H4+/AHYqOkAzjjWT5OiGL5Jrirs56BIxnAmJdzyFGaB
e4hz1N+L/7UDUCYSmln2qpTaCITjo/EcI2klZQVTZ1T4oSesod1Ma+n7hXy/
LpxcWXsXfWUsU8Yi5WVvDfo0iS4tb7O7xBiS5IpYP6v/xy5teZfkIlYmEEq0
eUB3ElHJEe0VH16Ws0UMnsLq6KqubO3jDOVP7G+k0IYi+XeRKuPtBoQUoZBp
jPrB9Oy8jarQjKPOY+Az0Mc4cDgg1MMu4JOVZXRdyCr50VHODWbdJ8SaIPku
JRUvkjUEXPQWhpuXk5oIlTd4dgDF0fk5HrkR2u26bfIBZA8BAekvkc3Tw450
yCY1LH9TLns+somSv6Rs710fNbKL4aeYyH3ooWpmRILKyV7skyvmTG0xpXtb
zbiMVqgzQF6Ed1gM8gh5DdB17g8E5mbD0XWPCk8QYvMKfCvKgWRdTVlvMvHL
InIOFsAzDQsIdmrjG0hb1w3wxiXXcUqmXgJRiaMa6Ql0KglBsKKfxtJ9+j//
7f9IlC0DcOrO2nkJ2gtF1IdNmGyFQ71YXFVB37vY99Owb+v4gcH9hdPGRMEw
2N1JnE6HaZ4vS1vpwWPXafWNKH/WULG/jrmoZJ0YWb0BnmEbXfkmeEFUjRqb
cky2VHAABtT9F9rWZQpHoLBfHUXlxaw7sT/XcTg53T0+bSYDRa4IoQSh/oko
pAbmhUCN/45f1JKy/8m9oKvewc0HAAwMk3iTyVDOUVVBbh76uowrN4pJpnqx
bnnf7x6enh0fnLxpLs91c7vJftT6T/iP/hMCGG7CBSsrcdKbpM1G0wcr7bZ2
6FP4lsN7C/YAGfmZnvA20jqDp9wOGw7RSEsj/Jq/29GH3x29Pj7whqVdQzEN
FrIlTaGta/rkiWm7+xR43E5VqWkXNPyNa7d7tP/6SI5EarspL+3sl+Gp3Avf
iaEXT+D10f7B8Y45acDHdNTBIQ9UkM9W3I5QP+P71YkjHAuySebdD6SKCk8X
cQufkRsJt5nSMdnpt/s3b2iSSA42mzYyjAFClGq3W/QhhHcRkW6ai6N3nmgq
ExR+6OFlvendpebnjV3VtwD2Z4dHhyfPD/Ybd7m3BcXoY4YbpKRDWq9flji2
1arMokfwFRtYU9TkjF1dQAkoKsnpHjMy5mQqmAAW7oc87G6Pb87QWCp2NMgn
xlQb1Od++fr7g2OdxlfJ2DqF+1fnMQIvNIjSAbAPwJMLfrRV6f4740eB5b9+
JhqU+9dcxTpst+6e0g2j+FbiK0w9adh/Z/t4TIC8QLMZdUVxes5kNi3imGC9
+xI2blXZfa0wWzZh+MOzI/LOv3Ej3NeN4/xUemAPxyCaG7BFNwYou1FA7/3/
R15/d0/cydL5e/asTazNDreoplx66WpLELI75qRqnjRSPzztXxx5BCU2/1Hc
1Slx1fjhrhFJjAelz+069plKjvifcgam0klO3Sz0CM+guAIabBGKNe0aRl28
2YdY9s5+ZyvRi5evc2aNZjOSHeuK/Q6NRwj2cIDE3qS98WquwysDdfBFVdSx
iYAh235twjq85JZBGMwQYf6M1hEYhoMloEtFLBKB+HvZsFPsgj3LzvD2DMUB
GyYyMJ24cE9YYmkG5DqAtDvR7AmWnuQpnP5x6C1QXxZJhSoXioNr7Q02j594
rSVxQDQDiRqglAKOsSFmRF94DfXmpRESiIFC6rmFvdlbeVdoyV2PKb3rIyTz
Qv7Y3Ts9/MPu6QHgi9ODo9NDYMLuWkQu37IYautrIGCVj92QfnWQsoqjiXHt
Z2WmREID5AkVdp4KeFO9ADAvHUa6co4APeoTq0boMElZryR2APGK8hlOGRsG
1CZkmznQfSSxyh5/gO0wv2HR4BH42AlDoc8/cRcTWiC2MHHz6PPKvEPlx35S
M+ImeJC17ga2U9y0X5W2DAEZ+tndIpNpIjOdZ3FjtOgcsy+iuEv2sSFvjb+r
Jl699Mcx2xCVDpsJ+grQovZq+CrPaImoEOCicEY5hlSGFVr3IqrGc5vBA8nW
FVKrA6ojir9sUXQkkgAUhlE6obiYjLLxOIDftMgFGm1vmaTRl1GCDwekGyFt
iDjCs2MKZ4qjJEqbfv1Q3yu7utrylRoTxBF5wZnbWe+BfTPiINcIdD9h/Ymf
x8eRA0BCdZGVHg8UER6wW+GPXlw1k1MYhzUT0+u5U1VMNHmz8LJzIdbmyhD9
VVcM6R7NGnMq5tKL1F/kk3jHtrHxyA7L+m42sfuAHKY4AIZdZVpKqaR0VIj5
AA4iZyjgQB0vmtNkc3A6iUV+weYyg6+MjyZhyQ4EYXgBpjoAjx7wNMXsgec4
NQ4FCT5euLmYjCG8lgE6sbdzYG6fd0Pl4gVAe2/L5t2g+AP/0ol022FaH9ws
zPo5xj15lmZPeG3gi0bh1W/JPpJJrJtvervMTTSpgWM7JvSJRCUAchPiy3km
GnDuwnxJCelg4RyIjU0rIgUUmE/xdY8GnzAaKa7gTF3+eQvhDJ3jNI6KcFKw
RdGMr0jIVpnbC5BnyCHyD0gCp+J6LP6extEKMSK5EeQSoSu4lhSY+zVfDN+t
Fk8iT02JG+wVBvUKuhKXhOvYQr3iqWRPWMn1g49ok6UnDpqjsCgTcFxbf/9G
oPFu85ZOqVaigCTVPCS/879gmFBlalk3UF85uoUE3JAwOoXhhiDVJAwDHdye
foGkW7zydYM/ImNXXf3Uko+ImNwkIvkL6VQL3igyedP7M37o/pGfP0s5dPeP
7fJTX8AU1igat3b62tFPQ3OosZqZKA83Sb/9Ms+XW7fqwmgQsQsWxkBKKwrk
IG7T/DfeDIwqkeH68dr2XT8BHD32K8/fvo+mPjKYhP/HHamaS8C3CewHch9b
Xk8dG6nCpnh0O74s88//rGPcUBFYmn2oRkv6lr7r+/Hbe/W9Pnqqzx+ll5+C
92E+E+9V3+2hks9tgYRuPC/nSXH12BuCFGFm5U+2H8MU7tzpv1t3/OmRUsWq
YOnWMy/00y1m2r7nSM8cCUe204xz8z2XD82+WZC4SzsccUJ1h60eyIXFIX8E
OdLse8Xb4+3IvcchPN8WezVX2Kn06fq5Dd71eiblUIcEYbVEIkEE6pN1EoTj
BUwCkD5WoCVamNRchiB61LBNCyUcxYwgsd1WfnCBw3iMxO9061EwLsDqG1gM
JALawSNPG5oC4SFJN8UuTMyblT4X7o8c6ncMu2pHn0c+sy8hgpseYoEbjgqS
rUHYjmeNWVBl6t6MkMHGeFE362CKVj3jcnJJBokG8wi73VGPq83Xb71D2Pmr
naLLteeMvMCqCGI24n1bI2l0zTcNKmb9d75GmmFTYqdQUynHao34baMDLA/v
MoOpBRDPNye2yclYVrJ92ahoyypT+G3gR7Ev5RI8x3oJ9qOw/NsvMilb0qOT
izF1g8mTdJvaaZtHkjfJitKuUxN77iQBJ/xQvYsu8XRTCB4x+D4WZCXAANtZ
UbQMJMxNJBswEPzL37HQjGfSXDBlsbxCPRxGAcMx+BBNPt5X3AWJEaVDv56i
wmBT2LJjd+GqBsyykqOucvS34RBqufKchlxIOO+dC63jOaCHLiXz8Tfh3taI
Wplwcswbia60lxiz4UQDD5E9NjkCyPBSepKIyTMZsvsIBB36D2N+KLZ2DJJA
SVI4DxBpNnv5ly0pEWdfk8Jdam5ntJzgbFBFy7L9gI/Aa/vfRhYxdriAun+y
KPI5JrkmK+Lsc4FYhK+caY70AvQbKYHw2hjVHGfp85Aa9uUYHcZqa/HZVu8y
25Y2PA3Lgz1BDswt9U5rjYFRTXaa321GIP4UlVVKbdk2/yi+1Ycm+PbONkIT
bPed7da4/q8BT0hnRTzhOgkWWEJZHQwAQ/0XsIQf/fv95J7YBRwWiyqDOT+L
f1Rf6NcX6BSLeYOmLk7nuzxCn/tdqzzys41E6apMrEszWgTxr7pCIsmMm8nx
0VUAIDI+jV59BwDZKfuWTTwHe+tSmSxQK+OCaHMmGlFlBueYDgkJAD44vojX
x//qzTd7GLLa5e0tWcXWRAE7ikGJPJbMHDXCUDidybXNymAzdd6cpJMzupxz
8gZR2rl6MVzV1ATM98SEiitnSil1XEY7uxbrISe5UMJsAM3Aez+VAjby0g2J
9jzI7+1nGQCcROkF6OylbOTKhFi5lGFS6LFZt9iPCnf9i0WS8jj0VHhLOIM/
Zr8pW+mzGXa4QmyreIflp/MsLl2NZJ63hVmpiwsAEk+nlCa5B1iIp6QgWc5g
E2yn5KyIOKaCvBRfJaev1PoUGyMVJiBrJRCZrssk4B10T+4SibCb2LqWJDxJ
addgH6nMkEl8QBcOu3qGh5hhbg+E470gSeSh3XAM4j3oOcHANhOMSABzA3yY
SiMSylVWINTOvEo51sVazKsEyt4gpE8+nbfTrjcBu+fu3QRYYSb3L/0sSLnL
euKP61IGU/poFBABa6+M+7g5G0xOQExDc4SWDO4VMWY3GJdqpVkCWkK7vOwR
JKC705AwNMljiTHOmY2mOTH1vKw0I5a8vlSUlEfTOZiYTHMcGD8QYzclWoJj
T2s8O2buEWvB8QZWXFtNzKuI1s56dQw9UEgTMOjSV9fk4nRZunQwQD68Irgm
vtEYJpoVZbwsCuIVY/P77dtcyDgY6XLoejeoiUt0M2Dx6/OSzaxNeC2KGS4m
si5vb9WVOdlVXW6mrQ5ycI3009gliO7JXuMqBDJLWzYyAC3ZX018A9p1qrpS
3g4k0sKmUiRdA2pYGhBPmSW9pI6wWkrOqDCjTURmL5ujEvthRCBKH4PaR+r/
ASBZUO0n8wAA

-->

</rfc>
