<?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.6.9 (Ruby 2.6.8) -->
<?rfc rfcedstyle="yes"?>
<?rfc tocindent="yes"?>
<?rfc strict="yes"?>
<?rfc comments="yes"?>
<?rfc inline="yes"?>
<?rfc text-list-symbols="o-*+"?>
<?rfc compact="yes"?>
<?rfc subcompact="no"?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-uta-rfc7525bis-09" category="bcp" consensus="true" submissionType="IETF" obsoletes="7525" updates="5288, 6066" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.9.1 -->
  <front>
    <title abbrev="TLS Recommendations">Recommendations for Secure Use of Transport Layer Security (TLS) and Datagram Transport Layer Security (DTLS)</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-uta-rfc7525bis-09"/>
    <author initials="Y." surname="Sheffer" fullname="Yaron Sheffer">
      <organization>Intuit</organization>
      <address>
        <email>yaronf.ietf@gmail.com</email>
      </address>
    </author>
    <author initials="P." surname="Saint-Andre" fullname="Peter Saint-Andre">
      <organization>independent</organization>
      <address>
        <email>stpeter@stpeter.im</email>
      </address>
    </author>
    <author initials="T." surname="Fossati" fullname="Thomas Fossati">
      <organization>arm</organization>
      <address>
        <email>thomas.fossati@arm.com</email>
      </address>
    </author>
    <date year="2022" month="June" day="30"/>
    <area>Applications</area>
    <workgroup>UTA Working Group</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <t>Transport Layer Security (TLS) and Datagram Transport Layer Security (DTLS) are used to protect data exchanged over a wide range of application protocols, and can also form the basis for secure transport protocols.  Over the years, the industry has witnessed several serious attacks on TLS and DTLS, including attacks on the most commonly used cipher suites and their modes of operation.  This document provides the latest recommendations for ensuring the security of deployed services that use TLS and DTLS. These recommendations are applicable to the majority of use cases.</t>
      <t>An earlier version of this document was published as RFC 7525 when the industry was in the midst of its transition to TLS 1.2. Years later this transition is largely complete and TLS 1.3 is widely available. This document updates the guidance given the new environment and obsoletes RFC 7525. In addition, the document updates RFC 5288 and RFC 6066 in view of recent attacks.</t>
    </abstract>
  </front>
  <middle>
    <section anchor="introduction">
      <name>Introduction</name>
      <t>Transport Layer Security (TLS) and Datagram Transport Layer Security (DTLS) are used to protect data exchanged over a wide variety of application protocols, including HTTP <xref target="HTTP1.1"/> <xref target="HTTP2"/>, IMAP <xref target="RFC9051"/>, POP <xref target="STD53"/>, SIP <xref target="RFC3261"/>, SMTP <xref target="RFC5321"/>, and XMPP <xref target="RFC6120"/>.  Such protocols use both the TLS or DTLS handshake protocol and the TLS or DTLS record layer.  The TLS handshake protocol can also be used with different record layers to define secure transport protocols; at present the most prominent example is QUIC <xref target="RFC9000"/>.  Over the years leading to 2015, the industry had witnessed serious attacks on the TLS "family" of protocols, including attacks on the most commonly used cipher suites and their modes of operation.  For instance, both the AES-CBC <xref target="RFC3602"/> and RC4 <xref target="RFC7465"/> encryption algorithms, which together were once the most widely deployed ciphers, were attacked in the context of TLS.  Detailed information about the attacks known prior to 2015 is provided in a companion document (<xref target="RFC7457"/>) to the previous version of this specification, which will help the reader understand the rationale behind the recommendations provided here. That document has not been updated in concert with this one; instead, newer attacks are described in this document, as are mitigations for those attacks.</t>
      <t>The TLS community reacted to the attacks described in <xref target="RFC7457"/> in several ways:</t>
      <ul spacing="normal">
        <li>Detailed guidance was published on the use of TLS 1.2 <xref target="RFC5246"/> and DTLS 1.2 <xref target="RFC6347"/>, along with earlier protocol versions. This guidance is included in the original <xref target="RFC7525"/> and mostly retained in this revised version; note that this guidance was mostly adopted by the industry since the publication of RFC 7525 in 2015.</li>
        <li>Versions of TLS earlier than 1.2 were deprecated <xref target="RFC8996"/>.</li>
        <li>Version 1.3 of TLS <xref target="RFC8446"/> was released, followed by version 1.3 of DTLS <xref target="RFC9147"/>; these versions largely mitigate or resolve the described attacks.</li>
      </ul>
      <t>Those who implement and deploy TLS and TLS-based protocols need guidance on how they can be used securely.  This document provides guidance for deployed services as well as for software implementations, assuming the implementer expects his or her code to be deployed in the environments defined in <xref target="applicability"/>. Concerning deployment, this document targets a wide audience -- namely, all deployers who wish to add authentication (be it one-way only or mutual), confidentiality, and data integrity protection to their communications.</t>
      <t>The recommendations herein take into consideration the security of various mechanisms, their technical maturity and interoperability, and their prevalence in implementations at the time of writing.  Unless it is explicitly called out that a recommendation applies to TLS alone or to DTLS alone, each recommendation applies to both TLS and DTLS.</t>
      <t>This document attempts to minimize new guidance to TLS 1.2 implementations, and the overall approach is to encourage systems to move to TLS 1.3. However, this is not always practical. Newly discovered attacks, as well as ecosystem changes, necessitated some new requirements that apply to TLS 1.2 environments. Those are summarized in <xref target="diff-rfc"/>.</t>
      <t>As noted, the TLS 1.3 specification resolves many of the vulnerabilities listed in this document. A system that deploys TLS 1.3 should have fewer vulnerabilities than TLS 1.2 or below. Therefore this document replaces <xref target="RFC7525"/>, with an explicit goal to encourage migration of most uses of TLS 1.2 to TLS 1.3.</t>
      <t>These are minimum recommendations for the use of TLS in the vast majority of implementation and deployment scenarios, with the exception of unauthenticated TLS (see <xref target="applicability"/>). Other specifications that reference this document can have stricter requirements related to one or more aspects of the protocol, based on their particular circumstances (e.g., for use with a particular application protocol); when that is the case, implementers are advised to adhere to those stricter requirements. Furthermore, this document provides a floor, not a ceiling, so stronger options are always allowed (e.g., depending on differing evaluations of the importance of cryptographic strength vs. computational load).</t>
      <t>Community knowledge about the strength of various algorithms and feasible attacks can change quickly, and experience shows that a Best Current Practice (BCP) document about security is a point-in-time statement.  Readers are advised to seek out any errata or updates that apply to this document.</t>
    </section>
    <section anchor="terminology">
      <name>Terminology</name>
      <t>A number of security-related terms in this document are used in the sense defined in <xref target="RFC4949"/>.</t>
      <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&nbsp;14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
    </section>
    <section anchor="rec">
      <name>General Recommendations</name>
      <t>This section provides general recommendations on the secure use of TLS. Recommendations related to cipher suites are discussed in the following section.</t>
      <section anchor="protocol-versions">
        <name>Protocol Versions</name>
        <section anchor="rec-versions">
          <name>SSL/TLS Protocol Versions</name>
          <t>It is important both to stop using old, less secure versions of SSL/TLS and to start using modern, more secure versions; therefore, the following are the recommendations concerning TLS/SSL protocol versions:</t>
          <ul spacing="normal">
            <li>
              <t>Implementations <bcp14>MUST NOT</bcp14> negotiate SSL version 2.  </t>
              <t>
Rationale: Today, SSLv2 is considered insecure <xref target="RFC6176"/>.</t>
            </li>
            <li>
              <t>Implementations <bcp14>MUST NOT</bcp14> negotiate SSL version 3.  </t>
              <t>
Rationale: SSLv3 <xref target="RFC6101"/> was an improvement over SSLv2 and plugged some significant security holes but did not support strong cipher suites. SSLv3 does not support TLS extensions, some of which (e.g., renegotiation_info <xref target="RFC5746"/>) are security-critical.  In addition, with the emergence of the POODLE attack <xref target="POODLE"/>, SSLv3 is now widely recognized as fundamentally insecure.  See <xref target="DEP-SSLv3"/> for further details.</t>
            </li>
            <li>
              <t>Implementations <bcp14>MUST NOT</bcp14> negotiate TLS version 1.0 <xref target="RFC2246"/>.  </t>
              <t>
Rationale: TLS 1.0 (published in 1999) does not support many modern, strong cipher suites. In addition, TLS 1.0 lacks a per-record Initialization Vector (IV) for CBC-based cipher suites and does not warn against common padding errors. This and other recommendations in this section are in line with <xref target="RFC8996"/>.</t>
            </li>
            <li>
              <t>Implementations <bcp14>MUST NOT</bcp14> negotiate TLS version 1.1 <xref target="RFC4346"/>.  </t>
              <t>
Rationale: TLS 1.1 (published in 2006) is a security improvement over TLS 1.0 but still does not support certain stronger cipher suites.</t>
            </li>
            <li>
              <t>Implementations <bcp14>MUST</bcp14> support TLS 1.2 <xref target="RFC5246"/> and <bcp14>MUST</bcp14> prefer to negotiate TLS version 1.2 over earlier versions of TLS.  </t>
              <t>
Rationale: Several stronger cipher suites are available only with TLS 1.2 (published in 2008). In fact, the cipher suites recommended by this document for TLS 1.2 (<xref target="rec-cipher"/> below) are not available in older versions of the protocol.</t>
            </li>
            <li>
              <t>Implementations <bcp14>SHOULD</bcp14> support TLS 1.3 <xref target="RFC8446"/> and, if implemented, <bcp14>MUST</bcp14> prefer to negotiate TLS 1.3 over earlier versions of TLS.  </t>
              <t>
Rationale: TLS 1.3 is a major overhaul to the protocol and resolves many of the security issues with TLS 1.2. Even if a TLS implementation defaults to TLS 1.3, as long as it supports TLS 1.2 it <bcp14>MUST</bcp14> follow all the recommendations in this document.</t>
            </li>
            <li>
              <t>New protocol designs that embed TLS mechanisms <bcp14>SHOULD</bcp14> use only TLS 1.3 and <bcp14>SHOULD NOT</bcp14> use TLS 1.2; for instance, QUIC <xref target="RFC9001"/>) took this approach. As a result, implementations of such newly-developed protocols <bcp14>SHOULD</bcp14> support TLS 1.3 only with no negotiation of earlier versions.  </t>
              <t>
Rationale: secure deployment of TLS 1.3 is significantly easier and less error prone than secure deployment of TLS 1.2.</t>
            </li>
          </ul>
          <t>This BCP applies to TLS 1.3, TLS 1.2, and earlier versions. It is not safe for readers to assume that the recommendations in this BCP apply to any future version of TLS.</t>
        </section>
        <section anchor="dtls-protocol-versions">
          <name>DTLS Protocol Versions</name>
          <t>DTLS, an adaptation of TLS for UDP datagrams, was introduced when TLS 1.1 was published.  The following are the recommendations with respect to DTLS:</t>
          <ul spacing="normal">
            <li>
              <t>Implementations <bcp14>MUST NOT</bcp14> negotiate DTLS version 1.0 <xref target="RFC4347"/>.  </t>
              <t>
Version 1.0 of DTLS correlates to version 1.1 of TLS (see above).</t>
            </li>
            <li>
              <t>Implementations <bcp14>MUST</bcp14> support DTLS 1.2 <xref target="RFC6347"/> and <bcp14>MUST</bcp14> prefer to negotiate DTLS version 1.2 over earlier versions of DTLS.  </t>
              <t>
Version 1.2 of DTLS correlates to version 1.2 of TLS (see above).
(There is no version 1.1 of DTLS.)</t>
            </li>
            <li>
              <t>Implementations <bcp14>SHOULD</bcp14> support DTLS 1.3 <xref target="RFC9147"/> and, if implemented, <bcp14>MUST</bcp14> prefer to negotiate DTLS version 1.3 over earlier versions of DTLS.  </t>
              <t>
Version 1.3 of DTLS correlates to version 1.3 of TLS (see above).</t>
            </li>
          </ul>
        </section>
        <section anchor="rec-fallback">
          <name>Fallback to Lower Versions</name>
          <t>TLS/DTLS 1.2 clients <bcp14>MUST NOT</bcp14> fall back to earlier TLS versions, since those versions have been deprecated <xref target="RFC8996"/>. We note that as a result of that, the downgrade-protection SCSV mechanism <xref target="RFC7507"/> is no longer needed for clients. In addition, TLS 1.3 implements a new version negotiation mechanism.</t>
        </section>
      </section>
      <section anchor="strict-tls">
        <name>Strict TLS</name>
        <t>The following recommendations are provided to help prevent SSL Stripping and STARTTLS Command Injection (attacks that are summarized in <xref target="RFC7457"/>):</t>
        <ul spacing="normal">
          <li>Many existing application protocols were designed before the use of TLS became common. These protocols typically support TLS in one of two ways: either via a separate port for TLS-only communication (e.g., port 443 for HTTPS) or via a method for dynamically upgrading a channel from unencrypted to TLS-protected (e.g., STARTTLS, which is used in protocols such as IMAP and XMPP). Regardless of the mechanism for protecting the communication channel (TLS-only port or dynamic upgrade), what matters is the end state of the channel. When TLS-only communication is available for a certain protocol, it <bcp14>MUST</bcp14> be used by implementations and <bcp14>MUST</bcp14> be configured by administrators. When a protocol only supports dynamic upgrade, implementations <bcp14>MUST</bcp14> provide a strict local policy (a policy that forbids use of plaintext in the absence of a negotiated TLS channel) and administrators <bcp14>MUST</bcp14> use this policy.</li>
          <li>HTTP client and server implementations intended for use in the World Wide Web (see 
<xref target="applicability"/>) <bcp14>MUST</bcp14> support the HTTP Strict Transport Security (HSTS) header 
field <xref target="RFC6797"/>, so that Web servers can advertise that they are willing to 
accept TLS-only clients. Web servers <bcp14>SHOULD</bcp14> use HSTS to indicate that they are 
willing to accept TLS-only clients, unless they are deployed in such a way that 
using HSTS would in fact weaken overall security (e.g., it can be problematic to 
use HSTS with self-signed certificates, as described in <xref section="11.3" sectionFormat="of" target="RFC6797"/>).
Similar technologies exist for non-HTTP application protocols, such as MTA-STS for 
mail transfer agents <xref target="RFC8461"/> and methods founded in DNS-Based Authentication of 
Named Entities (DANE) <xref target="RFC6698"/> for SMTP <xref target="RFC7672"/> and XMPP <xref target="RFC7712"/>.</li>
        </ul>
        <t>Rationale: Combining unprotected and TLS-protected communication opens the way to SSL Stripping and similar attacks, since an initial part of the communication is not integrity protected and therefore can be manipulated by an attacker whose goal is to keep the communication in the clear.</t>
      </section>
      <section anchor="compression">
        <name>Compression</name>
        <t anchor="rec-compress">In order to help prevent compression-related attacks (summarized in <xref section="2.6" sectionFormat="of" target="RFC7457"/>), when using TLS 1.2 implementations and deployments <bcp14>SHOULD NOT</bcp14> support
TLS-level compression (<xref section="6.2.2" sectionFormat="of" target="RFC5246"/>); the only exception is when
the application protocol in question has been proved not to be open to such attacks,
however even in this case extreme caution is warranted because of the potential for
future attacks related to TLS compression. More specifically, the HTTP protocol is known to be vulnerable to compression-related attacks. Note: this recommendation applies to TLS 1.2 only, because compression has been removed from TLS 1.3.</t>
        <t>Rationale: TLS compression has been subject to security attacks, such as the CRIME attack.</t>
        <t>Implementers should note that compression at higher protocol levels can allow an active attacker to extract cleartext information from the connection. The BREACH attack is one such case. These issues can only be mitigated outside of TLS and are thus outside the scope of this document. See <xref section="2.6" sectionFormat="of" target="RFC7457"/> for further details.</t>
        <section anchor="certificate-compression">
          <name>&nbsp;Certificate Compression</name>
          <t>Certificate chains often take up the majority of the bytes transmitted during
the handshake.  In order to manage their size, some or all of the following
methods can be employed:</t>
          <ul spacing="normal">
            <li>Limit the number of names or extensions;</li>
            <li>Use keys with small public key representations, like ECDSA;</li>
            <li>Use certificate compression.</li>
          </ul>
          <t>To achieve the latter, TLS 1.3 defines the <tt>compress_certificate</tt> extension in
<xref target="RFC8879"/>.  See also <xref section="5" sectionFormat="of" target="RFC8879"/> for security and privacy
considerations associated with its use.  To clarify, CRIME-style attacks on TLS
compression do not apply to certificate compression.</t>
          <t>Due to the strong likelihood of middlebox interference,
RFC8879-style compression has not been made available in
TLS 1.2.  In theory, the <tt>cached_info</tt> extension defined in <xref target="RFC7924"/> could
be used, but it is not widely enough supported to be considered a practical
alternative.</t>
        </section>
      </section>
      <section anchor="rec-resume">
        <name>TLS Session Resumption</name>
        <t>Session resumption drastically reduces the number of full TLS handshakes and thus is an essential
performance feature for most deployments.</t>
        <t>Stateless session resumption with session tickets is a popular strategy. For TLS 1.2, it is specified in
<xref target="RFC5077"/>.  For TLS 1.3, a more secure PSK-based mechanism is described in
<xref section="4.6.1" sectionFormat="of" target="RFC8446"/>. See <xref target="Springall16"/> for a quantitative study of the risks induced by TLS cryptographic "shortcuts", including session resumption.</t>
        <t>When it is used, the resumption information <bcp14>MUST</bcp14>
be authenticated and encrypted to prevent modification or eavesdropping by an attacker.
Further recommendations apply to session tickets:</t>
        <ul spacing="normal">
          <li>A strong cipher <bcp14>MUST</bcp14> be used when encrypting the ticket (as least as strong as the main TLS cipher suite).</li>
          <li>Ticket-encryption keys <bcp14>MUST</bcp14> be changed regularly, e.g., once every week, so as not to negate the benefits of forward secrecy (see <xref target="sec-pfs"/> for details on forward secrecy). Old ticket-encryption keys <bcp14>MUST</bcp14> be destroyed at the end of the validity period.</li>
          <li>For similar reasons, session ticket validity <bcp14>MUST</bcp14> be limited to a reasonable duration (e.g., half as long as ticket-encryption key validity).</li>
          <li>TLS 1.2 does not roll the session key forward within a single session. Thus, to prevent an attack where the server's ticket-encryption key is stolen and used to decrypt the entire content of a session (negating the concept of forward secrecy), a TLS 1.2 server <bcp14>SHOULD NOT</bcp14> resume sessions that are too old, e.g. sessions that have been open longer than two ticket-encryption key rotation periods.</li>
        </ul>
        <t>Rationale: session resumption is another kind of TLS handshake, and therefore must be as secure as the initial handshake. This document (<xref target="detail"/>) recommends the use of cipher suites that provide forward secrecy, i.e. that prevent an attacker who gains momentary access to the TLS endpoint (either client or server) and its secrets from reading either past or future communication. The tickets must be managed so as not to negate this security property.</t>
        <t>TLS 1.3 provides the powerful option of forward secrecy even within a long-lived connection
that is periodically resumed. <xref section="2.2" sectionFormat="of" target="RFC8446"/> recommends that clients <bcp14>SHOULD</bcp14>
send a "key_share" when initiating session resumption.
In order to gain forward secrecy, this document recommends that server implementations <bcp14>SHOULD</bcp14>
select the "psk_dhe_ke" PSK key exchange mode and 
respond with a "key_share", to complete an ECDHE exchange on each session resumption.
As a more performant alternative, server implementations <bcp14>MAY</bcp14> refrain from responding with a 
"key_share" until a certain amount of time (e.g., measured in hours) has passed since the last 
ECDHE exchange; this implies that the "key_share" operation would not occur for the presumed
majority of session resumption requests occurring within a few hours, while still ensuring 
forward secrecy for longer-lived sessions.</t>
        <t>TLS session resumption introduces potential privacy issues where the server is able
to track the client, in some cases indefinitely. See <xref target="Sy2018"/> for more details.</t>
      </section>
      <section anchor="renegotiation-in-tls-12">
        <name>Renegotiation in TLS 1.2</name>
        <t>The recommendations in this section apply to TLS 1.2 only, because renegotiation has been removed from TLS 1.3.</t>
        <t>Renegotiation in TLS 1.2 is a handshake that establishes new cryptographic parameters for an existing session. The mechanism existed in TLS 1.2 and in earlier protocol versions, and was improved following several major attacks including a plaintext injection attack, CVE-2009-3555 <xref target="CVE"/>.</t>
        <t>TLS 1.2 clients and servers <bcp14>MUST</bcp14> implement the <tt>renegotiation_info</tt> extension, as defined in <xref target="RFC5746"/>.</t>
        <t>TLS 1.2 clients <bcp14>MUST</bcp14> send <tt>renegotiation_info</tt> in the Client Hello.  If the server does not acknowledge the extension, the client <bcp14>MUST</bcp14> generate a fatal <tt>handshake_failure</tt> alert prior to terminating the connection.</t>
        <t>Rationale: It is not safe for a client to connect to a TLS 1.2 server that does not support <tt>renegotiation_info</tt>, regardless of whether either endpoint actually implements renegotiation.  See also <xref section="4.1" sectionFormat="of" target="RFC5746"/>.</t>
        <t>A related attack resulting from TLS session parameters not being properly authenticated is Triple Handshake <xref target="triple-handshake"/>. To address this attack, TLS 1.2 implementations <bcp14>MUST</bcp14> support the <tt>extended_master_secret</tt> extension defined in <xref target="RFC7627"/>.</t>
      </section>
      <section anchor="post-handshake-authentication">
        <name>Post-Handshake Authentication</name>
        <t>Renegotiation in TLS 1.2 was (partially) replaced in TLS 1.3 by separate post-handshake authentication and key update mechanisms.  In the context of protocols that multiplex requests over a single connection (such as HTTP/2 <xref target="HTTP2"/>), post-handshake authentication has the same problems as TLS 1.2 renegotiation.  Multiplexed protocols <bcp14>SHOULD</bcp14> follow the advice provided for HTTP/2 in <xref target="RFC8740"/>.</t>
      </section>
      <section anchor="server-name-indication-sni">
        <name>Server Name Indication (SNI)</name>
        <t>TLS implementations <bcp14>MUST</bcp14> support the Server Name Indication (SNI) extension defined in <xref section="3" sectionFormat="of" target="RFC6066"/> for those higher-level protocols that would benefit from it, including HTTPS. However, the actual use of SNI in particular circumstances is a matter of local policy.  Implementers are strongly encouraged to support TLS Encrypted Client Hello once <xref target="I-D.ietf-tls-esni"/> has been standardized.</t>
        <t>Rationale: SNI supports deployment of multiple TLS-protected virtual servers on a single
      address, and therefore enables fine-grained security for these virtual servers,
      by allowing each one to have its own certificate. However, SNI also leaks the 
      target domain for a given connection; this information leak is closed by 
      use of TLS Encrypted Client Hello.</t>
        <t>In order to prevent the attacks described in <xref target="ALPACA"/>, a server that does not
recognize the presented server name <bcp14>SHOULD NOT</bcp14> continue the handshake and
instead <bcp14>SHOULD</bcp14> fail with a fatal-level <tt>unrecognized_name(112)</tt> alert.  Note that this
recommendation updates <xref section="3" sectionFormat="of" target="RFC6066"/>: "If the server understood the
ClientHello extension but does not recognize the server name, the server <bcp14>SHOULD</bcp14>
take one of two actions: either abort the handshake by sending a fatal-level
<tt>unrecognized_name(112)</tt> alert or continue the handshake."
Clients <bcp14>SHOULD</bcp14> abort the handshake if the server acknowledges the SNI extension, but presents a certificate with a different hostname than the one sent by the client.</t>
      </section>
      <section anchor="rec-alpn">
        <name>Application-Layer Protocol Negotiation (ALPN)</name>
        <t>TLS implementations (both client- and server-side) <bcp14>MUST</bcp14> support the
Application-Layer Protocol Negotiation (ALPN) extension <xref target="RFC7301"/>.</t>
        <t>In order to prevent "cross-protocol" attacks resulting from failure to ensure
that a message intended for use in one protocol cannot be mistaken for a
message for use in another protocol, servers are advised to strictly enforce the
behavior prescribed in <xref section="3.2" sectionFormat="of" target="RFC7301"/>: "In the event that the
server supports no protocols that the client advertises, then the server <bcp14>SHALL</bcp14>
respond with a fatal <tt>no_application_protocol</tt> alert."  Clients <bcp14>SHOULD</bcp14>
abort the handshake if the server acknowledges the ALPN extension,
but does not select a protocol from the client list.  Failure to do so can
result in attacks such those described in <xref target="ALPACA"/>.</t>
        <t>Protocol developers are strongly encouraged to register an ALPN identifier 
for their protocols. This applies both to new protocols and to well-established 
protocols; however, because the latter might have a large deployed base,
strict enforcement of ALPN usage may not be feasible when an ALPN 
identifier is registered for a well-established protocol.</t>
      </section>
      <section anchor="multi-server-deployment">
        <name>Multi-Server Deployment</name>
        <t>Deployments that involve multiple servers or services can increase the size of the attack surface for TLS. Two scenarios are of interest:</t>
        <ol spacing="normal" type="1"><li>Deployments in which multiple services handle the same domain name via different 
protocols (e.g., HTTP and IMAP). In this case an attacker might be able to direct 
a connecting endpoint to the service offering a different protocol and mount a 
cross-protocol attack. In a cross-protocol attack, the client and server believe 
they are using different protocols, which the attacker might exploit if messages 
sent in one protocol are interpreted as messages in the other protocol with 
undesirable effects (see <xref target="ALPACA"/> for more detailed information about this class 
of attacks). To mitigate this threat, service providers <bcp14>SHOULD</bcp14> deploy ALPN (see
<xref target="rec-alpn"/> immediately above) and to the extent possible ensure that multiple 
services handling the same domain name provide equivalent levels of security that 
are consistent with the recommendations in this document.</li>
          <li>Deployments in which multiple servers providing the same service have different
TLS configurations. In this case, an attacker might be able to direct a connecting 
endpoint to a server with a TLS configuration that is more easily exploitable (see 
<xref target="DROWN"/> for more detailed information about this class of attacks). To mitigate 
this threat, service providers <bcp14>SHOULD</bcp14> ensure that all servers providing the same 
service provide equivalent levels of security that are consistent with the 
recommendations in this document.</li>
        </ol>
      </section>
      <section anchor="zero-round-trip-time-0-rtt-data-in-tls-13">
        <name>Zero Round Trip Time (0-RTT) Data in TLS 1.3</name>
        <t>The 0-RTT early data feature is new in TLS 1.3. It provides reduced latency
when TLS connections are resumed, at the potential cost of certain security properties.
As a result, it requires special attention from implementers on both
the server and the client side. Typically this extends to both the
TLS library as well as protocol layers above it.</t>
        <t>For use in HTTP-over-TLS, readers are referred to <xref target="RFC8470"/> for guidance.</t>
        <t>For QUIC-on-TLS, refer to <xref section="9.2" sectionFormat="of" target="RFC9001"/>.</t>
        <t>For other protocols, generic guidance is given in Section <xref target="RFC8446" section="8" sectionFormat="bare"/> and Appendix <xref target="RFC8446" section="E.5" sectionFormat="bare"/> of <xref target="RFC8446"/>.
To paraphrase Appendix E.5, applications <bcp14>MUST</bcp14> avoid this feature unless
an explicit specification exists for the application protocol in question to clarify
when 0-RTT is appropriate and secure. This can take the form of an IETF RFC,
a non-IETF standard, or even documentation associated with a non-standard protocol.</t>
      </section>
    </section>
    <section anchor="detail">
      <name>Recommendations: Cipher Suites</name>
      <t>TLS 1.2 provided considerable flexibility in the selection of cipher suites. Unfortunately, the security of some of these cipher suites has degraded over time to the point where some are known to be insecure (this is one reason why TLS 1.3 restricted such flexibility). Incorrectly configuring a server leads to no or reduced security.  This section includes recommendations on the selection and negotiation of cipher suites.</t>
      <section anchor="rec-cipher-guidelines">
        <name>General Guidelines</name>
        <t>Cryptographic algorithms weaken over time as cryptanalysis improves: algorithms that were once considered strong become weak. Consequently, they need to be phased out over time and replaced with more secure cipher suites. This helps to ensure that the desired security properties still hold. SSL/TLS has been in existence for almost 20 years and many of the cipher suites that have been recommended in various versions of SSL/TLS are now considered weak or at least not as strong as desired. Therefore, this section modernizes the recommendations concerning cipher suite selection.</t>
        <ul spacing="normal">
          <li>
            <t>Implementations <bcp14>MUST NOT</bcp14> negotiate the cipher suites with NULL encryption.  </t>
            <t>
