There is code to compute the Weil pairing using a gp script (written
by me) which sage includes, but at present there is no wrapper for it
to be used in Sage. Either that could be done, or someone could
rewrite that gp script in Sage.
John Cremona
--
John Cremona
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 (!)
* 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: martinr...@jabber.ccc.de
I CC'ed this so sge-devel.
John
--
John Cremona