]> IBM Research Europe - Zurich

mail@felixguenther.info

Mozilla

mt@lowentropy.net

Cloudflare

caw@heapingbits.net

safe limits crypto 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. This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF. Discussion Venues Discussion of this document takes place on the Crypto Forum Research Group mailing list (cfrg@ietf.org), which is archived at . Source for this draft and an issue tracker can be found at .

Introduction An Authenticated Encryption with Associated Data (AEAD) algorithm provides confidentiality and integrity. specifies an AEAD as a function with four inputs -- secret key, nonce, plaintext, associated data (of which nonce, plaintext, and associated data can optionally be zero-length) -- that produces ciphertext output and an error code indicating success or failure. The ciphertext is typically composed of the encrypted plaintext bytes and an authentication tag. The generic AEAD interface does not describe usage limits. Each AEAD algorithm does describe limits on its inputs, but these are formulated as strict functional limits, such as the maximum length of inputs, which are determined by the properties of the underlying AEAD composition. The security degradation caused by repeated use of a single key is not given the same thorough treatment. Effective limits can be influenced by the number of "users" of a given key. In the traditional setting, there is one key shared between two parties. Any limits on the maximum length of inputs or encryption operations apply to that single key. The attacker's goal is to break security (confidentiality or integrity) of that specific key. However, in practice, there are often many parties with independent keys, multiple sessions between two parties, and even many keys used within a single session due to rekeying. This multi-key security setting, often referred to as the multi-user setting in the academic literature, considers an attacker's advantage in breaking security of any of these many keys, further assuming the attacker may have done some offline work (measuring time, but not memory) to help break any key. As a result, AEAD algorithm limits can depend on offline work and the number of keys. However, given that a multi-key attacker does not target any specific key, acceptable advantage levels could be higher than those chosen in the single-key setting. The number of times a single pair of key and nonce can be used might also be relevant to security. For some algorithms, such as AEAD_AES_128_GCM or AEAD_AES_256_GCM, this limit is 1 and using the same pair of key and nonce has serious consequences for both confidentiality and integrity; see . Nonce-reuse resistant algorithms like AEAD_AES_128_GCM_SIV can tolerate a limited amount of nonce reuse. This document focuses on AEAD schemes requiring non-repeating nonces. It is good practice to have limits on how many times the same key (or key-nonce pair) is used. Setting a limit based on some measurable property of the usage -- such as the number of protected messages, the amount of data transferred, or elapsed time -- ensures that it is easy to apply limits. This might require the application of simplifying assumptions. For example, TLS 1.3 and QUIC both specify limits on the number of records that can be protected, using the simplifying assumption that records are the same size; see and . Exceeding the determined usage limit for a single key can be avoided using rekeying. Rekeying can also provide a measure of forward and backward (post-compromise) security. contains a thorough survey of rekeying and the consequences of different design choices. Additional rekeying mechanisms, such as running an ephemeral asymmetric key exchange, can provide further security guarantees such as post-compromise security (PCS); they are out of scope for this document, which focuses on AEAD advantage bounds resulting from limiting the use of keys. When considering rekeying, the multi-user limits SHOULD be applied. Currently, AEAD limits and usage requirements are scattered among peer-reviewed papers, standards documents, and other RFCs. Determining the correct limits for a given setting is challenging as papers do not use consistent labels or conventions, and rarely apply any simplifications that might aid in reaching a simple limit. The intent of this document is to collate all relevant information about the proper usage and limits of AEAD algorithms in one place. This may serve as a standard reference when considering which AEAD algorithm to use, and how to use it. This document represents the consensus of the Crypto Forum Research Group (CFRG).

Requirements Notation The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here.

Notation This document defines limitations in part using the quantities in below. Notation

Symbol	Description
n	AEAD block length (in bits), of the underlying block cipher
k	AEAD key length (in bits)
r	AEAD nonce length (in bits)
t	Size of the authentication tag (in bits)
L	Maximum length of each message, including both plaintext and AAD (in blocks)
s	Total plaintext and AAD length in all messages (in blocks)
q	Number of protected messages (AEAD encryption invocations)
v	Number of attacker forgery attempts (failed AEAD decryption invocations + 1)
p	Upper bound on adversary attack probability
o	Offline adversary work (measured in number of encryption and decryption queries)
u	Number of keys (multi-key setting only)
B	Maximum number of blocks encrypted by any key (multi-key setting only)
C	Maximum number of blocks encrypted or decrypted by any key (multi-key setting only)

