Other

• Key = string of bits

  • Polynomial arithmetic. View K as polynomial K(x) with coefficients in Z2
  • Compute
    K(x)*xd mod P(x)
    for irreducible P of degree d.
  • Very fast in hardware.
  • In software
    (1 xor + 1 index)/byte

Previous slide

Next slide

Back to first slide

View graphic version