gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b0000000000000000000000000000000001000000000000000000000000000000
a = 0x0000000040000000
a = x
30
b = b0000000000000000000000000000000010110000110000010101001011111001
b = 0x00000000b0c152f9
b = x
31
+ x
29
+ x
28
+ x
23
+ x
22
+ x
16
+ x
14
+ x
12
+ x
9
+ x
7
+ x
6
+ x
5
+ x
4
+ x
3
+ 1
1000000000000000000000000000000 | 10110000110000010101001011111001
c
quotient
= b0000000000000000000000000000000000000000000000000000000000000000
c
quotient
= 0x0000000000000000
c
quotient
= 0
c
remainder
= b0000000000000000000000000000000001000000000000000000000000000000
c
remainder
= 0x0000000040000000
c
remainder
= x
30