law aes128_forgery

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

import Base
import bend-collections-laws-crypto@1.0.0.0/src/crypto/aesgcm.bend as GCM
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/aes/gcm.bend as G

111law aes128_forgery:
112  for +key: List<&2, U32>
113  for +h: {List.length(&2, U32, key) == 16n : Nat}
114  for +n0: U32
115  for +n1: U32
116  for +n2: U32
117  for +n3: U32
118  for +n4: U32
119  for +n5: U32
120  for +n6: U32
121  for +n7: U32
122  for +n8: U32
123  for +n9: U32
124  for +n10: U32
125  for +n11: U32
126  for +aad: List<&2, U32>
127  for +c: List<&2, U32>
128  for +t0: U32
129  for +t1: U32
130  for +t2: U32
131  for +t3: U32
132  for +t4: U32
133  for +t5: U32
134  for +t6: U32
135  for +t7: U32
136  for +t8: U32
137  for +t9: U32
138  for +t10: U32
139  for +t11: U32
140  for +t12: U32
141  for +t13: U32
142  for +t14: U32
143  for +t15: U32
144  for ne: {[t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15] != G.aes_tag(key, [n0, n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11], aad, c) : List<&2, U32>}
145  {GCM.aes128_gcm_decrypt(key, [n0, n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11], aad, List.append(&2, U32, c, [t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15])) == None{} : Maybe<&2, List<&2, U32>>}