Add bloq for constant polynomial multiplication modulu in GF(2)

[NoureldinYosri]

This PR is the first PR implementing https://arxiv.org/abs/1910.02849v2. specifically this PR implements Algorithm 1: $MULT_{f(x)}$ Which I renamed to MultiplyPolyByConstantMod.

The final construction implements polyomial multiplication in GF(2) with exactly $n^{log_2(3)}$ Toffolis as opposed to the $n^2$ construction we currently have.

[NoureldinYosri]

@tanujkhattar I want to have an $n-1$ degree polynomial in GF(2) instead of a number in GF($2^n$). is there a way to do that? or do we want to use GF($2^n$) for consistancy?

[tanujkhattar]

Ops, Me and @NoureldinYosri had a discussion offline on how to modify the PR to have the right signature for galois field arithmetic. Guess I should have left a review and blocked the PR.

@NoureldinYosri Can you please open a follow-up PR to accommodate the changes that we discussed offline ?

[NoureldinYosri]

@tanujkhattar will do, it is worth mentioning that the disagreement is about the form of the input ... here I use polynomials (array of booleans) ... but the convention that qualtran adopted in the QGF dtype is of representing them as instanstances of galois.GF(...) which are essentially numbers