Title :
A Brief Look at Pairings Based Cryptography
Author_Institution :
Stanford Univ., Stanford
Abstract :
This note provides a brief summary of how a new algebraic tool, bilinear groups, is transforming public-key cryptography. For the examples mentioned, the best solutions without bilinear groups either do not exist or are far less efficient. Many of the systems discussed in this note were implemented by Lynn [45] in a software library freely available under the GPL.
Keywords :
algebra; public key cryptography; algebraic tool; bilinear group; pairing based cryptography; public-key cryptography; Bibliographies; Computational geometry; Computer science; Elliptic curve cryptography; Elliptic curves; Galois fields; Polynomials; Public key cryptography;
Conference_Titel :
Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on
Conference_Location :
Providence, RI
Print_ISBN :
978-0-7695-3010-9
DOI :
10.1109/FOCS.2007.51