def mul
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/aes/aes.bend as Aesimport Base
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/aes/poly.bend as P
25# Section 4.2: the product of two bytes is their polynomial product modulo m(x).
26def mul(+a: U32, +b: U32) -> U32:
27 byte(P.reduce(8n, low(), P.mul(bits(a), bits(b))))
Uses (6)
Used by (12)
- bend-collections-laws-crypto@1.0.0.0/spec/crypto/aes/aes:inverse
- bend-collections-laws-crypto@1.0.0.0/spec/crypto/aes/aes:mix_column
- bend-collections-laws-crypto@1.0.0.0/proofs/crypto/aes/sbox:xtime_ok
- bend-collections-laws-crypto@1.0.0.0/spec/crypto/aes/aes:xpow
- bend-collections-laws-crypto@1.0.0.0/proofs/crypto/aes/cipher:mix_column_ok
- …