I’m working through blockbreakers.

I’m currently stuck trying to figure out how to get a polynomial modulo working.

The big challenge of today was figuring out how to manipulate java bytes. I opted for sequences of 8 bits for now. It’s easy enough to reason about this way. But I would love to update my data model to be integers at some point.

I’m currently stuck on how to do polynomial division. There’s definitely a trick to it that I’m not seeing because in the look up table that the site provides for this section, there’s a modulo ring pattern. Which makes sense since the division is to calculate the modulo by the “zero” polynomial, but the actual mechanics are not clear right now.