http://lardbucket.org/blog/archives/2007/11/05/math-again-almost/ My Blog Thu, 28 Aug 2008 23:41:37 +0000 http://wordpress.org/?v=2.5.1 http://lardbucket.org/blog/archives/2007/11/05/math-again-almost/#comment-3963 Pseudonym Wed, 07 Nov 2007 04:17:29 +0000 http://lardbucket.org/blog/archives/2007/11/05/math-again-almost/#comment-3963 Hi. Just so you know, SSSS (like most "real" SSS implementations) doesn't work in GF(p) (think integers modulo a prime), but in GF(2^b) for some b, because that's more convenient for computers. (An element of GF(2^b) can be represented using a b-bit binary number. Note that this is <i>not</i> a "binary number", exactly, but it's an efficient <i>representation</i><i>. The distinction is important.) Near the top of ssss.c (I just looked at 0.5) is a data structure called "irred_coeff", which is for constructing GF(2^b) for various values of b. I'm going to do a blog post on Galois fields soonish on The BWAIN. I'll try to explain things in such a way that SSSS is more understandable, okay?</i> Hi. Just so you know, SSSS (like most “real” SSS implementations) doesn’t work in GF(p) (think integers modulo a prime), but in GF(2^b) for some b, because that’s more convenient for computers. (An element of GF(2^b) can be represented using a b-bit binary number. Note that this is not a “binary number”, exactly, but it’s an efficient representation. The distinction is important.)
Near the top of ssss.c (I just looked at 0.5) is a data structure called “irred_coeff”, which is for constructing GF(2^b) for various values of b.
I’m going to do a blog post on Galois fields soonish on The BWAIN. I’ll try to explain things in such a way that SSSS is more understandable, okay?

]]>