law Api256.roundtrip

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

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

359# decrypt(encrypt(x)) == Some(x).
360law Api256.roundtrip:
361  for +key: List<&2, U32>
362  for +h: {List.length(&2, U32, key) == 32n : Nat}
363  for +n0: U32
364  for +n1: U32
365  for +n2: U32
366  for +n3: U32
367  for +n4: U32
368  for +n5: U32
369  for +n6: U32
370  for +n7: U32
371  for +n8: U32
372  for +n9: U32
373  for +n10: U32
374  for +n11: U32
375  for +aad: List<&2, U32>
376  for +pt: List<&2, U32>
377  {open256(key, [n0, n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11], aad, GCM.aes256_gcm_encrypt(key, [n0, n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11], aad, pt)) == Some{pt} : Maybe<&2, List<&2, U32>>}