Rationale: The NULL cipher suites do not encrypt traffic and 
             so provide no confidentiality services. Any entity in the 
             network with access to the connection can view the plaintext 
             of contents being exchanged by the client and server.<br/>
             Nevertheless, this document does not discourage software from
             implementing NULL cipher suites, since they can be useful for 
             testing and debugging.</t>
          </li>
          <li>
            <t>Implementations <bcp14>MUST NOT</bcp14> negotiate RC4 cipher suites.  </t>
            <t>
Rationale: The RC4 stream cipher has a variety of cryptographic 
             weaknesses, as documented in <xref target="RFC7465"/>.
     Note that DTLS specifically forbids the use of RC4 already.</t>
          </li>
          <li>
            <t>Implementations <bcp14>MUST NOT</bcp14> negotiate cipher suites offering less 
             than 112 bits of security, including so-called "export-level" 
             encryption (which provide 40 or 56 bits of security).  </t>
            <t>
Rationale: Based on <xref target="RFC3766"/>, at least 112 bits 
             of security is needed.  40-bit and 56-bit security (found in 
             so-called "export ciphers") are considered 
             insecure today.</t>
          </li>
          <li>
            <t>Implementations <bcp14>SHOULD NOT</bcp14> negotiate cipher suites that use 
             algorithms offering less than 128 bits of security.  </t>
            <t>
Rationale: Cipher suites that offer 112 or more bits but less than 128 bits
             of security are not considered weak at this time; however, it is 
             expected that their useful lifespan is short enough to justify 
             supporting stronger cipher suites at this time.  128-bit ciphers 
             are expected to remain secure for at least several years, and 
             256-bit ciphers until the next fundamental technology 
             breakthrough.  Note that, because of so-called 
             "meet-in-the-middle" attacks <xref target="Multiple-Encryption"/>,
             some legacy cipher suites (e.g., 168-bit 3DES) have an effective 
             key length that is smaller than their nominal key length (112 
             bits in the case of 3DES).  Such cipher suites should be 
             evaluated according to their effective key length.</t>
          </li>
          <li>
            <t>Implementations <bcp14>SHOULD NOT</bcp14> negotiate cipher suites based on 
             RSA key transport, a.k.a. "static RSA".  </t>
            <t>
Rationale: These cipher suites, which have assigned values starting 
             with the string "TLS_RSA_WITH_*", have several drawbacks, especially
             the fact that they do not support forward secrecy.</t>
          </li>
          <li>
            <t>Implementations <bcp14>SHOULD NOT</bcp14> negotiate cipher suites based on
             non-ephemeral (static) finite-field Diffie-Hellman key agreement.  </t>
            <t>
Rationale: These cipher suites, which have assigned values prefixed by "TLS_DH_*", have several drawbacks, especially
             the fact that they do not support forward secrecy.</t>
          </li>
          <li>
            <t>Implementations <bcp14>MUST</bcp14> support and prefer to negotiate cipher suites 
             offering forward secrecy.  However, TLS 1.2 implementations <bcp14>SHOULD NOT</bcp14> negotiate
             cipher suites based on ephemeral finite-field Diffie-Hellman key
             agreement (i.e., "TLS_DHE_*" suites).  This is justified by the known fragility
             of the construction (see <xref target="RACCOON"/>) and the limitation around
             negotiation -- including using <xref target="RFC7919"/>, which has seen very
             limited uptake.  </t>
            <t>
