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: Bill Unruh: "Re: Distribute encrypted file to large amount of users"
    Date: Thu, 29 May 2003 22:07:33 GMT
    
    

    I'm thinking of a new project for later on this summer. A nice fast
    bigpoly polynomial library maybe a worthwhile thing to have.

    Seems a couple people like LTM [hehehe mention it once on /. and get
    3600 hits within hours] so I could take what I am learning from those
    projects to make a new library.

    This library would provide for the various polynomial basis operations,
    add, sub, mult, divide, invmod, and various helper functions [degree,
    quick shifts, etc...]. Of course it would be under the TDCAL style
    license and such, etc...

    Anyways. Any interest at all in such a library?

    Tom


  • Next message: Bill Unruh: "Re: Distribute encrypted file to large amount of users"

    Relevant Pages

    • Re: [PATCH] NTP shift_right cleanup (v. A3)
      ... For fixed shifts, you can just write it as a divide; GCC will DTRT. ... send the line "unsubscribe linux-kernel" in ...
      (Linux-Kernel)
    • Re: port I/O abstraction macros
      ... but did not know how to divide ... You use arithmetic shifts where the MSB is duplicated rather than ... using a logical shift. ... so it isn't going to be very elegant if it is written ...
      (comp.arch.embedded)
    • Re: Dynamically resizing a buffer
      ... after enough years, and enough code, one largely forgets any such reasoning, all rote response really... ... I have spent years programming in assembler where I would use shifts and years spent programming in high level languages where I would not. ... A trivial mistake that does not get made if you code what you want to express instead of trying to use tricks. ... divide is for scaling. ...
      (comp.lang.c)
    • Re: binary divide by 3
      ... > I vaguely recall seeing a reference to an efficient algorithm for performing ... > a divide by 3 on processors that only have boolean ops, ... You can divide by multiplying by the reciprocal. ... This can done with shifts and adds. ...
      (comp.arch.embedded)