On Mar 5, 2009, at 9:52 AM, Ryan Hinton wrote:
> William Stein wrote:
>> On Mon, Mar 2, 2009 at 4:11 PM, Carl Witty
>> wrote:
>>> On Mon, Mar 2, 2009 at 3:35 PM, William Stein
>>> wrote:
On Mon, Mar 2, 2009 at 2:07 PM, Ryan Hinton
wrote:
> ...
> So I'm trying to impleme
William Stein wrote:
> On Mon, Mar 2, 2009 at 4:11 PM, Carl Witty wrote:
>> On Mon, Mar 2, 2009 at 3:35 PM, William Stein wrote:
>>> On Mon, Mar 2, 2009 at 2:07 PM, Ryan Hinton wrote:
...
So I'm trying to implement a search
algorithm similar to [1] for arbitrary word widths. S
On Mon, Mar 2, 2009 at 4:11 PM, Carl Witty wrote:
>
> On Mon, Mar 2, 2009 at 3:35 PM, William Stein wrote:
>>
>> On Mon, Mar 2, 2009 at 2:07 PM, Ryan Hinton wrote:
>>> ...
>>> So I'm trying to implement a search
>>> algorithm similar to [1] for arbitrary word widths. Since the theory is
>>> ba
On Mon, Mar 2, 2009 at 3:35 PM, William Stein wrote:
>
> On Mon, Mar 2, 2009 at 2:07 PM, Ryan Hinton wrote:
>> ...
>> So I'm trying to implement a search
>> algorithm similar to [1] for arbitrary word widths. Since the theory is
>> based on matrices and polynomials over GF(2), Sage seems a good
On Mon, Mar 2, 2009 at 2:07 PM, Ryan Hinton wrote:
>
> Here's the quick story. I'm working on a pseudo-random number
> generator, and I'm open to suggestions on where to put the resulting
> file(s). I am more interested in the theory for finding new generators
> than in making this generator av
