gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b0000000000000000000000000000000000000000000000000000000001000101
a = 0x0000000000000045
a = x
6
+ x
2
+ 1
b = b0000000000000000000000000000000000000000000000000000000000010100
b = 0x0000000000000014
b = x
4
+ x
2
1000101 | 10100 - 10100 | 1 ------- | 10101 | - 00000 | 0 - 10100 | 1 ------- | 1 |
c
quotient
= b0000000000000000000000000000000000000000000000000000000000000101
c
quotient
= 0x0000000000000005
c
quotient
= x
2
+ 1
c
remainder
= b0000000000000000000000000000000000000000000000000000000000000001
c
remainder
= 0x0000000000000001
c
remainder
= 1