<?xml version="1.0" encoding="US-ASCII"?>

<!DOCTYPE rfc SYSTEM "rfc2629.dtd" [
]>

<?rfc rfcedstyle="yes"?>
<?rfc compact="yes"?>
<?rfc subcompact="no" ?>
<?rfc sortrefs="yes"?>
<?rfc symrefs="yes"?>
<?rfc toc="yes"?>
<?rfc tocdepth="4"?>

<rfc number="7525" seriesNo="195" submissionType="IETF" consensus="yes"
     ipr="trust200902" category="bcp">

  <front>
    <title abbrev="TLS Recommendations">Recommendations for Secure Use of
    Transport Layer Security (TLS) and&nbsp;Datagram&nbsp;Transport&nbsp;Layer&nbsp;Security&nbsp;(DTLS)</title>
    <author initials="Y." surname="Sheffer" fullname="Yaron Sheffer">
      <organization abbrev="Intuit">Intuit</organization>
      <address>
        <postal>
          <street>4 HaHarash St.</street>
          <city>Hod HaSharon</city>
          <code>4524075</code>
          <country>Israel</country>
        </postal>
        <email>yaronf.ietf@gmail.com</email>
      </address>
    </author>
    <author initials="R." surname="Holz" fullname="Ralph Holz">
      <organization>NICTA</organization>
      <address>
        <postal>
          <street>13 Garden St.</street>
          <city>Eveleigh 2015 NSW</city>
          <country>Australia</country>
        </postal>
        <email>ralph.ietf@gmail.com</email>
      </address>
    </author>
    <author initials="P." surname="Saint-Andre" fullname="Peter Saint-Andre">
      <organization>&amp;yet</organization>
      <address>
        <email>peter@andyet.com</email>
        <uri>https://andyet.com/</uri>
      </address>
    </author>
    <date month="May" year="2015"/>
    <workgroup>UTA</workgroup>
    <keyword>Transport Layer Security</keyword>
    <keyword>TLS</keyword>
    <keyword>DTLS</keyword>
    <keyword>Secure Sockets Layer</keyword>
    <keyword>SSL</keyword>
    <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>
  <middle>

    <section title="Introduction" anchor="d1e381">
      <t>Transport Layer Security (TLS) <xref target='RFC5246'/> and Datagram
      Transport Security Layer (DTLS) <xref target='RFC6347'/> 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.  For instance, both the AES-CBC <xref target='RFC3602'/> and RC4 <xref target='RFC7465'/> encryption algorithms, which together have been the most widely deployed ciphers, have been attacked in the context of TLS.  A companion document <xref target='RFC7457'/> provides detailed information about these attacks and will help the reader understand the rationale behind the recommendations provided here.</t>
      <t>Because of these attacks, those who implement and deploy TLS and DTLS need updated guidance on how TLS 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 environments defined in <xref target='applicability'/>. 
In fact, this document calls for the deployment of algorithms that 
are widely implemented but not yet widely deployed.  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>
         It is expected that the TLS 1.3 specification will resolve 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. This
         document is likely to be updated after TLS 1.3 gets noticeable
         deployment.
      </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 title="Terminology" anchor="terms">
      <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 "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in <xref target="RFC2119"/>.</t>
    </section>

    <section title="General Recommendations" anchor="rec">
    <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 title="Protocol Versions">
      <section title="SSL/TLS Protocol Versions" anchor="rec-versions">
        <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>
        <t>
          <list style='symbols'>
            <t>Implementations MUST NOT negotiate SSL version 2.
               <vspace blankLines='1'/>
               Rationale: Today, SSLv2 is considered insecure <xref target='RFC6176'/>.
            </t>
            <t>Implementations MUST NOT negotiate SSL version 3.
               <vspace blankLines='1'/>
               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>
            <t>
Implementations SHOULD NOT negotiate TLS version 1.0 <xref target='RFC2246'/>; the only 
  exception is when no higher version is available in the negotiation.


               <vspace blankLines='1'/>
               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.
            </t>
            <t>Implementations SHOULD NOT negotiate TLS version 1.1 <xref
	    target='RFC4346'/>; the only exception is when no higher version is available in the negotiation.
               <vspace blankLines='1'/>
               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>
            <t>Implementations MUST support TLS 1.2 <xref target='RFC5246'/> and MUST prefer to negotiate TLS version 1.2 over earlier versions of TLS.
               <vspace blankLines='1'/>
               Rationale: Several stronger cipher suites are available only with TLS 1.2 (published in 2008). In fact, the cipher suites recommended by this document
	       (<xref target="rec-cipher"/> below) are only available in TLS 1.2.
            </t>
          </list>
        </t>
        <t>This BCP applies to TLS 1.2 and also to 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 title="DTLS Protocol Versions">
        <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>
 <t>
 <list style="symbols">
