gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b0000000000000000000000000000000000000000000000000001011100010011
a = 0x0000000000001713
a = x
12
+ x
10
+ x
9
+ x
8
+ x
4
+ x + 1
b = b0000000000000000000000000000000000000000000000000000100001100111
b = 0x0000000000000867
b = x
11
+ x
6
+ x
5
+ x
2
+ x + 1
1011100010011 | 100001100111 - 100001100111 | 1 ------------- | 11111011101 | - 000000000000 | 0
c
quotient
= b0000000000000000000000000000000000000000000000000000000000000010
c
quotient
= 0x0000000000000002
c
quotient
= x
c
remainder
= b0000000000000000000000000000000000000000000000000000011111011101
c
remainder
= 0x00000000000007dd
c
remainder
= x
10
+ x
9
+ x
8
+ x
7
+ x
6
+ x
4
+ x
3
+ x
2
+ 1