Usage Limits on AEAD Algorithms
draft-wood-cfrg-aead-limits-00

Document Type Replaced Internet-Draft (cfrg RG)
Authors Felix Günther  , Martin Thomson  , Christopher Wood 
Last updated 2020-08-04 (latest revision 2020-05-20)
Replaced by draft-irtf-cfrg-aead-limits
Stream IRTF
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream IRTF state Replaced
Consensus Boilerplate Unknown
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-irtf-cfrg-aead-limits
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-wood-cfrg-aead-limits-00.txt

Abstract

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.

Authors

Felix Günther (mail@felixguenther.info)
Martin Thomson (mt@lowentropy.net)
Christopher Wood (caw@heapingbits.net)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)