Security Definitions For each AEAD algorithm, we define the chosen-plaintext confidentiality (IND-CPA) and ciphertext integrity (INT-CTXT) advantage roughly as the advantage an attacker has in breaking the corresponding classical security property for the algorithm. Mathematically rigorous definitions for these advantages can be found, e.g., in Chapters 5 and 9 of . An IND-CPA attacker can query ciphertexts for arbitrary plaintexts. An INT-CTXT attacker can additionally query plaintexts for arbitrary ciphertexts. Moreover, we define the combined authenticated encryption advantage guaranteeing both confidentiality and integrity against an active attacker. Specifically:

• Confidentiality advantage (CA): The probability of an attacker succeeding in breaking the IND-CPA (confidentiality) properties of the AEAD scheme. In this document, the definition of confidentiality advantage roughly is the probability that an attacker successfully distinguishes the ciphertext outputs of the AEAD scheme from the outputs of a random function.
• Integrity advantage (IA): The probability of an attacker succeeding in breaking the INT-CTXT (integrity) properties of the AEAD scheme. In this document, the definition of integrity advantage roughly is the probability that an attacker is able to forge a ciphertext that will be accepted as valid.
• Authenticated Encryption advantage (AEA): The probability of an active attacker succeeding in breaking the authenticated-encryption properties of the AEAD scheme. In this document, the definition of authenticated encryption advantage roughly is the probability that an attacker successfully distinguishes the ciphertext outputs of the AEAD scheme from the outputs of a random function or is able to forge a ciphertext that will be accepted as valid.

Here, we consider advantages beyond distinguishing underlying primitives from their ideal instances, for example, a block cipher from a random permutation (PRP advantage) or a pseudorandom function from a truly random function (PRF advantage). See , for the formal definitions of and relations between IND-CPA (confidentiality), INT-CTXT (integrity), and authenticated encryption security (AE). The authenticated encryption advantage subsumes, and can be derived as the combination of, both CA and IA: The AEADs described in this document all use ciphers in counter mode, where a pseudorandom bitstream is XORed with plaintext to produce ciphertext. Confidentiality under definitions other than IND-CPA, such as an IND-CCA definition that allows an active attacker to adaptively decrypt ciphertexts, depends critically on retaining integrity. A cipher in counter mode cannot guarantee confidentiality if integrity is not maintained. This combined risk to AE security is included in the definition of AEA, which bounds the overall risk of attack on the AEAD. This document decomposes AEA into CA and IA as a way to help set specific limits on different types of usage. AE security depends on retaining both confidentiality and integrity, and SHOULD be the default basis for setting limits.

Calculating Limits Applications choose their own targets for AEA. Each application requires an analysis of how it uses an AEAD to determine what usage limits will keep AEA sufficiently small. Once an upper bound on AEA is determined (or bounds on CA and IA separately), this document defines a process for determining three overall operational limits:

• Confidentiality limit (CL): The number of messages an application can encrypt before giving the adversary a confidentiality advantage higher than CA.
• Integrity limit (IL): The number of ciphertexts an application can decrypt unsuccessfully before giving the adversary an integrity advantage higher than IA.
• Authenticated encryption limit (AEL): The combined number of messages and number of ciphertexts an application can encrypt or decrypt before giving the adversary an authenticated encryption advantage higher than AEA.

As a general rule, a value for AEA can be evenly allocated to CA and IA by halving the target. This split allows for the computation of separate limits, CL and IL. For example, given a value AEA <= 2^-60 one may choose IA <= 2^-61 and CA <= 2^-61. Some applications might choose to set different targets for CA and IA. For example, TLS sets CA below 2^-60 and IA below 2^-57 in the single-key setting; see . When limits are expressed as a number of messages an application can encrypt or decrypt, this requires assumptions about the size of messages and any additional authenticated data (AAD). Limits can instead be expressed in terms of the number of bytes, or blocks, of plaintext and maybe AAD in total. To aid in translating between message-based and byte/block-based limits, a formulation of limits that includes a maximum message size (L) and the AEAD schemes' block length in bits (n) is provided. All limits are based on the total number of messages, either the number of protected messages (q) or the number of forgery attempts (v); which correspond to CL and IL respectively. Limits are then derived from those bounds using a target attacker probability. For example, given an integrity advantage of IA = v * (8L / 2^106) and a targeted maximum attacker success probability of IA = p, the algorithm remains secure, i.e., the adversary's advantage does not exceed the targeted probability of success, provided that v <= (p * 2^106) / 8L. In turn, this implies that v <= (p * 2^103) / L is the corresponding limit. To apply these limits, implementations can count the number of messages that are protected or rejected against the determined limits (q and v respectively). This requires that messages cannot exceed the maximum message size (L) that is chosen.

