title: Multiplying two polynomials
body: <p>This is a question asked in some interview questions.</p>
  
  <p>Given three polynomials f(x), g(x), h(x) where the co-efficient are binary. Give [f(x)*g(x)] mod h(x) [All operation in binary co-efficient]</p>
  
  <p>Polynomials are given in this format… x3 + x + 1 is given as “1011”. Write a program char* multmod (char *f, char *g, char *h) that will output polynomial… (f*g) mod h </p>
  
  <p>What could be the approach?
  can we do something at bit level?</p>