⇤ ← Revision 1 as of 20080916 09:33:08
878
Comment: Nadia El Mrabet abstract

← Revision 2 as of 20081114 13:41:56 ⇥
878
converted to 1.6 markup

No differences found! 
Pairings are bilinears applications that take as arguments two points on an elliptic curve and return an element of a finite field. Pairings are very useful in cryptography as they allow the construction of new protocols such as the identity based cryptography and simplify existing protocols such as short signature schemes. The aim of this talk is to review the definition of pairings and to present an implementation using the SAGE software.