Approximations This analysis assumes a message-based approach to setting limits. Implementations that use byte counting rather than message counting could use a maximum message size (L) of one to determine a limit for the number of protected messages (q) that can be applied with byte counting. This results in attributing per-message overheads to every byte, so the resulting limit could be significantly lower than necessary. Actions, like rekeying, that are taken to avoid the limit might occur more often as a result. To simplify formulae, estimates in this document elide terms that contribute negligible advantage to an attacker relative to other terms. In other respects, this document seeks to make conservative choices that err on the side of overestimating attacker advantage. Some of these assumptions are present in the papers that this work is based on. For instance, analyses are simplified by using a single message size that covers both AAD and plaintext. AAD can contribute less toward attacker advantage for confidentiality limits, so applications where AAD comprises a significant proportion of messages might find the estimates provided to be slightly more conservative than necessary to meet a given goal. This document assumes the use of non-repeating nonces (in particular, non-zero-length nonces). The modes covered here are not robust if the same nonce and key are used to protect different messages, so deterministic generation of nonces from a counter or similar techniques is strongly encouraged. If an application cannot guarantee that nonces will not repeat, a nonce-misuse resistant AEAD like AES-GCM-SIV is likely to be a better choice.

Single-Key AEAD Limits This section summarizes the confidentiality and integrity bounds and limits for modern AEAD algorithms used in IETF protocols, including: AEAD_AES_128_GCM , AEAD_AES_256_GCM , AEAD_AES_128_CCM , AEAD_CHACHA20_POLY1305 , AEAD_AES_128_CCM_8 . The limits in this section apply to using these schemes with a single key; for settings where multiple keys are deployed (for example, when rekeying within a connection or when using multiple connections between two parties), the limits in this section MUST NOT be used, but instead those in . These algorithms, as cited, all define a nonce length (r) of 96 bits. Some definitions of these AEAD algorithms allow for other nonce lengths, but the analyses in this document all fix the nonce length to r = 96. Using other nonce lengths might result in different bounds; for example, shows that using a variable-length nonce for AES-GCM results in worse security bounds. The CL and IL values bound the total number of encryption and forgery queries (q and v). Alongside each advantage value, we also specify these bounds.

Offline Work Single-key analyses of different cipher modes typically concentrate on the advantage that an attacker might gain through the mode itself. These analyses assume that the underlying cipher is an ideal PRP or PRF, and we make the same assumptions here. But even an ideal PRP or PRF can be attacked through exhaustive key search (in the key length, k) given sufficient resources. An attacker that is able to deploy sufficient offline resources (o) can increase their success probability independent of any usage. In even the best case, single key bounds are always limited to the maximum of the stated bound and This constrains the security that can be achieved for modes that use smaller key sizes, depending on what assumptions can be made about attacker resources. For example, given a 128-bit key and a single nonce, if an attacker could be assumed to have the resources to perform in the order of 2⁸⁰ AES operations, an attacker gains an attack probability of 2^-48. That might seem like it requires a lot of compute resources, but that amount of compute could cost a significant, but not completely implausible sum in 2025. That cost can only reduce over time, suggesting that a much greater advantage is likely achievable for a sufficiently motivated attacker. Of course, for such a small chance of success (2^-48 is less than one in 281 trillion) this sort of attack seems likely to remain impractical for some time.

AEAD_AES_128_GCM and AEAD_AES_256_GCM The CL and IL values for AES-GCM are derived in , following , and summarized below. For this AEAD, n = 128 (the AES block length) and t = 128 , . In this example, the length s is the sum of AAD and plaintext (in blocks of 128 bits), as described in .

Confidentiality Limit Applying Corollary 3 from , assuming AES behaves like a random permutation, the following bound applies: This implies the following usage limit: Which, for a message-based protocol with s <= q * L, if we assume that every packet is size L (in blocks of 128 bits), produces the limit:

Integrity Limit Applying Equation (22) from , in which the assumption of s + q + v < 2^64 ensures that the delta function cannot produce a value greater than 2, the following bound applies: When p * 2^127 / (L + 1) approaches or exceeds 2⁶⁴, the additional condition s + q + v < 2^64 becomes the binding constraint. This produces the following limit:

