law Api128.roundtrip

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/aes/laws.bend:228

import Base
import bend-collections-laws-crypto@1.0.0.0/src/crypto/aesgcm.bend as GCM

228# decrypt(encrypt(x)) == Some(x).
229law Api128.roundtrip:
230  for +key: List<&2, U32>
231  for +h: {List.length(&2, U32, key) == 16n : Nat}
232  for +n0: U32
233  for +n1: U32
234  for +n2: U32
235  for +n3: U32
236  for +n4: U32
237  for +n5: U32
238  for +n6: U32
239  for +n7: U32
240  for +n8: U32
241  for +n9: U32
242  for +n10: U32
243  for +n11: U32
244  for +aad: List<&2, U32>
245  for +pt: List<&2, U32>
246  {open128(key, [n0, n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11], aad, GCM.aes128_gcm_encrypt(key, [n0, n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11], aad, pt)) == Some{pt} : Maybe<&2, List<&2, U32>>}