gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b0000000000000000000000000000000000000000000000000000000001100111
a = 0x0000000000000067
a = x
6
+ x
5
+ x
2
+ x + 1
b = b0000000000000000000000000000000000000000000000000000000000010001
b = 0x0000000000000011
b = x
4
+ 1
1100111 | 10001 - 10001 | 1 ------- | 100011 | - 10001 | 1 ------- | 1 | - 00000 | 0
c
quotient
= b0000000000000000000000000000000000000000000000000000000000000110
c
quotient
= 0x0000000000000006
c
quotient
= x
2
+ x
c
remainder
= b0000000000000000000000000000000000000000000000000000000000000001
c
remainder
= 0x0000000000000001
c
remainder
= 1