gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b0000000000000000000000000000000000000000000000000000010000000000
a = 0x0000000000000400
a = x
10
b = b0000000000000000000000000000000011101011111100101000001100011111
b = 0x00000000ebf2831f
b = x
31
+ x
30
+ x
29
+ x
27
+ x
25
+ x
24
+ x
23
+ x
22
+ x
21
+ x
20
+ x
17
+ x
15
+ x
9
+ x
8
+ x
4
+ x
3
+ x
2
+ x + 1
10000000000 | 11101011111100101000001100011111
c
quotient
= b0000000000000000000000000000000000000000000000000000000000000000
c
quotient
= 0x0000000000000000
c
quotient
= 0
c
remainder
= b0000000000000000000000000000000000000000000000000000010000000000
c
remainder
= 0x0000000000000400
c
remainder
= x
10