AEAD_CHACHA20_POLY1305 The known single-user result for AEAD_CHACHA20_POLY1305 (correcting the prior one from ) gives a combined AE limit, which we separate into confidentiality and integrity limits below. For this AEAD, n = 512 (the ChaCha20 block length), k = 256, and t = 128; the length L' is the sum of AAD and plaintext (in Poly1305 blocks of 128 bits), see .

Confidentiality Limit This implies there is no limit beyond the PRF security of the underlying ChaCha20 block function.

Integrity Limit This implies the following limit:

AEAD_AES_128_CCM The CL and IL values for AEAD_AES_128_CCM are derived from and specified in the QUIC-TLS mapping specification . This analysis uses the total number of underlying block cipher operations to derive its bound. For CCM, this number is the sum of: the length of the associated data in blocks, the length of the ciphertext in blocks, the length of the plaintext in blocks, plus 1. In the following limits, this is simplified to a value of twice the length of the packet in blocks, i.e., 2L represents the effective length, in number of block cipher operations, of a message with L blocks. This simplification is based on the observation that common applications of this AEAD carry only a small amount of associated data compared to ciphertext. For example, QUIC has 1 to 3 blocks of AAD. For this AEAD, n = 128 (the AES block length) and t = 128.

Confidentiality Limit This implies the following limit:

Integrity Limit This implies the following limit: In a setting where v or q is sufficiently large, v is negligible compared to (2L * (v + q))^2, so this can be simplified to:

AEAD_AES_128_CCM_8 The analysis in also applies to this AEAD, but the reduced tag length of 64 bits changes the integrity limit calculation considerably. This results in reducing the limit on v by a factor of 2⁶⁴. Note that, to apply this result, two inequalities can be produced, with the first applied to determine v, then applying the second to find q: This approach produces much smaller values for v than for q. Alternative allocations tend to greatly reduce q without significantly increasing v.

Single-Key Examples Note: The following example limits purely serve as illustration of the formulas given in this section. They do not constitute general guidance; every application has to choose their own advantage targets and consider their deployment properties, such as message sizes. As mentioned earlier, for settings where multiple keys are deployed (like rekeying, multiple connections, etc.), the examples in this section MUST NOT be used; refer instead to those in . An example protocol might choose to aim for a single-key CA and IA that is at most 2^-50. (This assumes limits to offline work of o <= 2^(k-50), see .) If the messages exchanged in the protocol are at most a common Internet MTU of around 1500 bytes, then a value for L might be set to 2⁷. shows limits for q and v that might be chosen under these conditions. Example single-key limits; see text for parameter details

AEAD	Maximum q	Maximum v
AEAD_AES_128_GCM	232.5	264
AEAD_AES_256_GCM	232.5	264
AEAD_CHACHA20_POLY1305	n/a	246
AEAD_AES_128_CCM	230	230
AEAD_AES_128_CCM_8	230.4	213

AEAD_CHACHA20_POLY1305 provides no limit to q based on the provided single-user analyses. The limit for q on AEAD_AES_128_CCM and AEAD_AES_128_CCM_8 is reduced due to a need to reduce the value of q to ensure that IA does not exceed the target. AEAD_AES_128_CCM_8 only permits small value of v due to the shorter tag, which leaves a higher limit available for q. The table assumes equal allocations to q and v for AEAD_AES_128_CCM. Some protocols naturally limit v to 1, such as TCP-based variants of TLS, which terminate sessions on decryption failure. If v is limited to 1, q can be increased to 2³¹ for both CCM AEADs.

Multi-Key AEAD Limits In the multi-key setting, each user is assumed to have an independent and uniformly distributed key. The same nonce can be used, but only with different keys (all of these modes are broken if key and nonce repeat). The success probability in attacking one of these many independent keys can be generically bounded by the success probability of attacking a single key multiplied by the number of keys present , . Absent concrete multi-key bounds, this means the attacker advantage in the multi-key setting is the product of the single-key advantage and the number of keys. This section summarizes the confidentiality and integrity bounds and limits for the same algorithms as in for the multi-key setting. The CL and IL values bound the total number of encryption and forgery queries (q and v). Alongside each value, we also specify these bounds.

