Barreto, Paulo S.L.M., Kim, Hae Y., Lynn, Ben and Scott, Michael (2002) Efficient algorithms for pairing-based cryptosystems. In: Crypto 2002, 18-22 August 2002, Santa Barbara, California, USA. ISBN 978-3-540-44050-5
Abstract
We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable
to that of RSA in larger characteristics.We also propose faster algorithms for scalar multiplication in characteristic 3 and square root extraction
over Fpm, the latter technique being also useful in contexts other than that of pairing-based cryptography.
Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Event Type: | Conference |
| Refereed: | Yes |
| Subjects: | Computer Science > Computer security |
| DCU Faculties and Centres: | DCU Faculties and Schools > Faculty of Engineering and Computing > School of Computing |
| Published in: | Advances in Cryptology. Lecture Notes in Computer Science 2442. Springer-Verlag. ISBN 978-3-540-44050-5 |
| Publisher: | Springer-Verlag |
| Official URL: | http://dx.doi.org/10.1007/3-540-45708-9_23 |
| Copyright Information: | The original publication is available at www.springerlink.com |
| Use License: | This item is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 3.0 License. View License |
| ID Code: | 15046 |
| Deposited On: | 21 Dec 2009 14:09 by Michael Scott . Last Modified 19 Jul 2018 14:49 |
Documents
Full text available as:
Preview |
PDF
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
235kB |
Downloads
Downloads
Downloads per month over past year
Archive Staff Only: edit this record