def mul

bend-collections-laws-crypto@1.0.0.0 · spec/crypto/aes/gcm.bend:57

import Base
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/aes/poly.bend as P

57# X * Y: the polynomial product reduced modulo f.
58def mul(x: Word(128n), y: Word(128n)) -> Word(128n):
59  P.reduce(128n, low(), P.mul(P.coefficients(128n, x), P.coefficients(128n, y)))