gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b0000000000000000000000000000000000000000000000000000000001011110
a = 0x000000000000005e
a = x
6
+ x
4
+ x
3
+ x
2
+ x
b = b0000000000000000000000000000000000000000000000000000000000101111
b = 0x000000000000002f
b = x
5
+ x
3
+ x
2
+ x + 1
1011110 | 101111 - 101111 | 1 ------- | 0 | - 000000 | 0
c
quotient
= b0000000000000000000000000000000000000000000000000000000000000010
c
quotient
= 0x0000000000000002
c
quotient
= x
c
remainder
= b0000000000000000000000000000000000000000000000000000000000000000
c
remainder
= 0x0000000000000000
c
remainder
= 0