gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100
a = 0x00000000000000000000000000000004
a = x
2
b = b00000000000000000000000000000000000000000000000000000000000000000110011001110111111000100000000101000110010100001000111110110111
b = 0x00000000000000006677e20146508fb7
b = x
62
+ x
61
+ x
58
+ x
57
+ x
54
+ x
53
+ x
52
+ x
50
+ x
49
+ x
48
+ x
47
+ x
46
+ x
45
+ x
41
+ x
32
+ x
30
+ x
26
+ x
25
+ x
22
+ x
20
+ x
15
+ x
11
+ x
10
+ x
9
+ x
8
+ x
7
+ x
5
+ x
4
+ x
2
+ x + 1
100 | 110011001110111111000100000000101000110010100001000111110110111
c
quotient
= b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
c
quotient
= 0x00000000000000000000000000000000
c
quotient
= 0
c
remainder
= b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100
c
remainder
= 0x00000000000000000000000000000004
c
remainder
= x
2