>> Right. So there should also be a polymonial modulus operator?
> 
> Indeed there is.

Ooo...

> For instance, if you consider 
> polynomials over the real numbers modulo X^2-1, you get the same 
> structure as the complex numbers (you can do a similar thing for 
> quaternions).

Aren't quaternions non-associative?

> In terms of real-world uses, iirc the polynomial modulus is valuable in 
> in information coding.  For example modular multiplication of 
> polynomials is a step in the AES cypher and a CRC checksum is 
> essentially a polynomial modulus.

...and *this* is why I can't implement AES or CRC.

-- 
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*

Post a reply to this message