gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000
a = 0x00000000000000000000000000100000
a = x
20
b = b00000000000000000000000000000000000000000000000000000000000000001101111001110000111011101111011111000001100011111011011110011011
b = 0x0000000000000000de70eef7c18fb79b
b = x
63
+ x
62
+ x
60
+ x
59
+ x
58
+ x
57
+ x
54
+ x
53
+ x
52
+ x
47
+ x
46
+ x
45
+ x
43
+ x
42
+ x
41
+ x
39
+ x
38
+ x
37
+ x
36
+ x
34
+ x
33
+ x
32
+ x
31
+ x
30
+ x
24
+ x
23
+ x
19
+ x
18
+ x
17
+ x
16
+ x
15
+ x
13
+ x
12
+ x
10
+ x
9
+ x
8
+ x
7
+ x
4
+ x
3
+ x + 1
100000000000000000000 | 1101111001110000111011101111011111000001100011111011011110011011
c
quotient
= b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
c
quotient
= 0x00000000000000000000000000000000
c
quotient
= 0
c
remainder
= b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000
c
remainder
= 0x00000000000000000000000000100000
c
remainder
= x
20