gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000
a = 0x00000000000000000000000000004000
a = x
14
b = b00000000000000000000000000000000000000000000000000000000000000001001101010111010011010001110111100001100111101011100001010111111
b = 0x00000000000000009aba68ef0cf5c2bf
b = x
63
+ x
60
+ x
59
+ x
57
+ x
55
+ x
53
+ x
52
+ x
51
+ x
49
+ x
46
+ x
45
+ x
43
+ x
39
+ x
38
+ x
37
+ x
35
+ x
34
+ x
33
+ x
32
+ x
27
+ x
26
+ x
23
+ x
22
+ x
21
+ x
20
+ x
18
+ x
16
+ x
15
+ x
14
+ x
9
+ x
7
+ x
5
+ x
4
+ x
3
+ x
2
+ x + 1
100000000000000 | 1001101010111010011010001110111100001100111101011100001010111111
c
quotient
= b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
c
quotient
= 0x00000000000000000000000000000000
c
quotient
= 0
c
remainder
= b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000
c
remainder
= 0x00000000000000000000000000004000
c
remainder
= x
14