def mul_byte_steps

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

import Base
import bend-collections-laws-crypto@1.0.0.0/src/crypto/aes/gcm.bend as I
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/aes/gcm.bend as G
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/aes/ghash_defs.bend as D

96def mul_byte_steps(+a: U32, +acc: I.Acc) -> {I.mul_byte(a, acc) == D.steps(G.byte_bits(a), acc) : I.Acc}:
97  match a:
98    case U32{WCon{a_0, WCon{a_1, WCon{a_2, WCon{a_3, WCon{a_4, WCon{a_5, WCon{a_6, WCon{a_7, WCon{a_8, WCon{a_9, WCon{a_10, WCon{a_11, WCon{a_12, WCon{a_13, WCon{a_14, WCon{a_15, WCon{a_16, WCon{a_17, WCon{a_18, WCon{a_19, WCon{a_20, WCon{a_21, WCon{a_22, WCon{a_23, WCon{a_24, WCon{a_25, WCon{a_26, WCon{a_27, WCon{a_28, WCon{a_29, WCon{a_30, WCon{a_31, WNil{}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}:
99      {==}