Referenced Items are not available for this document.
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.
Published in:
Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on
Date of Conference: 21-23 Oct. 2007
- Page(s):
- 19 - 26
- ISSN :
- 0272-5428
- Print ISBN:
- 978-0-7695-3010-9
- INSPEC Accession Number:
- 9782505
- Conference Location :
- Providence, RI
- Digital Object Identifier :
- 10.1109/FOCS.2007.51
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