Rationale: Forward secrecy (sometimes called "perfect forward 
             secrecy") prevents the recovery of information that was encrypted 
             with older session keys, thus limiting how far back in time data
             can be decrypted when an attack is successful.  See <xref target="sec-pfs"/>
             for a detailed discussion.</t>
          </li>
        </ul>
      </section>
      <section anchor="rec-cipher">
        <name>Cipher Suites for TLS 1.2</name>
        <t>Given the foregoing considerations, implementation and deployment of the following cipher suites is <bcp14>RECOMMENDED</bcp14>:</t>
        <ul spacing="normal">
          <li>TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256</li>
          <li>TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384</li>
          <li>TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256</li>
          <li>TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384</li>
        </ul>
        <t>As these are authenticated encryption (AEAD) algorithms <xref target="RFC5116"/>, these cipher suites are supported only in TLS 1.2 and not in earlier protocol versions.</t>
        <t>Typically, in order to prefer these suites, the order of suites needs to be explicitly configured in server software.  It would be ideal if server software implementations were to prefer these suites by default.</t>
        <t>Some devices have hardware support for AES-CCM but not AES-GCM, so they are unable to follow the foregoing recommendations regarding cipher suites.  There are even devices that do not support public key cryptography at all, but these are out of scope entirely.</t>
        <t>When using ECDSA signatures for authentication of TLS peers, it is <bcp14>RECOMMENDED</bcp14> that implementations use the NIST curve P-256. In addition, to avoid predictable or repeated nonces (that would allow revealing the long term signing key), it is <bcp14>RECOMMENDED</bcp14> that implementations implement "deterministic ECDSA" as specified in <xref target="RFC6979"/> and in line with the recommendations in <xref target="RFC8446"/>.</t>
        <t>Note that implementations of "deterministic ECDSA" may be vulnerable to certain
side-channel and fault injection attacks precisely because of their
determinism.  While most fault attacks described in the literature assume
physical access to the device (and therefore are more relevant in IoT
deployments with poor or non-existent physical security), some can be carried
out remotely <xref target="Poddebniak2017"/>, e.g., as Rowhammer <xref target="Kim2014"/> variants.  In
deployments where side-channel attacks and fault injection attacks are a
concern, implementation strategies combining both randomness and determinism
(for example, as described in <xref target="I-D.mattsson-cfrg-det-sigs-with-noise"/>) can
be used to avoid the risk of successful extraction of the signing key.</t>
        <section anchor="detail-neg">
          <name>Implementation Details</name>
          <t>Clients <bcp14>SHOULD</bcp14> include TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 as the first proposal to any server.  Servers <bcp14>MUST</bcp14> prefer this cipher suite over weaker cipher suites whenever it is proposed, even if it is not the first proposal.  Clients are of course free to offer stronger cipher suites, e.g., using AES-256; when they do, the server <bcp14>SHOULD</bcp14> prefer the stronger cipher suite unless there are compelling reasons (e.g., seriously degraded performance) to choose otherwise.</t>
          <t>The previous version of this document implicitly allowed the old RFC 5246 mandatory-to-implement cipher suite, TLS_RSA_WITH_AES_128_CBC_SHA. At the time of writing, this cipher suite does not provide additional interoperability, except with extremely old clients. As with other cipher suites that do not provide forward secrecy, implementations <bcp14>SHOULD NOT</bcp14> support this cipher suite. Other application protocols specify other cipher suites as mandatory to implement (MTI).</t>
          <t><xref target="RFC8422"/> allows clients and servers to negotiate ECDH parameters (curves).  Both clients and servers <bcp14>SHOULD</bcp14> include the "Supported Elliptic Curves" extension <xref target="RFC8422"/>.  Clients and servers <bcp14>SHOULD</bcp14> support the NIST P-256 (secp256r1) <xref target="RFC8422"/> and X25519 (x25519) <xref target="RFC7748"/> curves.  Note that <xref target="RFC8422"/> deprecates all but the uncompressed point format.  Therefore, if the client sends an ec_point_formats extension, the ECPointFormatList <bcp14>MUST</bcp14> contain a single element, "uncompressed".</t>
        </section>
      </section>
      <section anchor="cipher-suites-for-tls-13">
        <name>Cipher Suites for TLS 1.3</name>
        <t>This document does not specify any cipher suites for TLS 1.3. Readers
are referred to <xref section="9.1" sectionFormat="of" target="RFC8446"/> for cipher suite recommendations.</t>
      </section>
      <section anchor="limits-on-key-usage">
        <name>Limits on Key Usage</name>
        <t>All ciphers have an upper limit on the amount of traffic that can be securely
protected with any given key. In the case of AEAD cipher suites, two separate
limits are maintained for each key:</t>
        <ol spacing="normal" type="1"><li>Confidentiality limit (CL), i.e., the number of records that can be
encrypted.</li>
          <li>Integrity limit (IL), i.e., the number of records that are allowed to fail
authentication.</li>
        </ol>
        <t>The latter only applies to DTLS since TLS connections are torn down on the
first decryption failure.</t>
        <t>When a sender is approaching CL, the implementation <bcp14>SHOULD</bcp14> initiate a new
handshake (or in TLS 1.3, a Key Update) to rotate the session key.</t>
        <t>When a receiver has reached IL, the implementation <bcp14>SHOULD</bcp14> close the connection.</t>
        <t>For all TLS 1.3 cipher suites, readers are referred to <xref section="5.5" sectionFormat="of" target="RFC8446"/> for the values of CL and IL. For all DTLS 1.3 cipher suites, readers are referred to <xref section="4.5.3" sectionFormat="of" target="RFC9147"/>.</t>
        <t>For all AES-GCM cipher suites recommended for TLS 1.2 and DTLS 1.2 in this
document, CL can be derived by plugging the corresponding parameters into the
inequalities in <xref section="6.1" sectionFormat="of" target="I-D.irtf-cfrg-aead-limits"/> that apply to
random, partially implicit nonces, i.e., the nonce construction used in TLS
1.2.  Although the obtained figures are slightly higher than those for TLS 1.3,
it is <bcp14>RECOMMENDED</bcp14> that the same limit of 2<sup>24.5</sup> records is used for
both versions.</t>
        <t>For all AES-GCM cipher suites recommended for DTLS 1.2, IL (obtained from the
same inequalities referenced above) is 2<sup>28</sup>.</t>
      </section>
      <section anchor="rec-keylength">
        <name>Public Key Length</name>
        <t>When using the cipher suites recommended in this document, two public keys are 
      normally used in the TLS handshake: one for the Diffie-Hellman key agreement
      and one for server authentication. Where a client certificate is used, a third 
      public key is added.</t>
        <t>With a key exchange based on modular exponential (MODP) Diffie-Hellman groups ("DHE" cipher suites), DH key lengths of at least 2048 bits are <bcp14>REQUIRED</bcp14>.</t>
        <t>Rationale: For various reasons, in practice, DH keys are typically generated in lengths
 that are powers of two (e.g., 2<sup>10</sup> = 1024 bits, 2<sup>11</sup> = 2048 bits, 2<sup>12</sup> = 4096 bits).
 Because a DH key of 1228 bits would be roughly equivalent to only an 80-bit symmetric key
<xref target="RFC3766"/>, it is better to use keys longer than that for the "DHE" family of cipher suites.
A DH key of 1926 bits would be roughly equivalent to a 100-bit symmetric key <xref target="RFC3766"/>.
A DH key of 2048 bits (equivalent to a 112-bit symmetric key) 
is the minimum allowed by the latest revision of <xref target="NIST.SP.800-56A"/>, as of this writing
(see in particular Appendix D).</t>
        <t>As noted in <xref target="RFC3766"/>, correcting for the emergence of a TWIRL machine would imply that 1024-bit DH keys yield about 61 bits of equivalent strength and that a 2048-bit DH key would yield about 92 bits of equivalent strength.
The Logjam attack <xref target="Logjam"/> further demonstrates that 1024-bit Diffie Hellman parameters
should be avoided.</t>
        <t>With regard to ECDH keys, implementers are referred to the IANA "Supported Groups Registry" (former "EC Named Curve
Registry"), within the
   "Transport Layer Security (TLS) Parameters" registry <xref target="IANA_TLS"/>, and in particular to the "recommended"
   groups.  Curves of less than 224 bits <bcp14>MUST NOT</bcp14> be used. This recommendation is in-line with the latest
revision of <xref target="NIST.SP.800-56A"/>.</t>
        <t>When using RSA, servers <bcp14>MUST</bcp14> authenticate using certificates with at least a 2048-bit modulus for the public key.  In addition, the use of the SHA-256 hash algorithm is <bcp14>RECOMMENDED</bcp14> and SHA-1 or MD5 <bcp14>MUST NOT</bcp14> be used (<xref target="RFC9155"/>, and see <xref target="CAB-Baseline"/> for more details). Clients <bcp14>MUST</bcp14> indicate to servers that they request SHA-256, by using the "Signature Algorithms" extension defined in TLS 1.2. For TLS 1.3, the same requirement is already specified by <xref target="RFC8446"/>.</t>
      </section>
      <section anchor="truncated-hmac">
        <name>Truncated HMAC</name>
        <t>Implementations <bcp14>MUST NOT</bcp14> use the Truncated HMAC extension, defined in <xref section="7" sectionFormat="of" target="RFC6066"/>.</t>
        <t>Rationale: the extension does not apply to the AEAD
      cipher suites recommended above. However it does apply to most other TLS cipher suites. Its use
      has been shown to be insecure in <xref target="PatersonRS11"/>.</t>
      </section>
    </section>
    <section anchor="applicability">
      <name>Applicability Statement</name>
      <t>The recommendations of this document primarily apply to the implementation and deployment of application protocols that are most commonly used with TLS and DTLS on the Internet today.  Examples include, but are not limited to:</t>
      <ul spacing="normal">
        <li>Web software and services that wish to protect HTTP traffic with TLS.</li>
        <li>Email software and services that wish to protect IMAP, POP3, or SMTP traffic with TLS.</li>
        <li>Instant-messaging software and services that wish to protect Extensible Messaging and Presence Protocol (XMPP) or Internet Relay Chat (IRC) traffic with TLS.</li>
        <li>Realtime media software and services that wish to protect Secure Realtime Transport Protocol (SRTP) traffic with DTLS.</li>
      </ul>
      <t>This document does not modify the implementation and deployment recommendations (e.g., mandatory-to-implement cipher suites) prescribed by existing application protocols that employ TLS or DTLS. If the community that uses such an application protocol wishes to modernize its usage of TLS or DTLS to be consistent with the best practices recommended here, it needs to explicitly update the existing application protocol definition (one example is <xref target="RFC7590"/>, which updates <xref target="RFC6120"/>).</t>
      <t>Designers of new application protocols developed through the Internet
  Standards Process <xref target="RFC2026"/> are expected at minimum to conform to the best
  practices recommended here, unless they provide documentation of
  compelling reasons that would prevent such conformance (e.g.,
  widespread deployment on constrained devices that lack support for
  the necessary algorithms).</t>
      <t>This document does not discuss the use of TLS in constrained-node networks
<xref target="RFC7228"/>.  For recommendations regarding the profiling of TLS and DTLS for
small devices with severe constraints on power, memory, and processing
resources, the reader is referred to <xref target="RFC7925"/> and
<xref target="I-D.ietf-uta-tls13-iot-profile"/>.</t>
      <section anchor="security-services">
        <name>Security Services</name>
        <t>This document provides recommendations for an audience that wishes to secure their communication with TLS to achieve the following:</t>
        <ul spacing="normal">
          <li>Confidentiality: all application-layer communication is encrypted with the goal that no party should be able to decrypt it except the intended receiver.</li>
          <li>Data integrity: any changes made to the communication in transit are detectable by the receiver.</li>
          <li>Authentication: an endpoint of the TLS communication is authenticated as the intended entity to communicate with.</li>
        </ul>
        <t>With regard to authentication, TLS enables authentication of one or both endpoints in the communication.  In the context of opportunistic security <xref target="RFC7435"/>, TLS is sometimes used without authentication. As discussed in <xref target="oppsec"/>, considerations for opportunistic security are not in scope for this document.</t>
        <t>If deployers deviate from the recommendations given in this document, they need to be aware that they might lose access to one of the foregoing security services.</t>
        <t>This document applies only to environments where confidentiality is required. It requires algorithms and configuration options that enforce secrecy of the data in transit.</t>
        <t>This document also assumes that data integrity protection is always one of the goals of a deployment. In cases where integrity is not required, it does not make sense to employ TLS in the first place. There are attacks against confidentiality-only protection that utilize the lack of integrity to also break confidentiality (see, for instance, <xref target="DegabrieleP07"/> in the context of IPsec).</t>
        <t>This document addresses itself to application protocols that are most commonly used on the Internet with TLS and DTLS. Typically, all communication between TLS clients and TLS servers requires all three of the above security services. This is particularly true where TLS clients are user agents like Web browsers or email software.</t>
        <t>This document does not address the rarer deployment scenarios where one of the above three properties is not desired, such as the use case described in <xref target="oppsec"/> below.  As another scenario where confidentiality is not needed, consider a monitored network where the authorities in charge of the respective traffic domain require full access to unencrypted (plaintext) traffic, and where users collaborate and send their traffic in the clear.</t>
      </section>
      <section anchor="oppsec">
        <name>Opportunistic Security</name>
        <t>There are several important scenarios in which the use of TLS is optional, i.e., the client decides dynamically ("opportunistically") whether to use TLS with a particular server or to connect in the clear.  This practice, often called "opportunistic security", is described at length in <xref target="RFC7435"/> and is often motivated by a desire for backward compatibility with legacy deployments.</t>
        <t>In these scenarios, some of the recommendations in this document might be too strict, since adhering to them could cause fallback to cleartext, a worse outcome than using TLS with an outdated protocol version or cipher suite.</t>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
    <section anchor="sec">
      <name>Security Considerations</name>
      <t>This entire document discusses the security practices directly affecting applications
    using the TLS protocol. This section contains broader security considerations related
    to technologies used in conjunction with or by TLS.
    The reader is referred to the Security Considerations sections of TLS 1.3
    <xref target="RFC8446"/>, DTLS 1.3 <xref target="RFC9147"/>, TLS 1.2 <xref target="RFC5246"/> and DTLS 1.2 <xref target="RFC6347"/>
    for further context.</t>
      <section anchor="host-name-validation">
        <name>Host Name Validation</name>
        <t>Application authors should take note that some TLS implementations
  do not validate host names.  If the TLS implementation they are
  using does not validate host names, authors might need to write their
  own validation code or consider using a different TLS implementation.</t>
        <t>It is noted that the requirements regarding host name validation (and, in general, binding between the TLS layer and the protocol that runs above it) vary between different protocols. For HTTPS, these requirements are defined by Sections 4.3.3, 4.3.4 and 4.3.5 of <xref target="I-D.ietf-httpbis-semantics"/>.</t>
        <t>Host name validation is security-critical for all common TLS use cases. Without it, TLS ensures that the certificate is valid and guarantees possession of the private key, but does not ensure that the connection terminates at the desired endpoint. Readers are referred to <xref target="RFC6125"/> for further details regarding generic host name validation in the TLS context. In addition, that RFC contains a long list of example protocols, some of which implement a policy very different from HTTPS.</t>
        <t>If the host name is discovered indirectly and in an insecure manner (e.g., by an insecure DNS query for an SRV or MX record), it <bcp14>SHOULD NOT</bcp14> be used as a reference identifier <xref target="RFC6125"/> even when it matches the presented certificate.  This proviso does not apply if the host name is discovered securely (for further discussion, see <xref target="DANE-SRV"/> and <xref target="DANE-SMTP"/>).</t>
        <t>Host name validation typically applies only to the leaf "end entity" certificate. Naturally, in order to ensure proper authentication in the context of the PKI, application clients need to verify the entire certification path in accordance with <xref target="RFC5280"/>.</t>
      </section>
      <section anchor="sec-aes">
        <name>AES-GCM</name>
        <t><xref target="rec-cipher"/> above recommends the use of the AES-GCM authenticated encryption algorithm. Please refer to <xref section="6" sectionFormat="of" target="RFC5288"/> for security considerations that apply specifically to AES-GCM when used with TLS.</t>
        <section anchor="nonce-reuse-in-tls-12">
          <name>&nbsp;Nonce Reuse in TLS 1.2</name>
          <t>The existence of deployed TLS stacks that mistakenly reuse the AES-GCM nonce is
documented in <xref target="Boeck2016"/>, showing there is an actual risk of AES-GCM getting
implemented in an insecure way and thus making TLS sessions that use an
AES-GCM cipher suite vulnerable to attacks such as <xref target="Joux2006"/>.  (See <xref target="CVE"/>
records: CVE-2016-0270, CVE-2016-10213, CVE-2016-10212, CVE-2017-5933.)</t>
          <t>While this problem has been fixed in TLS 1.3, which enforces a deterministic
method to generate nonces from record sequence numbers and shared secrets for
all of its AEAD cipher suites (including AES-GCM), TLS 1.2 implementations
could still choose their own (potentially insecure) nonce generation methods.</t>
          <t>It is therefore <bcp14>RECOMMENDED</bcp14> that TLS 1.2 implementations use the 64-bit
sequence number to populate the <tt>nonce_explicit</tt> part of the GCM nonce, as
described in the first two paragraphs of <xref section="5.3" sectionFormat="of" target="RFC8446"/>. This stronger recommendation updates <xref section="3" sectionFormat="of" target="RFC5288"/>, which specified that the use of 64-bit sequence numbers to populate the <tt>nonce_explicit</tt> field was optional.</t>
          <t>We note that at the time of writing there are no cipher suites defined for nonce
reuse resistant algorithms such as AES-GCM-SIV <xref target="RFC8452"/>.</t>
        </section>
      </section>
      <section anchor="sec-pfs">
        <name>Forward Secrecy</name>
        <t>Forward secrecy (also called "perfect forward secrecy" or "PFS" and defined in <xref target="RFC4949"/>) is a defense against an attacker who records encrypted conversations where the session keys are only encrypted with the communicating parties' long-term keys.</t>
        <t>Should the attacker be able to obtain these long-term keys at some point later in time, the session keys and thus the entire conversation could be decrypted.</t>
        <t>In the context of TLS and DTLS, such compromise of long-term keys is not entirely implausible. It can happen, for example, due to:</t>
        <ul spacing="normal">
          <li>A client or server being attacked by some other attack vector, and the private key retrieved.</li>
          <li>A long-term key retrieved from a device that has been sold or otherwise decommissioned without prior wiping.</li>
          <li>A long-term key used on a device as a default key <xref target="Heninger2012"/>.</li>
          <li>A key generated by a trusted third party like a CA, and later retrieved from it either by extortion or compromise <xref target="Soghoian2011"/>.</li>
          <li>A cryptographic break-through, or the use of asymmetric keys with insufficient length <xref target="Kleinjung2010"/>.</li>
          <li>Social engineering attacks against system administrators.</li>
          <li>Collection of private keys from inadequately protected backups.</li>
        </ul>
        <t>Forward secrecy ensures in such cases that it is not feasible for an attacker to determine the session keys even if the attacker has obtained the long-term keys some time after the conversation. It also protects against an attacker who is in possession of the long-term keys but remains passive during the conversation.</t>
        <t>Forward secrecy is generally achieved by using the Diffie-Hellman scheme to derive session keys. The Diffie-Hellman scheme has both parties maintain private secrets and send parameters over the network as modular powers over certain cyclic groups. The properties of the so-called Discrete Logarithm Problem (DLP) allow the parties to derive the session keys without an eavesdropper being able to do so. There is currently no known attack against DLP if sufficiently large parameters are chosen. A variant of the Diffie-Hellman scheme uses elliptic curves instead of the originally proposed modular arithmetic. Given the current state of the art, elliptic-curve Diffie-Hellman appears to be more efficient, permits shorter key lengths, and allows less freedom for implementation errors than finite-field Diffie-Hellman.</t>
        <t>Unfortunately, many TLS/DTLS cipher suites were defined that do not feature forward secrecy, e.g., TLS_RSA_WITH_AES_256_CBC_SHA256.  This document therefore advocates strict use of forward-secrecy-only ciphers.</t>
      </section>
      <section anchor="diffie-hellman-exponent-reuse">
        <name>Diffie-Hellman Exponent Reuse</name>
        <t>For performance reasons, it is not uncommon for TLS implementations to reuse Diffie-Hellman and Elliptic Curve Diffie-Hellman exponents across multiple connections. Such reuse can result in major security issues:</t>
        <ul spacing="normal">
          <li>If exponents are reused for too long (in some cases, even as little as a few hours), an attacker who gains access to the host can decrypt previous connections. In other words, exponent reuse negates the effects of forward secrecy.</li>
          <li>TLS implementations that reuse exponents should test the DH public key they receive for group membership, in order to avoid some known attacks. These tests are not standardized in TLS at the time of writing, although general guidance in this area is provided by <xref target="NIST.SP.800-56A"/> and available in many protocol implementations.</li>
          <li>Under certain conditions, the use of static finite-field DH keys, or of ephemeral finite-field DH keys that are reused across multiple connections, can lead to timing attacks (such as those described in <xref target="RACCOON"/>) on the shared secrets used in Diffie-Hellman key exchange.</li>
          <li>An "invalid curve" attack can be mounted against elliptic-curve DH if the victim does not verify that the received point lies on the correct curve.  If the victim is reusing the DH secrets, the attacker can repeat the probe varying the points to recover the full secret (see <xref target="Antipa2003"/> and <xref target="Jager2015"/>).</li>
        </ul>
        <t>To address these concerns:</t>
        <ul spacing="normal">
          <li>TLS implementations <bcp14>SHOULD NOT</bcp14> use static finite-field DH keys and <bcp14>SHOULD NOT</bcp14> reuse ephemeral finite-field DH keys across multiple connections.</li>
          <li>Server implementations that want to reuse elliptic-curve DH keys <bcp14>SHOULD</bcp14> either use a "safe curve" <xref target="SAFECURVES"/> (e.g., X25519), or perform the checks described in <xref target="NIST.SP.800-56A"/> on the received points.</li>
        </ul>
      </section>
      <section anchor="certificate-revocation">
        <name>Certificate Revocation</name>
        <t>The following considerations and recommendations represent the current state of the art regarding certificate revocation, even though no complete and efficient solution exists for the problem of checking the revocation status of common public key certificates <xref target="RFC5280"/>:</t>
        <ul spacing="normal">
          <li>Certificate revocation is an important tool when recovering from attacks on the TLS implementation, as well as cases of misissued certificates. TLS implementations <bcp14>MUST</bcp14> implement a strategy to distrust revoked certificates.</li>
          <li>Although Certificate Revocation Lists (CRLs) are the most widely supported mechanism for distributing revocation information, they have known scaling challenges that limit their usefulness, despite workarounds such as partitioned CRLs and delta CRLs. The more modern <xref target="CRLite"/> and the follow-on Let's Revoke <xref target="LetsRevoke"/> build on the availability of Certificate Transparency <xref target="RFC9162"/> logs and aggressive compression to allow practical use of the CRL infrastructure, but at the time of writing, neither solution is deployed for client-side revocation processing at scale.</li>
          <li>Proprietary mechanisms that embed revocation lists in the Web browser's configuration database cannot scale beyond a small number of the most heavily used Web servers.</li>
          <li>The On-Line Certification Status Protocol (OCSP) <xref target="RFC6960"/> in its basic form presents both scaling and privacy issues. In addition, clients typically "soft-fail", meaning that they do not abort the TLS connection if the OCSP server does not respond. (However, this might be a workaround to avoid denial-of-service attacks if an OCSP responder is taken offline.). For an up-to-date survey of the status of OCSP deployment in the Web PKI see <xref target="Chung18"/>.</li>
          <li>The TLS Certificate Status Request extension (<xref section="8" sectionFormat="of" target="RFC6066"/>), commonly called "OCSP stapling", resolves the operational issues with OCSP. However, it is still ineffective in the presence of a MITM attacker because the attacker can simply ignore the client's request for a stapled OCSP response.</li>
          <li>
            <xref target="RFC7633"/> defines a certificate extension that indicates that clients must expect stapled OCSP responses for the certificate and must abort the handshake ("hard-fail") if such a response is not available.</li>
          <li>OCSP stapling as used in TLS 1.2 does not extend to intermediate certificates within a certificate chain. The Multiple Certificate Status extension <xref target="RFC6961"/> addresses this shortcoming, but it has seen little deployment and had been deprecated by <xref target="RFC8446"/>. As a result, we no longer recommend this extension for TLS 1.2.</li>
          <li>TLS 1.3 (<xref section="4.4.2.1" sectionFormat="of" target="RFC8446"/>) allows the association of OCSP information with intermediate certificates by using an extension to the CertificateEntry structure. However using this facility remains impractical because many CAs either do not publish OCSP for CA certificates or publish OCSP reports with a lifetime that is too long to be useful.</li>
          <li>Both CRLs and OCSP depend on relatively reliable connectivity to the Internet, which might not be available to certain kinds of nodes. A common example is newly provisioned devices that need to establish a secure connection in order to boot up for the first time.</li>
        </ul>
        <t>For the common use cases of public key certificates in TLS, servers <bcp14>SHOULD</bcp14> support the following as a best practice given the current state of the art and as a foundation for a possible future solution: OCSP <xref target="RFC6960"/> and OCSP stapling using the <tt>status_request</tt> extension defined in <xref target="RFC6066"/>. Note that the exact mechanism for embedding the <tt>status_request</tt> extension differs between TLS 1.2 and 1.3. As a matter of local policy, server operators <bcp14>MAY</bcp14> request that CAs issue must-staple <xref target="RFC7633"/> certificates for the server and/or for client authentication, but we recommend to review the operational conditions before deciding on this approach.</t>
        <t>The considerations in this section do not apply to scenarios where the DANE-TLSA resource record <xref target="RFC6698"/> is used to signal to a client which certificate a server considers valid and good to use for TLS connections.</t>
      </section>
    </section>
    <section anchor="d1e1127">
      <name>Acknowledgments</name>
      <t>Thanks to
Alexey Melnikov,
Andrei Popov,
Ben Kaduk,
Christian Huitema,
Daniel Kahn Gillmor,
David Benjamin,
Eric Rescorla,
Francesca Palombini,
Hannes Tschofenig,
Hubert Kario,
Ilari Liusvaara,
John Mattsson,
John R Levine,
Julien <contact fullname="Élie" asciiFullname="Elie"/>,
Leif Johansson,
Martin Thomson,
Mohit Sahni,
Nick Sullivan,
Nimrod Aviram,
Paul Wouters,
Rich Salz,
Ryan Sleevi,
Sean Turner,
Stephen Farrell,
Tim Evans,
Valery Smyslov,
Viktor Dukhovni
for helpful comments and discussions that have shaped this document.</t>
      <t>The authors gratefully acknowledge the contribution of Ralph Holz, who was a coauthor of RFC 7525, the previous version of this document.</t>
      <t>See RFC 7525 for additional acknowledgments for the previous revision of this document.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <references>
        <name>Normative References</name>
        <reference anchor="RFC7465" target="https://www.rfc-editor.org/info/rfc7465">
          <front>
            <title>Prohibiting RC4 Cipher Suites</title>
            <author fullname="A. Popov" initials="A." surname="Popov">
              <organization/>
            </author>
            <date month="February" year="2015"/>
            <abstract>
              <t>This document requires that Transport Layer Security (TLS) clients and servers never negotiate the use of RC4 cipher suites when they establish connections.  This applies to all TLS versions.  This document updates RFCs 5246, 4346, and 2246.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7465"/>
          <seriesInfo name="DOI" value="10.17487/RFC7465"/>
        </reference>
        <reference anchor="RFC5246" target="https://www.rfc-editor.org/info/rfc5246">
          <front>
            <title>The Transport Layer Security (TLS) Protocol Version 1.2</title>
            <author fullname="T. Dierks" initials="T." surname="Dierks">
              <organization/>
            </author>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla">
              <organization/>
            </author>
            <date month="August" year="2008"/>
            <abstract>
              <t>This document specifies Version 1.2 of the Transport Layer Security (TLS) protocol.  The TLS protocol provides communications security over the Internet.  The protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5246"/>
          <seriesInfo name="DOI" value="10.17487/RFC5246"/>
        </reference>
        <reference anchor="RFC6347" target="https://www.rfc-editor.org/info/rfc6347">
          <front>
            <title>Datagram Transport Layer Security Version 1.2</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla">
              <organization/>
            </author>
            <author fullname="N. Modadugu" initials="N." surname="Modadugu">
              <organization/>
            </author>
            <date month="January" year="2012"/>
            <abstract>
              <t>This document specifies version 1.2 of the Datagram Transport Layer Security (DTLS) protocol.  The DTLS protocol provides communications privacy for datagram protocols.  The protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery.  The DTLS protocol is based on the Transport Layer Security (TLS) protocol and provides equivalent security guarantees.  Datagram semantics of the underlying transport are preserved by the DTLS protocol.  This document updates DTLS 1.0 to work with TLS version 1.2.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6347"/>
          <seriesInfo name="DOI" value="10.17487/RFC6347"/>
        </reference>
        <reference anchor="RFC8996" target="https://www.rfc-editor.org/info/rfc8996">
          <front>
            <title>Deprecating TLS 1.0 and TLS 1.1</title>
            <author fullname="K. Moriarty" initials="K." surname="Moriarty">
              <organization/>
            </author>
            <author fullname="S. Farrell" initials="S." surname="Farrell">
              <organization/>
            </author>
            <date month="March" year="2021"/>
            <abstract>
              <t>This document formally deprecates Transport Layer Security (TLS) versions 1.0 (RFC 2246) and 1.1 (RFC 4346). Accordingly, those documents have been moved to Historic status. These versions lack support for current and recommended cryptographic algorithms and mechanisms, and various government and industry profiles of applications using TLS now mandate avoiding these old TLS versions. TLS version 1.2 became the recommended version for IETF protocols in 2008 (subsequently being obsoleted by TLS version 1.3 in 2018), providing sufficient time to transition away from older versions. Removing support for older versions from implementations reduces the attack surface, reduces opportunity for misconfiguration, and streamlines library and product maintenance. </t>
              <t>This document also deprecates Datagram TLS (DTLS) version 1.0 (RFC 4347) but not DTLS version 1.2, and there is no DTLS version 1.1.</t>
              <t>This document updates many RFCs that normatively refer to TLS version 1.0 or TLS version 1.1, as described herein. This document also updates the best practices for TLS usage in RFC 7525; hence, it is part of BCP 195.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="195"/>
          <seriesInfo name="RFC" value="8996"/>
          <seriesInfo name="DOI" value="10.17487/RFC8996"/>
        </reference>
        <reference anchor="RFC8446" target="https://www.rfc-editor.org/info/rfc8446">
          <front>
            <title>The Transport Layer Security (TLS) Protocol Version 1.3</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla">
              <organization/>
            </author>
            <date month="August" year="2018"/>
            <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.</t>
              <t>This document updates RFCs 5705 and 6066, and obsoletes RFCs 5077, 5246, and 6961.  This document also specifies new requirements for TLS 1.2 implementations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8446"/>
          <seriesInfo name="DOI" value="10.17487/RFC8446"/>
        </reference>
        <reference anchor="RFC9147" target="https://www.rfc-editor.org/info/rfc9147">
          <front>
            <title>The Datagram Transport Layer Security (DTLS) Protocol Version 1.3</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla">
              <organization/>
            </author>
            <author fullname="H. Tschofenig" initials="H." surname="Tschofenig">
              <organization/>
            </author>
            <author fullname="N. Modadugu" initials="N." surname="Modadugu">
              <organization/>
            </author>
            <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" target="https://www.rfc-editor.org/info/rfc2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner">
              <organization/>
            </author>
            <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" target="https://www.rfc-editor.org/info/rfc8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba">
              <organization/>
            </author>
            <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="RFC6176" target="https://www.rfc-editor.org/info/rfc6176">
          <front>
            <title>Prohibiting Secure Sockets Layer (SSL) Version 2.0</title>
            <author fullname="S. Turner" initials="S." surname="Turner">
              <organization/>
            </author>
            <author fullname="T. Polk" initials="T." surname="Polk">
              <organization/>
            </author>
            <date month="March" year="2011"/>
            <abstract>
              <t>This document requires that when Transport Layer Security (TLS) clients and servers establish connections, they never negotiate the use of  Secure Sockets Layer (SSL) version 2.0.  This document updates the  backward compatibility sections found in the Transport Layer Security (TLS). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6176"/>
          <seriesInfo name="DOI" value="10.17487/RFC6176"/>
        </reference>
        <reference anchor="RFC5746" target="https://www.rfc-editor.org/info/rfc5746">
          <front>
            <title>Transport Layer Security (TLS) Renegotiation Indication Extension</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla">
              <organization/>
            </author>
            <author fullname="M. Ray" initials="M." surname="Ray">
              <organization/>
            </author>
            <author fullname="S. Dispensa" initials="S." surname="Dispensa">
              <organization/>
            </author>
            <author fullname="N. Oskov" initials="N." surname="Oskov">
              <organization/>
            </author>
            <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="RFC7627" target="https://www.rfc-editor.org/info/rfc7627">
          <front>
            <title>Transport Layer Security (TLS) Session Hash and Extended Master Secret Extension</title>
            <author fullname="K. Bhargavan" initials="K." role="editor" surname="Bhargavan">
              <organization/>
            </author>
            <author fullname="A. Delignat-Lavaud" initials="A." surname="Delignat-Lavaud">
              <organization/>
            </author>
            <author fullname="A. Pironti" initials="A." surname="Pironti">
              <organization/>
            </author>
            <author fullname="A. Langley" initials="A." surname="Langley">
              <organization/>
            </author>
            <author fullname="M. Ray" initials="M." surname="Ray">
              <organization/>
            </author>
            <date month="September" year="2015"/>
            <abstract>
              <t>The Transport Layer Security (TLS) master secret is not cryptographically bound to important session parameters such as the server certificate.  Consequently, it is possible for an active attacker to set up two sessions, one with a client and another with a server, such that the master secrets on the two sessions are the same.  Thereafter, any mechanism that relies on the master secret for authentication, including session resumption, becomes vulnerable to a man-in-the-middle attack, where the attacker can simply forward messages back and forth between the client and server.  This specification defines a TLS extension that contextually binds the master secret to a log of the full handshake that computes it, thus preventing such attacks.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7627"/>
          <seriesInfo name="DOI" value="10.17487/RFC7627"/>
        </reference>
        <reference anchor="RFC8740" target="https://www.rfc-editor.org/info/rfc8740">
          <front>
            <title>Using TLS 1.3 with HTTP/2</title>
            <author fullname="D. Benjamin" initials="D." surname="Benjamin">
              <organization/>
            </author>
            <date month="February" year="2020"/>
            <abstract>
              <t>This document updates RFC 7540 by forbidding TLS 1.3 post-handshake authentication, as an analog to the existing TLS 1.2 renegotiation restriction.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8740"/>
          <seriesInfo name="DOI" value="10.17487/RFC8740"/>
        </reference>
        <reference anchor="RFC7301" target="https://www.rfc-editor.org/info/rfc7301">
          <front>
            <title>Transport Layer Security (TLS) Application-Layer Protocol Negotiation Extension</title>
            <author fullname="S. Friedl" initials="S." surname="Friedl">
              <organization/>
            </author>
            <author fullname="A. Popov" initials="A." surname="Popov">
              <organization/>
            </author>
            <author fullname="A. Langley" initials="A." surname="Langley">
              <organization/>
            </author>
            <author fullname="E. Stephan" initials="E." surname="Stephan">
              <organization/>
            </author>
            <date month="July" year="2014"/>
            <abstract>
              <t>This document describes a Transport Layer Security (TLS) extension for application-layer protocol negotiation within the TLS handshake. For instances in which multiple application protocols are supported on the same TCP or UDP port, this extension allows the application layer to negotiate which protocol will be used within the TLS connection.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7301"/>
          <seriesInfo name="DOI" value="10.17487/RFC7301"/>
        </reference>
        <reference anchor="RFC3766" target="https://www.rfc-editor.org/info/rfc3766">
          <front>
            <title>Determining Strengths For Public Keys Used For Exchanging Symmetric Keys</title>
            <author fullname="H. Orman" initials="H." surname="Orman">
              <organization/>
            </author>
            <author fullname="P. Hoffman" initials="P." surname="Hoffman">
              <organization/>
            </author>
            <date month="April" year="2004"/>
            <abstract>
              <t>Implementors of systems that use public key cryptography to exchange symmetric keys need to make the public keys resistant to some predetermined level of attack.  That level of attack resistance is the strength of the system, and the symmetric keys that are exchanged must be at least as strong as the system strength requirements.  The three quantities, system strength, symmetric key strength, and public key strength, must be consistently matched for any network protocol usage.  While it is fairly easy to express the system strength requirements in terms of a symmetric key length and to choose a cipher that has a key length equal to or exceeding that requirement, it is harder to choose a public key that has a cryptographic strength meeting a symmetric key strength requirement.  This document explains how to determine the length of an asymmetric key as a function of a symmetric key strength requirement.  Some rules of thumb for estimating equivalent resistance to large-scale attacks on various algorithms are given.  The document also addresses how changing the sizes of the underlying large integers (moduli, group sizes, exponents, and so on) changes the time to use the algorithms for key exchange.  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="86"/>
          <seriesInfo name="RFC" value="3766"/>
          <seriesInfo name="DOI" value="10.17487/RFC3766"/>
        </reference>
        <reference anchor="RFC6979" target="https://www.rfc-editor.org/info/rfc6979">
          <front>
            <title>Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA)</title>
            <author fullname="T. Pornin" initials="T." surname="Pornin">
              <organization/>
            </author>
            <date month="August" year="2013"/>
            <abstract>
              <t>This document defines a deterministic digital signature generation procedure.  Such signatures are compatible with standard Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA) digital signatures and can be processed with unmodified verifiers, which need not be aware of the procedure described therein.  Deterministic signatures retain the cryptographic security features associated with digital signatures but can be more easily implemented in various environments, since they do not need access to a source of high-quality randomness.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6979"/>
          <seriesInfo name="DOI" value="10.17487/RFC6979"/>
        </reference>
        <reference anchor="RFC8422" target="https://www.rfc-editor.org/info/rfc8422">
          <front>
            <title>Elliptic Curve Cryptography (ECC) Cipher Suites for Transport Layer Security (TLS) Versions 1.2 and Earlier</title>
            <author fullname="Y. Nir" initials="Y." surname="Nir">
              <organization/>
            </author>
            <author fullname="S. Josefsson" initials="S." surname="Josefsson">
              <organization/>
            </author>
            <author fullname="M. Pegourie-Gonnard" initials="M." surname="Pegourie-Gonnard">
              <organization/>
            </author>
            <date month="August" year="2018"/>
            <abstract>
              <t>This document describes key exchange algorithms based on Elliptic Curve Cryptography (ECC) for the Transport Layer Security (TLS) protocol.  In particular, it specifies the use of Ephemeral Elliptic Curve Diffie-Hellman (ECDHE) key agreement in a TLS handshake and the use of the Elliptic Curve Digital Signature Algorithm (ECDSA) and Edwards-curve Digital Signature Algorithm (EdDSA) as authentication mechanisms.</t>
              <t>This document obsoletes RFC 4492.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8422"/>
          <seriesInfo name="DOI" value="10.17487/RFC8422"/>
        </reference>
        <reference anchor="RFC7748" target="https://www.rfc-editor.org/info/rfc7748">
          <front>
            <title>Elliptic Curves for Security</title>
            <author fullname="A. Langley" initials="A." surname="Langley">
              <organization/>
            </author>
            <author fullname="M. Hamburg" initials="M." surname="Hamburg">
              <organization/>
            </author>
            <author fullname="S. Turner" initials="S." surname="Turner">
              <organization/>
            </author>
            <date month="January" year="2016"/>
            <abstract>
              <t>This memo specifies two elliptic curves over prime fields that offer a high level of practical security in cryptographic applications, including Transport Layer Security (TLS).  These curves are intended to operate at the ~128-bit and ~224-bit security level, respectively, and are generated deterministically based on a list of required properties.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7748"/>
          <seriesInfo name="DOI" value="10.17487/RFC7748"/>
        </reference>
        <reference anchor="RFC9155" target="https://www.rfc-editor.org/info/rfc9155">
          <front>
            <title>Deprecating MD5 and SHA-1 Signature Hashes in TLS 1.2 and DTLS 1.2</title>
            <author fullname="L. Velvindron" initials="L." surname="Velvindron">
              <organization/>
            </author>
            <author fullname="K. Moriarty" initials="K." surname="Moriarty">
              <organization/>
            </author>
            <author fullname="A. Ghedini" initials="A." surname="Ghedini">
              <organization/>
            </author>
            <date month="December" year="2021"/>
            <abstract>
              <t>The MD5 and SHA-1 hashing algorithms are increasingly vulnerable to attack, and this document deprecates their use in TLS 1.2 and DTLS 1.2 digital signatures. However, this document does not deprecate SHA-1 with Hashed Message Authentication Code (HMAC), as used in record protection. This document updates RFC 5246.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9155"/>
          <seriesInfo name="DOI" value="10.17487/RFC9155"/>
        </reference>
        <reference anchor="I-D.ietf-httpbis-semantics" target="https://www.ietf.org/archive/id/draft-ietf-httpbis-semantics-19.txt">
          <front>
            <title>HTTP Semantics</title>
            <author fullname="Roy T. Fielding">
              <organization>Adobe</organization>
            </author>
            <author fullname="Mark Nottingham">
              <organization>Fastly</organization>
            </author>
            <author fullname="Julian Reschke">
              <organization>greenbytes GmbH</organization>
            </author>
            <date day="12" month="September" year="2021"/>
            <abstract>
              <t>The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems. This document describes the overall architecture of HTTP, establishes common terminology, and defines aspects of the protocol that are shared by all versions. In this definition are core protocol elements, extensibility mechanisms, and the "http" and "https" Uniform Resource Identifier (URI) schemes.

 This document updates RFC 3864 and obsoletes RFCs 2818, 7231, 7232, 7233, 7235, 7538, 7615, 7694, and portions of 7230.
              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-httpbis-semantics-19"/>
        </reference>
        <reference anchor="RFC6125" target="https://www.rfc-editor.org/info/rfc6125">
          <front>
            <title>Representation and Verification of Domain-Based Application Service Identity within Internet Public Key Infrastructure Using X.509 (PKIX) Certificates in the Context of Transport Layer Security (TLS)</title>
            <author fullname="P. Saint-Andre" initials="P." surname="Saint-Andre">
              <organization/>
            </author>
            <author fullname="J. Hodges" initials="J." surname="Hodges">
              <organization/>
            </author>
            <date month="March" year="2011"/>
            <abstract>
              <t>Many application technologies enable secure communication between two entities by means of Internet Public Key Infrastructure Using X.509 (PKIX) certificates in the context of Transport Layer Security (TLS). This document specifies procedures for representing and verifying the identity of application services in such interactions.   [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6125"/>
          <seriesInfo name="DOI" value="10.17487/RFC6125"/>
        </reference>
        <reference anchor="RFC5288" target="https://www.rfc-editor.org/info/rfc5288">
          <front>
            <title>AES Galois Counter Mode (GCM) Cipher Suites for TLS</title>
            <author fullname="J. Salowey" initials="J." surname="Salowey">
              <organization/>
            </author>
            <author fullname="A. Choudhury" initials="A." surname="Choudhury">
              <organization/>
            </author>
            <author fullname="D. McGrew" initials="D." surname="McGrew">
              <organization/>
            </author>
            <date month="August" year="2008"/>
            <abstract>
              <t>This memo describes the use of the Advanced Encryption Standard (AES) in Galois/Counter Mode (GCM) as a Transport Layer Security (TLS) authenticated encryption operation.  GCM provides both confidentiality and data origin authentication, can be efficiently implemented in hardware for speeds of 10 gigabits per second and above, and is also well-suited to software implementations.  This memo defines TLS cipher suites that use AES-GCM with RSA, DSA, and Diffie-Hellman-based key exchange mechanisms.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5288"/>
          <seriesInfo name="DOI" value="10.17487/RFC5288"/>
        </reference>
        <reference anchor="RFC6066" target="https://www.rfc-editor.org/info/rfc6066">
          <front>
            <title>Transport Layer Security (TLS) Extensions: Extension Definitions</title>
            <author fullname="D. Eastlake 3rd" initials="D." surname="Eastlake 3rd">
              <organization/>
            </author>
            <date month="January" year="2011"/>
            <abstract>
              <t>This document provides specifications for existing TLS extensions.  It is a companion document for RFC 5246, "The Transport Layer Security (TLS) Protocol Version 1.2".  The extensions specified are server_name, max_fragment_length, client_certificate_url, trusted_ca_keys, truncated_hmac, and status_request.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6066"/>
          <seriesInfo name="DOI" value="10.17487/RFC6066"/>
        </reference>
      </references>
      <references>
        <name>Informative References</name>
        <reference anchor="Chung18">
          <front>
            <title>Is the Web Ready for OCSP Must-Staple?</title>
            <author fullname="Taejoong Chung" initials="T." surname="Chung">
              <organization/>
            </author>
            <author fullname="Jay Lok" initials="J." surname="Lok">
              <organization/>
            </author>
            <author fullname="Balakrishnan Chandrasekaran" initials="B." surname="Chandrasekaran">
              <organization/>
            </author>
            <author fullname="David Choffnes" initials="D." surname="Choffnes">
              <organization/>
            </author>
            <author fullname="Dave Levin" initials="D." surname="Levin">
              <organization/>
            </author>
            <author fullname="Bruce M. Maggs" initials="B." surname="Maggs">
              <organization/>
            </author>
            <author fullname="Alan Mislove" initials="A." surname="Mislove">
              <organization/>
            </author>
            <author fullname="John Rula" initials="J." surname="Rula">
              <organization/>
            </author>
            <author fullname="Nick Sullivan" initials="N." surname="Sullivan">
              <organization/>
            </author>
            <author fullname="Christo Wilson" initials="C." surname="Wilson">
              <organization/>
            </author>
            <date month="October" year="2018"/>
          </front>
          <seriesInfo name="Proceedings of the Internet Measurement Conference" value="2018"/>
          <seriesInfo name="DOI" value="10.1145/3278532.3278543"/>
        </reference>
        <reference anchor="CRLite">
          <front>
            <title>CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers</title>
            <author fullname="James Larisch" initials="J." surname="Larisch">
              <organization/>
            </author>
            <author fullname="David Choffnes" initials="D." surname="Choffnes">
              <organization/>
            </author>
            <author fullname="Dave Levin" initials="D." surname="Levin">
              <organization/>
            </author>
            <author fullname="Bruce M. Maggs" initials="B." surname="Maggs">
              <organization/>
            </author>
            <author fullname="Alan Mislove" initials="A." surname="Mislove">
              <organization/>
            </author>
            <author fullname="Christo Wilson" initials="C." surname="Wilson">
              <organization/>
            </author>
            <date month="May" year="2017"/>
          </front>
          <seriesInfo name="2017 IEEE Symposium on Security and Privacy" value="(SP)"/>
          <seriesInfo name="DOI" value="10.1109/sp.2017.17"/>
        </reference>
        <reference anchor="LetsRevoke">
          <front>
            <title>Let's Revoke: Scalable Global Certificate Revocation</title>
            <author fullname="Trevor Smith" initials="T." surname="Smith">
              <organization/>
            </author>
            <author fullname="Luke Dickinson" initials="L." surname="Dickinson">
              <organization/>
            </author>
            <author fullname="Kent Seamons" initials="K." surname="Seamons">
              <organization/>
            </author>
            <date year="2020"/>
          </front>
          <seriesInfo name="Proceedings 2020 Network and Distributed System Security" value="Symposium"/>
          <seriesInfo name="DOI" value="10.14722/ndss.2020.24084"/>
        </reference>
        <reference anchor="DegabrieleP07">
          <front>
            <title>Attacking the IPsec Standards in Encryption-only Configurations</title>
            <author fullname="Jean Paul Degabriele" initials="J." surname="Degabriele">
              <organization/>
            </author>
            <author fullname="Kenneth G. Paterson" initials="K." surname="Paterson">
              <organization/>
            </author>
            <date month="May" year="2007"/>
          </front>
          <seriesInfo name="2007 IEEE Symposium on Security and Privacy (SP" value="'07)"/>
          <seriesInfo name="DOI" value="10.1109/sp.2007.8"/>
        </reference>
        <reference anchor="triple-handshake">
          <front>
            <title>Triple Handshakes and Cookie Cutters: Breaking and Fixing Authentication over TLS</title>
            <author fullname="Karthikeyan Bhargavan" initials="K." surname="Bhargavan">
              <organization/>
            </author>
            <author fullname="Antoine Delignat Lavaud" initials="A." surname="Lavaud">
              <organization/>
            </author>
            <author fullname="Cedric Fournet" initials="C." surname="Fournet">
              <organization/>
            </author>
            <author fullname="Alfredo Pironti" initials="A." surname="Pironti">
              <organization/>
            </author>
            <author fullname="Pierre Yves Strub" initials="P." surname="Strub">
              <organization/>
            </author>
            <date month="May" year="2014"/>
          </front>
          <seriesInfo name="2014 IEEE Symposium on Security and" value="Privacy"/>
          <seriesInfo name="DOI" value="10.1109/sp.2014.14"/>
        </reference>
        <reference anchor="Soghoian2011">
          <front>
            <title>Certified Lies: Detecting and Defeating Government Interception Attacks Against SSL</title>
            <author fullname="Christopher Soghoian" initials="C." surname="Soghoian">
              <organization/>
            </author>
            <author fullname="Sid Stamm" initials="S." surname="Stamm">
              <organization/>
            </author>
            <date year="2010"/>
          </front>
          <seriesInfo name="SSRN Electronic" value="Journal"/>
          <seriesInfo name="DOI" value="10.2139/ssrn.1591033"/>
        </reference>
        <reference anchor="Logjam">
          <front>
            <title>Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice</title>
            <author fullname="David Adrian" initials="D." surname="Adrian">
              <organization/>
            </author>
            <author fullname="Karthikeyan Bhargavan" initials="K." surname="Bhargavan">
              <organization/>
            </author>
            <author fullname="Zakir Durumeric" initials="Z." surname="Durumeric">
              <organization/>
            </author>
            <author fullname="Pierrick Gaudry" initials="P." surname="Gaudry">
              <organization/>
            </author>
            <author fullname="Matthew Green" initials="M." surname="Green">
              <organization/>
            </author>
            <author fullname="J. Alex Halderman" initials="J." surname="Halderman">
              <organization/>
            </author>
            <author fullname="Nadia Heninger" initials="N." surname="Heninger">
              <organization/>
            </author>
            <author fullname="Drew Springall" initials="D." surname="Springall">
              <organization/>
            </author>
            <author fullname="Emmanuel Thomé" initials="E." surname="Thomé">
              <organization/>
            </author>
            <author fullname="Luke Valenta" initials="L." surname="Valenta">
              <organization/>
            </author>
            <author fullname="Benjamin VanderSloot" initials="B." surname="VanderSloot">
              <organization/>
            </author>
            <author fullname="Eric Wustrow" initials="E." surname="Wustrow">
              <organization/>
            </author>
            <author fullname="Santiago Zanella-Béguelin" initials="S." surname="Zanella-Béguelin">
              <organization/>
            </author>
            <author fullname="Paul Zimmermann" initials="P." surname="Zimmermann">
              <organization/>
            </author>
            <date month="October" year="2015"/>
          </front>
          <seriesInfo name="Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications" value="Security"/>
          <seriesInfo name="DOI" value="10.1145/2810103.2813707"/>
        </reference>
        <reference anchor="POODLE" target="https://www.us-cert.gov/ncas/alerts/TA14-290A">
          <front>
            <title>SSL 3.0 Protocol Vulnerability and POODLE Attack</title>
            <author>
              <organization>US-CERT</organization>
            </author>
            <date year="2014" month="October"/>
          </front>
        </reference>
        <reference anchor="CAB-Baseline" target="https://www.cabforum.org/documents.html">
          <front>
            <title>Baseline Requirements for the Issuance and Management of Publicly-Trusted Certificates Version 1.1.6</title>
            <author>
              <organization>CA/Browser Forum</organization>
            </author>
            <date year="2013"/>
          </front>
        </reference>
        <reference anchor="Heninger2012">
          <front>
            <title>Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices</title>
            <author initials="N." surname="Heninger" fullname="Nadia Heninger">
              <organization/>
            </author>
            <author initials="Z." surname="Durumeric" fullname="Zakir Durumeric">
              <organization/>
            </author>
            <author initials="E." surname="Wustrow" fullname="Eric Wustrow">
              <organization/>
            </author>
            <author initials="J. A." surname="Halderman" fullname="J. Alex Halderman">
              <organization/>
            </author>
            <date year="2012"/>
          </front>
          <seriesInfo name="Usenix Security Symposium" value="2012"/>
        </reference>
        <reference anchor="Sy2018">
          <front>
            <title>Tracking Users across the Web via TLS Session Resumption</title>
            <author fullname="Erik Sy" initials="E." surname="Sy">
              <organization/>
            </author>
            <author fullname="Christian Burkert" initials="C." surname="Burkert">
              <organization/>
            </author>
            <author fullname="Hannes Federrath" initials="H." surname="Federrath">
              <organization/>
            </author>
            <author fullname="Mathias Fischer" initials="M." surname="Fischer">
              <organization/>
            </author>
            <date month="December" year="2018"/>
          </front>
          <seriesInfo name="Proceedings of the 34th Annual Computer Security Applications" value="Conference"/>
          <seriesInfo name="DOI" value="10.1145/3274694.3274708"/>
        </reference>
        <reference anchor="DANE-SMTP" target="https://www.rfc-editor.org/info/rfc7672">
          <front>
            <title>SMTP Security via Opportunistic DNS-Based Authentication of Named Entities (DANE) Transport Layer Security (TLS)</title>
            <author fullname="V. Dukhovni" initials="V." surname="Dukhovni">
              <organization/>
            </author>
            <author fullname="W. Hardaker" initials="W." surname="Hardaker">
              <organization/>
            </author>
            <date month="October" year="2015"/>
            <abstract>
              <t>This memo describes a downgrade-resistant protocol for SMTP transport security between Message Transfer Agents (MTAs), based on the DNS-Based Authentication of Named Entities (DANE) TLSA DNS record. Adoption of this protocol enables an incremental transition of the Internet email backbone to one using encrypted and authenticated Transport Layer Security (TLS).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7672"/>
          <seriesInfo name="DOI" value="10.17487/RFC7672"/>
        </reference>
        <reference anchor="PatersonRS11">
          <front>
            <title>Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol</title>
            <author fullname="Kenneth G. Paterson" initials="K." surname="Paterson">
              <organization/>
            </author>
            <author fullname="Thomas Ristenpart" initials="T." surname="Ristenpart">
              <organization/>
            </author>
            <author fullname="Thomas Shrimpton" initials="T." surname="Shrimpton">
              <organization/>
            </author>
            <date year="2011"/>
          </front>
          <seriesInfo name="Lecture Notes in Computer Science" value="pp. 372-389"/>
          <seriesInfo name="DOI" value="10.1007/978-3-642-25385-0_20"/>
        </reference>
        <reference anchor="DANE-SRV" target="https://www.rfc-editor.org/info/rfc7673">
          <front>
            <title>Using DNS-Based Authentication of Named Entities (DANE) TLSA Records with SRV Records</title>
            <author fullname="T. Finch" initials="T." surname="Finch">
              <organization/>
            </author>
            <author fullname="M. Miller" initials="M." surname="Miller">
              <organization/>
            </author>
            <author fullname="P. Saint-Andre" initials="P." surname="Saint-Andre">
              <organization/>
            </author>
            <date month="October" year="2015"/>
            <abstract>
              <t>The DNS-Based Authentication of Named Entities (DANE) specification (RFC 6698) describes how to use TLSA resource records secured by DNSSEC (RFC 4033) to associate a server's connection endpoint with its Transport Layer Security (TLS) certificate (thus enabling administrators of domain names to specify the keys used in that domain's TLS servers).  However, application protocols that use SRV records (RFC 2782) to indirectly name the target server connection endpoints for a service domain name cannot apply the rules from RFC 6698.  Therefore, this document provides guidelines that enable such protocols to locate and use TLSA records.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7673"/>
          <seriesInfo name="DOI" value="10.17487/RFC7673"/>
        </reference>
        <reference anchor="HTTP1.1" target="https://www.ietf.org/archive/id/draft-ietf-httpbis-messaging-19.txt">
          <front>
            <title>HTTP/1.1</title>
            <author fullname="Roy T. Fielding">
              <organization>Adobe</organization>
            </author>
            <author fullname="Mark Nottingham">
              <organization>Fastly</organization>
            </author>
            <author fullname="Julian Reschke">
              <organization>greenbytes GmbH</organization>
            </author>
            <date day="12" month="September" year="2021"/>
            <abstract>
              <t>The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems. This document specifies the HTTP/1.1 message syntax, message parsing, connection management, and related security concerns.

 This document obsoletes portions of RFC 7230.
              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-httpbis-messaging-19"/>
        </reference>
        <reference anchor="HTTP2" target="https://www.ietf.org/archive/id/draft-ietf-httpbis-http2bis-07.txt">
          <front>
            <title>HTTP/2</title>
            <author fullname="Martin Thomson">
              <organization>Mozilla</organization>
            </author>
            <author fullname="Cory Benfield">
              <organization>Apple Inc.</organization>
            </author>
            <date day="24" month="January" year="2022"/>
            <abstract>
              <t>This specification describes an optimized expression of the semantics of the Hypertext Transfer Protocol (HTTP), referred to as HTTP version 2 (HTTP/2). HTTP/2 enables a more efficient use of network resources and a reduced latency by introducing field compression and allowing multiple concurrent exchanges on the same connection.

 This document obsoletes RFCs 7540 and 8740.
              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-httpbis-http2bis-07"/>
        </reference>
        <reference anchor="Kleinjung2010">
          <front>
            <title>Factorization of a 768-Bit RSA Modulus</title>
            <author fullname="Thorsten Kleinjung" initials="T." surname="Kleinjung">
              <organization/>
            </author>
            <author fullname="Kazumaro Aoki" initials="K." surname="Aoki">
              <organization/>
            </author>
            <author fullname="Jens Franke" initials="J." surname="Franke">
              <organization/>
            </author>
            <author fullname="Arjen K. Lenstra" initials="A." surname="Lenstra">
              <organization/>
            </author>
            <author fullname="Emmanuel Thomé" initials="E." surname="Thomé">
              <organization/>
            </author>
            <author fullname="Joppe W. Bos" initials="J." surname="Bos">
              <organization/>
            </author>
            <author fullname="Pierrick Gaudry" initials="P." surname="Gaudry">
              <organization/>
            </author>
            <author fullname="Alexander Kruppa" initials="A." surname="Kruppa">
              <organization/>
            </author>
            <author fullname="Peter L. Montgomery" initials="P." surname="Montgomery">
              <organization/>
            </author>
            <author fullname="Dag Arne Osvik" initials="D." surname="Osvik">
              <organization/>
            </author>
            <author fullname="Herman te Riele" initials="H." surname="te Riele">
              <organization/>
            </author>
            <author fullname="Andrey Timofeev" initials="A." surname="Timofeev">
              <organization/>
            </author>
            <author fullname="Paul Zimmermann" initials="P." surname="Zimmermann">
              <organization/>
            </author>
            <date year="2010"/>
          </front>
          <seriesInfo name="Advances in Cryptology - CRYPTO 2010" value="pp. 333-350"/>
          <seriesInfo name="DOI" value="10.1007/978-3-642-14623-7_18"/>
        </reference>
        <reference anchor="IANA_TLS" target="https://www.iana.org/assignments/tls-parameters">
          <front>
            <title>Transport Layer Security (TLS) Parameters</title>
            <author>
              <organization>IANA</organization>
            </author>
            <date/>
          </front>
        </reference>
        <reference anchor="Multiple-Encryption">
          <front>
            <title>On the security of multiple encryption</title>
            <author fullname="Ralph C. Merkle" initials="R." surname="Merkle">
              <organization/>
            </author>
            <author fullname="Martin E. Hellman" initials="M." surname="Hellman">
              <organization/>
            </author>
            <date month="July" year="1981"/>
          </front>
          <seriesInfo name="Communications of the ACM" value="Vol. 24, pp. 465-467"/>
          <seriesInfo name="DOI" value="10.1145/358699.358718"/>
        </reference>
        <reference anchor="NIST.SP.800-56A">
          <front>
            <title>Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography</title>
            <author fullname="Elaine Barker" initials="E." surname="Barker">
              <organization/>
            </author>
            <author fullname="Lily Chen" initials="L." surname="Chen">
              <organization/>
            </author>
            <author fullname="Allen Roginsky" initials="A." surname="Roginsky">
              <organization/>
            </author>
            <author fullname="Apostol Vassilev" initials="A." surname="Vassilev">
              <organization/>
            </author>
            <author fullname="Richard Davis" initials="R." surname="Davis">
              <organization/>
            </author>
            <date month="April" year="2018"/>
          </front>
          <seriesInfo name="National Institute of Standards and Technology" value="report"/>
          <seriesInfo name="DOI" value="10.6028/nist.sp.800-56ar3"/>
        </reference>
        <reference anchor="Springall16">
          <front>
            <title>Measuring the Security Harm of TLS Crypto Shortcuts</title>
            <author fullname="Drew Springall" initials="D." surname="Springall">
              <organization/>
            </author>
            <author fullname="Zakir Durumeric" initials="Z." surname="Durumeric">
              <organization/>
            </author>
            <author fullname="J. Alex Halderman" initials="J." surname="Halderman">
              <organization/>
            </author>
            <date month="November" year="2016"/>
          </front>
          <seriesInfo name="Proceedings of the 2016 Internet Measurement" value="Conference"/>
          <seriesInfo name="DOI" value="10.1145/2987443.2987480"/>
        </reference>
        <reference anchor="DEP-SSLv3" target="https://www.rfc-editor.org/info/rfc7568">
          <front>
            <title>Deprecating Secure Sockets Layer Version 3.0</title>
            <author fullname="R. Barnes" initials="R." surname="Barnes">
              <organization/>
            </author>
            <author fullname="M. Thomson" initials="M." surname="Thomson">
              <organization/>
            </author>
            <author fullname="A. Pironti" initials="A." surname="Pironti">
              <organization/>
            </author>
            <author fullname="A. Langley" initials="A." surname="Langley">
              <organization/>
            </author>
            <date month="June" year="2015"/>
            <abstract>
              <t>The Secure Sockets Layer version 3.0 (SSLv3), as specified in RFC 6101, is not sufficiently secure.  This document requires that SSLv3 not be used.  The replacement versions, in particular, Transport Layer Security (TLS) 1.2 (RFC 5246), are considerably more secure and capable protocols.</t>
              <t>This document updates the backward compatibility section of RFC 5246 and its predecessors to prohibit fallback to SSLv3.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7568"/>
          <seriesInfo name="DOI" value="10.17487/RFC7568"/>
        </reference>
        <reference anchor="Boeck2016" target="https://eprint.iacr.org/2016/475.pdf">
          <front>
            <title>Nonce-Disrespecting Adversaries: Practical Forgery Attacks on GCM in TLS</title>
            <author initials="H." surname="Böck" fullname="Hanno Böck">
              <organization/>
            </author>
            <author initials="A." surname="Zauner" fullname="Aaron Zauner">
              <organization/>
            </author>
            <author initials="S." surname="Devlin" fullname="Sean Devlin">
              <organization/>
            </author>
            <author initials="J." surname="Somorovsky" fullname="Juraj Somorovsky">
              <organization/>
            </author>
            <author initials="P." surname="Jovanovic" fullname="Philipp Jovanovic">
              <organization/>
            </author>
            <date year="2016" month="May"/>
          </front>
        </reference>
        <reference anchor="Joux2006" target="https://csrc.nist.gov/csrc/media/projects/block-cipher-techniques/documents/bcm/comments/800-38-series-drafts/gcm/joux_comments.pdf">
          <front>
            <title>Authentication Failures in NIST version of GCM</title>
            <author initials="A." surname="Joux" fullname="Antoine Joux">
              <organization/>
            </author>
            <date year="2006"/>
          </front>
        </reference>
        <reference anchor="CVE" target="https://cve.mitre.org">
          <front>
            <title>Common Vulnerabilities and Exposures</title>
            <author>
              <organization>MITRE</organization>
            </author>
            <date/>
          </front>
        </reference>
        <reference anchor="ALPACA" target="https://www.usenix.org/conference/usenixsecurity21/presentation/brinkmann">
          <front>
            <title>ALPACA: Application Layer Protocol Confusion - Analyzing and Mitigating Cracks in TLS Authentication</title>
            <author initials="M." surname="Brinkmann" fullname="Marcus Brinkmann">
              <organization/>
            </author>
            <author initials="C." surname="Dresen" fullname="Christian Dresen">
              <organization/>
            </author>
            <author initials="R." surname="Merget" fullname="Robert Merget">
              <organization/>
            </author>
            <author initials="D." surname="Poddebniak" fullname="Damian Poddebniak">
              <organization/>
            </author>
            <author initials="J." surname="Müller" fullname="Jens Müller">
              <organization/>
            </author>
            <author initials="J." surname="Somorovsky" fullname="Juraj Somorovsky">
              <organization/>
            </author>
            <author initials="J." surname="Schwenk" fullname="Jörg Schwenk">
              <organization/>
            </author>
            <author initials="S." surname="Schinzel" fullname="Sebastian Schinzel">
              <organization/>
            </author>
            <date year="2021"/>
          </front>
          <seriesInfo name="30th USENIX Security Symposium (USENIX Security 21)" value=""/>
        </reference>
        <reference anchor="DROWN" target="https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/aviram">
          <front>
            <title>DROWN: Breaking TLS using SSLv2</title>
            <author initials="N." surname="Aviram" fullname="Nimrod Aviram">
              <organization/>
            </author>
            <author initials="S." surname="Schinzel" fullname="Sebastian Schinzel">
              <organization/>
            </author>
            <author initials="J." surname="Somorovsky" fullname="Juraj Somorovsky">
              <organization/>
            </author>
            <author initials="N." surname="Heninger" fullname="Nadia Heninger">
              <organization/>
            </author>
            <author initials="M." surname="Dankel" fullname="Maik Dankel">
              <organization/>
            </author>
            <author initials="J." surname="Steube" fullname="Jens Steube">
              <organization/>
            </author>
            <author initials="L." surname="Valenta" fullname="Luke Valenta">
              <organization/>
            </author>
            <author initials="D." surname="Adrian" fullname="David Adrian">
              <organization/>
            </author>
            <author initials="J." surname="Halderman" fullname="J. Alex Halderman">
              <organization/>
            </author>
            <author initials="V." surname="Dukhovni" fullname="Viktor Dukhovni">
              <organization/>
            </author>
            <author initials="E." surname="Käsper" fullname="Emilia Käsper">
              <organization/>
            </author>
            <author initials="S." surname="Cohney" fullname="Shaanan Cohney">
              <organization/>
            </author>
            <author initials="S." surname="Engels" fullname="Susanne Engels">
              <organization/>
            </author>
            <author initials="C." surname="Paar" fullname="Christof Paar">
              <organization/>
            </author>
            <author initials="Y." surname="Shavitt" fullname="Yuval Shavitt">
              <organization/>
            </author>
            <date year="2016"/>
          </front>
          <seriesInfo name="25th USENIX Security Symposium (USENIX Security 16)" value=""/>
        </reference>
        <reference anchor="RACCOON" target="https://www.usenix.org/conference/usenixsecurity21/presentation/merget">
          <front>
            <title>Raccoon Attack: Finding and Exploiting Most-Significant-Bit-Oracles in TLS-DH(E)</title>
            <author initials="R." surname="Merget" fullname="Robert Merget">
              <organization/>
            </author>
            <author initials="M." surname="Brinkmann" fullname="Marcus Brinkmann">
              <organization/>
            </author>
            <author initials="N." surname="Aviram" fullname="Nimrod Aviram">
              <organization/>
            </author>
            <author initials="J." surname="Somorovsky" fullname="Juraj Somorovsky">
              <organization/>
            </author>
            <author initials="J." surname="Mittmann" fullname="Johannes Mittmann">
              <organization/>
            </author>
            <author initials="J." surname="Schwenk" fullname="Jörg Schwenk">
              <organization/>
            </author>
            <date year="2021"/>
          </front>
          <seriesInfo name="30th USENIX Security Symposium (USENIX Security 21)" value=""/>
        </reference>
        <reference anchor="Antipa2003">
          <front>
            <title>Validation of Elliptic Curve Public Keys</title>
            <author initials="A." surname="Antipa" fullname="Adrian Antipa">
              <organization/>
            </author>
            <author initials="D. R. L." surname="Brown" fullname="Daniel R. L. Brown">
              <organization/>
            </author>
            <author initials="A." surname="Menezes" fullname="Alfred Menezes">
              <organization/>
            </author>
            <author initials="R." surname="Struik" fullname="Rene Struik">
              <organization/>
            </author>
            <author initials="S. A." surname="Vanstone" fullname="Scott A. Vanstone">
              <organization/>
            </author>
            <date year="2003"/>
          </front>
          <seriesInfo name="Public Key Cryptography - PKC 2003" value=""/>
        </reference>
        <reference anchor="Jager2015">
          <front>
            <title>Practical Invalid Curve Attacks on TLS-ECDH</title>
            <author initials="T." surname="Jager" fullname="Tibor Jager">
              <organization/>
            </author>
            <author initials="J." surname="Schwenk" fullname="Jörg Schwenk">
              <organization/>
            </author>
            <author initials="J." surname="Somorovsky" fullname="Juraj Somorovsky">
              <organization/>
            </author>
            <date year="2015"/>
          </front>
          <seriesInfo name="European Symposium on Research in Computer Security (ESORICS) 2015" value=""/>
        </reference>
        <reference anchor="SAFECURVES" target="https://safecurves.cr.yp.to">
          <front>
            <title>SafeCurves: Choosing Safe Curves for Elliptic-Curve Cryptography</title>
            <author initials="D. J." surname="Bernstein" fullname="Daniel J. Bernstein">
              <organization/>
            </author>
            <author initials="T." surname="Lange" fullname="Tanja Lange">
              <organization/>
            </author>
            <date year="2014" month="December"/>
          </front>
        </reference>
        <reference anchor="Poddebniak2017" target="https://eprint.iacr.org/2017/1014.pdf">
          <front>
            <title>Attacking Deterministic Signature Schemes using Fault Attacks</title>
            <author initials="D." surname="Poddebniak" fullname="Damian Poddebniak">
              <organization/>
            </author>
            <author initials="J." surname="Somorovsky" fullname="Juraj Somorovsky">
              <organization/>
            </author>
            <author initials="S." surname="Schinzel" fullname="Sebastian Schinzel">
              <organization/>
            </author>
            <author initials="M." surname="Lochter" fullname="Manfred Lochter">
              <organization/>
            </author>
            <author initials="P." surname="Rösler" fullname="Paul Rösler">
              <organization/>
            </author>
            <date year="2017"/>
          </front>
        </reference>
        <reference anchor="Kim2014" target="https://users.ece.cmu.edu/~yoonguk/papers/kim-isca14.pdf">
          <front>
            <title>Flipping Bits in Memory Without Accessing Them: An Experimental Study of DRAM Disturbance Errors</title>
            <author initials="Y." surname="Kim" fullname="Yoongu Kim">
              <organization/>
            </author>
            <author initials="R." surname="Daly" fullname="Ross Daly">
              <organization/>
            </author>
            <author initials="J." surname="Kim" fullname="Jeremie Kim">
              <organization/>
            </author>
            <author initials="C." surname="Fallin" fullname="Chris Fallin">
              <organization/>
            </author>
            <author initials="J. H." surname="Lee" fullname="Ji Jye Lee">
              <organization/>
            </author>
            <author initials="D." surname="Lee" fullname="Donghyuk Lee">
              <organization/>
            </author>
            <author initials="C." surname="Wilkerson" fullname="Chris Wilkerson">
              <organization/>
            </author>
            <author initials="K." surname="Lai" fullname="Konrad Lai">
              <organization/>
            </author>
            <author initials="O." surname="Mutlu" fullname="Onur Mutlu">
              <organization/>
            </author>
            <date year="2014"/>
          </front>
        </reference>
        <reference anchor="RFC9051" target="https://www.rfc-editor.org/info/rfc9051">
          <front>
            <title>Internet Message Access Protocol (IMAP) - Version 4rev2</title>
            <author fullname="A. Melnikov" initials="A." role="editor" surname="Melnikov">
              <organization/>
            </author>
            <author fullname="B. Leiba" initials="B." role="editor" surname="Leiba">
              <organization/>
            </author>
            <date month="August" year="2021"/>
            <abstract>
              <t>The Internet Message Access Protocol Version 4rev2 (IMAP4rev2) allows a client to access and manipulate electronic mail messages on a server.  IMAP4rev2 permits manipulation of mailboxes (remote message folders) in a way that is functionally equivalent to local folders.  IMAP4rev2 also provides the capability for an offline client to resynchronize with the server. </t>
              <t>IMAP4rev2 includes operations for creating, deleting, and renaming mailboxes; checking for new messages; removing messages permanently; setting and clearing flags; parsing per RFCs 5322, 2045, and 2231; searching; and selective fetching of message attributes, texts, and portions thereof.  Messages in IMAP4rev2 are accessed by the use of numbers. These numbers are either message sequence numbers or unique identifiers. </t>
              <t>IMAP4rev2 does not specify a means of posting mail; this function is handled by a mail submission protocol such as the one specified in RFC 6409.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9051"/>
          <seriesInfo name="DOI" value="10.17487/RFC9051"/>
        </reference>
        <referencegroup anchor="STD53" target="https://www.rfc-editor.org/info/std53">
          <!-- reference.RFC.1939.xml -->