AEAD_AES_128_GCM and AEAD_AES_256_GCM Concrete multi-key bounds for AEAD_AES_128_GCM and AEAD_AES_256_GCM exist due to Theorem 4.3 in , which covers protocols with nonce randomization, like TLS 1.3 and QUIC . Here, the full nonce is XORed with a secret, random offset. The bound for nonce randomization was further improved in . Results for AES-GCM with random, partially implicit nonces are captured by Theorem 5.3 in , which applies to protocols such as TLS 1.2 . Here, the implicit part of the nonce is a random value, of length at least 32 bits and fixed per key, while we assume that the explicit part of the nonce is chosen using a non-repeating process. The full nonce is the concatenation of the two parts. This produces similar limits under most conditions. Note that implementations that choose the explicit part at random have a higher chance of nonce collisions and are not considered for the limits in this section. For this AEAD, n = 128 (the AES block length), t = 128, and r = 96; the key length is k = 128 or k = 256 for AEAD_AES_128_GCM and AEAD_AES_256_GCM respectively.

Authenticated Encryption Security Limit Protocols with nonce randomization have a limit of: This implies the following limit: This assumes that B is much larger than 100; that is, any user enciphers significantly more than 1600 bytes of data. For smaller values of B, the value of B should be replaced by B+98. For AEAD_AES_128_GCM, it further assumes o <= 2^70, otherwise a term in the order of o / 2^120 becomes relevant. Protocols with random, partially implicit nonces (like TLS 1.2) have the following limit, which is similar to that for nonce randomization: The first term is negligible if k = 256; this implies the following simplified limits: For k = 128, assuming o <= q + v (i.e., that the attacker does not spend more work than all legitimate protocol users together), the limits are:

Confidentiality Limit The confidentiality advantage is essentially dominated by the same term as the AE advantage for protocols with nonce randomization: This implies the following limit: Similarly, the limits for protocols with random, partially implicit nonces are:

Integrity Limit There is currently no dedicated integrity multi-key bound available for AEAD_AES_128_GCM and AEAD_AES_256_GCM. The AE limit can be used to derive an integrity limit as: therefore contains the integrity limits.

