Re: Any desires for a "big poly" polynomial basis GF(2)[x] library?
From: Tom St Denis (tomstdenis_at_iahu.ca)
Date: 05/30/03
- Next message: Ernst Lippe: "Re: Generating a large sequence of unique, random numbers"
- Previous message: Ernst Lippe: "Re: Generating a large sequence of unique, random numbers"
- In reply to: Paul Rubin: "Re: Any desires for a "big poly" polynomial basis GF(2)[x] library?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Thu, 29 May 2003 23:35:06 GMT
Paul Rubin wrote:
> Tom St Denis <tomstdenis@iahu.ca> writes:
>
>>I'm thinking of a new project for later on this summer. A nice fast
>>bigpoly polynomial library maybe a worthwhile thing to have. ...
>>
>>Anyways. Any interest at all in such a library?
>
>
> It's most interesting if it can do stuff like multivariable factoring.
> The algorithms for that are complicated, but if you make a serious try
> at implementing them you'll learn a lot of math.
I was thinking of univariate polynomial basis math, like you'd need for
most ECC systems [which don't use ONB].
Tom
- Next message: Ernst Lippe: "Re: Generating a large sequence of unique, random numbers"
- Previous message: Ernst Lippe: "Re: Generating a large sequence of unique, random numbers"
- In reply to: Paul Rubin: "Re: Any desires for a "big poly" polynomial basis GF(2)[x] library?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]