<reference anchor="RFC1939" target="https://www.rfc-editor.org/info/rfc1939">
            <front>
              <title>Post Office Protocol - Version 3</title>
              <author fullname="J. Myers" initials="J." surname="Myers">
                <organization/>
              </author>
              <author fullname="M. Rose" initials="M." surname="Rose">
                <organization/>
              </author>
              <date month="May" year="1996"/>
              <abstract>
                <t>The Post Office Protocol - Version 3 (POP3) is intended to permit a workstation to dynamically access a maildrop on a server host in a useful fashion.  [STANDARDS-TRACK]</t>
              </abstract>
            </front>
            <seriesInfo name="STD" value="53"/>
            <seriesInfo name="RFC" value="1939"/>
            <seriesInfo name="DOI" value="10.17487/RFC1939"/>
          </reference>
        </referencegroup>
        <reference anchor="RFC3261" target="https://www.rfc-editor.org/info/rfc3261">
          <front>
            <title>SIP: Session Initiation Protocol</title>
            <author fullname="J. Rosenberg" initials="J." surname="Rosenberg">
              <organization/>
            </author>
            <author fullname="H. Schulzrinne" initials="H." surname="Schulzrinne">
              <organization/>
            </author>
            <author fullname="G. Camarillo" initials="G." surname="Camarillo">
              <organization/>
            </author>
            <author fullname="A. Johnston" initials="A." surname="Johnston">
              <organization/>
            </author>
            <author fullname="J. Peterson" initials="J." surname="Peterson">
              <organization/>
            </author>
            <author fullname="R. Sparks" initials="R." surname="Sparks">
              <organization/>
            </author>
            <author fullname="M. Handley" initials="M." surname="Handley">
              <organization/>
            </author>
            <author fullname="E. Schooler" initials="E." surname="Schooler">
              <organization/>
            </author>
            <date month="June" year="2002"/>
            <abstract>
              <t>This document describes Session Initiation Protocol (SIP), an application-layer control (signaling) protocol for creating, modifying, and terminating sessions with one or more participants.  These sessions include Internet telephone calls, multimedia distribution, and multimedia conferences.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3261"/>
          <seriesInfo name="DOI" value="10.17487/RFC3261"/>
        </reference>
        <reference anchor="RFC5321" target="https://www.rfc-editor.org/info/rfc5321">
          <front>
            <title>Simple Mail Transfer Protocol</title>
            <author fullname="J. Klensin" initials="J." surname="Klensin">
              <organization/>
            </author>
            <date month="October" year="2008"/>
            <abstract>
              <t>This document is a specification of the basic protocol for Internet electronic mail transport.  It consolidates, updates, and clarifies several previous documents, making all or parts of most of them obsolete.  It covers the SMTP extension mechanisms and best practices for the contemporary Internet, but does not provide details about particular extensions.  Although SMTP was designed as a mail transport and delivery protocol, this specification also contains information that is important to its use as a "mail submission" protocol for "split-UA" (User Agent) mail reading systems and mobile environments.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5321"/>
          <seriesInfo name="DOI" value="10.17487/RFC5321"/>
        </reference>
        <reference anchor="RFC6120" target="https://www.rfc-editor.org/info/rfc6120">
          <front>
            <title>Extensible Messaging and Presence Protocol (XMPP): Core</title>
            <author fullname="P. Saint-Andre" initials="P." surname="Saint-Andre">
              <organization/>
            </author>
            <date month="March" year="2011"/>
            <abstract>
              <t>The Extensible Messaging and Presence Protocol (XMPP) is an application profile of the Extensible Markup Language (XML) that enables the near-real-time exchange of structured yet extensible data between any two or more network entities.  This document defines XMPP's core protocol methods: setup and teardown of XML streams, channel encryption, authentication, error handling, and communication primitives for messaging, network availability ("presence"), and request-response interactions.  This document obsoletes RFC 3920.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6120"/>
          <seriesInfo name="DOI" value="10.17487/RFC6120"/>
        </reference>
        <reference anchor="RFC9000" target="https://www.rfc-editor.org/info/rfc9000">
          <front>
            <title>QUIC: A UDP-Based Multiplexed and Secure Transport</title>
            <author fullname="J. Iyengar" initials="J." role="editor" surname="Iyengar">
              <organization/>
            </author>
            <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson">
              <organization/>
            </author>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document defines the core of the QUIC transport protocol.  QUIC provides applications with flow-controlled streams for structured communication, low-latency connection establishment, and network path migration. QUIC includes security measures that ensure confidentiality, integrity, and availability in a range of deployment circumstances.  Accompanying documents describe the integration of TLS for key negotiation, loss detection, and an exemplary congestion control algorithm.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9000"/>
          <seriesInfo name="DOI" value="10.17487/RFC9000"/>
        </reference>
        <reference anchor="RFC3602" target="https://www.rfc-editor.org/info/rfc3602">
          <front>
            <title>The AES-CBC Cipher Algorithm and Its Use with IPsec</title>
            <author fullname="S. Frankel" initials="S." surname="Frankel">
              <organization/>
            </author>
            <author fullname="R. Glenn" initials="R." surname="Glenn">
              <organization/>
            </author>
            <author fullname="S. Kelly" initials="S." surname="Kelly">
              <organization/>
            </author>
            <date month="September" year="2003"/>
            <abstract>
              <t>This document describes the use of the Advanced Encryption Standard (AES) Cipher Algorithm in Cipher Block Chaining (CBC) Mode, with an explicit Initialization Vector (IV), as a confidentiality mechanism within the context of the IPsec Encapsulating Security Payload (ESP).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3602"/>
          <seriesInfo name="DOI" value="10.17487/RFC3602"/>
        </reference>
        <reference anchor="RFC7457" target="https://www.rfc-editor.org/info/rfc7457">
          <front>
            <title>Summarizing Known Attacks on Transport Layer Security (TLS) and Datagram TLS (DTLS)</title>
            <author fullname="Y. Sheffer" initials="Y." surname="Sheffer">
              <organization/>
            </author>
            <author fullname="R. Holz" initials="R." surname="Holz">
              <organization/>
            </author>
            <author fullname="P. Saint-Andre" initials="P." surname="Saint-Andre">
              <organization/>
            </author>
            <date month="February" year="2015"/>
            <abstract>
              <t>Over the last few years, there have been several serious attacks on Transport Layer Security (TLS), including attacks on its most commonly used ciphers and modes of operation.  This document summarizes these attacks, with the goal of motivating generic and protocol-specific recommendations on the usage of TLS and Datagram TLS (DTLS).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7457"/>
          <seriesInfo name="DOI" value="10.17487/RFC7457"/>
        </reference>
        <reference anchor="RFC7525" target="https://www.rfc-editor.org/info/rfc7525">
          <front>
            <title>Recommendations for Secure Use of Transport Layer Security (TLS) and Datagram Transport Layer Security (DTLS)</title>
            <author fullname="Y. Sheffer" initials="Y." surname="Sheffer">
              <organization/>
            </author>
            <author fullname="R. Holz" initials="R." surname="Holz">
              <organization/>
            </author>
            <author fullname="P. Saint-Andre" initials="P." surname="Saint-Andre">
              <organization/>
            </author>
            <date month="May" year="2015"/>
            <abstract>
              <t>Transport Layer Security (TLS) and Datagram Transport Layer Security (DTLS) are widely used to protect data exchanged over application protocols such as HTTP, SMTP, IMAP, POP, SIP, and XMPP.  Over the last few years, several serious attacks on TLS have emerged, including attacks on its most commonly used cipher suites and their modes of operation.  This document provides recommendations for improving the security of deployed services that use TLS and DTLS. The recommendations are applicable to the majority of use cases.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="195"/>
          <seriesInfo name="RFC" value="7525"/>
          <seriesInfo name="DOI" value="10.17487/RFC7525"/>
        </reference>
        <reference anchor="RFC4949" target="https://www.rfc-editor.org/info/rfc4949">
          <front>
            <title>Internet Security Glossary, Version 2</title>
            <author fullname="R. Shirey" initials="R." surname="Shirey">
              <organization/>
            </author>
            <date month="August" year="2007"/>
            <abstract>
              <t>This Glossary provides definitions, abbreviations, and explanations of terminology for information system security. The 334 pages of entries offer recommendations to improve the comprehensibility of written material that is generated in the Internet Standards Process (RFC 2026). The recommendations follow the principles that such writing should (a) use the same term or definition whenever the same concept is mentioned; (b) use terms in their plainest, dictionary sense; (c) use terms that are already well-established in open publications; and (d) avoid terms that either favor a particular vendor or favor a particular technology or mechanism over other, competing techniques that already exist or could be developed.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="FYI" value="36"/>
          <seriesInfo name="RFC" value="4949"/>
          <seriesInfo name="DOI" value="10.17487/RFC4949"/>
        </reference>
        <reference anchor="RFC6101" target="https://www.rfc-editor.org/info/rfc6101">
          <front>
            <title>The Secure Sockets Layer (SSL) Protocol Version 3.0</title>
            <author fullname="A. Freier" initials="A." surname="Freier">
              <organization/>
            </author>
            <author fullname="P. Karlton" initials="P." surname="Karlton">
              <organization/>
            </author>
            <author fullname="P. Kocher" initials="P." surname="Kocher">
              <organization/>
            </author>
            <date month="August" year="2011"/>
            <abstract>
              <t>This document is published as a historical record of the SSL 3.0 protocol.  The original Abstract follows.</t>
              <t>This document specifies version 3.0 of the Secure Sockets Layer (SSL 3.0) protocol, a security protocol that provides communications privacy over the Internet.  The protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery.  This document defines a  Historic Document for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6101"/>
          <seriesInfo name="DOI" value="10.17487/RFC6101"/>
        </reference>
        <reference anchor="RFC2246" target="https://www.rfc-editor.org/info/rfc2246">
          <front>
            <title>The TLS Protocol Version 1.0</title>
            <author fullname="T. Dierks" initials="T." surname="Dierks">
              <organization/>
            </author>
            <author fullname="C. Allen" initials="C." surname="Allen">
              <organization/>
            </author>
            <date month="January" year="1999"/>
            <abstract>
              <t>This document specifies Version 1.0 of the Transport Layer Security (TLS) protocol. The TLS protocol provides communications privacy over the Internet. The protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2246"/>
          <seriesInfo name="DOI" value="10.17487/RFC2246"/>
        </reference>
        <reference anchor="RFC4346" target="https://www.rfc-editor.org/info/rfc4346">
          <front>
            <title>The Transport Layer Security (TLS) Protocol Version 1.1</title>
            <author fullname="T. Dierks" initials="T." surname="Dierks">
              <organization/>
            </author>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla">
              <organization/>
            </author>
            <date month="April" year="2006"/>
            <abstract>
              <t>This document specifies Version 1.1 of the Transport Layer Security (TLS) protocol.  The TLS protocol provides communications security over the Internet.  The protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4346"/>
          <seriesInfo name="DOI" value="10.17487/RFC4346"/>
        </reference>
        <reference anchor="RFC4347" target="https://www.rfc-editor.org/info/rfc4347">
          <front>
            <title>Datagram Transport Layer Security</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla">
              <organization/>
            </author>
            <author fullname="N. Modadugu" initials="N." surname="Modadugu">
              <organization/>
            </author>
            <date month="April" year="2006"/>
            <abstract>
              <t>This document specifies Version 1.0 of the Datagram Transport Layer Security (DTLS) protocol.  The DTLS protocol provides communications privacy for datagram protocols.  The protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery.  The DTLS protocol is based on the Transport Layer Security (TLS) protocol and provides equivalent security guarantees.  Datagram semantics of the underlying transport are preserved by the DTLS protocol.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4347"/>
          <seriesInfo name="DOI" value="10.17487/RFC4347"/>
        </reference>
        <reference anchor="RFC7507" target="https://www.rfc-editor.org/info/rfc7507">
          <front>
            <title>TLS Fallback Signaling Cipher Suite Value (SCSV) for Preventing Protocol Downgrade Attacks</title>
            <author fullname="B. Moeller" initials="B." surname="Moeller">
              <organization/>
            </author>
            <author fullname="A. Langley" initials="A." surname="Langley">
              <organization/>
            </author>
            <date month="April" year="2015"/>
            <abstract>
              <t>This document defines a Signaling Cipher Suite Value (SCSV) that prevents protocol downgrade attacks on the Transport Layer Security (TLS) and Datagram Transport Layer Security (DTLS) protocols.  It updates RFCs 2246, 4346, 4347, 5246, and 6347.  Server update considerations are included.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7507"/>
          <seriesInfo name="DOI" value="10.17487/RFC7507"/>
        </reference>
        <reference anchor="RFC6797" target="https://www.rfc-editor.org/info/rfc6797">
          <front>
            <title>HTTP Strict Transport Security (HSTS)</title>
            <author fullname="J. Hodges" initials="J." surname="Hodges">
              <organization/>
            </author>
            <author fullname="C. Jackson" initials="C." surname="Jackson">
              <organization/>
            </author>
            <author fullname="A. Barth" initials="A." surname="Barth">
              <organization/>
            </author>
            <date month="November" year="2012"/>
            <abstract>
              <t>This specification defines a mechanism enabling web sites to declare themselves accessible only via secure connections and/or for users to be able to direct their user agent(s) to interact with given sites only over secure connections.  This overall policy is referred to as HTTP Strict Transport Security (HSTS).  The policy is declared by web sites via the Strict-Transport-Security HTTP response header field and/or by other means, such as user agent configuration, for example. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6797"/>
          <seriesInfo name="DOI" value="10.17487/RFC6797"/>
        </reference>
        <reference anchor="RFC8461" target="https://www.rfc-editor.org/info/rfc8461">
          <front>
            <title>SMTP MTA Strict Transport Security (MTA-STS)</title>
            <author fullname="D. Margolis" initials="D." surname="Margolis">
              <organization/>
            </author>
            <author fullname="M. Risher" initials="M." surname="Risher">
              <organization/>
            </author>
            <author fullname="B. Ramakrishnan" initials="B." surname="Ramakrishnan">
              <organization/>
            </author>
            <author fullname="A. Brotman" initials="A." surname="Brotman">
              <organization/>
            </author>
            <author fullname="J. Jones" initials="J." surname="Jones">
              <organization/>
            </author>
            <date month="September" year="2018"/>
            <abstract>
              <t>SMTP MTA Strict Transport Security (MTA-STS) is a mechanism enabling mail service providers (SPs) to declare their ability to receive Transport Layer Security (TLS) secure SMTP connections and to specify whether sending SMTP servers should refuse to deliver to MX hosts that do not offer TLS with a trusted server certificate.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8461"/>
          <seriesInfo name="DOI" value="10.17487/RFC8461"/>
        </reference>
        <reference anchor="RFC6698" target="https://www.rfc-editor.org/info/rfc6698">
          <front>
            <title>The DNS-Based Authentication of Named Entities (DANE) Transport Layer Security (TLS) Protocol: TLSA</title>
            <author fullname="P. Hoffman" initials="P." surname="Hoffman">
              <organization/>
            </author>
            <author fullname="J. Schlyter" initials="J." surname="Schlyter">
              <organization/>
            </author>
            <date month="August" year="2012"/>
            <abstract>
              <t>Encrypted communication on the Internet often uses Transport Layer Security (TLS), which depends on third parties to certify the keys used.  This document improves on that situation by enabling the administrators of domain names to specify the keys used in that domain's TLS servers.  This requires matching improvements in TLS client software, but no change in TLS server software.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6698"/>
          <seriesInfo name="DOI" value="10.17487/RFC6698"/>
        </reference>
        <reference anchor="RFC7672" target="https://www.rfc-editor.org/info/rfc7672">
          <front>
            <title>SMTP Security via Opportunistic DNS-Based Authentication of Named Entities (DANE) Transport Layer Security (TLS)</title>
            <author fullname="V. Dukhovni" initials="V." surname="Dukhovni">
              <organization/>
            </author>
            <author fullname="W. Hardaker" initials="W." surname="Hardaker">
              <organization/>
            </author>
            <date month="October" year="2015"/>
            <abstract>
              <t>This memo describes a downgrade-resistant protocol for SMTP transport security between Message Transfer Agents (MTAs), based on the DNS-Based Authentication of Named Entities (DANE) TLSA DNS record. Adoption of this protocol enables an incremental transition of the Internet email backbone to one using encrypted and authenticated Transport Layer Security (TLS).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7672"/>
          <seriesInfo name="DOI" value="10.17487/RFC7672"/>
        </reference>
        <reference anchor="RFC7712" target="https://www.rfc-editor.org/info/rfc7712">
          <front>
            <title>Domain Name Associations (DNA) in the Extensible Messaging and Presence Protocol (XMPP)</title>
            <author fullname="P. Saint-Andre" initials="P." surname="Saint-Andre">
              <organization/>
            </author>
            <author fullname="M. Miller" initials="M." surname="Miller">
              <organization/>
            </author>
            <author fullname="P. Hancke" initials="P." surname="Hancke">
              <organization/>
            </author>
            <date month="November" year="2015"/>
            <abstract>
              <t>This document improves the security of the Extensible Messaging and Presence Protocol (XMPP) in two ways.  First, it specifies how to establish a strong association between a domain name and an XML stream, using the concept of "prooftypes".  Second, it describes how to securely delegate a service domain name (e.g., example.com) to a target server hostname (e.g., hosting.example.net); this is especially important in multi-tenanted environments where the same target server hosts a large number of domains.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7712"/>
          <seriesInfo name="DOI" value="10.17487/RFC7712"/>
        </reference>
        <reference anchor="RFC8879" target="https://www.rfc-editor.org/info/rfc8879">
          <front>
            <title>TLS Certificate Compression</title>
            <author fullname="A. Ghedini" initials="A." surname="Ghedini">
              <organization/>
            </author>
            <author fullname="V. Vasiliev" initials="V." surname="Vasiliev">
              <organization/>
            </author>
            <date month="December" year="2020"/>
            <abstract>
              <t>In TLS handshakes, certificate chains often take up the majority of the bytes transmitted.</t>
              <t>This document describes how certificate chains can be compressed to reduce the amount of data transmitted and avoid some round trips.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8879"/>
          <seriesInfo name="DOI" value="10.17487/RFC8879"/>
        </reference>
        <reference anchor="RFC7924" target="https://www.rfc-editor.org/info/rfc7924">
          <front>
            <title>Transport Layer Security (TLS) Cached Information Extension</title>
            <author fullname="S. Santesson" initials="S." surname="Santesson">
              <organization/>
            </author>
            <author fullname="H. Tschofenig" initials="H." surname="Tschofenig">
              <organization/>
            </author>
            <date month="July" year="2016"/>
            <abstract>
              <t>Transport Layer Security (TLS) handshakes often include fairly static information, such as the server certificate and a list of trusted certification authorities (CAs).  This information can be of considerable size, particularly if the server certificate is bundled with a complete certificate chain (i.e., the certificates of intermediate CAs up to the root CA).</t>
              <t>This document defines an extension that allows a TLS client to inform a server of cached information, thereby enabling the server to omit already available information.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7924"/>
          <seriesInfo name="DOI" value="10.17487/RFC7924"/>
        </reference>
        <reference anchor="RFC5077" target="https://www.rfc-editor.org/info/rfc5077">
          <front>
            <title>Transport Layer Security (TLS) Session Resumption without Server-Side State</title>
            <author fullname="J. Salowey" initials="J." surname="Salowey">
              <organization/>
            </author>
            <author fullname="H. Zhou" initials="H." surname="Zhou">
              <organization/>
            </author>
            <author fullname="P. Eronen" initials="P." surname="Eronen">
              <organization/>
            </author>
            <author fullname="H. Tschofenig" initials="H." surname="Tschofenig">
              <organization/>
            </author>
            <date month="January" year="2008"/>
            <abstract>
              <t>This document describes a mechanism that enables the Transport Layer Security (TLS) server to resume sessions and avoid keeping per-client session state.  The TLS server encapsulates the session state into a ticket and forwards it to the client.  The client can subsequently resume a session using the obtained ticket.  This document obsoletes RFC 4507.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5077"/>
          <seriesInfo name="DOI" value="10.17487/RFC5077"/>
        </reference>
        <reference anchor="I-D.ietf-tls-esni" target="https://www.ietf.org/archive/id/draft-ietf-tls-esni-14.txt">
          <front>
            <title>TLS Encrypted Client Hello</title>
            <author fullname="Eric Rescorla">
              <organization>RTFM, Inc.</organization>
            </author>
            <author fullname="Kazuho Oku">
              <organization>Fastly</organization>
            </author>
            <author fullname="Nick Sullivan">
              <organization>Cloudflare</organization>
            </author>
            <author fullname="Christopher A. Wood">
              <organization>Cloudflare</organization>
            </author>
            <date day="13" month="February" year="2022"/>
            <abstract>
              <t>   This document describes a mechanism in Transport Layer Security (TLS)
   for encrypting a ClientHello message under a server public key.