<t>Implementations SHOULD NOT negotiate DTLS version 1.0 <xref target="RFC4347"/>.
<vspace blankLines='1'/>
  Version 1.0 of DTLS correlates to version 1.1 of TLS (see above).
</t>
<t>Implementations MUST support and MUST prefer to negotiate DTLS version 1.2 <xref target="RFC6347"/>.
<vspace blankLines='1'/>
  Version 1.2 of DTLS correlates to version 1.2 of TLS (see above).
  (There is no version 1.1 of DTLS.)
</t>
</list>
</t>
    </section>

      <section title="Fallback to Lower Versions" anchor="rec-fallback">
      <t>
       Clients that "fall back" to lower versions of the protocol after the server
  rejects higher versions of the protocol MUST NOT fall back to SSLv3 or earlier.
</t>
<t>
  Rationale: Some client implementations revert to lower versions of TLS or even
  to SSLv3 if the server rejected higher versions of the protocol.
  This fallback can be forced by a man-in-the-middle (MITM) attacker.
  TLS 1.0 and SSLv3 are significantly less secure than TLS
  1.2, the version recommended by this document.  While TLS 1.0-only
  servers are still quite common, IP scans show that SSLv3-only servers
  amount to only about 3% of the current Web server population.  
  (At the time of this writing, an explicit method for preventing downgrade 
  attacks has been defined recently in <xref target="RFC7507"/>.)
  </t>
      </section>
      </section>
      
      <section title="Strict TLS">
      <t>
      The following recommendations are provided to help prevent SSL Stripping
      (an attack that is summarized in Section 2.1 of <xref target='RFC7457'/>):
      
      <list style="symbols">
      <t>
	In cases where an
	application protocol allows implementations or deployments a choice
	between strict TLS configuration and dynamic upgrade from
	unencrypted to TLS-protected traffic (such as STARTTLS), clients and
	servers SHOULD prefer strict TLS configuration.
	</t>
      <t>
        Application protocols typically provide a way for the server to offer 
        TLS during an initial protocol exchange, and sometimes also provide a 
        way for the server to advertise support for TLS (e.g., through a flag 
        indicating that TLS is required); unfortunately, these indications are
        sent before the communication channel is encrypted. A client SHOULD 
        attempt to negotiate TLS even if these indications are not communicated 
        by the server.
      </t>
      <t>
      HTTP client and server implementations MUST support the HTTP Strict Transport
      Security (HSTS) header <xref target="RFC6797"/>, in order to allow Web servers to 
      advertise that they are
      willing to accept TLS-only clients.
      </t>
      <t>
      Web servers SHOULD 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 Section 11.3 of <xref target="RFC6797"/>).
      </t>
      </list>
      </t>
      <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 title="Compression" anchor="rec-compress">
        <t>In order to help prevent compression-related attacks (summarized in
	Section 2.6 of <xref target='RFC7457'/>), implementations and
	deployments SHOULD disable TLS-level compression (Section 6.2.2 of <xref target="RFC5246"/>), unless the application protocol in question has been shown not to be open to such attacks.</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 Section 2.6 of <xref target="RFC7457"/> for 
	further details.</t>
      </section>

      <section title="TLS Session Resumption" anchor="rec-resume">
        <t>If TLS session resumption is used, care ought to be taken to do so safely. In particular,
	when using session tickets <xref target='RFC5077'/>, the resumption information
	MUST be authenticated 
	and encrypted to prevent modification or eavesdropping by an attacker. Further recommendations apply to session tickets:
	<list style="symbols">
	<t>A strong cipher suite MUST be used when encrypting the ticket (as least as strong as the main TLS cipher suite).</t>
	<t>Ticket keys MUST 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).</t>
	<t>For similar reasons, session ticket validity SHOULD be limited to a reasonable duration (e.g., half as long as ticket key validity).</t>
	</list>
	</t>
	<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>
      </section>
      
      <section title="TLS Renegotiation">
      <t>Where handshake renegotiation is implemented, both clients and servers 
         MUST implement the renegotiation_info extension, as defined in 
         <xref target="RFC5746"/>.
      </t>
      <t>The most secure option for countering the Triple Handshake attack is to 
         refuse any change of certificates during renegotiation.  In addition, TLS 
         clients SHOULD apply the same validation policy for all certificates 
         received over a connection.  The <xref target="triple-handshake"/> 
         document suggests several other possible countermeasures, such as binding
         the master secret to the full handshake (see <xref target='SESSION-HASH'/>)
         and binding the abbreviated session resumption handshake to the original 
         full handshake.  Although the latter two techniques are still under development 
         and thus do not qualify as current practices, those who implement and deploy 
         TLS are advised to watch for further development of appropriate countermeasures.
      </t>
      </section>

      <section title="Server Name Indication">
      <t>
      TLS implementations MUST support the Server Name Indication (SNI) extension
      defined in Section 3 of <xref 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.
      </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.
      </t>
      </section>
      
    </section>

    <section title="Recommendations: Cipher Suites" anchor="detail">

      <t>TLS and its implementations provide considerable flexibility in the
         selection of cipher suites.  Unfortunately, some available cipher
         suites are insecure, some do not provide the targeted security
         services, and some no longer provide enough security.  Incorrectly
         configuring a server leads to no or reduced security.  This section
         includes recommendations on the selection and negotiation of
         cipher suites.
         </t>

      <section title="General Guidelines" anchor="rec-cipher-guidelines">
        <t>
	Cryptographic algorithms weaken over time as cryptanalysis improves:  
  algorithms that were once considered strong become weak. Such algorithms 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>
        <t>
          <list style='symbols'>
            <t>Implementations MUST NOT negotiate the cipher suites with 
               NULL encryption.
               <vspace blankLines='1'/>
               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.  
               (Nevertheless, this document does not discourage software from
               implementing NULL cipher suites, since they can be useful for 
               testing and debugging.) 
            </t>
            <t>Implementations MUST NOT negotiate RC4 cipher suites. 
               <vspace blankLines='1'/>
               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>
	    <t>Implementations MUST NOT negotiate cipher suites offering less 
               than 112 bits of security, including so-called "export-level" 
               encryption (which provide 40 or 56 bits of security).
               <vspace blankLines='1'/>
               Rationale: Based on <xref target='RFC3766'/>, at least 112 bits 
               of security is needed.  40-bit and 56-bit security are considered 
               insecure today.  TLS 1.1 and 1.2 never negotiate 40-bit or 56-bit 
               export ciphers.
            </t>
            <t>Implementations SHOULD NOT negotiate cipher suites that use 
               algorithms offering less than 128 bits of security.
               <vspace blankLines='1'/>
               Rationale: Cipher suites that offer between 112-bits and 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>
            <t>Implementations SHOULD NOT negotiate cipher suites based on 
               RSA key transport, a.k.a. "static RSA".
               <vspace blankLines='1'/>
               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>
            <t>Implementations MUST support and prefer to negotiate cipher suites 
               offering forward secrecy, such as those in the Ephemeral 
               Diffie-Hellman and Elliptic Curve Ephemeral Diffie-Hellman ("DHE" 
               and "ECDHE") families.
               <vspace blankLines='1'/>
               Rationale: Forward secrecy (sometimes called "perfect forward 
               secrecy") prevents the recovery of information that was encrypted 
               with older session keys, thus limiting the amount of time during 
               which attacks can be successful. See <xref target="sec-pfs"/> for 
               a detailed discussion.
            </t>
          </list>
        </t>
	</section>
	
	<section title="Recommended Cipher Suites" anchor="rec-cipher">
        <t>Given the foregoing considerations, implementation and deployment of the following cipher suites
	is RECOMMENDED:</t>
        <t>
          <list style='symbols'>
            <t>TLS_DHE_RSA_WITH_AES_128_GCM_SHA256</t>
            <t>TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256</t>
            <t>TLS_DHE_RSA_WITH_AES_256_GCM_SHA384</t>
            <t>TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384</t>
          </list>
        </t>
        <t>These cipher suites are supported only in TLS 1.2 because they
	are authenticated encryption (AEAD) algorithms <xref target="RFC5116"/>.</t>
        <t>Typically, in order to prefer these suites, the order of suites needs to be explicitly configured in server software. (See <xref target='BETTERCRYPTO'/> for helpful deployment guidelines, but note that its recommendations differ from the current document in some details.)  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 they are out of scope entirely.</t>

	<section title="Implementation Details" anchor="detail-neg">
          <t>Clients SHOULD include TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 as the first proposal to any server, unless they have prior knowledge that the server cannot respond to a TLS 1.2 client_hello message.</t>
          <t>Servers MUST prefer this cipher suite over weaker cipher suites whenever it is proposed, even if it is not the first proposal.</t>
          <t>Clients are of course free to offer stronger cipher suites, e.g., using AES-256; when they do, the server SHOULD prefer the stronger cipher suite unless there are compelling reasons (e.g., seriously degraded performance) to choose otherwise.</t>
          <t>This document does not change the mandatory-to-implement TLS cipher suite(s) prescribed by TLS. To maximize interoperability, RFC 5246 mandates implementation of the TLS_RSA_WITH_AES_128_CBC_SHA cipher suite, which is significantly weaker than the cipher suites recommended here. (The GCM mode does not suffer from the same weakness, caused by the order of MAC-then-Encrypt in TLS <xref target='Krawczyk2001'/>, since it uses an AEAD mode of operation.) Implementers should consider the interoperability gain against the loss in security when deploying the TLS_RSA_WITH_AES_128_CBC_SHA cipher suite. Other application protocols specify other cipher suites as mandatory to implement (MTI).</t>
          <t>Note that some profiles of TLS 1.2 use different cipher suites. For example, <xref target="RFC6460"/> defines a profile that uses the TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 and TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 cipher suites.</t>
          <t><xref target="RFC4492"/> allows clients and servers to negotiate ECDH parameters (curves).  Both clients and servers SHOULD include the "Supported Elliptic Curves" extension <xref target="RFC4492"/>.  For interoperability, clients and servers SHOULD support the NIST P-256 (secp256r1) curve <xref target="RFC4492"/>. In addition, clients SHOULD send an ec_point_formats extension with a single element, "uncompressed".</t>
        </section>

      </section>

      <section title="Public Key Length" anchor="rec-keylength">
      <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 RECOMMENDED.</t>
<t> Rationale: For various reasons, in practice, DH keys are typically generated in lengths that are powers of two (e.g., 2^10 = 1024 bits, 2^11 = 2048 bits, 2^12 = 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'/> and a DH key of 2048 bits might be sufficient for at least the next 10 years <xref target='NIST.SP.800-56A'/>. See <xref target="detail-alt"/> for additional information on the use of MODP Diffie-Hellman in TLS.
</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 65 bits of equivalent strength and that a 2048-bit DH key would yield about 92 bits of equivalent strength.</t>

<t>With regard to ECDH keys, the IANA "EC Named Curve Registry" (within the
   "Transport Layer Security (TLS) Parameters" registry <xref target="IANA_TLS"/>) contains 160-bit
elliptic curves that are considered to be roughly equivalent to only an 80-bit
symmetric key <xref target='ECRYPT-II'/>.   Curves of less than 192 bits SHOULD NOT be used.</t>
<t>When using RSA, servers SHOULD 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 RECOMMENDED (see <xref target="CAB-Baseline"/> for more details). Clients SHOULD indicate to servers that they request SHA-256, by using the "Signature Algorithms" extension defined in TLS&nbsp;1.2. </t>
      </section>

	<section title="Modular Exponential vs. Elliptic Curve DH Cipher Suites" anchor="detail-alt">
      <t>Not all TLS implementations support both modular exponential (MODP) and elliptic curve (EC) Diffie-Hellman groups, as
      required by <xref target="rec-cipher"/>. Some implementations are severely limited in
      the length of DH values. When such implementations need to be accommodated,
      the following are RECOMMENDED (in priority order):</t>
        <t>
          <list style="numbers">
            <t>Elliptic Curve DHE with appropriately negotiated parameters
	    (e.g., the curve to be used) and a Message Authentication Code (MAC) algorithm stronger than HMAC-SHA1 <xref target='RFC5289'/></t>
            <t>TLS_DHE_RSA_WITH_AES_128_GCM_SHA256 <xref target="RFC5288"/>, with 2048-bit Diffie-Hellman parameters</t>
            <t>TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, with 1024-bit parameters</t>
          </list>
        </t>
        <t>Rationale: Although Elliptic Curve Cryptography is widely deployed, there are some communities where its adoption has been limited for several reasons, including its complexity compared to modular arithmetic and longstanding perceptions of IPR concerns (which, for the most part, have now been resolved <xref target='RFC6090'/>).  Note that ECDHE cipher suites exist for both RSA and ECDSA certificates, so moving to ECDHE cipher suites does not require moving away from RSA-based certificates.  On the other hand, there are two related issues hindering effective use of MODP Diffie-Hellman cipher suites in TLS:</t>
        <t>
          <list style="symbols">
            <t>There are no standardized, widely implemented protocol mechanisms to negotiate the DH groups or parameter lengths supported by client and server.</t>
            <t>Many servers choose DH parameters of 1024 bits or fewer.</t>
            <t>There are widely deployed client implementations that reject received DH parameters if they are longer than 1024 bits.  In
                 addition, several implementations do not perform appropriate validation of group parameters and are vulnerable to attacks referenced in Section 2.9 of <xref target='RFC7457'/>.</t>
          </list>
        </t>
        <t>Note that with DHE and ECDHE cipher suites, the TLS master key only depends on the Diffie-Hellman parameters and not on the strength of the RSA certificate; moreover, 1024 bit MODP DH parameters are generally considered insufficient at this time.</t>
        <t>With MODP ephemeral DH, deployers ought to carefully evaluate interoperability vs. security considerations when configuring their TLS endpoints.</t>
      </section>
      
      <section title="Truncated HMAC">
      <t>Implementations MUST NOT use the Truncated HMAC extension, defined in Section 7 of <xref 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 title="Applicability Statement" anchor="applicability">

        <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>
        <t>
          <list style="symbols">
            <t>Web software and services that wish to protect HTTP traffic with TLS.</t>
            <t>Email software and services that wish to protect IMAP, POP3, or SMTP traffic with TLS.</t>
            <t>Instant-messaging software and services that wish to protect
	    Extensible
   Messaging and Presence Protocol (XMPP) or Internet Relay Chat (IRC) traffic with TLS.</t>
            <t>Realtime media software and services that wish to protect
	    Secure Realtime Transport Protocol (SRTP) traffic with DTLS.</t>
          </list>
        </t>
        <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='TLS-XMPP'/>, 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> 

        <section title="Security Services">
          <t>This document provides recommendations for an audience that wishes to secure their communication with TLS to achieve the following:</t>
          <t>
            <list style="symbols">
              <t>Confidentiality: all application-layer communication is encrypted with the goal that no party should be able to decrypt it except the intended receiver.</t>
              <t>Data integrity: any changes made to the communication in transit are detectable by the receiver.</t>
              <t>Authentication: an endpoint of the TLS communication is authenticated as the intended entity to communicate with.</t>
            </list>
          </t>
          <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 recommends 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 title="Opportunistic Security" anchor="oppsec">
          <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>
          <t>This document specifies best practices for TLS in general.  A separate document containing recommendations for the use of TLS with opportunistic security is to be completed in the future.</t>
        </section>
      </section>


    <section title="Security Considerations" anchor="sec">
    <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.</t>
      <section title="Host Name Validation">
	<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 Section 3 of <xref target="RFC2818"/>.
	</t>
	<t>
	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 MX or SRV record), it SHOULD
	NOT 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'/> (see also 
        <xref target='RFC6125'/>).
 	</t>
      </section>

	<section title="AES-GCM" anchor="sec-aes">
        <t>
	<xref target="rec-cipher"/> above recommends the use of the AES-GCM authenticated
	encryption algorithm.
