2020-04-03 03:09:54 -0500 | received badge | ● Notable Question (source) |

2018-12-30 06:33:55 -0500 | received badge | ● Popular Question (source) |

2017-09-04 03:23:32 -0500 | asked a question | calculating the modulo of a "number" in a binary finite field Polynomial equations in binary finite fields are often represented as numbers. eg. $x^2 + 1$ is basically the same thing as $1x^2 + 0x^1 + 1x^0$ and thus would be represented as $101_2$ or $5_{10}$. In that spirit I'm trying to use a hexadecimal number to represent a polynomial equation. The polynomial equation is larger than the modulo I'm using ($x^{113} + x^9 + 1$) so I'm trying to get the result of the modulo operation. Here's what I've tried: Unfortunately, this doesn't seem to work and instead gets me the following error messages: I realize that what I'm doing isn't technically a finite field but idk how else I might get a "number" turned into a polynomial equation. Any ideas? |

2017-09-04 03:23:31 -0500 | asked a question | pre-reduction multiplication result in binary field The following will do multiplication in a finite field: The problem with this is that the result you get back has had the reduction step already ran. I'd like to see the multiplication result pre-reduction. Any ideas? |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.