DocumentCode
2225608
Title
A Brief Look at Pairings Based Cryptography
Author
Boneh, Dan
Author_Institution
Stanford Univ., Stanford
fYear
2007
fDate
21-23 Oct. 2007
Firstpage
19
Lastpage
26
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on
Conference_Location
Providence, RI
ISSN
0272-5428
Print_ISBN
978-0-7695-3010-9
Type
conf
DOI
10.1109/FOCS.2007.51
Filename
4389476
Link To Document