gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000000
a = 0x000000000000000000400000
a = x
22
b = b000000000000000000000000000000000000000000000000111101111101100100100100100111111111001100111111
b = 0x000000000000f7d9249ff33f
b = x
47
+ x
46
+ x
45
+ x
44
+ x
42
+ x
41
+ x
40
+ x
39
+ x
38
+ x
36
+ x
35
+ x
32
+ x
29
+ x
26
+ x
23
+ x
20
+ x
19
+ x
18
+ x
17
+ x
16
+ x
15
+ x
14
+ x
13
+ x
12
+ x
9
+ x
8
+ x
5
+ x
4
+ x
3
+ x
2
+ x + 1
10000000000000000000000 | 111101111101100100100100100111111111001100111111
c
quotient
= b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
c
quotient
= 0x000000000000000000000000
c
quotient
= 0
c
remainder
= b000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000000
c
remainder
= 0x000000000000000000400000
c
remainder
= x
22