Please refer to Section 11 of <xref target="RFC5246"/> for general security
	considerations when using TLS 1.2, and to Section 6 of <xref
	target="RFC5288"/> for security considerations that apply specifically to AES-GCM when used with TLS.</t>
      </section>
      <section title="Forward Secrecy" anchor="sec-pfs">
        <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. 

  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.

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>
        <t>
          <list style="symbols">
            <t>A client or server being attacked by some other attack vector, and the private key retrieved.</t>
            <t>A long-term key retrieved from a device that has been sold or otherwise decommissioned without prior wiping.</t>
            <t>A long-term key used on a device as a default key <xref target="Heninger2012"/>.</t>
            <t>A key generated by a trusted third party like a CA, and later retrieved from it either by extortion or compromise <xref target="Soghoian2011"/>.</t>
            <t>A cryptographic break-through, or the use of asymmetric keys with insufficient length <xref target="Kleinjung2010"/>.</t>
            <t>Social engineering attacks against system administrators.</t>
            <t>Collection of private keys from inadequately protected backups.</t>
          </list>
        </t>
        <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 arithmetics.</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 title="Diffie-Hellman Exponent Reuse">
      <t>
      For performance reasons, many TLS implementations reuse Diffie-Hellman and Elliptic Curve
      Diffie-Hellman exponents
      across multiple connections. Such reuse can result in major
      security issues:
      <list style="symbols">
      <t>If exponents are reused for too long (e.g., even more than 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.</t>
      <t>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. See <xref target="RFC6989"/> for recipient tests
      required of IKEv2 implementations that reuse DH exponents.</t>
      </list>
      </t>
      </section>
      <section title="Certificate Revocation">
      <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>
      <t>
      <list style='symbols'>
      <t>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).</t>
      <t>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.</t>
      <t>The On-Line Certification Status Protocol (OCSP) <xref target='RFC6960'/>
         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.)</t>


      <t>The TLS Certificate Status Request extension (Section 8 of <xref
      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.</t>

      <t>OCSP stapling as defined in <xref target="RFC6066"/> does not extend to 
         intermediate certificates used in a certificate chain. 
         Although the Multiple Certificate Status extension <xref target="RFC6961"/> addresses this shortcoming, it is a recent 
         addition without much deployment.</t>
      <t>Both CRLs and OCSP depend on relatively reliable connectivity to the 
         Internet, which might not be available to certain kinds of nodes (such
         as newly provisioned devices that need to establish a secure connection
         in order to boot up for the first time).</t>
      </list>
      </t>
      <t>With regard to common public key certificates, servers SHOULD support the following as a best practice given the current state of the art and as a foundation for a possible future solution:
      <list style='numbers'>
        <t>OCSP <xref target='RFC6960'/></t>
        <t>Both the status_request extension defined in <xref target='RFC6066'/> and the status_request_v2 extension defined in <xref target='RFC6961'/> (This might enable interoperability with the widest range of clients.)</t>
        <t>The OCSP stapling extension defined in <xref target='RFC6961'/></t>
      </list>
      </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>


  </middle>

  <back>
    <references title="Normative References">
<?rfc include="reference.RFC.2119.xml"?>
<?rfc include="reference.RFC.2818.xml"?>
<?rfc include="reference.RFC.3766.xml"?>
<?rfc include="reference.RFC.4492.xml"?>
<?rfc include="reference.RFC.4949.xml"?>
<?rfc include="reference.RFC.5246.xml"?>
<?rfc include="reference.RFC.5288.xml"?>
<?rfc include="reference.RFC.5289.xml"?>
<?rfc include="reference.RFC.5746.xml"?>
<?rfc include="reference.RFC.6066.xml"?>
<?rfc include="reference.RFC.6125.xml"?>
<?rfc include="reference.RFC.6176.xml"?>
<?rfc include="reference.RFC.6347.xml"?>
<?rfc include="reference.RFC.7465.xml"?>
    </references>

    <references title="Informative References">

      <reference anchor="IANA_TLS"
                 target="http://www.iana.org/assignments/tls-parameters">
        <front>
          <title>Transport Layer Security (TLS) Parameters</title>

          <author>
            <organization>IANA</organization>
          </author>

          <date/>
        </front>
      </reference>

<!-- draft-ietf-dane-smtp-with-dane: In Last Call -->
<reference anchor='DANE-SMTP'>
<front>
<title>SMTP security via opportunistic DANE TLS</title>

<author initials='V' surname='Dukhovni' fullname='Viktor Dukhovni'>
    <organization />
</author>

<author initials='W' surname='Hardaker' fullname='Wesley Hardaker'>
    <organization />
</author>

<date month='April' year='2015' />

<abstract><t>This memo describes a downgrade-resistant protocol for SMTP transport security between Mail 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='Work in Progress,' value='draft-ietf-dane-smtp-with-dane-16' />
</reference>


<!-- draft-ietf-dane-srv: Approved-announcement to be sent -->
<reference anchor='DANE-SRV'>
<front>
<title>Using DNS-Based Authentication of Named Entities (DANE) TLSA Records with SRV Records</title>

<author initials='T' surname='Finch' fullname='Tony Finch'>
    <organization />
</author>

<author initials='M' surname='Miller' fullname='Matthew Miller'>
    <organization />
</author>

<author initials='P' surname='Saint-Andre' fullname='Peter Saint-Andre'>
    <organization />
</author>

<date month='April' year='2015' />

<abstract><t>The 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 TLS certificate.  However, application protocols that use SRV records (RFC 2782) to indirectly name the target server connection endpoints for a service domain 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='Work in Progress,' value='draft-ietf-dane-srv-14' />

</reference>


<reference anchor='RFC7507'>
<front>
<title>TLS Fallback Signaling Cipher Suite Value (SCSV) for Preventing Protocol Downgrade Attacks</title>

<author initials='B' surname='Moeller' fullname='Bodo Moeller'>
    <organization />
</author>

<author initials='A' surname='Langley' fullname='Adam 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 RFC 2246, RFC 4346, RFC 4347, RFC 5246, and RFC 6347.  Server update considerations are included.</t></abstract>

</front>
<seriesInfo name="RFC" value="7507"/>
</reference>


<!-- draft-ietf-tls-session-hash: waiting for writeup  -->
<reference anchor='SESSION-HASH'>
<front>
<title>Transport Layer Security (TLS) Session Hash and Extended Master Secret Extension</title>

<author initials='K' surname='Bhargavan' fullname='Karthikeyan Bhargavan' role='editor'>
    <organization />
</author>

<author initials='A' surname='Delignat-Lavaud' fullname='Antoine Delignat-Lavaud'>
    <organization />
</author>

<author initials='A' surname='Pironti' fullname='Alfredo Pironti'>
    <organization />
</author>

<author initials='A' surname='Langley' fullname='Adam Langley'>
    <organization />
</author>

<author initials='M' surname='Ray' fullname='Marsh Ray'>
    <organization />
</author>

<date month='April' 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='Work in Progress,' value='draft-ietf-tls-session-hash-05' />

</reference>

<!-- draft-ietf-tls-sslv3-diediedie: in Q; EDIT -->
<reference anchor="DEP-SSLv3">
<front>
<title>Deprecating Secure Sockets Layer Version 3.0</title>

<author initials='R' surname='Barnes' fullname='Richard Barnes'>
    <organization />
</author>

<author initials='M' surname='Thomson' fullname='Martin Thomson'>
    <organization />
</author>

<author initials='A' surname='Pironti' fullname='Alfredo Pironti'>
    <organization />
</author>

<author initials='A' surname='Langley' fullname='Adam Langley'>
    <organization />
</author>

<date month='April' year='2015' />

<abstract><t>Secure Sockets Layer version 3.0 (SSLv3) is no longer secure.  This document requires that SSLv3 not be used.  The replacement versions, in particular Transport Layer Security (TLS) 1.2, are considerably more secure and capable protocols.  This document updates the backward compatibility sections of the TLS RFCs to prohibit fallback to SSLv3.</t></abstract>

</front>

<seriesInfo name='Work in Progress,' value='draft-ietf-tls-sslv3-diediedie-03' />

</reference>


<!-- draft-ietf-uta-xmpp: In Q; EDIT  -->
<reference anchor='TLS-XMPP'>
<front>
<title>Use of Transport Layer Security (TLS) in the Extensible Messaging and Presence Protocol (XMPP)</title>

<author initials='P' surname='Saint-Andre' fullname='Peter Saint-Andre'>
    <organization />
</author>

<author initials='a' surname='alkemade' fullname='alkemade'>
    <organization />
</author>

<date month='April' 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='Work in Progress,' value='draft-ietf-uta-xmpp-07' />

</reference>

<?rfc include="reference.RFC.2026.xml"?>
<?rfc include="reference.RFC.2246.xml"?>
<?rfc include="reference.RFC.3602.xml"?>
<?rfc include="reference.RFC.4346.xml"?>
<?rfc include="reference.RFC.4347.xml"?>
<?rfc include="reference.RFC.5077.xml"?>
<?rfc include="reference.RFC.5116.xml"?>
<?rfc include="reference.RFC.5280.xml"?>
<?rfc include="reference.RFC.6090.xml"?>
<?rfc include="reference.RFC.6101.xml"?>
<?rfc include="reference.RFC.6120.xml"?>
<?rfc include="reference.RFC.6460.xml"?>
<?rfc include="reference.RFC.6698.xml"?>
<?rfc include="reference.RFC.6797.xml"?>
<?rfc include="reference.RFC.6960.xml"?>
<?rfc include="reference.RFC.6961.xml"?>
<?rfc include="reference.RFC.6989.xml"?>
<?rfc include="reference.RFC.7435.xml"?>
<?rfc include="reference.RFC.7457.xml"?>


<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 month="October" year="2014"/></front>
<seriesInfo name="Alert" value="TA14-290A"/>
</reference>

<reference anchor="triple-handshake" target="https://secure&nbhy;resumption.com/"><front><title>Triple Handshakes Considered Harmful:
Breaking and Fixing Authentication over TLS</title>
<author initials="A." surname="Delignat-Lavaud" fullname="Antoine Delignat-Lavaud"></author>
<author initials="K." surname="Bhargavan" fullname="Karthikeyan Bhargavan"></author>
<author initials="A." surname="Pironti" fullname="Alfredo Pironti"></author><date year="2014"/>
</front></reference>

<reference anchor="BETTERCRYPTO"
	   target="https://bettercrypto.org/static/applied&nbhy;crypto&nbhy;hardening.pdf"><front><title>Applied
Crypto
Hardening</title><author><organization>bettercrypto.org</organization></author><date
month="April" year="2015"/></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="ECRYPT-II" target="http://www.ecrypt.eu.org/ecrypt2/"><front><title>ECRYPT II Yearly Report on Algorithms and Keysizes (2011-2012)</title><author fullname="Nigel Smart (ed.)" initials="N." surname="Smart"></author><date year="2012"/></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"/><author initials="Z." surname="Durumeric" fullname="Zakir Durumeric"/><author initials="E." surname="Wustrow" fullname="Eric Wustrow"/><author initials="J.A." surname="Halderman" fullname="J. Alex Halderman"/><date year="2012"/></front><seriesInfo name="Usenix Security Symposium" value="2012"/></reference>

<reference anchor="Kleinjung2010" target="https://eprint.iacr.org/2010/006.pdf"><front><title>Factorization of a 768-Bit RSA modulus</title><author initials="T." surname="Kleinjung" fullname="Thorsten Kleinjung"/><date year="2010"/></front><seriesInfo name="CRYPTO" value="10"/></reference>


<reference anchor="Krawczyk2001" target="https://www.iacr.org/archive/crypto2001/21390309.pdf"><front>
<title>The Order of Encryption and Authentication for Protecting Communications (Or: How Secure is SSL?)</title>
<author initials="H." surname="Krawczyk" fullname="Hugo Krawczyk"/><date year="2001"/></front><seriesInfo name="CRYPTO" value="01"/></reference>

<reference anchor="NIST.SP.800-56A" target="http://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-56Ar2.pdf"><front>
<title>Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography</title>
<author initials="E." surname="Barker" fullname="Elaine Barker"/>
<author initials="L." surname="Chen" fullname="Lily Chen"/>
<author initials="A." surname="Roginsky" fullname="Allen Roginsky"/>
<author initials="M." surname="Smid" fullname="Miles Smid"/>
<date year="2013"/></front><seriesInfo name="NIST Special Publication" value="800-56A"/></reference>

<reference anchor="Soghoian2011"><front><title>Certified lies: Detecting and defeating government interception attacks against SSL</title><author initials="C." surname="Soghoian" fullname="Christopher Soghoian"/><author initials="S." surname="Stamm" fullname="Sid Stamm"/><date year="2011"/></front><seriesInfo name="Proc. 15th Int. Conf. Financial Cryptography" value="and Data Security"/></reference>

<reference anchor="PatersonRS11" target="http://dx.doi.org/10.1007/978-3-642-25385-0_20"><front><title>Tag size does matter: attacks and proofs for the TLS record protocol</title><author fullname="Kenneth G. Paterson" initials="K. G." surname="Paterson" /><author fullname="Thomas Ristenpart" initials="T." surname="Ristenpart" /><author fullname="Thomas Shrimpton" initials="T." surname="Shrimpton" /><date year="2011" /></front></reference>

<reference anchor="DegabrieleP07"
	   target="http://dx.doi.org/10.1109/SP.2007.8"><front><title>Attacking
the IPsec Standards in Encryption-only Configurations</title><author
fullname="Jean Paul Degabriele" initials="J. P." surname="Degabriele"
/><author fullname="Kenneth G. Paterson" initials="K. G." surname="Paterson"
/><date year="2007" /></front><seriesInfo name="IEEE Symposium on Security and
Privacy" value="(SP '07)"/></reference>

<reference anchor="Smith2013" target="https://briansmith.org/browser-ciphersuites-01.html"><front><title>Proposal to Change the Default TLS Ciphersuites Offered by Browsers.</title><author initials="B." surname="Smith" fullname="Brian Smith"/><date year="2013"/></front></reference>
<reference anchor="Multiple-Encryption" target="http://dl.acm.org/citation.cfm?id=358718"><front><title>On the security of multiple encryption</title>
<author initials="R.C." surname="Merkle" fullname="Ralph C. Merkle"></author>
<author initials="M.E." surname="Hellman" fullname="Martin E. Hellman"></author>
<date year="1981"/></front>
<seriesInfo name="Communications of the ACM," value="Vol. 24"/>
</reference>

</references>


    <section title="Acknowledgments" anchor="d1e1127" numbered="no">
      <t>Thanks to RJ Atkinson, Uri Blumenthal, Viktor Dukhovni, Stephen Farrell, Daniel Kahn Gillmor, Paul Hoffman, Simon Josefsson, Watson Ladd, Orit Levin, Ilari Liusvaara, Johannes Merkle, Bodo Moeller, Yoav Nir, Massimiliano Pala, Kenny Paterson, Patrick Pelletier, Tom Ritter, Joe St. Sauver, Joe Salowey, Rich Salz, Brian Smith, Sean Turner, and Aaron Zauner for their feedback and suggested improvements. Thanks also to Brian Smith, who has provided a great resource in his "Proposal to Change the Default TLS Ciphersuites Offered by Browsers" <xref target='Smith2013'/>. Finally, thanks to all others who commented on the TLS, UTA, and other discussion lists but who are not mentioned here by name.</t>
      <t>Robert Sparks and Dave Waltermire provided helpful reviews on behalf of the General Area Review Team and the Security Directorate, respectively.</t>
      <t>During IESG review, Richard Barnes, Alissa Cooper, Spencer Dawkins,
      Stephen Farrell, Barry Leiba, Kathleen Moriarty, and Pete Resnick
      provided comments that led to further improvements.</t>

      <t>
Ralph Holz gratefully acknowledges the support by Technische 
Universitaet Muenchen.
The authors gratefully acknowledge the assistance of Leif Johansson
      and Orit Levin as the working group chairs and Pete Resnick as the
      sponsoring Area Director.

</t> 
    </section>

  </back>
</rfc>
