On Apr 1, 12:46 pm, "John Cremona" <[EMAIL PROTECTED]> wrote:
> Sounds like a good idea, and certainly vastly better than my gp code
> which was really only a toy.
>
> I CC'ed this so sge-devel.
>
> John
>
> On 01/04/2008, Martin Albrecht <[EMAIL PROTECTED]> wrote:
>
>
>
>
>
> > Hi there,
>
> > let me (ab)use this opportunity to point to a library for doing these
> > things
> > over finite fields (for crypto) I came across by chance.
>
> > http://crypto.stanford.edu/pbc/
>
> > PBC stands for Pairing-Based Cryptography and is a library for ... well ...
> > pairings in cryptography (where everybody is pretty crazy about pairings
> > these days). The focus seems to be 'industrial' applications rather than
> > research (playing around).
>
> > It is
> > * GPL v3 (!)
I took a look at the sources and it really is GPL V3. The author made
the switch from 0.4.15 to 0.4.16. Maybe we could ask nicely for GPL V2
or V3. Looking at http://crypto.stanford.edu/pbc/links.html the author
is aware of Sage, so let's give it a try. The code is small, i.e.
0.5MB compressed and even has an MSVC port!
> > * well documented: reference manual, tutorial, examples
> > * small: 500k
> > * used by a couple of applications
> > * claimed to be fast: I have no idea how fast 'fast' should be though
>
> > So if you care about pairings, it might be worth a look/wrap etc.
>
> > Cheers,
> > Martin
>
> > PS: The PBC website links to Sage btw.
>
> > --
> > name: Martin Albrecht
> > _pgp:http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
> > _www:http://www.informatik.uni-bremen.de/~malb
> > _jab: [EMAIL PROTECTED]
>
> --
> John Cremona
Cheers,
Michael
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
