gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b00000000000000000000000100000000
a = 0x00000100
a = x
8
b = b00000000000000000000000101110001
b = 0x00000171
b = x
8
+ x
6
+ x
5
+ x
4
+ 1
100000000 | 101110001 - 101110001 | 1 --------- | 1110001 |
c
quotient
= b00000000000000000000000000000001
c
quotient
= 0x00000001
c
quotient
= 1
c
remainder
= b00000000000000000000000001110001
c
remainder
= 0x00000071
c
remainder
= x
6
+ x
5
+ x
4
+ 1