Discussion Venues

   This note is to be removed before publishing as an RFC.

   Source for this draft and an issue tracker can be found at
   https://github.com/tlswg/draft-ietf-tls-esni
   (https://github.com/tlswg/draft-ietf-tls-esni).

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-tls-esni-14"/>
        </reference>
        <reference anchor="RFC8470" target="https://www.rfc-editor.org/info/rfc8470">
          <front>
            <title>Using Early Data in HTTP</title>
            <author fullname="M. Thomson" initials="M." surname="Thomson">
              <organization/>
            </author>
            <author fullname="M. Nottingham" initials="M." surname="Nottingham">
              <organization/>
            </author>
            <author fullname="W. Tarreau" initials="W." surname="Tarreau">
              <organization/>
            </author>
            <date month="September" year="2018"/>
            <abstract>
              <t>Using TLS early data creates an exposure to the possibility of a replay attack.  This document defines mechanisms that allow clients to communicate with servers about HTTP requests that are sent in early data.  Techniques are described that use these mechanisms to mitigate the risk of replay.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8470"/>
          <seriesInfo name="DOI" value="10.17487/RFC8470"/>
        </reference>
        <reference anchor="RFC9001" target="https://www.rfc-editor.org/info/rfc9001">
          <front>
            <title>Using TLS to Secure QUIC</title>
            <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson">
              <organization/>
            </author>
            <author fullname="S. Turner" initials="S." role="editor" surname="Turner">
              <organization/>
            </author>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document describes how Transport Layer Security (TLS) is used to secure QUIC.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9001"/>
          <seriesInfo name="DOI" value="10.17487/RFC9001"/>
        </reference>
        <reference anchor="RFC7919" target="https://www.rfc-editor.org/info/rfc7919">
          <front>
            <title>Negotiated Finite Field Diffie-Hellman Ephemeral Parameters for Transport Layer Security (TLS)</title>
            <author fullname="D. Gillmor" initials="D." surname="Gillmor">
              <organization/>
            </author>
            <date month="August" year="2016"/>
            <abstract>
              <t>Traditional finite-field-based Diffie-Hellman (DH) key exchange during the Transport Layer Security (TLS) handshake suffers from a number of security, interoperability, and efficiency shortcomings. These shortcomings arise from lack of clarity about which DH group parameters TLS servers should offer and clients should accept.  This document offers a solution to these shortcomings for compatible peers by using a section of the TLS "Supported Groups Registry" (renamed from "EC Named Curve Registry" by this document) to establish common finite field DH parameters with known structure and a mechanism for peers to negotiate support for these groups.</t>
              <t>This document updates TLS versions 1.0 (RFC 2246), 1.1 (RFC 4346), and 1.2 (RFC 5246), as well as the TLS Elliptic Curve Cryptography (ECC) extensions (RFC 4492).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7919"/>
          <seriesInfo name="DOI" value="10.17487/RFC7919"/>
        </reference>
        <reference anchor="RFC5116" target="https://www.rfc-editor.org/info/rfc5116">
          <front>
            <title>An Interface and Algorithms for Authenticated Encryption</title>
            <author fullname="D. McGrew" initials="D." surname="McGrew">
              <organization/>
            </author>
            <date month="January" year="2008"/>
            <abstract>
              <t>This document defines algorithms for Authenticated Encryption with Associated Data (AEAD), and defines a uniform interface and a registry for such algorithms.  The interface and registry can be used as an application-independent set of cryptoalgorithm suites.  This approach provides advantages in efficiency and security, and promotes the reuse of crypto implementations.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5116"/>
          <seriesInfo name="DOI" value="10.17487/RFC5116"/>
        </reference>
        <reference anchor="I-D.mattsson-cfrg-det-sigs-with-noise" target="https://www.ietf.org/archive/id/draft-mattsson-cfrg-det-sigs-with-noise-04.txt">
          <front>
            <title>Deterministic ECDSA and EdDSA Signatures with Additional Randomness</title>
            <author fullname="John Preuß Mattsson">
              <organization>Ericsson</organization>
            </author>
            <author fullname="Erik Thormarker">
              <organization>Ericsson</organization>
            </author>
            <author fullname="Sini Ruohomaa">
              <organization>Ericsson</organization>
            </author>
            <date day="15" month="February" year="2022"/>
            <abstract>
              <t>   Deterministic elliptic-curve signatures such as deterministic ECDSA
   and EdDSA have gained popularity over randomized ECDSA as their
   security do not depend on a source of high-quality randomness.
   Recent research has however found that implementations of these
   signature algorithms may be vulnerable to certain side-channel and
   fault injection attacks due to their determinism.  One countermeasure
   to such attacks is to re-add randomness to the otherwise
   deterministic calculation of the per-message secret number.  This
   document updates RFC 6979 and RFC 8032 to recommend constructions
   with additional randomness for deployments where side-channel attacks
   and fault injection attacks are a concern.  The updates are invisible
   to the validator of the signature and compatible with existing ECDSA
   and EdDSA validators.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-mattsson-cfrg-det-sigs-with-noise-04"/>
        </reference>
        <reference anchor="I-D.irtf-cfrg-aead-limits" target="https://www.ietf.org/archive/id/draft-irtf-cfrg-aead-limits-04.txt">
          <front>
            <title>Usage Limits on AEAD Algorithms</title>
            <author fullname="Felix Günther">
              <organization>ETH Zurich</organization>
            </author>
            <author fullname="Martin Thomson">
              <organization>Mozilla</organization>
            </author>
            <author fullname="Christopher A. Wood">
              <organization>Cloudflare</organization>
            </author>
            <date day="7" month="March" year="2022"/>
            <abstract>
              <t>   An Authenticated Encryption with Associated Data (AEAD) algorithm
   provides confidentiality and integrity.  Excessive use of the same
   key can give an attacker advantages in breaking these properties.
   This document provides simple guidance for users of common AEAD
   functions about how to limit the use of keys in order to bound the
   advantage given to an attacker.  It considers limits in both single-
   and multi-key settings.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-irtf-cfrg-aead-limits-04"/>
        </reference>
        <reference anchor="RFC7590" target="https://www.rfc-editor.org/info/rfc7590">
          <front>
            <title>Use of Transport Layer Security (TLS) in the Extensible Messaging and Presence Protocol (XMPP)</title>
            <author fullname="P. Saint-Andre" initials="P." surname="Saint-Andre">
              <organization/>
            </author>
            <author fullname="T. Alkemade" initials="T." surname="Alkemade">
              <organization/>
            </author>
            <date month="June" year="2015"/>
            <abstract>
              <t>This document provides recommendations for the use of Transport Layer Security (TLS) in the Extensible Messaging and Presence Protocol (XMPP).  This document updates RFC 6120.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7590"/>
          <seriesInfo name="DOI" value="10.17487/RFC7590"/>
        </reference>
        <reference anchor="RFC2026" target="https://www.rfc-editor.org/info/rfc2026">
          <front>
            <title>The Internet Standards Process -- Revision 3</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner">
              <organization/>
            </author>
            <date month="October" year="1996"/>
            <abstract>
              <t>This memo documents the process used by the Internet community for the standardization of protocols and procedures.  It defines the stages in the standardization process, the requirements for moving a document between stages and the types of documents used during this process. 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="9"/>
          <seriesInfo name="RFC" value="2026"/>
          <seriesInfo name="DOI" value="10.17487/RFC2026"/>
        </reference>
        <reference anchor="RFC7228" target="https://www.rfc-editor.org/info/rfc7228">
          <front>
            <title>Terminology for Constrained-Node Networks</title>
            <author fullname="C. Bormann" initials="C." surname="Bormann">
              <organization/>
            </author>
            <author fullname="M. Ersue" initials="M." surname="Ersue">
              <organization/>
            </author>
            <author fullname="A. Keranen" initials="A." surname="Keranen">
              <organization/>
            </author>
            <date month="May" year="2014"/>
            <abstract>
              <t>The Internet Protocol Suite is increasingly used on small devices with severe constraints on power, memory, and processing resources, creating constrained-node networks.  This document provides a number of basic terms that have been useful in the standardization work for constrained-node networks.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7228"/>
          <seriesInfo name="DOI" value="10.17487/RFC7228"/>
        </reference>
        <reference anchor="RFC7925" target="https://www.rfc-editor.org/info/rfc7925">
          <front>
            <title>Transport Layer Security (TLS) / Datagram Transport Layer Security (DTLS) Profiles for the Internet of Things</title>
            <author fullname="H. Tschofenig" initials="H." role="editor" surname="Tschofenig">
              <organization/>
            </author>
            <author fullname="T. Fossati" initials="T." surname="Fossati">
              <organization/>
            </author>
            <date month="July" year="2016"/>
            <abstract>
              <t>A common design pattern in Internet of Things (IoT) deployments is the use of a constrained device that collects data via sensors or controls actuators for use in home automation, industrial control systems, smart cities, and other IoT deployments.</t>
              <t>This document defines a Transport Layer Security (TLS) and Datagram Transport Layer Security (DTLS) 1.2 profile that offers communications security for this data exchange thereby preventing eavesdropping, tampering, and message forgery.  The lack of communication security is a common vulnerability in IoT products that can easily be solved by using these well-researched and widely deployed Internet security protocols.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7925"/>
          <seriesInfo name="DOI" value="10.17487/RFC7925"/>
        </reference>
        <reference anchor="I-D.ietf-uta-tls13-iot-profile" target="https://www.ietf.org/archive/id/draft-ietf-uta-tls13-iot-profile-04.txt">
          <front>
            <title>TLS/DTLS 1.3 Profiles for the Internet of Things</title>
            <author fullname="Hannes Tschofenig">
              <organization>Arm Limited</organization>
            </author>
            <author fullname="Thomas Fossati">
              <organization>Arm Limited</organization>
            </author>
            <date day="7" month="March" year="2022"/>
            <abstract>
              <t>   This document is a companion to RFC 7925 and defines TLS/DTLS 1.3
   profiles for Internet of Things devices.  It also updates RFC 7925
   with regards to the X.509 certificate profile.

Discussion Venues

   This note is to be removed before publishing as an RFC.

   Source for this draft and an issue tracker can be found at
   https://github.com/thomas-fossati/draft-tls13-iot.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-uta-tls13-iot-profile-04"/>
        </reference>
        <reference anchor="RFC7435" target="https://www.rfc-editor.org/info/rfc7435">
          <front>
            <title>Opportunistic Security: Some Protection Most of the Time</title>
            <author fullname="V. Dukhovni" initials="V." surname="Dukhovni">
              <organization/>
            </author>
            <date month="December" year="2014"/>
            <abstract>
              <t>This document defines the concept "Opportunistic Security" in the context of communications protocols.  Protocol designs based on Opportunistic Security use encryption even when authentication is not available, and use authentication when possible, thereby removing barriers to the widespread use of encryption on the Internet.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7435"/>
          <seriesInfo name="DOI" value="10.17487/RFC7435"/>
        </reference>
        <reference anchor="RFC5280" target="https://www.rfc-editor.org/info/rfc5280">
          <front>
            <title>Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile</title>
            <author fullname="D. Cooper" initials="D." surname="Cooper">
              <organization/>
            </author>
            <author fullname="S. Santesson" initials="S." surname="Santesson">
              <organization/>
            </author>
            <author fullname="S. Farrell" initials="S." surname="Farrell">
              <organization/>
            </author>
            <author fullname="S. Boeyen" initials="S." surname="Boeyen">
              <organization/>
            </author>
            <author fullname="R. Housley" initials="R." surname="Housley">
              <organization/>
            </author>
            <author fullname="W. Polk" initials="W." surname="Polk">
              <organization/>
            </author>
            <date month="May" year="2008"/>
            <abstract>
              <t>This memo profiles the X.509 v3 certificate and X.509 v2 certificate revocation list (CRL) for use in the Internet.  An overview of this approach and model is provided as an introduction.  The X.509 v3 certificate format is described in detail, with additional information regarding the format and semantics of Internet name forms.  Standard certificate extensions are described and two Internet-specific extensions are defined.  A set of required certificate extensions is specified.  The X.509 v2 CRL format is described in detail along with standard and Internet-specific extensions.  An algorithm for X.509 certification path validation is described.  An ASN.1 module and examples are provided in the appendices.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5280"/>
          <seriesInfo name="DOI" value="10.17487/RFC5280"/>
        </reference>
        <reference anchor="RFC8452" target="https://www.rfc-editor.org/info/rfc8452">
          <front>
            <title>AES-GCM-SIV: Nonce Misuse-Resistant Authenticated Encryption</title>
            <author fullname="S. Gueron" initials="S." surname="Gueron">
              <organization/>
            </author>
            <author fullname="A. Langley" initials="A." surname="Langley">
              <organization/>
            </author>
            <author fullname="Y. Lindell" initials="Y." surname="Lindell">
              <organization/>
            </author>
            <date month="April" year="2019"/>
            <abstract>
              <t>This memo specifies two authenticated encryption algorithms that are nonce misuse resistant -- that is, they do not fail catastrophically if a nonce is repeated.</t>
              <t>This document is the product of the Crypto Forum Research Group.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8452"/>
          <seriesInfo name="DOI" value="10.17487/RFC8452"/>
        </reference>
        <reference anchor="RFC9162" target="https://www.rfc-editor.org/info/rfc9162">
          <front>
            <title>Certificate Transparency Version 2.0</title>
            <author fullname="B. Laurie" initials="B." surname="Laurie">
              <organization/>
            </author>
            <author fullname="E. Messeri" initials="E." surname="Messeri">
              <organization/>
            </author>
            <author fullname="R. Stradling" initials="R." surname="Stradling">
              <organization/>
            </author>
            <date month="December" year="2021"/>
            <abstract>
              <t>This document describes version 2.0 of the Certificate Transparency (CT) protocol for publicly logging the existence of Transport Layer Security (TLS) server certificates as they are issued or observed, in a manner that allows anyone to audit certification authority (CA) activity and notice the issuance of suspect certificates as well as to audit the certificate logs themselves. The intent is that eventually clients would refuse to honor certificates that do not appear in a log, effectively forcing CAs to add all issued certificates to the logs.</t>
              <t>This document obsoletes RFC 6962.  It also specifies a new TLS extension that is used to send various CT log artifacts.</t>
              <t>Logs are network services that implement the protocol operations for submissions and queries that are defined in this document.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9162"/>
          <seriesInfo name="DOI" value="10.17487/RFC9162"/>
        </reference>
        <reference anchor="RFC6960" target="https://www.rfc-editor.org/info/rfc6960">
          <front>
            <title>X.509 Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP</title>
            <author fullname="S. Santesson" initials="S." surname="Santesson">
              <organization/>
            </author>
            <author fullname="M. Myers" initials="M." surname="Myers">
              <organization/>
            </author>
            <author fullname="R. Ankney" initials="R." surname="Ankney">
              <organization/>
            </author>
            <author fullname="A. Malpani" initials="A." surname="Malpani">
              <organization/>
            </author>
            <author fullname="S. Galperin" initials="S." surname="Galperin">
              <organization/>
            </author>
            <author fullname="C. Adams" initials="C." surname="Adams">
              <organization/>
            </author>
            <date month="June" year="2013"/>
            <abstract>
              <t>This document specifies a protocol useful in determining the current status of a digital certificate without requiring Certificate Revocation Lists (CRLs). Additional mechanisms addressing PKIX operational requirements are specified in separate documents.  This document obsoletes RFCs 2560 and 6277.  It also updates RFC 5912.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6960"/>
          <seriesInfo name="DOI" value="10.17487/RFC6960"/>
        </reference>
        <reference anchor="RFC7633" target="https://www.rfc-editor.org/info/rfc7633">
          <front>
            <title>X.509v3 Transport Layer Security (TLS) Feature Extension</title>
            <author fullname="P. Hallam-Baker" initials="P." surname="Hallam-Baker">
              <organization/>
            </author>
            <date month="October" year="2015"/>
            <abstract>
              <t>The purpose of the TLS feature extension is to prevent downgrade attacks that are not otherwise prevented by the TLS protocol.  In particular, the TLS feature extension may be used to mandate support for revocation checking features in the TLS protocol such as Online Certificate Status Protocol (OCSP) stapling.  Informing clients that an OCSP status response will always be stapled permits an immediate failure in the case that the response is not stapled.  This in turn prevents a denial-of-service attack that might otherwise be possible.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7633"/>
          <seriesInfo name="DOI" value="10.17487/RFC7633"/>
        </reference>
        <reference anchor="RFC6961" target="https://www.rfc-editor.org/info/rfc6961">
          <front>
            <title>The Transport Layer Security (TLS) Multiple Certificate Status Request Extension</title>
            <author fullname="Y. Pettersen" initials="Y." surname="Pettersen">
              <organization/>
            </author>
            <date month="June" year="2013"/>
            <abstract>
              <t>This document defines the Transport Layer Security (TLS) Certificate Status Version 2 Extension to allow clients to specify and support several certificate status methods.  (The use of the Certificate Status extension is commonly referred to as "OCSP stapling".)  Also defined is a new method based on the Online Certificate Status Protocol (OCSP) that servers can use to provide status information about not only the server's own certificate but also the status of intermediate certificates in the chain.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6961"/>
          <seriesInfo name="DOI" value="10.17487/RFC6961"/>
        </reference>
      </references>
    </references>
    <section anchor="diff-rfc">
      <name>Differences from RFC 7525</name>
      <t>This revision of the Best Current Practices contains numerous changes, and this section is focused
on the normative changes.</t>
      <ul spacing="normal">
        <li>
          <t>High level differences:
          </t>
          <ul spacing="normal">
            <li>Clarified items (e.g. renegotiation) that only apply to TLS 1.2.</li>
            <li>Changed status of TLS 1.0 and 1.1 from <bcp14>SHOULD NOT</bcp14> to <bcp14>MUST NOT</bcp14>.</li>
            <li>Added TLS 1.3 at a <bcp14>SHOULD</bcp14> level.</li>
            <li>Similar changes to DTLS.</li>
            <li>Specific guidance for multiplexed protocols.</li>
            <li>
              <bcp14>MUST</bcp14>-level implementation requirement for ALPN, and more specific <bcp14>SHOULD</bcp14>-level guidance for ALPN and SNI.</li>
            <li>Clarified discussion of strict TLS policies, including <bcp14>MUST</bcp14>-level recommendations.</li>
            <li>Limits on key usage.</li>
            <li>New attacks since <xref target="RFC7457"/>: ALPACA, Raccoon, Logjam, "Nonce-Disrespecting Adversaries".</li>
            <li>RFC 6961 (OCSP status_request_v2) has been deprecated.</li>
            <li>
              <bcp14>MUST</bcp14>-level requirement for server-side RSA certificates to have 2048-bit modulus at a minimum, replacing a <bcp14>SHOULD</bcp14>.</li>
          </ul>
        </li>
        <li>
          <t>Differences specific to TLS 1.2:
          </t>
          <ul spacing="normal">
            <li>
              <bcp14>SHOULD</bcp14>-level guidance on AES-GCM nonce generation.</li>
            <li>
              <bcp14>SHOULD NOT</bcp14> use (static or ephemeral) finite-field DH key agreement.</li>
            <li>
              <bcp14>SHOULD NOT</bcp14> reuse ephemeral finite-field DH keys across multiple connections.</li>
            <li>2048-bit DH now a <bcp14>MUST</bcp14>, ECDH minimal curve size is 224, vs. 192 previously.</li>
            <li>Support for <tt>extended_master_secret</tt> is now a <bcp14>MUST</bcp14> (previously it was a soft recommendation, as the RFC had not been published at the time). Also removed other, more complicated, related mitigations.</li>
            <li>
              <bcp14>MUST</bcp14>-level restriction on session ticket validity, replacing a <bcp14>SHOULD</bcp14>.</li>
            <li>
              <bcp14>SHOULD</bcp14>-level restriction on the TLS session duration, depending on the rotation period of an <xref target="RFC5077"/> ticket key.</li>
            <li>Drop TLS_DHE_RSA_WITH_AES from the recommended ciphers</li>
            <li>Add TLS_ECDHE_ECDSA_WITH_AES to the recommended ciphers</li>
            <li>
              <bcp14>SHOULD NOT</bcp14> use the old MTI cipher suite, TLS_RSA_WITH_AES_128_CBC_SHA.</li>
            <li>Recommend curve X25519 alongside NIST P-256</li>
          </ul>
        </li>
        <li>
          <t>Differences specific to TLS 1.3:
          </t>
          <ul spacing="normal">
            <li>New TLS 1.3 capabilities: 0-RTT.</li>
            <li>Removed capabilities: renegotiation, compression.</li>
            <li>Added mention of TLS Encrypted Client Hello, but no recommendation to use until it is finalized.</li>
            <li>
              <bcp14>SHOULD</bcp14>-level requirement for forward secrecy in TLS 1.3 session resumption.</li>
            <li>Generic <bcp14>SHOULD</bcp14>-level guidance to avoid 0-RTT unless it is documented for the particular protocol.</li>
          </ul>
        </li>
      </ul>
    </section>
    <section anchor="document-history">
      <name>Document History</name>
      <t><cref>Note to RFC Editor: please remove before publication.</cref></t>
      <section anchor="draft-ietf-uta-rfc7525bis-09">
        <name>draft-ietf-uta-rfc7525bis-09</name>
        <ul spacing="normal">
          <li>More background on strict TLS for non-HTTP protocols.</li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-08">
        <name>draft-ietf-uta-rfc7525bis-08</name>
        <ul spacing="normal">
          <li>Addressed SecDir review by Ben Kaduk.</li>
          <li>Addressed reviews by Stephen Farrell, Martin Thomson, Tim Evans and John Mattsson.</li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-07">
        <name>draft-ietf-uta-rfc7525bis-07</name>
        <ul spacing="normal">
          <li>Addressed AD reviews by Francesca and Paul.</li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-06">
        <name>draft-ietf-uta-rfc7525bis-06</name>
        <ul spacing="normal">
          <li>Addressed several I-D nits raised by the document shepherd.</li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-05">
        <name>draft-ietf-uta-rfc7525bis-05</name>
        <ul spacing="normal">
          <li>
            <t>Addressed WG Last Call comments, specifically:
            </t>
            <ul spacing="normal">
              <li>More clarity and guidance on session resumption.</li>
              <li>Clarity on TLS 1.2 renegotiation.</li>
              <li>Wording on the 0-RTT feature aligned with RFC 8446.</li>
              <li>
                <bcp14>SHOULD NOT</bcp14> guidance on static and ephemeral finite field DH cipher suites.</li>
              <li>Revamped the recommended TLS 1.2 cipher suites, removing DHE and adding ECDSA. The latter due to the wide adoption of ECDSA certificates and in line with RFC 8446.</li>
              <li>Recommendation to use deterministic ECDSA.</li>
              <li>Finally deprecated the old TLS 1.2 MTI cipher suite.</li>
              <li>Deeper discussion of ECDH public key reuse issues, and as a result, recommended support of X25519.</li>
              <li>Reworded the section on certificate revocation and OCSP following a long mailing list thread.</li>
            </ul>
          </li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-04">
        <name>draft-ietf-uta-rfc7525bis-04</name>
        <ul spacing="normal">
          <li>No version fallback from TLS 1.2 to earlier versions, therefore no SCSV.</li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-03">
        <name>draft-ietf-uta-rfc7525bis-03</name>
        <ul spacing="normal">
          <li>Cipher integrity and confidentiality limits.</li>
          <li>Require <tt>extended_master_secret</tt>.</li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-02">
        <name>draft-ietf-uta-rfc7525bis-02</name>
        <ul spacing="normal">
          <li>Adjusted text about ALPN support in application protocols</li>
          <li>Incorporated text from draft-ietf-tls-md5-sha1-deprecate</li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-01">
        <name>draft-ietf-uta-rfc7525bis-01</name>
        <ul spacing="normal">
          <li>
            <t>Many more changes, including:
            </t>
            <ul spacing="normal">
              <li>
                <bcp14>SHOULD</bcp14>-level requirement for forward secrecy in TLS 1.3 session resumption.</li>
              <li>Removed TLS 1.2 capabilities: renegotiation, compression.</li>
              <li>Specific guidance for multiplexed protocols.</li>
              <li>
                <bcp14>MUST</bcp14>-level implementation requirement for ALPN, and more specific <bcp14>SHOULD</bcp14>-level guidance for ALPN and SNI.</li>
              <li>Generic <bcp14>SHOULD</bcp14>-level guidance to avoid 0-RTT unless it is documented for the particular protocol.</li>
              <li>
                <bcp14>SHOULD</bcp14>-level guidance on AES-GCM nonce generation in TLS 1.2.</li>
              <li>
                <bcp14>SHOULD NOT</bcp14> use static DH keys or reuse ephemeral DH keys across multiple connections.</li>
              <li>2048-bit DH now a <bcp14>MUST</bcp14>, ECDH minimal curve size is 224, up from 192.</li>
            </ul>
          </li>
        </ul>
      </section>
      <section anchor="draft-ietf-uta-rfc7525bis-00">
        <name>draft-ietf-uta-rfc7525bis-00</name>
        <ul spacing="normal">
          <li>Renamed: WG document.</li>
          <li>Started populating list of changes from RFC 7525.</li>
          <li>General rewording of abstract and intro for revised version.</li>
          <li>Protocol versions, fallback.</li>
          <li>Reference to ECHO.</li>
        </ul>
      </section>
      <section anchor="draft-sheffer-uta-rfc7525bis-00">
        <name>draft-sheffer-uta-rfc7525bis-00</name>
        <ul spacing="normal">
          <li>Renamed, since the BCP number does not change.</li>
          <li>Added an empty "Differences from RFC 7525" section.</li>
        </ul>
      </section>
      <section anchor="draft-sheffer-uta-bcp195bis-00">
        <name>draft-sheffer-uta-bcp195bis-00</name>
        <ul spacing="normal">
          <li>Initial release, the RFC 7525 text as-is, with some minor editorial
changes to the references.</li>
        </ul>
      </section>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIABTKvWIAA8W9y3bbaJYuOMdToJSDkPKQtETdLGeeqpIlOawIy1aJCkdF
nXWWAyJBESEQYAGgZKZXnHWmPe4XqEE/Q416VPkm/SS9v733fwNB2xGVXZ2r
VoVFAP9136/9fj+KmqzJ0xfxTTou5/O0mCRNVhZ1PC2reJSOl1Ua/1CncTmN
b6ukqBdl1cRvklWqT7NmFW/fvhntxEkxic+TJrmvkvln3j3Hy1Fyd1eljy9i
+qM9czQpx0UypyVNqmTa9LO0mfaXTdKvpuPjw+HhXVb3d0+icdKk92W1ehHf
jRdReVeXedqk9YsY70TLBY2Gvw6Hz5/34qPdo6MoyhbVi7iplnUz3N092R1G
SZUmL+LTxSLPxjr5U1k93FflcvEi/uH2NP6R/syK+/hb/BRFdUNfzF/Elxe3
r6KHdEVvT+ivokmrIm3651hwNKZx0qJe1jxZiq/obD4keVnQplZpHS2yF1Ec
037SSd2scv01jpty7P0zKyZp0ZgfajrMKp3W9u/VPPizqbKxfVkOtLFPsyLP
CjdN+rHp51nd9GmQuzKn18r+H/+bfLdI3DD18s7+UpRRlCybWVnR2vv0EKPS
lz8N4tEsnU7Tin+Tm/spqcoi+L2s7pMi+wufMp/YMmv4QTpPspwmxBfTAS77
H+/x04BmDia6pomSrGj6p8WkSr3Jruneq7Vn4YQ4y0XKB+rPWjcLfPyP+t9B
Fk55O4hflXVNY3jT3c7KeVIHD8K5kmruz9Hw+4OpvP+P9JS3FhVlNacfHtMX
BJnF1Psrjs9my+J+7/mL+Pzd5WBvd7C3d3D4YX94/Pxwfzjg/x7s83s3b7Im
9V7bPXk2uh4Md/eOB3vHeONN2tQ36WP54L11cDwcPismdU0vDncHw4Pd5wd4
9zy9T+6qLM3T693jjkF3jwfP8R6B2iJP+zOC6nqWPHTOf0DT4N1ReT8rs6Sg
n/bse8O9/ZNndV0Vg73Dk73dfd7Lm/L+F+CWt+Vnw+d7u/R8QP/dP97lDV2/
e3f+5uIFn7CFR/pfH7dASDvqn13c3PJPIAEv4nfjprwjAMGi+Ocmqe5TguhZ
0yzqF8+ePT09DZZ1f5xWzeC+fHxWjJP6WZLTn/Wz29O9g/7wZPdUvhRSORq9
ifcHu/F1VRKalnn8fpkXaZXcZTlIHAihrDI+bZpk/MA3dfqy/zKpU8bDTYs/
O332siqfalrtq7Jazr1dfEPL3/9m4/rHyd0UXwxonGdEQJeM/oNZM8/9lZsV
EM3912VWpfwWk/pmlsaXdb1MinHKO7hKiuSeXwDtv17eEY3MV/1bkM90Ep/R
8WRTkM20jt+nVU2gH+8N9gZH2O3rtCCqmVa06GHXbhm73g7se/yzQbC3ySRL
wkf6xb8M4vMl7TIlWhd88i/JQ1a1nuk3F4P4R1oyHWvwxQW9FjzQ178bnNKy
knySEj4WwSffDeLTPP3YeuquZ/iNf9TfXGXYQPxTuazi65rP9J9ognMiNGMQ
Chzrj9kkrRfEUybxj2nyEH+frmpaR/w2bcCI6OXHbJzWMjCBRZbWIBUvdF3E
mIvso2Ouo9V8UdbZcm4XBAxc0T9DUvKMSMjB0ckBSMnB8S4j9fnp24v+6Or2
mkSBV2fHR8dDxjbaXVWXxc3IQ989ogTPTo6f9/f7RwfD/vBw//lhf/fDcNeN
c/PeDMO4/fr29pqAgwh//5xpfB/AC04+T4ks3tNBmdeGHS/hv0P6B975Pk+z
4hcij7Sr3U1L2js4Gu73jz/s8dYuT9+efiBJ4wX/a9DkdX+RkJQCks9jXi3z
hknaRTGuVgsh48F5HT4/OjkZ0H+O957H+OTt5eh2QKTu+e5u//Do1L5+tDt8
/qz1sOIzGC0q2maS53tHLSJ38vz44ICIHP77XA7x4rpPVOZxX07x8Ij38bJM
xw+07aONKPV6EL/8678TxfHh9nVSFKX3u75LcP4vybJoId8pc27vgb49GgAY
iXYEb4/SpPB/t0hEdH9eVuVj/bAKcWhZJb+0H/Ytg/+ufEyK8rGF3dczIqyL
ReupIt5VsgJpP+qmjSkOvRlkybhi0og3nx0cHw4Wk2mArW9LInz986yuCCGB
oIS6p5NHApAEWEeLqEgMInqXgzQTXVopca9jOq9vz66AtgRjjHLflcuPxC43
39PpgN8JT75oSpBm+8BSlt0NmxvX1XhQkBzHbAt/PZunRDufLaryF9pD/ewu
L8cP/XG2mKVVn+jOrMj+dZnWjkM8uxvPnxlp8Rngdf95XwhNn8Xv+tk9vfEL
remDea19dqe0P/pdRej4FUk9pDUIHSNEiB+VOxC9o3NiZvh+MwO/ury9ufD2
P03yOu3e/mM6mGckFONm/QWd0UJpPp8r036YAl98JAKJ1WEZp2+uT89ON17S
FSETQc8DUfoQ6q+SarysWw/1ozPCExo+Db84m1V0TRmQxT3UL24G8VWKnQVf
3EBmafwn+vr5IL4uJ5P0rsiSEM/PkzlmaD11KHn11/87z1vo/h0pKsGD/xQG
46vx7CktwoV999d/r+6DJ46o0K9Z8Zc0b5GVu0SOK3hsEWK4FyCEfhvKc+CM
jPKkjpESkhJ6P5Nfa2WXwz1CFNxGw4D77C64T4ElHfobBRVfV1TN1gqBZzTP
kgG9T7ic5Ku/gIawKEXwd5+ApOhwZxUTDqEYLfxZ4/XxN/u7zYwE24u3l//c
wevj7faj4d4Ok6Hzm3c/vv2c+HX6mBEbDIWvbF6VE//J77ur/xQc/XbJkHD1
PCkeWmu7SrIH/3dvUU26vEvXUcH7XV9+M4jfkzJAQBK8/Wb5kAYPHHqeTqqs
JTqeJ4/ZRB/EraX8FmFTv3oPOfhhVj4WWfDR++yhKavwmRODv//r/0WsLTzR
izlRxyR45O77rJwVaXhro1lCekHhP3LvX9Ct5HX4/rImhEr9R45QXidJuBoh
k1A3zJO+Z2SgM2xCIvnT8pH4sf/ESeNHfwsSQcKCcE3i+8QWa6B3HVKNxGFK
SDIE+4hLkGAPSgBUJ/pA/4JkN+zA8+Hhb8PzvSPB85vTs7N37zZj+m/kML+L
7/1GavK7+QvR0mZtYd+VM0BZHT79rUzp/2P2MncHHQLKTTIel8Q2RJ58Eb/K
iolhHSSv5GXG0uhVWTf9UXZfsNpdNP2XWdN/R5wkTw0r6Z+/3r7Y+RtyEJJJ
s0VCEuj+50RZeSsUZoXUeU8cfSRwfAMQK5/aRLLI0nztsZvnKi3Sv6QhgTnN
p1U6CR45qB811TILr/2GXvR/d9TrFIS+IPJThHxhNC6bZu2pE873A7WfWEIm
hmzIuxc5KS7E2eOzZfWYqhWFtfz1O3IPST4gJbS8r5LFbEUrvP7+LJaJoFsk
Ylc53HgjtwN5KdjFbXZHnMH9/jsltt+It44cHwan5JSpy+IRJ6YH5KlUAOeL
s/PX6wd1sazKBRRPB8D0/g2hGtGnGVCBFIDFsgncDhejdzeXZ6OdWNZCo45O
X12c/XDz/mK08SQJWGnDL9OKLj7NOqF17bm7hDcJMb3wEpLil8T7XY5njzTo
cTr/rI2yTqbYymNaD0iTXS0GTemf5zcjes5HCM46K0vhM/SjHKzY+Aw09uWw
fSjjE3GaAwzInzuV36mB/A6S//vETmJhb8rxrGkhwVVSMLXwnznjw81f/71u
60fXyTIPHsiV4Xw676nD3nD8bA/m8LbBQUAd1wSLYDXPoMgT/oPCJw3cbrSx
dE5XJ0LDK1pJYxCEr+v7bA542XhPJDR9n4X8+CfiM/dL+7OjlOekr7Skg7p2
v7orbI/4HfG+eZa2hyTp7lWSt81FLN/5DzwpmG4sbQnkWfzdKrU/O+hrv3hO
m5qtlg/tV2kRP2b5AxswO9YRPtNvvgfehlL192VRJRP7s774jvjRssmXwavv
imXl/WyBpRupSV6o6gHh/mA8Xw7SyfLZ/1rxBT08WyQkjtfPHrJ5P6vHSQf8
vIJJDIBBYgDz/6uU8GdFuyJAWBKkjMeQVyF4EhjBvARhgugobDiQmpvlZAUe
dX5zehWfE/Atqzu2/l9UVVkBxPr9fpzc1Q2IdfQ39P7GCUE3bX4SN2W8IP05
HTc4qyROP45noI6TuHyk75L4KZukcYWfsNTE074XqnfXPZ6bJKI4yesShG7O
3gyiD5nQvVrc2I1dlf12EMfvMBHeXxH7oMHwTxLA4BlYxbOkpiU0JFpitXVK
79LRgRuVJAgnAbeSI6B/9Oj7cb4UGc69goHnJMOxc7Ys8pUcgRjn4nqZNWqj
ohezil6d0N+0aeJ1FW+ZFns7oy0Z4x228QgHAg+dwxPTxFWHGx/OaNie+T0j
nmLoSUrS5Yp3VrGjgd5IGqwr2NAAIES/tcfGNeqV3OUpLpP3mPxSmgkw0jgh
xWkQRQSAdMJ5Rpv1LIJNsKMnOu8F5KB6RquiP25enbFDP36apUV4N3g302PN
JjW7qYAKfM0ZwwitCPvYGwwH8U+4Xj6lSib13svwgHCT7gT+bgQS8Obl4308
ByDS4+QxyXLsdtC6Cw044OXcL0kEBCbdZ4+66iJ9omsgNags+HWMbmMW7C4H
JA7FyWTCqxJQXJsA7yKogYfAH4htwEE8ZjQHnQHdEs8gkDcQNKYTmuRpFP0B
rndSyZbsgor+/8TqRxjWBUw24LVDIziG4k+f1I3066/67+Gvv/biy6tTPPsH
OouT3cM9/HT9jn8Z3Z4f7uPv0aV5Y394xG/A0aU/He4P+Sfs9Z+vrs3PR3vD
3V9/JZwbLUmotKtikL4rSZ3C7QBAYHDBf6073L5ssDl4DUhUTQje6AgZo+Vx
x9eWpN3puRIlmsWTbMr6ZhOMVOPQJ+kUDoTN5O5PBBWxKqWOHtFjkj7wU/ox
AfQD3v/ph8sze6q7chIhqYzzNOHLoZkhVK+RzklAOtdIpjmYrSlJjflqC4DQ
efl/Yxr6im6COHgDDO25qzy9GPXPXpo97x/tEnAJjp0d0I9/Bz/cwdEh/Zha
JyFdzz1o3WxOC36aZQQoJFCnDRbzRJcUw6nkFq00xFJdWTY+xbuyTfpZidq4
LBCow5FXoMGQE4n48AsaLYIV3IHZ431zTA8Fac50khm8+nI1uFBlFjx8IoE+
BQawBGZbdn58cHj86687hpoTtDzyzbVpNrxkEgDAtEp2/5TleTxL8wV/C782
ncSyoP/PMVDyK3+REJjdpSS5648t1mJXSwfEtJYA164UXLkoG/qeqKvQRd7W
GMddNYInvEjS1v/El00r6YEIg/zoOYFcEXiMq+zOHLpH0HvgPnhlrsZ7w0xJ
uqpTj7oaBMb6lwXIIW173AgZ9O8lmMs/a/xtRIunZFW/IJLtLtsyk5A3KjIs
NTRPuJzC6eHw4EiB9zx8crR/cMy0LicxU87J8GRLdvSia+Vwdv6sVpx0IEqw
f5/RVZrtEAvTeQHvOY6CdlF4xwtoAsbqJH/CPaYidTTBbNitDpJMygXO824V
UhgSbhW7+FjG1upihQaaFeA/oPPUEJXanJbZNk1d8AExDhJqEiQyPMmBPT85
oaP0BmB5QMfQVw74tLHgKiWaSNvrEaTkefkki34Mvzx3n57s4Tr+hD3QPZqD
t7KIgh7OmYYmYeFRtusgyQdDgOXTrIwzkHArZAixseIcrCp3WKLH0YrUBzNa
6Kx8wjwr5kCG+QhXyVebpVA7BNBkXbSEKJ0SeUhUKC+nzRMQzK5XkAyIVy/n
Rly1T+mu0o/wzNcxY3YF0kBYN2HB8y51MypweuJWraxRUc/IrByuBc52xoSD
w3VkFKEAoWwq2lttxJeEmBOsvjFJV1D+8hXQKjfLIP6Iy3gibMX6SKhjFd3z
k2/TmrMGJKpPWB8zN6NdzZfNMsl3eqBm0wwBi1mCdYqAwvJURqdxz5KXilkq
6wrTU0KkAa1Kodr0FWQV5wSBg4YrMVtNswlxXlMUIKuBCcxTSHJZPRdFiWaz
7hGS+xt5H+vEEivmunLKPY8rg6XAcQaaUrSvP06EmzWkp2Lmp4qt3wR1PxQ5
yRI4MroVAgW6wgzkgeYGnRQ2SF8nrc2KdJnWRhvgONxYmOO5/aFHFIEY2OZP
WVAItCKcrA8ghIzpfNHw2zDnzLO/iOBvEcPpIx1Qr5ywZEaQY+qqxJIyHpCO
q1xWCenB9YrY2VxmKR+9QfcH8WuiOfS9gm4mbDLJwVXo2NXmOojfpk+QQ7J6
jNkcHen5SEonIVPFIr3XYKBsU2iYQNblXLZX+bGEcgV0bCt/tz4ugq8wCyXc
J0SfE2j9xWAmhFvEeYPkRqe8fFBTIyqCggZyhyGLBJlJsRLZhAhpK/ADoc4d
LH4Qn+phyqoFc2s306xc5iSBJHTIUxYd2gMz8zB7JIi6S4nos7ZcpUTj0hYF
qWiCBKTQZ5c9YcM0kIHp+L4kdArufJ7dV5a9sSxJNLn2Ob8HBYzxesAMh8t5
p1mgJT8o2XxMaHRfhw8h1WMqvKealE0Qh7pnxK4U+l66MKtdFh7dS0Wn3q7T
dJ0O7wzidyw6B1esIEUHKl621pmCRfENSQB8WoXgSBwrUVlMsX6Oe0lq4SQK
MIYX9mLhjUIBQaqSita9JIZMwnpFU4raUMfb6eB+0ONjxBHKFfqvd6m0O38y
ZoyEiRhL+TRhz+dyalaZiJzErAPgJPQdeNO50UH8alnh8LC9NueyHDqJp3lZ
EnlgshCPUzr54r5HqIxRSwRVkKrkGXeEciQqy+imJZIezBLqA6uj+ANEfalX
pudK2yL9U8SKaTx2/oZsjAnT4p6O7ZEWP2aHjSoGcV4mkx0C4zMrUkOnISJP
mOD0HTuAx5+cPsZwOiVpLINpysjggBahZjGd3fghV8aUsmWUwYuw/smQsfgl
TGpny4r1bXVapfH2y7PrHY/u85Isu8xwzosS2QhZ0Wc+VoNiCsmJb1gpWrtl
wogH5mGgY2lVgc8DuKxZySerIRljs3D0h/iWvQhlXt6viHjGxZJdSnQ6Zml9
iw30Zr1GD50BJzMSQFGnoegEunVwcnDCBBqCxQOJiciCqeOtqx9Gt1s9+W/8
9h3/++bin364vLk4x79Hr0/fvLH/iPSN0et3P7w5d/9yX569u7q6eHsuH9Ov
cfBTtHV1+tOWXN/Wu+vby3dvT99sdW9KBESWSUj4aNi0GAX6GN3of/zbnlH0
h3t7J2xkYvl+7/gA8j1hrszGkpr8CSk5omshbYL16hxWmwUxyFx4KYCpEB02
iv74P3Ay//NF/Oe78WLv4O/1B2w4+NGcWfAjn9n6L2sfyyF2/NQxjT3N4PfW
SYfrPf0p+Nucu/cjbIzfpgVrs+3Mrk8v4j8QJ/pVJadaRVenQeh3bW7lS6Q+
zxqsZa159L5lFIJ2RwLPsvYAXLQ0EC9dCt3SH/7g5XWoRoZf/4CwnWfgXuuP
dV99o8HRBi+ZwhsC2KidCXS2XKhHr8xJtGGZVjf26OmoZjIWC/EZsRb9Dlat
ioCPOVnrU9YlRfjotbbIiNChCoyd8kMTPkNyy5ot4AVd6x/jy5aobqCXpMD7
ktQU0lTxtdF3hwMOTjLmnhfxbTlJiOBy+BNOx+gcfCG6EbVT7B2z2v3bJ91v
T8ph9Namu7unqnrCmgcBnqa4wLQpC8OJL/Ll/b2RcWsXc+Oo/KxE2M0dEexJ
NmF+Wi8XbG0VThqC30CXMSnTOniZTREfGyK0ogXwhFB72JymDJe4j+6VXvoA
658x9BzD9CCWd0vkx9CYWMwPvQlOPONIJGXK+EGTlYRJ0tDyN5vJedWsRzwZ
8yXghw7kL+KgmS4JkMSlSM/MNcJsziKeTWSgY4ewNBUphZgKzFv1194wjsmZ
UXb1Oods51qDMhaDd+NtZywjdN87OTnZWT9/VhsMQnXfXHCIZvBcTIgxiQ19
tcNfkqQCVV3SAIk4jBGLuX35fod3fvbyTC0v69Zqu6ynpKLZ7hOYLNXGTULl
hIWtlN2yapVjPsQn2UZnwwANcWUTSxFz1heDQGjY+j3nv2cEgf3N57/XOn9k
MeyIbOQkpTYCmtMFWtUNbMlrFwYDbwKDqZFXw9vauB8f4TotpfzWgtUMENxN
ex/KSlueTKOKrREf4zHuXK3IgMajqHJFpmYGTLV2hM93GB6nJIgKeQ/Hs7Bg
rKW+IAQgtAN/+gR+JV/TAbDiKnSEVQO7Jpq2RABysFFfZeo8cZU4wjPfD+2l
dOak93jqJRT9z14C208/e/hx+L8uuNwXGGQFl0ebIcLHOjs8x12nacGT8utl
WgfXNYgv4O6lPSWiUIeKM8nRCOGpPVWdZUQ2xSds2NIDq+090W98JMLFWb7s
YuFrlg1cytv0yW2IpCviYqpHINZMFHFnzzN3xsIVANEcF47CSZA2NoBW9ycG
KedKU5eheAz3xIdUPsjKjDVrEJ/WbKGr6Sh6a8Y/KCtwtxYwUPUnhD15uQiM
1RtAy+FO4cBGLRBtcGkjqUoenlHD2lUYWjz+T5NApYQXiY6FZTcmy1hgkYo9
6DPDDY3NkNSNtlmSwUFfU6W0ve5YhEomhwjtm7JfQNRJGApgN7fOlM1QYiZn
VRKwPV02ngzpSBmE3vNuiTeSQBd4qCfJorFnjbexrB/Or9lWjcABmIY4VkMC
D+DIhhXE8InAr6Ue8S9LrXzXmqtnLLkvvpKbnXeLEwfsHGPoeO89NC4bYvKi
XfBh+9xQ981WreSOiMrOl/lQp2Pu84zo/Ks50blhRe/9t7+wj2HnPuJ4m82Z
AnjtbfNEO1/BAs5DHiCOr9/IA1r7/wwz6Nj//hf3v999j0ACRCzeQTamD96U
sASvqX5TfQW6LWlR9nrHtDgYIi0Y4sXYDGYW7+0MSoA6NkvfKchGTvZ4b3JS
xj+mnjs1cXRWmFfSmIiip4LQcpL2Pe/R6Gz03nEDa6DeZfc033wuAgychTQx
cFy31ikh77s7xTrgJjAn7VNnO6Mo3iM2bWKISKxLjg50xZ7ZIAE6SQ46gGcJ
BBcKIcaSAEnmYLenN7dYGmyK+OGy+EW3vm2Mg3JsHV4JFxXBFOaKTXQfEa6L
0btil4w3GawDspjxBgQG9zu6xHmqYr6JsXNDNKsF1Dgi0z6zg0BWiOb2VEq4
QJxmrAk8ZglL18htJyjgT1To6zN/DDyDRrnk1w4O9vlVBFWNdmB4lMHmKUGh
3PZkVSRzXdByAQDi3bM5tUjzeFqV83hZaHCMXApmViBz5mNzFSZmJKut0dFt
nqUAAmEO7jKRWTuw99wn1YQZr0pkDminwocbzd6WGBp/x2ap2/ZEePNuc7qx
dAdrS6AdNmyRV1s9QZ+Ycs3cOiBhnjK0rnOG9GPlaawxsUqM8zsYQc942+9W
645RwxvuUvEN3y8reTOZSPQ4XTtriLyaxAl/vCgrW7b2ui6EKQFm3AJACVLm
JZy8i5KAfUU4Y/7FSEO7ussmtQHuRY5aPIhdUjtbclcbe0PiCLqIoHqGEmsY
7kRWgkFZbpEZiVIACTkiUCgQf4kwA8KB9l6wjsIQLIykK/qxrPIJl98gqnkn
JD9a90iFPBsf8ryGTtkIOxcK+Xp0Swg0k8inaJql+cQYn45POPamLuXQMK+s
WvwSCaoNNFntJLgVUyPEVGmYXZSM4VnzIM2QYH8wT5LHavAhMsrAMVpDR97Y
G4buEU4zutmP/DgLQVOQIRk5EgslT/vE3tNMtFUiiMkDQaXxbls9SolC1phg
EwI8QhREt415y3YbLPHVaT7tK1UdeyVoWJNqRViNlMDvKW+3d0BsfZTNM7jp
OHwBLhNI4kzTGVKKsujzTW+ITDXk6er2tI+14ZsI5Z4k6hKiS3LPvE/u/vkB
wk4lMopJKjywy0JDqc7fjrg20KRdSoEWHb0lHjGJL+hHdjlvo77KjgGpo5Pn
aljzAlpRu0Un8+JZj4/3hpBuVTWOPAWIeOKdFKtZFo5cm3Ah90tI10gxK4Qu
8vWXHVy31lO24QUi2cD2KsYy9phaatomm1B01mJddGXWzG3ghrh6tliK9R80
sTABlRUCcQiI2KsuwRQPabromlIDL3MSywYxSyTIJKsk7zeyst5Yf4SZn86h
moikGoggY/ehdbsZQWO7LWAYSB0OjhRQVd7oiaokWLUhdKTlka99bV0pF0TS
fg5t2l8XrEBm5iPSTYc6txjFdv4k4SigBc6hj0h4WlHEVL0DN7AfVBjhHxGn
yRIrm/nESi6uOMAOuzUYjxQ6oplEr8Qpm1FUW4WDHCZyOLrpj6VdRlIRqvFt
kxylnIeNOAQmHDQFvIhUtzVH7/mHNGjTnMYgvmJ/iok9yOEbthTf7c8E2MpG
TESIpD985tIH8dsSyUAaBfm5ACVWxQpMb3bmX5o9VDoQPlUWvFzsR9QyeXV+
Wy/vflHF2VJih6RK3LD5s5vLK+MZoMEv/TgFjY9xKoc/Ff05y+5nfmApA6Dy
OjFn0T/GqHnnUBU60UdOOBI0VCnCxTvzbjU8ulCnHZsMXt5cnJ69Nk4Mif2V
rQCCjHitZjusgSH7zgb4SggZ/FFGPmeBhMX2ZW2fsRFwTPC7lrwyUJfHJmTu
9n8oOSYt8z/+zaupFhIe/wHJSxlruU2q8XtLoWV+zA7nP61YxQU/oi1ifxPO
AmLctekG4iWyNGzOVd80+qUmCmVcUhUbH3Voq5ZFhpspEU7nIhuwnvSGqL8I
TS4UAZGSHLzpnF5/oldRYfQBtc+Eyc8xlwT1coBBlfqZ9ASieUb7vjg7H52a
r8f+EXlYTXokZJtZlmrwbM4yvdNTJbxBoP1n8+UHb7if3VoJEiNl6M+PTyQ7
BLYCJGm4iz/Ua5d3XAaaiY1cVNljMl5FQcgl4mPrcixyMZ8CcpmWgNyYdjAm
NppNiSQwQva5amgr/yzy0W9SiiHfmPk2H8/50mZuqf8Lh5tns5IUP0SbcebQ
XflR4ic0CqsX6QZ1KW0qY8Pz58kkDfwJkbWWA/Bo2rJSQvvzmO4pnbCD0z/0
tQCU45MhIjLGID+Rakw9dhpl1kCqzsq0KJf3M8MHhfCL/mQ8z4kLjIySHIVc
uQynGCSw1pFu6yYlts1c0AoCMK/MUxIDzDuVfQfFa+tG9WWaZzlWGHO4MF0S
lAe5PyZ3ZckqJ0IC61p4WbSgowcR5PjqVBKEpxzOVjc+96d1j6CialzB2rJU
ipbfaX0PCGnWkKUFR66x9pXerwacKWMt0nK0yh75NhQVDnePjxkV3OtwbATh
Cdej79X56dT1LBTYI4dAB4MjMS9ab5Glra6GnmJWQuJGAuGYb40Wr1mtbDPO
aq6yJEbnO/FphFFoW8TEqmZMxH3LTzlaPzg6V1ar5RgE4sQubY/WZ1PQGwGa
YewjW/V9A4mRFuflxMW0gjomj2k9qUoRpUNxdhBpqN+6Tcxge+t+mRqfttzb
gbmBpUyT16S2E/mYVH3O9KrZoqhDqHAwT7SCle+FJOXqj/Etf9v3MqWYulvz
haYDVuk9QA6ijqiBnC8FGXBFCmP6wMqyUhMxBYsOC0NoQVRBIjjp1EkY5AwF
OpGViS6lP/uLaa1wogwXtLL1PsJOSYxpPr9kAlXa+4oFOmsMMvHGqGDBKgqy
3CY4AOCC0X4qOj2x6wbX4j4zc+RgmBr0qV8x0SS+HZjsZkk+9T2HnUu3w8uF
qFxp/elVqb5Esyh8Yk4GRILTxKB35PYdCFFLRP47wLVwCRBSE6fYIb7ZtC5Q
kabMUwklNgmjk5Rf0qNtskoT4MR9lthlbjMQOPtewVaLdSjY6akXFrtW45Cn
GAnlNqN6tt+mLCUwC0fdeu5M8Ky/qEWcnX4wxnZvl6RfVZEYOECgA9/jGoVm
yi+xHQ+ZAFnAJHot/Xe+rMFrGT2F2ip6Gh3bk/XChAXS/wQtYOmyxKT27dRh
fAGfgrEMtg6cyOeAZtBXWtAhSnjMgS1E7Fh5JRxPuEaBET84FqqYcOgsgboY
tdXExzIULlHshMB8nhfVi6ERVJqLql8tQK9Y3GZGGaj5oi4Y1mdOTwTfyQaC
k9VOhFtwXksDQ6SRIYNE/AUcRMTbNZK6i0KxgmuRDHDUz7NHtrAYpSYyQeIC
NlaQANhOBoGaMQxYZXiR0MrUAyXQH9UgXEm8RbD5gaCiSreE+gu0NJu4n68k
4BrXr7+d6xCuYoN91i4qZ3WUjm9rUT98mMzSDw+0MpIbGIlMBjmHajEERPD9
lsXEhN57++kZVVzz+KEovL5wY5SF5Pp0bZOjE1hysQIXEmisWNjbtJGr05+Q
o1Dx0QhE8voyk2eZxJF/5kuicbnnCkjm5VJoHUeMK6WfExNYSnxkTNp2Ve+w
dE3gzSl5NgEyB7xH4T7/pElAczUumLAAfxU2L1qttYD7ckyAbhNEFgpyka9e
dlAtJCMQi6zl88psmwF8mj7J6tnlA37CsV22LEXUxg9MLtRV8cLQYcW5Lqpp
ogtqzwCkmpYN1mmxKCa1xGAjEKCKXbJs/ss4+w/m7XKu9SsgRUINITKIFEiV
RrmytgoYDDQurJGUhxs/bFMrtIEddWfkrcXttXOoQpNQEBP6RaPQpqWI5O9q
D0h4UN0kEo5Rs+M2lJhd5WyRvwvnCvXEBN8vx88Fhs20kiK4OfdYeBxHjczV
eOjHaktQncRwGSXYqxcQOKCMm1fe66H2cB/tP/r7h4eHdIn0tyQztBz2zqmk
QqDLq2VldT0o19NZ1R3h6a0uXLdjLvEygTB3Dqt26TNhha9TOghoz1MflK1g
R5u0yTKSjGXX5KBbZpRwe9DIeJqgJtDPFhI+TKWK888xN0Jw5QSkVFUggRU2
dt4TbDpClRIzuaSbFmqAXBPTJBmvHfjZdTIIjfb9wYTgzP5VCrDCBOn3S4lP
dkEJwXDdhpwDq4XamzuNQ7uuRljgNCzKGerkYYqYQ/CWSA/Iag80QzqrW+6q
gWrtioyfPrUbbUARvuVk4kpccllt4XqTd2DNg/kzQ8QknXyYE9dIqw8iSG20
uHDli6Oh6PjiO0KOBKpRurWGjqvPEBzg9DbnyeFCdkxOpEcd9qHvelEMNI8j
UK0caiAp5ANJk/LCGa11yS+j4cVWsHdfq/5/9JiX1KdRtcfBNlw2YhSHN+DZ
0NWf2el9YYkzlcZrxHqoc5OT4c2JtAHRNCP42BX3qIGg7H6ZIK/eBcGY+A1a
nb2358cHu77TDzE2gmRwK9IRTWw0yOjt5Y5Qpi9C0OeG2ARFBqesJ3b3yJhw
JNBJvAXqpWrdlAgnqvMLomVNuz7QKEh/ThXpjSJDa+MIk00JnRoVDNswXvej
HQBL7fxMMYSwgVFzdCVNx4vUubCGHp9wi4nj06d/sE0u0I4irYuMTsP5Z1At
hQgbXIQc8ODHlNNOXDBHEGVqILrlt33MKj4Kw85Kp9orZChFaauWKdsfiNHT
PfbvKynlYRUhFRERpBZO0NNRYbcyTJslbo6RLUWPZuPNU+Fbpr0LxCaZGudp
8iAIpINKGQbiD3PVQmgvUmfLoasRfT2DHMbhnKO81PgaHc8LyOq+sUHo5TW6
bbO5tIsUi+c6K508LbIpNFbE5thH8zKcJL6xAiQsK5bytkdoikmktW0seUAI
gqobzNIVn35eFi5t5wPG397bG+4odycAfxuUYYlaDkqThboJjV/EW6E0oiV/
4EKgXyM5ToF/Rx84ecrao4Ij8Q6i5/+g6iK7vbwwuIQX5SLhkjtDqtxpMVPR
wsr+2USfPxtYEbrPf7Cl+7LEuWvaLDgXTzgToAacexIajkTBoVbl0Hht9FZd
+S+img1DihigZnIiXNpLK+WIuCXKiNe4oN9qXPDW49TbBLtvd6yDI8kXxa/d
XGGbMxplir4nLffhWFkPnIp+0wI8KFEBZB8ZBRtQcWtclXXdN0xjy/P2B8KZ
yrRSWgF6daRp3tKEKO2MFsOh+iXZRJSL56TTcEQTU6DIjOB9aIx4LsjP0N92
6jdHkzEvoc9Fo4/uUlS154jG7qimfWv3kbMBDmrhG6VPou9HCnqWZRRlm716
eoENQpMCL0WIfEjbbtldVHEoyg9eOMgHM4EhMFtxHOJK9DtwBZDhIUsU0A+1
IHlRjy5SQLaGKiDwUjkgmJQw99GdRhonnRUWdFjeE8lkA3UnYLx26TWSqfJ5
6YCUFWjCrDTzZqS8zzTjUEHhppkDGJvrp+EhJoW48BJ7apMgjKotfae5T+LI
q/o3M2zVWA+cIxylRWZq2k6k8pSL8IPLrhdpAKhCp5E1eANLBvp5slINx1Vc
YJui2WfkbZTDX+QcFNGS9cV72WVEu1gi7qvUeW4lnig696KexF5aPHKVLCsI
WZGncoWoxhx/NoaDRbkN2I76clStI+owTbSUFSea3xKbsbVO+JJRGgUCIa37
RRTtDWJ/NQQpEt0crISnB7znqdMJVJJhUo6oa0fhIaG4i1aToIQlIoL96vRa
0gFdnJRvcJeLhWNAo5MmWQUUwaiJFZYgmhk12YQByEppg1rZw19TkCInNsuE
hwxpsAkZ4tyA7meBPcIL4b1Lcw7WwKA26FQi4NaX4eouztL21lPpnQCyouS5
5kGZRbYpu6TJ+gUi3Eem2l1AzoUAYjwIO3UmQWBoeIrCMuqDNLSibSFMu4s4
snya1LJMuL2EGO2w1m+rwUn12hnBb9Ozl6VqoAv/1cJvjH9YDYaUrE9m6r8S
Q+dmYQ2XteVsF0NLrNmogW4r+CwMM1Sc9TR9uLZVhtuQbbxGqFnD1b8aEw/m
FSiR4RlAKw3SqHkZNnf9KzIfh1+DiTgoWVKwYnOaTA4ttGFBEkonUfdaWS1A
vd5X4V6AdxjWxz2rLChrXZsyNj4hhiRQWo7NZCjniSSMnS+au8/8dsDbCHSC
jV8DeD6kSKj3xuP24Oe3AMgm4MBwXwQQNYP8S1qV8Q1isNnwFt+y12W3f3N7
u8Mljz2DlBjs+RmbrFdShs+E4WRiJnfvc6Km9QlK8M+ES08X41Vkkx+dvioM
RT0tPRNh4PwY41LKW9vk95YvMkPme5hY25jyUBqzkzDZxXgmiDKoOQV1jOhb
5MtfWpBOKTTEegIJm5TEpyqmRFcfD/ImtpZndxU7eF05ORcGKvWKmeTQOglj
XzmhGdytDytcnzOEKq9YEmcEViJJmaj6410FcVNiT0dDKnKfFA0dRFMJnfB8
IsLzP9hcZf0uJPHEXNhEno2DKqhibQiEcanGTSoONMyP8cXgMArClxCECIPm
YlaBTfsv9vw4ajW2JY9lNpETNkAmWRiRXyYurITHXhZX2O2LwdmNDSoUiBTw
Nqnai4pTLoUtS0WPWyF1GnQqYaDVnClGwQ3Rsd9elHDyBP9trFg9DmnCoRks
VOrTiniUT81XgRDYLvTzIj6TyIQRRyawwqqxDM69Yk2jNtKSU7ByOipt1WwL
XeWuJ2+r/McPIJfNsmBGaYwRrjKmKdgihrAwXGLGTiDOstLS5+zbNcUGmO6L
T5JHAZD7seW2Js62qeYIiUXigug7l6IPEZRrwk1EbfF2yAIiZ7yyhmnYiUh1
iuio480oTJohZ5QLvTK7NAVfjWNSiwC3o9i9Kk3mMAE9rVz8VrUOV6oBNNmU
jfp2ieBNROW6lAtpYXpvn9A1R2eBY9Kr/eYlG8mR00WwaS9BX8Y6s25FgiPv
M7E127rdXpCoxr3dYccpD89FY2v4DVAVQCqBSSVdubzFTCoJLht/GVxWQh0e
DPJ+kGQL8PjQkVNSO4OF09dZ5PStsY4VqHt9VuaTga0jZU3LmZKK1FTqTXKO
IR3uall3Fuy9khcdIUAuEMqvOIIeBFqHr7OSFRcXefKPFQfJoeWNhhiyA9MP
M9RtejU1e6GbXGr3kAJXd8qHXnErfx8OSDWd8CuqBqyfBd/g2x/evPFKwn+p
CAkNwl+EI2m4tg6DYITpFCCNQJfWeHVpRaWibBcJttI4mrKtOJDOUbn2SIU2
GRfaG4RieZ4vUHxuLcE0yzrW24MBtyVer1ZPp+v6EJgjPVVvEK8N8xZ2Cno5
Z29EGFJkbT1cuFaL4Zoq0hBp2oNZCQfLWT91l2gflLpG6Bbn87VGQ3sVk9g2
Se+W9/dclzh47StBCS0FWtj+ZbDBR6h5mczNtzPO8ff6aISRGu0hgW3cjkGz
JfVcAz8vdziwMOy8AlzPwM+Nsjm/XrAgVpjkkNlWg99zLCFOWPMDe/fXboPr
tu8N4zuNAjaEMAjjLvtaHXqLpCZi42Ly31obzYvZ3BZt0eDYwS4I1OHR2jw7
7TIyL03pWDnK/WN4RnqOttnFdqCOXzxUKiwQbhzs9ul9hrfDI/6ny5rl7FHc
2zp5aG3ZdJnY2nF6k1DfNXQx8kaDOn2tG6T/21jk43O3aBsKtWfz+G5403Kz
w+drJ94+8LP1iXgkPmmj9vIgsBSvj/25ezCVsNrMyvQpADv37KqSFbAGVVyv
HiKBcu2sMgQmz6ZpvUg42pdTEEymChHgX5ZEaKar9asVCz4D9oZ6Yt7qCIBo
oww2CgHrVwArgl0j7NNzq12qbGCA18RcaZOsLsY0VCA1s0mEI6e8gGF4hQJd
1vX6Ju/QLreZVTgM3y/pbNcsdBsgb3++NU9Tqbs7S/uSuuTcQZ8+mdiK/oVF
eMLRdRwiWS1P7xE6GB6w2mD3juRg988vkOzPtvNCbX/Z4zqsI0Qll2LFxoTD
OW42epxBo0AbHjod7214ItePSBu+MU9N5ER4JaZZUbhmTdO8W1+WVmyGtXOM
EoZaCUBW43bj1vNlqv4VFMGW2G4v52Z0ynPZxkUEZ4OHQTKIt1B1gzgavbG1
Vm5wXfEyNmG5mFrLBWCzLBwnlTW/+f+zZiQoU/R8i1jeB5rxw4+Xt68//HGr
p3XGFRMmVfJ0JwmzqVpYbAtF+z/WkpOx88atjKhnXKOt0NfB7ya05ljXpDxS
qdMFOkli1dtykjuxxLL2pUDFeUbiZtqHg54kf76E5L5KU7Wo/qfOG5Wcso8i
BfKRnv8XHuaXqnBJOuZ6qanwaNcZhfKr9nyxC2DZFI7XdZPt8Tfgi7vFL1ze
Gp03dxlvI0ejZ+7hgi5CZ9kxWj79n/CfzAnuYpSYksDNNoUOvqk6A2HO0sTL
sf9DO5NzjVo1J3KSk9p/Kkgx62qJsxj0+540Jz4gkwKKCt0O8KAQkjqKzLH2
eCararmA4aoNzq/WkseI+IN/1qaxyBYyAWC8N7e9xi7kUxKwNCDBqaKcycaO
QmdzFysDGmzYcKNOUiR1N730LFaIlrVsCEeBPj3TpJJqYmAIsDHANL0GUKLc
aI6VyfdzuVsZ+7uhAJJsYmv32gS69nDitLUOBS2rvab8cv0M30rnlyBtWXZ+
jaJvbbNEqPn3JevsQYp0u1RRuxdFOzu9hUi0S6+uuZS0BiJw2oSj9KcXow8k
OX349uzqw+j1KYk1n3mRnpoX958fhC9yfvrXjdl6tT0qbPuN7ekRRg77qsvp
xen5ji9Za4bu3h6rIl02Sql3ZrKjuSZCK05fqrB8pk9YFFmvAGdN+PE5TFl5
WsMq2JPKb3CxT14EVJ5aDWd+Zx9X5YrFUoljUY0fUZkuMhShFCjvMm2/tkaA
n7SZRsfiQO+0SivSqCEFTlLj3HyEV7CaPHkHxvDMfQPPrljHwFHhb7o7rfNk
3NeFcQR6AbwOzNtWK4lqX4NgKY5ZCRSIPT312ra2mKFXP2Hs95MXt5zEmjmg
YkPlVEtbSAJmvjJJz0J5GUi5Giq7JDT/Y61iEWBnkXJfQ1GLPKRT8bd1JSYi
5e0lsWbuch5f9wkH2u1QS3WM0NVNsrG4PNlgvUgZFYpSerN4McNSaARkObG+
aU6bRR6DVHalP+iMdr56tS4PZGsSdO7m89li+6WXJW8KfJ5wMQhNfHHVuDc4
tbnooHEeRc4O01Ewt3sViMlZr08j/sMINLVvquFxo5REwp/CZBkW3sZZnXKh
FL/ITlZFbtY5weWPnNfFhmQZqzM0Vvh/A3oueapweEYElDV3EAttkALb8XYY
ksxNjUp2B+akv0gkx2V5G/kVkPhkFyUcelLLSy3ehBRmLmvG6ZksL2aR46Sq
6N4ioANyqTg64tMn19EeDd1BS0URRIfi8mmW0O1V9Jp2ZKd7hlEu4cpsBMPh
2sThE9yA6Uj5mZtgwh+pOXuNEWrNBhj/x7aYF3tkSZealHOY/ZRb2luLtrk3
tLR87aqfxiHqCImvazrC8bS679PnqL5W93HC/aIk2IBshxC6O9f817gvpQKD
FnVW6cKU91FiIeFXFgu13moos2svTN/J1ychkUSGVvyteqa+jqmbLOlpVkkP
3EVZS9st+D6sgXrkp4BZngFPqO9OYBcPe53aJhlIWlzUSqiLzAMnf6q1wl3J
kvXVDFzYpEacwe5dw9qdMkKLvavbGmRgVIg32BLt2nagYuWpI7ba44vd43r1
ABUdkWqbSh1BLXVg7CTa9Zd73qob1Ktjwj1mx7MSMZbseH8icNK2Qhvbzlpv
AOe1ipxg+lOxaJFPtEX2wRHcWBNUklz1m7Lv6La/HdbU1uHk7OUZ4GQQn3a2
I+x1wIB1T9jSmcq5IJestUOUkmraglWqm6H/I63e1nQ8VUImQQkdZlVl+JsT
8jfrni4yu7UN04Otu6ytMLZV55KS2p0315y05719dXsJc7mp/z/k8oS4tLoz
3TJQxYHIfirdNgsIrLC+dBHo4QAteoAL3BpZIfeCYHUBVnnGI22tBZvLCn3k
Wx/bz4diuYUlFui94wX9o9rbicPtohrj8PBw7yTe/sj/NS8cHx8gh1i2FaRi
BAPYqs/cj81Ib4SNpvQSkItDCkTVNMKi+Ew1tNrE8nDQDkyW4w/8zQf5pm5n
i16cXePxK376BtUxmQ7C05f4BUJSuelevOWvZ0vCdzfpgPvtBpoumFvBDJQ4
BDLv64FppRatRwe5OJ+wjpDUrfaxtiV7yYq5chkHNHxPdPIHRIGSDobmXmrb
NiZfAgIEUHChMw1/8BL51YsrVRhEvjBddCOXnaXtH1caVwQuaHMX1boLva5N
3JH3YrIko1wWzMIRPLSSqcX8HXlXNKaEKJ+13MWy8u2zNztSvkNu3ZWoktY2
tb8FiVpUQ8IAg17aEp063OVXDScNBpVyl5ycwZGfgUKh7EBj1Vk99aolileS
nbhdAXVEiQoud653Ewl3VTMIB8JJMoDRcxLGDC0MoB0rwNbO3mhz+1AusWQm
E1LFdc4jl8+wze0x/JpYDE6cTMXMj2vDmIwna+dxq6HzSrNH9fSirThi4y8/
uxjOb2v58DW4LdFyYwgZagHT5jg7W9RucLiOSY0UP1pKK9KzNxKX/kYqh2G6
898938HgkKv2RrZbgLcL1bE/0/3Gb3YT9EHXeNDI9XmnZVv7WMXVJu5W0gDM
5bhXXjUPjxdx52QAFqHbvy4T7QobRAZqJTNJ96yaqcjRCe2/L0hLRxk0d4xE
Yu/FNknaijqq4Aa4ZSOVrOnVFFNHSUCps3eaNzNxLkJAujPUgU0ragHKEbBM
U2nNTvVKAZQ8ituLNqjINqBXKeE0Hv6ZGOTfD+kW//wM/7Kob6q9ozYrKyie
Gem3Xa+50h5BHKGa3Zam/US8oOBibA/ZiQl4p9XoSp/LOhEOhOx2sZ0AXd+w
58uaKwk/xRf2a2AbWQ8OakVGBcKrUG9noJFLUONpAWbLVfa9ToVBBagXHAho
EPBzzhuT3stdK1MtRSnRvSGZRc140GMjIfiZh7beXYJdOAO4Z2ACvZxMOFf5
R4nkDKr2WBfGvJxw7jVCEwoNbt6+end+vdPexn1VLhck7W2RGrcVHi0xFxIJ
nVdSo9bVUz3cPdDQAZyp6aUJs39o9bexarY8GxfklxavZgblIzbo2VTMECOO
zB45dsaln2qTlapKkADY3q4iwn+P93aHB7xC+2zPPrOrt8+G9tnB7omEoaAt
y0u1xyTmLGjSvaGJmrBmUfajI0vARdVzK+ScSwo+lwiTekWAighSdh6JzdiE
rwjG36XMf+nTpanUGlQ/0yYAImnzjU2TObIT1kM+T/0FnwyPvmrBCR1ax1pj
f63h0A4MtteG2huuD7UTR9rlwbTMNrKJOsG4YwyMQo+ZUUg/fYLkPxhdD57T
6g6PJOW7trqqKosRO8PC4gM2Avx8x+t07kqcmuPX0F11NvJCgvaNSXz74+XN
G5L6IKmkpuj+nHkJbgXAxrs1AL1ip6Ekfhzt2SAb75BsY2WxvHGGLI7TG0bn
8cc6GX5urAGLcW/K+1+SuWs0KX9DmLBlkefMylzPY7d+pg+xoQ+OC0cuwIEN
T44KiRkdl85KpLjQ1lpt+/IHzvfy9O2pry5+K5TohpMWq9UWgq8q2Pu2Ls5i
qc7PimRk39jpmdpX4ENEKbdcpwhJfXb9Ioiw78TXdjNbmhxZAbaxkg/0AoOV
GI49ENLlbnmMZguTCeWE9soaJVezsLFPQyU9LvxO7XYab9xK/OciCv3QWi2I
EH0BEVA/3+OPN6NTl/8sOQ6eF0tf8hs6qFpkqLoHgcxDli7TwbGhdsdTLzQR
/xy9PmUdnYTpmXOStQUa6Xd32t+D7fjq/HDtpFA2UXpYHR6amxFv99npS+7j
gPPqqAq2M7AGBSkoZZtylM70YUMbtCaNWXUPdMjJGlsj44Yh6c64+7a6i6/Y
gstBgV4rs3lt5JmPSwCn58O4W7XcESiMXJGiz4zw9dXpmVcYvh3daXw74Qe+
naGzTMxxUF+iXQKl8etaeaWvXH/0lHVmFVQ2C2YsBtqyI2B2PJgdiB0aYuxq
17nldnwsGeksrnjLrCOHg3d3nQDHy+JmtCc5R7Yug+ajjEyjeJY3w240UXfd
uDXD6KLK0FxCNWV7Hl90nXdb/Kxsw0chvaqMbGqbX1oNS20gsAhURdpoJGkc
X4iXwVRpS8X7aIIsXd1bccpzMxvjvzW2N+fnfMrqmXhw2YQiGdHG2GLWxLE/
F9yS5TcMhZzqXnz97nqfc5a4qUrnyJfc9bLpS46wxBp/9SwXArpwyl3Z7/HZ
NZf+IM5uCwtsc98rrMWe6U2aJ6v4DANvX96c7XQv8CZNcjZac5Lvb1ndSADW
DuB4l1vV6Ob2ujWx9NyzsR+bTHtc6Xr1FRDZhnNTEfPLJv16xy+acffFXm3a
E5XTpRmIRbccmAp7Wj3WZJ8uUQ5SyoEV3Wl2T1I7kemHZqdoNX+kLKiL3Giw
XkH6VjrrXcquINFIQroFZY1lcxs54YVNaDE0IZKf2XmsFS05dATqofoCwQVM
A8CTXRdl5aoASS/14S5aKcWgzXF8Lr3uRPtBOmz3WbuWrhrjG9ALGmek2X81
oI3dwdrre3fIXYP9kGWkoquwLiUFOSFR6R1OL4o/e35+ZyvjRAkzFMspDdHh
3/IiDEwRGmk1ImvgTFEB2CjmVgT1Alw1oLiFmm3EbBFEcuRSgsIGmUQS/Fik
OBDOq7U8f2ewEdU0LssXg7SDoDdxv0BFXU0FqlX5OyZF0pb03xycwtJXVU4z
PhuvawoDNtYtnTzM3rT3wGNapW4JYmdnzRn1bufcDkLiMvn+oUChFfOyGpvw
IbEeSiWRdk7w8cnwUNwtkV9kbdkkKLS2t9/PyqYvi06NMGOl8ZESxvaRernc
4VloBdRkOclSSSVSgirob/IpOKA67DVleWcTtiexwWvCClsG+xdsH/NQq8/Z
1Outs1xsoSUn3P+KF1hwMjKyxZzmZOoUaBn2rDEeSqbUpi6SMUgzi9EseTX+
vxBvDRt8amn7YZPJ2k22wFGyRrvJgenw9KpoB3OEdSVfsM/KlExQsV6bHLU6
LoZ9F+pwG5oXJ2Wi9UPRcPwIxjUtMrSZ9bRguZTIW4+D4vpklURhmDW7uP2w
InlHscqSsX+pUT02MUWh/GCfdQ/G5zp2MatWLoNK3rbxndaGJhhxmyahkcXQ
EDSjAWBvWIGR2hCSx9FiooiFRTiIdWoVoYqJPvtHbEWmNhrZjPq2lbSVVJs8
JV4O7ErLbLDHw8UOmbpwQYSdXb1NkGzjuHErsXjLCbePWVUWftBOO9mSCRAr
TxMu+WArLngRmKBkYREPKQtvxA4t+WXCj3XhEy1AoZiyvti8Nv2+TSxAgIy2
D6piQ45Gsf7JgBiI3dTjSex3lHLXsmE3Xmaq9Ml2e1ZVYpkOzi4SXGspreYk
KQV2DWpB2vPAi2C0oU3cFqBpH692aHUbEemrIW7zF1PBavxgyjDJMoGkOBrO
Ilq7L9jheq2m9Z8+nRN+31VZmqfX0u54DRUvr+l61hmtFs2EVtOgLyXP/puV
qLbKtKZUeUU3ekz+Q2J3R6w7NRVFvHgFqUQsVgUPMMECEDxkyl1xFY517LDJ
AM7gBLSolqmCRjAdF2hKbc9L7s4FJe6uKp9qLb+VBrrYZqnFFTcmOkFvVr7Q
5CpwySo8iJadyOa8XHgFXM0jD5vbcWu9ZL3Cm6GKKEVVPsGB5lpymBVsJgmY
TnI4HVXlpgIkapeQVWzetS1HD0INgqHeQ2Ki1b3dmDa5RyaWUbi0sJJeqzSS
cgTQb8K8bTO2rbqmtdV58iXfDsFojnp8ruKHhFyS0GJmDFpjOi2PhKd3AZcw
ohTbL/Qc2W6hOG8Sfkhzo6+S4Eptpaa2wForzUxy3/WpniqSWFg08/tTb28F
vAu/be3Y6uDqxcDQWnbEs6qqe0yKnZsq5WFjUMEN5yqSVnwmW6Sba6K7lB9g
yYZNNrK7rmbM08XQa/r7zUu6d9vSVKGYKRhyPjjaC9oJUQI1IPGGNHUx7Aom
EgZi3c2B9/ziJV8snORqWqFFjhQcsQ1dJzNJiBKJby6t2WLxUKHhvel3b3s6
wplISFBz4DkX1WDztGt0qlExeDzhA2jnHcStSB62prHt/iwQZdqERrrTyZta
N5Y/tUpA63MAsoFiFqy5N5GjWypQaZFvV43DqJ1S+QvWOEmoDJVxSUJ2dl0O
njd1b8K6Kxp0VYOqJpIapJO1ZDetUM8jc8V+r8Wx8SnTJ78si7FTRQBSq9ja
cG43qllsSe8+K7PU2mAuYrwwmmc+7rmYEP5VYjtcvhz/KB1ow8ANfnC0j7cj
k4Rk3EbKq0Wbew0ey7XJ36MDlhakj/0KuEpwbW4sVzRyfUwZLTpq3tIgGnL5
KCOnXIRXmlq6jgzrX4q0SvQvMndt2V3HSD27PEE5IwDDnajKJI0DG/Oj3SAd
wSTVWsXCcWQev3Tj+rpgV7eNGrw8dd8n4Cv8do3+zAjQZ+e5OMeRWZJJpIwR
TcyhiK5qEgEtQvOs1bJwNcF24Jxf2e87yj6KM4PLvpu8pmDNolqKY+EOir0C
5sFgH84P/OeAV4J/HYoP6++stWDWNIu7rO7XKfr/ZOOaLQWvu3bvdYbqj8HC
x9J42EpqpYhmRtZAr3ZVz1DCXlTImgNxXC3eMPiCZ+PF3i8T7nnMTW5qEzJm
+h5XzCrgCOuFtbXbtYO86i6mnYcpHuAKCxmV1YZZdgRr/Z3YAQ+7m9t6gGPK
qHUCkBfiYhC57cejtSGo25JAaZrFJX3Z4ayGS79Du7I2kSicoTjRov6cKupB
Fuum0kaAtVesyK02E80ZYf5MPx1RF7csV5RVa88cSR2VsVdL70b78PztCCXY
qpUxHY1u3rOj8Z81QkrykLxIbeN1TKS8n0Yw+aWDg3uQ1mLaqXKeNOOZaUtm
q8wHFfeNMFM+ZnXZdqVlnz8HE8zKHnF3+zYdtKd+UbSs79NGlaSbH65ur2FA
3oBYLuimrZmz6pcm03grLYwtZyvc1Vu4RtcTEhURRD1om2zW9T78ef39ZVCh
zyo9hirTURiHhsoGbiWsBSYi5EmJBbYMM8PV1Mzh811jhtSwNyNx9BOuciY1
WzVL9lclkd3N+sTtKbFzG5NErW1iEF/nXAK5oz4id67+O1mfaXC1SdzwoheD
AkE0oFmMNrH3XIaS6PMf//aW4xdvUi3/GHTIcmXKSmtNUr1WDAdSjFYLsXN3
PONtNhNLeKQX7mlUvJdlOkYuF0skcNiqACblPKUxOTpamAQmM+B92nBIj4si
WcP/p2Tl2vjOkwcj0Ya9JDl2q4i6Qh1bSXtBRfIE/pDvyuXH4e4u98WNtyVZ
m9tYRRpl+UK7XO0d9XeHx7s99+fe7nBvv/X30P593D882d8f7CB0I8u10rD2
rHH+bSnn4Ac2C5FVW1YtueEuJVGbhHPnQNNxSlM1tVMeFh1LMb2xiRfXrAv0
qdOUFqluGWkfcjjU1uPi421XL0DPdmdjMYZI1BQpl6eJSKL2QrjatvVXOSda
bndHQUo3AlzRFugDI0o1NldxLU52U1EIA7ZHHOoUtU6CnbPcnFm9ej/zGj4Y
l9/PrL8aAmDBHqFo0Vr6pdjiOPyUZAlOCa5F/HGR3qa5h+m9LGqISQb76t4g
QjsMdLh4EiuHKNmSXa/f/xe3LfUvUErB2AcQ+eVL8kln9pYiuhiy25X4VGic
SuboOI2EqhD3zNjl7xt3DUoqpPVHl+9tadrDYavxkqk0MRJTryXzKLHAsc9h
HQq2Y24qQWFKTkB02Lp+NdpS73mrUfrBycEJ8jMzwckpm2iNubXdnNVEaDvj
ERF6KNsmcd7rnuhqUkhiYiG9DtouJ89SKYHzsHB9Iw1POQEbI8CDPFI9bOYV
cfe8UhLcrXJ++HVs9DXxCQFYKlMLo9exWkOYfX7tbVMtF36xDGs78UUD30Db
M75f1BQldpRKA6lglZmRxCWxnilAsuQYEHYdIANhliAoVAzUNi13grYzpXbw
bjfD1UqLemSs6Yjcy4KYhlk+EuCUVc/Tu6yeQHfeVHA9TsTZFq7aPRU6nZiU
bK0BasKdkLRoaicjhRNHRxef8bF77ijpIfiUoad553zGHm4nShRuOSda4n1f
p8gVTiviVoxgPAweudBsNpU11bIWlRYR6+LuZLt0Ep+dymEIrLQ2CcenNBHi
wJEGBdfU2OTul2hdeT8rs6SgZezZZYTlF9kH0dcwBw4n8mheEgQfq2uc0HIJ
a6u0KxHz4KdP3+d0yb8si3uaa1fnGpVc0ZteIYTXJg0tb0q9ov3TpU2EDVcI
mqkH4lPOvXLHHjgoPyZ9cIKsCc59d3lqsOEhsNSL8VmjWkaVhW+QcSKpjWLr
8pxtjxDjPTcYz/5nERw6CI1JmA6IBKDQpn6wYhDiHaOD1N6dNprW7OM7Ix+T
Wt1ovZE+cixsh97dmvFOKgewmoo+vbDbT6Ti8trkHSeI+uJiR4HmI4EBkzD2
s5UpUY9RFkoOD/lLwalJL9buLxiD4Z1WwmxTBy1MGLHLOgW83CepajyzsSOc
/6vpHSYPAq+YmvXj1RhhuiY6+XYWuGlMKQBb2O+ctEh04kDMeCKButcqiG6f
v7ne0coeTNB0+e4E1mDHesRRx+YxrSc088LRTxP8gH5AxkOJvOhlBdtAju42
WgRLaaqBEVoJ15yxaEvvSg8d76Q4Rx65VHDBm8oQZsfdV8MxZqnJU5bU4Nj0
etMvSQi5R71AQVKuKmAvQE4spY8HsaurpPuB+tQ4vxnq7Jmp+lJ9pbUo8KWk
MgV6pPmE2XAPGf2cfMplLOlMvcQcobOa6c2xVihcMEErrrLdQjtOq6qsNEy9
o8DZ//O//09dD6FNqyg7l6smTvzsfC1KV+r9GMnIT5s3lfXX0ubFcLNWFgBF
mbQsANemiUO/ghP7k8ljKTHs2jlJab5O1NeJxL+tGcVWUnSOtdYlXGjKlCjL
kiznFVPw0pgsoeVcbBggTQ5fW+/gmp9YXfvCi3aWfPsNk8BF0M3NfVx3FS8J
dyDlKGUKSDiuzZb0bvbK3qJBN0s5l1N/cDY5moRB9jyx4W87aM6txTQSeJ6b
Jle5wXYd3+mt0fJ7sSIG9WbYyoVVmhgoW4Mi2BIa0LF88ARpuWcXq9ss0ntN
XnHNgNzdB5UJO2+EbeE8kjsF46VAPCjTjNd+7l0j2QIcNCW9MEBiEUoHLWqW
LUIbmBRn4cPzSZqQZOih3AjXBPn4jUiNyt+tVCE2QdNMlYF5TTPUl0ijJrEx
N05MasFa7ohQjccky5kyM7gUK6+NRXhofJg/cN62ZTbI1dWacZ7UpWVEQ+pi
EoNKTlHfVGRRs6dsJIdC5Wegv8fAhOYKDGHZ3JfStl0cQkeLOa9sommqENpB
jBuvI/fTJF2KTFrEW1khDgQm7aYYrkl55mIF2IcytDYjeG0kLpLHaQue38qY
Pa3HiAHQ1KBQg62KPJzDJgtwbjIdkd2LnnDz2myyF0p6Qj9Q6ct4j1DeKqlW
NhJVAuya0lReFHvHklsQYUTblIuUsEUy3N3dtwbp7xJRKQ7FIB302OaaeVJ3
SShUF956BnvA2mcATROM7OuK7J8Hu88RWagDog12EpOnRPIedZ61++XxTesm
0Xwkr3SLG7cr1JDGc/rq4uyHm/cXIzo1dW5IQZMdxh3lRXLjs7SjLe46niuA
hLCjNTjOPCfYTcoclR25t7OgwmNoi5YGG+14ZXV9fFYG8mvueTNXdmZlMkri
uPUCjltDZqw8BHV4KfJM2JDHmFGREYvjMWDrZuA1LWsp88R82y/h5+fGqZMc
rgMNE+5cspqyXawN8c9cjPGKIrY1qqFLpfPFhdDU83s5iVqHhtNZzaw7cCqB
lWxqI+474rRo2Ur6o9WssfPqH9rjgZIZ5tINF/EbPuzts5s3tRS6xzY43A7h
9/BN2IRO2yWe74Znzkhrk/h+d3auZKsGonLRF+GZ9VjKCdJAOWRdG7jP9Q8a
r9J7wY0skAAAyz4UJal664yHrL40YirB8tWUlzcJ/ymqEgvdkk0CY//NGxpN
qVdjEaKPc0ibb2o+mAfQOvqzlj8QzrbMchtwqPxVwoZQvcM7V0n5SeBpNBHH
J3tHqEKUl/eywOT+HvQRMocp+JNJVylRzDQAxjVgx5y0bpxrlUi1imVlEsE2
SBSFEiSLU1ntHEFcykfaD4ME+HfnUgfYPEirSAFD19zXKm0QW2CBwOb/3HF8
ux0jZ4BSq7kXzPhN3YrnReQtChyY5sA8HfHWFbrkJlLo3auBY+FyRppoZqJA
OeVNojWxUlz5u6L/BoaQs8CdOBIa4VKx3p2NrndMTs7J0a5EsHLXg6QGDwJR
tj2lWd830CtZFqTqj40E3nK8G1+n88VuIYCzj7I5W8jWSAohY6163K65b1iW
xwgTWLMxYXodwLnEyiDetkW0WWh0vRQ99HGS7CQtsiTvl9O+6SRoaFnGncl4
Lh1bopmkb3M5nSJPd7Cj1WrgyUBOGQfj1OB6Nhrb0WUezItH9cDj+vtLkwY8
Wxb3e0ig0ZvEIfjopXd4oxm+LpN12+8o5yfA7vRc1LDxCcghNskCd7mFmjo1
et+K6sG15kzxOb5aMTHio4GrUi66ojjA6DBsyX/d18LkI3Kg+NXl7ZVvnnet
hAMhrZbqA9l9USoZFjD6prY5zVJAmtdOO/FuqGY81XjIo/19rnsG1b3dDd2d
mfb9nShrlEpVCrfzJR8vwme7Z3Ps2R+cO2Dh064m1dtbKAMsKLAjxh/QcTuk
Ub6t/oIdBXcFou8V6WGPoIvV4Y6KXD8PEeHaonU9NZ6rr/mLJnKWFcIsTJeL
LqDza90pydgDI7Gx7NJdC7acMfpR3AuFzhpXZF2VbA8NcGCzZCL+AFuobi1z
PA5aVD6x9y1vORVj11eSV+kVchqo7I3YwW2/UtQBPQvrvO0YoxNDp7YZVJst
34VfkF1t75tO29pe2exhwU6MBt4JXxSo2mA5m8sqN8oNujkmY2G4xkKMPnSG
URqMYmX3jM5KuZ8p87jk7tiyfhzL2Wm4UAjh/jsk+HLDdw1yRssZ6T+oLUis
NUXseiKv4JC5rqIVRQzNS7mIkESXEo3geIs8Yw3dUPhHzcFovIQG4//VWEZp
E+6Ue1eVOCaReCLpoyTnoP6lEYO9vNQifco1WVO9S0HipAnKsb3EuaSbdNfz
uJBnDrkrYShbWDqg/nFpoAMfxytDIGQtNo6PfScb5HNBbFfwoqNmpFNh2FgV
5PpqPtRn1RWWwdjMBXYogCxk1bZsni7ZvmmEpxdyk4GkYO/X0ianif8sbO+D
Eu2fu4tLaPCZlGnwaley/esjunWE4jbLWZOvmYND8+ogv8VUc+Pqj0xM5loY
EA5X4JAE95mTVzYIs/LV6U+W/fACgWDMGZnU94U9CLlSzhNcqYEP1xz3GWLe
rAy6lhwIqvmU+oSt5OJB2knPZ9DOWkW7nUrFkLG0Si6N5UyrEWo9xJbaa+xr
JlTciGGm/kM7bYYNLYjBo0M9jU12rQnEUQg5OkHkl6nXhlFQckQqJJtNC2oH
vNOckFliEL9aShjQ0qsrF5gyUBBjDBWLOPU9R/JK0ee9dG9veMwx+EmByK8y
Os3Tj4R3V2leZA/lYy86LYiFZfF1ucBfLwlkvk8my4dedDarEIdE5Ps1XALz
pBedE0CmOb0wK+JvSfgh9Qo/PtI66cNfEmJ8vegC3tmbtKZDyembVxVsmSQ7
x9dJLkW2e9FrBHvW8W09npVTkkTv6aclSfoNjU0H3osu0WOXtNNl/ZgkFQ3z
XUlzXmlVbf3zhtS2R8Io+nOJg43/zJGuCPhY5jkiI//71l//D3qC6vLjLHtl
f73Aj8/+vhe9SUkUocFIceNxr7jLEYkD5Vz+LmeIK6UN06rfZuOHeESDkOxf
4M95RRdz+phVybwXXSfLPP6xXMJ51YtucMOjJP8L/XOFgNU8pbX2ohEJ//Ht
kkg8Hd2ogQGriF8lRK7yvBfdZvP4gganAd6TOkSMcTRf1Tlu5n320KD4wfJh
Vj4WWQRAQJtTFAcXXFGPowsk9duOkhQm5QPChNNbm0ZVx/ewK+Dk4EE10GSL
Yqq2L8LATZIvZsSpaXvsGHhimjouZSiVKeLjw+Fhz0jEn69LjcYRpAWYr4Qm
u0LQSQjdnnVIx/XLKrUH7vf77IUHmpxr5LKNojMzCsLQ0341tVkr4agpATmR
wTPlLdc2V8XGV5O6mlbs+pB8bhM94rcBxuLHoA2RWhQKkageU/MVm6BfE9+X
Tu422noMV08c/zE+4wbU3CeB8FJrfNBivRZAO3L1tvIr0zMrEPIg2mXUaWny
eFdZxZ6cj2dypRFMfSIZ4hS1C61syQXP9HVeuLw0yuYZfKsmxV3rz+pDjXx1
Pg+u/qSC+Ecvf6mWD7AA6UbZ9oP69Zi4wcib67dy/tIs2MwkK9QxgmnxhZiZ
314OWgftkEocIuyg5KwjcM6Mq4vaCEpvkWt1kjGsq5Ms4TsJ3A548BYFQEzc
KqeICWM9ODz+9dcXWOAponBuEBQNZimF4HrxFscD98+z2mQ9Io5zwhETFS1u
S4YHrENxEetHHAoRHx6HOy46yWkja+fePmhhXGJMQi+6gP/TbTP5WStDxtCi
ZUighCPNWTJv5IIgUPvIau/PwbEgQ/d90tmGwcwu8nTgfWY9D9rgjTNujU+h
3e3tdbvDW2uc/7xLAgP6JQPR9znhs+9JLT4+MIg+7IaouUJOjep0vfiRRP+9
k6EliflKF+g13flZ1OR08mGe1MSnPoiH52dRvs1c8bYbAxqsEHdYsFrg3DMZ
wQAsKLKipqSFUagkY9PYKHdI+ETIEBqEwG3B/uCeoCd7BSTqvmcy8WL067r3
ESeAQkFCxsjChq3QHT6kmh7GDQO6IGsNbFqDGQucGXSiNsue6nNWwkylFDXb
TtGzgYNMEm1Dc7h7jLx4XREXqMbE51W5iE0jOT9SoqPOAwz6Euhg6O3G5ldG
f9z0bQveWZYmsLy6vfwtfR2EjFjZXMBQ6/MnUIqZCrjC/l9E4v0XlvDZmtfJ
QuzrGfrM7/Zvbm/NvAI34QsB2+v5VnWfSXE769I2WrqwQbdSWpDrY5Y97UbV
jtVW0Vs6s4rtb4oQInj3O6EpJJDTdqyaTQGwEAbjznzhqNO3mvjVTdysEZcP
x9RjkoV5GRtWSHJp2jZHNmJhyAThvCZBv6xWUfRnWuH070UdLRmtLyZIv38R
L0zSC+7A6FuiyAtV/fMz/padkJMqmTZ9W0GIJCqIWEgN3D2BcHPFLYaJzd2L
VZqdeJalagx5nwvUefz/CyM/Z8+9GuQ4Xvw8q4zueLeKrWozCN6TF9he1RbH
45Y2EFvxnMWEQCX54vKOw+WdnvszOyWJ69klMCh9YbyjcDxTIeCyfx4XkC6q
JKtdGV4bb0VEGdg++eL4h+H4P34bv0FF0TOToAk5vBekLgkq892OITg1K82+
dDx5E7yf6fulM1gEeC1v/ajNdpX2CvSbeDRCx3sTNs2QC5PmGo8OFiMsn/3Q
LaYdW6bdKsMsdOgxmS80cNant2bpa1X7CWewbqLaYoASSw4TcDE9a6MGiVrn
cZ+kFY5kaIBsSRu5QLha64oWbvumk4p1tD2T119pVKRniDZcwmyszS2Uo6Xp
Ikhg1OUG4VYiHIlPpefMcMaq7R+jsffRKMJazHYQOqarMuoUUg+6nfjWRueZ
DMVui4oqmUmDReWTZKL16z+DDtyk8m1pFVhbnoG5tjkg2FC14aMp0N/zQhyJ
tYzORu+/iHv7HJwgB+2q9NiaSO1OJOz7vNGqJptkvC9OOiRNmRD+F00AQMaG
lKhmvchcStZdvLGmby+LcVktSskm4O/5bLwpm7zuzyeH/XqW7PUtnH1pYXtY
2BWs+yIqGt3aKlwgPP2/MQ/uW3HDYvVvEDv6v1Wz7f+Xarb9/wIBY+1KvkY3
8+sueyO0A8SMMsVlFkOl6yv1rP7v1rPg9ABYk671RZTaBeTepLA5Tl6AhTqr
VB+eRY6r0WQ9S5E40klsJYGFCt98qyGiFdNCLR+Z3NXcG1D5QVOVfDNsvKLx
lRDh8+tWMRhCIkPHBrxSkybPtd9fv/M3SIIDBPnP7tEUtmFb2dm1Cd+wXloT
YtlXqRyuQUK5Vby10S63ZUj9prXcjRd7J95SLrmtEI6IJdaeVVDZrihkre5n
dU/raiKil64bij+LuvRt5NmqhMebtQ2i/xdH1R06/AsBAA==

-->

</rfc>
