gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000100100101010010111010111011111110110101
a = 0x0000004952ebbfb5
a = x38 + x35 + x32 + x30 + x28 + x25 + x23 + x22 + x21 + x19 + x17 + x16 + x15 + x13 + x12 + x11 + x10 + x9 + x8 + x7 + x5 + x4 + x2 + 1

b = b0000000000000000000000000010001010100110011101111010010000011000
b = 0x00000022a677a418
b = x37 + x33 + x31 + x29 + x26 + x25 + x22 + x21 + x20 + x18 + x17 + x16 + x15 + x13 + x10 + x4 + x3

  100100101010010111010111011111110110101 | 10001010100110011101111010010000011000
- 10001010100110011101111010010000011000  | 1
  --------------------------------------- |
     110000011110000001001111011110000101 |
-  00000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000000000110000011110000001001111011110000101
cremainder = 0x0000000c1e04f785
cremainder = x35 + x34 + x28 + x27 + x26 + x25 + x18 + x15 + x14 + x13 + x12 + x10 + x9 + x8 + x7 + x2 + 1