AEAD_CHACHA20_POLY1305 Concrete multi-key bounds for AEAD_CHACHA20_POLY1305 are given in Theorem 7.2 in , covering protocols with nonce randomization like TLS 1.3 and QUIC . For this AEAD, n = 512 (the ChaCha20 block length), k = 256, t = 128, and r = 96; the length (L') is the sum of AAD and plaintext (in Poly1305 blocks of 128 bits).

Authenticated Encryption Security Limit Protocols with nonce randomization have a limit of: It implies the following limit: Note that this is the same limit as in the single-user case except that the total number of forgery attempts (v) and maximum message length in Poly1305 blocks (L') is calculated across all used keys.

Confidentiality Limit While the AE advantage is dominated by the number of forgery attempts v, those are irrelevant for the confidentiality advantage. The relevant limit for protocols with nonce randomization becomes dominated, at a very low level, by the adversary's offline work o and the number of protected messages q across all used keys: This implies the following simplified limit, which for most reasonable values of p is dominated by a technical limitation of approximately q = 2^100:

Integrity Limit The AE limit for AEAD_CHACHA20_POLY1305 essentially is the integrity (multi-key) bound. The former hence also applies to the latter: therefore contains the integrity limits.

AEAD_AES_128_CCM and AEAD_AES_128_CCM_8 Concrete multi-key bounds for AEAD_AES_128_CCM and AEAD_AES_128_CCM_8 are given in Theorem 7.2 in , covering protocols with nonce randomization like TLS 1.3 and QUIC . For this AEAD, n = 128 (the AES block length), k = 128, r = 96, and the tag length is t = 128 (for AEAD_AES_128_CCM) or t = 64 (for AEAD_AES_128_CCM_8). Protocols with nonce randomization have a limit of: Firstly, observe that offline work dominates if the target advantage is small relative to the final term. Thus, where p is very small (for instance, 2^-60), this requires an assumption that o is also small (in the example, less than 2⁶²). Where o is not constrained by the final term, the simplifying assumption that o <= q + v (i.e., that the attacker does not spend more work than all legitimate protocol users together) implies the following two limits (distributing the attack probability evenly among the first two terms):

Multi-Key Examples Note: The following example limits purely serve as illustration of the formulas given in this section. They do not constitute general guidance; every application has to choose their own advantage targets and consider their deployment properties, such as message sizes. An example protocol might choose to aim for a multi-key AEA, CA, and IA that is at most 2^-50. If the messages exchanged in the protocol are at most a common Internet MTU of around 1500 bytes, then a value for L might be set to 2⁷. shows limits for q and v across all keys that might be chosen under these conditions. Example multi-key limits; see text for parameter details

AEAD	Maximum q	Maximum v
AEAD_AES_128_GCM	269/B	269/B
AEAD_AES_256_GCM	269/B	269/B
AEAD_CHACHA20_POLY1305	2100	246
AEAD_AES_128_CCM	269/C	269/C
AEAD_AES_128_CCM_8	269/C	213

The limits for AEAD_AES_128_GCM, AEAD_AES_256_GCM and AEAD_AES_128_CCM, assume equal proportions for q and v. The limits for all schemes assume the use of nonce randomization, like in TLS 1.3 and QUIC , and offline work limited to o <= 2^70. The limits for AEAD_AES_128_GCM, AEAD_AES_256_GCM, AEAD_AES_128_CCM and AEAD_AES_128_CCM_8 further depend on the maximum number (B resp. C) of 128-bit blocks encrypted resp. encrypted or decrypted by any single key. For example, limiting the number of messages (of size <= 2⁷ blocks) encrypted, resp. encrypted or decrypted, to at most 2²⁰ (about a million) per key results in B resp. C of 2²⁷, which limits both q and v to 2⁴² messages for GCM and CCM, except for CCM_8 where the short tag length limits v to 2¹³.

Security Considerations The different analyses of AEAD functions that this work is based upon generally assume that the underlying primitives are ideal. For example, that a pseudorandom function (PRF) used by the AEAD is indistinguishable from a truly random function or that a pseudorandom permutation (PRP) is indistinguishable from a truly random permutation. Thus, the advantage estimates assume that the attacker is not able to exploit a weakness in an underlying primitive. Many of the formulae in this document depend on simplifying assumptions from differing models, which means that results are not universally applicable. When using this document to set limits, it is necessary to validate all these assumptions for the setting in which the limits might apply. In most cases, the goal is to use assumptions that result in setting a more conservative limit, but this is not always the case. As an example of one such simplification, this document defines v as the total number of decryption queries leading to a successful forgery (that is, the number of failed forgery attempts plus one), whereas models usually include all forgery attempts when determining v. The CA, IA, and AEA values defined in this document are upper bounds based on existing cryptographic research. Future analysis may introduce tighter bounds. Applications SHOULD NOT assume these bounds are rigid, and SHOULD accommodate changes. Note that the limits in this document apply to the adversary's ability to conduct a single successful forgery. For some algorithms and in some cases, an adversary's success probability in repeating forgeries may be noticeably larger than that of the first forgery. As an example, describes such multiple forgery attacks in the context of AES-GCM in more detail.

IANA Considerations This document does not make any request of IANA.

References Normative References 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] 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. 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. This document defines the ChaCha20 stream cipher as well as the use of the Poly1305 authenticator, both as stand-alone algorithms and as a "combined mode", or Authenticated Encryption with Associated Data (AEAD) algorithm. RFC 7539, the predecessor of this document, was meant to serve as a stable reference and an implementation guide. It was a product of the Crypto Forum Research Group (CFRG). This document merges the errata filed against RFC 7539 and adds a little text to the Security Considerations section. This memo describes the use of the Advanced Encryption Standard (AES) in the Counter with Cipher Block Chaining - Message Authentication Code (CBC-MAC) Mode (CCM) of operation within Transport Layer Security (TLS) and Datagram TLS (DTLS) to provide confidentiality and data origin authentication. The AES-CCM algorithm is amenable to compact implementations, making it suitable for constrained environments. [STANDARDS-TRACK] Springer Berlin Heidelberg Informative References This document specifies version 1.3 of the Transport Layer Security (TLS) protocol. TLS allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery. This document updates RFCs 5705 and 6066, and obsoletes RFCs 5077, 5246, and 6961. This document also specifies new requirements for TLS 1.2 implementations. A certain maximum amount of data can be safely encrypted when encryption is performed under a single key. This amount is called the "key lifetime". This specification describes a variety of methods for increasing the lifetime of symmetric keys. It provides two types of re-keying mechanisms based on hash functions and block ciphers that can be used with modes of operations such as CTR, GCM, CBC, CFB, and OMAC. This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF. This memo specifies two authenticated encryption algorithms that are nonce misuse resistant -- that is, they do not fail catastrophically if a nonce is repeated. This document is the product of the Crypto Forum Research Group. This document describes how Transport Layer Security (TLS) is used to secure QUIC. 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] 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]

Acknowledgments In addition to the authors of papers performing analysis of ciphers, thanks are owed to , , , , , , , , , , , , and for helping make this document better.