gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000
a = 0x00000000000000004000000000000000
a = x62

b = b00000000000000000000000000000000000000000000000000000000000000000110011001110111111000100000000101000110010100001000111110110111
b = 0x00000000000000006677e20146508fb7
b = x62 + x61 + x58 + x57 + x54 + x53 + x52 + x50 + x49 + x48 + x47 + x46 + x45 + x41 + x32 + x30 + x26 + x25 + x22 + x20 + x15 + x11 + x10 + x9 + x8 + x7 + x5 + x4 + x2 + x + 1

  100000000000000000000000000000000000000000000000000000000000000 | 110011001110111111000100000000101000110010100001000111110110111
- 110011001110111111000100000000101000110010100001000111110110111 | 1
  --------------------------------------------------------------- |
   10011001110111111000100000000101000110010100001000111110110111 |

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
cquotient = 0x00000000000000000000000000000001
cquotient = 1

cremainder = b00000000000000000000000000000000000000000000000000000000000000000010011001110111111000100000000101000110010100001000111110110111
cremainder = 0x00000000000000002677e20146508fb7
cremainder = x61 + x58 + x57 + x54 + x53 + x52 + x50 + x49 + x48 + x47 + x46 + x45 + x41 + x32 + x30 + x26 + x25 + x22 + x20 + x15 + x11 + x10 + x9 + x8 + x7 + x5 + x4 + x2 + x + 1