gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b0000000000000000000000000000000000000000000000000001000000000000
a = 0x0000000000001000
a = x
12
b = b0000000000000000000000000000000000000000000001101010101111101101
b = 0x000000000006abed
b = x
18
+ x
17
+ x
15
+ x
13
+ x
11
+ x
9
+ x
8
+ x
7
+ x
6
+ x
5
+ x
3
+ x
2
+ 1
1000000000000 | 1101010101111101101
c
quotient
= b0000000000000000000000000000000000000000000000000000000000000000
c
quotient
= 0x0000000000000000
c
quotient
= 0
c
remainder
= b0000000000000000000000000000000000000000000000000001000000000000
c
remainder
= 0x0000000000001000
c
remainder
= x
12