R. Granger, D. Page, M. Stam  Home/Search
Context Related
| iacr.org/2004/157.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/search...ast=365&title=1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Although identity based cryptography offers a number of functional advantages over conventional public key methods, the computational costs are significantly greater. The dominant part of this cost is the Tate pairing which, in characteristic three, is best computed using the algorithm of Duursma and Lee. (Update)
Cited by: More
FPGA Accelerated Tate Pairing Based Cryptosystems over Binary .. - Chang Shu Soonhak (2006) (Correct)
Active bibliography (related documents): More All
1.2: On Small Characteristic Algebraic Tori in Pairing-Based.. - Granger, Page, Stam (2004) (Correct)
1.0: Field Inversion and Point Halving Revisited - Fong, Hankerson, Lopez, Menezes (2003) (Correct)
0.9: Function Field Sieve in Characteristic Three - Granger, Holt, Page, Smart.. (2004) (Correct)
Similar documents based on text: More All
0.3: Fault and Side-Channel Attacks on Pairing Based Cryptography - Page, Vercauteren (2004) (Correct)
0.3: Efficient Hardware For The Tate Pairing Calculation .. - Kerins, Marnane.. (2005) (Correct)
0.2: The Vector Decomposition Problem for Elliptic and.. - Duursma, Kiyavash (2005) (Correct)
BibTeX entry: (Update)
R. Granger, D. Page, and M. Stam, "Hardware and software normal basis arithmetic for pairing based cryptography in characteristic three", IEEE Trans. on Computers, vol. 54, pp. 852--860, 2005. http://citeseer.ist.psu.edu/granger04hardware.html More
@misc{ granger05hardware,
author = "R. Granger and D. Page and M. Stam",
title = "Hardware and software normal basis arithmetic for pairing based cryptography
in characteristic three",
text = "R. Granger, D. Page, and M. Stam, Hardware and software normal basis arithmetic
for pairing based cryptography in characteristic three, IEEE Trans. on Computers,
vol. 54, pp. 852--860, 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/granger04hardware.html" }
Citations (may not include all citations):337 Identity-Based Encryption from the Weil Pairing - Boneh, Franklin - 2003
237 The Arithmetic of Elliptic Curves (context) - Silverman - 1986
201 Identity-Based Cryptosystems and Signature Schemes (context) - Shamir - 1985
193 Short signatures from the Weil Pairing - Boneh, Lynn et al. - 2001
134 Reducing Elliptic Curve Logarithms to Logarithms in a Finite.. (context) - Menezes, Okamoto et al. - 1993
73 Cryptosystems Based on Pairings (context) - Sakai, Ohgishi et al. - 2000
48 Implementing the Tate pairing (context) - Galbraith, Harrison et al. - 2002
26 Tate Pairing Implementation for Hyperelliptic Curves y = x x.. (context) - Duursma, Lee - 2003
24 Divisibility and the Discrete Logarithm Problem in the Divis.. (context) - Frey, Ruck et al. - 1994
20 VLSI Architectures for Computing Multiplications and Inverse.. (context) - Wang, Truong et al. - 1985
19 Efficient Algorithms for Pairing-Based Cryptosystems - Barreto, Kim et al. - 2002
18 A One Round Protocol for Tripartite Diffie-Hellman (context) - Joux - 2000
12 Efficient Identity based Signature Schemes based on Pairings - Hess - 2003
8 High Speed Software Multiplication in F2 m - Lopez, Dahab - 2000
7 Software Implementation of Finite Fields of Characteristic T.. (context) - Harrison, Page et al. - 2002
7 Low-Complexity Bit-Parallel Canonical and Normal Basis Multi.. - Koc, Sunar - 1998
5 A Modified Massey-Omura Parallel Multiplier for a Class for .. (context) - Hassan, Wang et al. - 1993
5 Efficient Arithmetic in Finite Field Extensions with Applica.. - Bailey, Paar - 2001
4 Storage Efficient Finite Field Basis Conversion - Jr, Yin - 1999
4 Hardware Implementation of Finite Fields of Characteristic T.. (context) - Page, Smart - 2002
3 Cryptology ePrint Archive (context) - Scott, Barreto - 2004
3 Fast Normal Basis Multiplication Using General Purpose Proce.. (context) - Reyhani-Masoleh, Hasan - 2001
3 On Small Characteristic Algebraic Tori in Pairing-Based Cryp.. - Granger, Page et al. - 2004
3 A New Construction of Massey-Omura Parallel Multiplier over .. (context) - Reyhani-Masoleh, Hassan - 2002
3 Efficient Software Implementation for Finite Field Multiplic.. - Ning, Yin - 2001
2 Arithmetic Architectures for Cryptographic Applications (context) - Bertoni, Guajardo et al. - 2003
2 Multiplication of Many-Digital Numbers by Automatic Computer.. (context) - Karatsuba, Ofman - 1963
2 Normal Bases over Finite Fields - Gao - 1993
1 Tsujii A Fast Algorithm for Computing Multiplicative Inverse.. (context) - Itoh - 1988
1 Data Structures for Parallel Exponentiation in Finite Fields (context) - Nocker - 2001
Documents on the same site (http://eprint.iacr.org/search.pl?last=365&title=1): More
Robust Software Tokens: Towards Securing a Digital Identity - Kwon (2001) (Correct)
On the Complexity of Matsui's Attack - Junod (2001) (Correct)
Constructing Pseudo-Random Permutations with a Prescribed.. - Naor, Reingold (2000) (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