A Brief Look at Pairings Based Cryptography

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...

Full description

Saved in:
Bibliographic Details
Published in48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) pp. 19 - 26
Main Author Boneh, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2007
Subjects
Bibliographies
Computational geometry
Computer science
Elliptic curve cryptography
Elliptic curves
Galois fields
Polynomials
Public key cryptography
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:0769530109
9780769530109
ISSN:0272-5428
DOI:10.1109/FOCS.2007.51