From 1ab46496fb69c603d1e57f3c5f15f0e0a34d9155 Mon Sep 17 00:00:00 2001 From: Martin Thomson Date: Mon, 31 Aug 2020 10:23:19 +1000 Subject: [PATCH] rap --- draft-ietf-quic-tls.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/draft-ietf-quic-tls.md b/draft-ietf-quic-tls.md index bacccdb350..57b036e960 100644 --- a/draft-ietf-quic-tls.md +++ b/draft-ietf-quic-tls.md @@ -2312,8 +2312,8 @@ The bounds in {{?GCM-MU}} are tighter and more complete than those used in ### Confidentiality Limit -For confidentiality, Theorum (4.3) in {{?GCM-MU}} establishes that - for a single -user that does not repeat nonces - the dominant term in determining the +For confidentiality, Theorum (4.3) in {{?GCM-MU}} establishes that - for a +single user that does not repeat nonces - the dominant term in determining the distinguishing advantage between a real and random AEAD algorithm gained by an attacker is: