R. Granger, N.P. Smart  Home/Search
Context
Related
| iacr.org/2006/172.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In many pairing-based protocols often the evaluation of the product of many pairing evaluations is required. In this paper we consider methods to compute such products e#ciently. Focusing on pairingfriendly fields in particular, we evaluate methods for the Weil, Tate and Ate pairing algorithms for ordinary elliptic curves at various security levels. Our operation counts indicate that the minimal cost of each additional pairing relative to the cost of one is 0.61, 0.45, and 0.43, for... (Update)
Active bibliography (related documents): More All
0.9: The Eta Pairing Revisited - Hess, Smart, Vercauteren (2006) (Correct)
0.8: High Security Pairing-Based Cryptography Revisited - Granger, Page, Smart (2006) (Correct)
0.5: Scaling Security in Pairing-Based Protocols - Scott (2005) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ granger-computing,
author = "R. Granger and N.P. Smart",
title = "On Computing Products of Pairings",
url = "citeseer.ist.psu.edu/granger06computing.html" }
Citations (may not include all citations):352 A course in computational algebraic number theory (context) - Cohen - 1993
134 Reducing elliptic curve logarithms to logarithms in a finite.. (context) - Menezes, Okamoto et al. - 1993
119 Elliptic Curves in Cryptography - Blake, Seroussi et al. - 1999
55 cient Algorithms for PairingBased Cryptosystems (context) - Barreto, Kim et al. - 2002
48 Implementing the Tate pairing (context) - Galbraith, Harrison et al. - 2002
30 Short group signatures - Boneh, Boyen et al. - 2004
29 cient identity-based encryption without random oracles (context) - Waters - 2005
25 On arithmetic weight for a general radix representation (context) - Clark, Liang - 1973
13 cient pairing computation on supersingular abelian varieties (context) - Barreto, Galbraith et al. - 2004
10 Compressed pairings - Scott, Barreto - 2004
9 Pairing-based cryptography at high security levels (context) - Koblitz, Menezes - 2005
7 On Multi-exponentiation in cryptography - Avanzi - 2002
7 and its e#cient calculation (context) - The, Pairing - 2004
4 High security pairing-based cryptography revisited - Granger, Page et al. - 2006
4 Computing the Tate Pairing (context) - Scott - 2005
3 Cryptology ePrint Archive (context) - Hess, Smart et al. - 2005
3 Identity-based encryption gone wild (context) - Abdalla, Catalano et al. - 2006
2 Processor Adequate Finite Fields) and related algebraic stru.. (context) - Avanzi, Mihailescu et al. - 2004
2 Special polynomial families for generating more suitable ell.. (context) - Duan, Cui et al. - 2005
1 A built-in decisional function and security proof of ID-base.. (context) - Cheng, Chen et al. - 2006
1 Hierarchichical identity based encryption with constant size.. (context) - Boneh, Boyen et al. - 2005
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC