gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000001010010111001011011101011101001001100001
a = 0x000000a5cb75d261
a = x39 + x37 + x34 + x32 + x31 + x30 + x27 + x25 + x24 + x22 + x21 + x20 + x18 + x16 + x15 + x14 + x12 + x9 + x6 + x5 + 1

b = b0000000000000000000000000100100110001101100100000101011010000110
b = 0x000000498d905686
b = x38 + x35 + x32 + x31 + x27 + x26 + x24 + x23 + x20 + x14 + x12 + x10 + x9 + x7 + x2 + x

  1010010111001011011101011101001001100001 | 100100110001101100100000101011010000110
- 100100110001101100100000101011010000110  | 1
  ---------------------------------------- |
    11011011010000010101010111111101101101 |
-  000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000000011011011010000010101010111111101101101
cremainder = 0x00000036d0557f6d
cremainder = x37 + x36 + x34 + x33 + x31 + x30 + x28 + x22 + x20 + x18 + x16 + x14 + x13 + x12 + x11 + x10 + x9 + x8 + x6 + x5 + x3 + x2 + 1