loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 3
A Parallel Architecture for Fast Computation of Elliptic Curve Scalar Multiplication over GF(2^m)
Santa Fe, New Mexico
April 26-April 30
ISBN: 0-7695-2132-0
ASCII Text
x 
 
Nazar A. Saqib, Francisco Rodríguez-Henriquez, Arturo Díaz-Pérez, "A Parallel Architecture for Fast Computation of Elliptic Curve Scalar Multiplication over GF(2^m)," Parallel and Distributed Processing Symposium, International, vol. 4, pp. 144a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 3, 2004.
 
 
BibTex
x
 
@article{ 10.1109/IPDPS.2004.1303124,
author = {Nazar A. Saqib and Francisco Rodríguez-Henriquez and Arturo Díaz-Pérez},
title = {A Parallel Architecture for Fast Computation of Elliptic Curve Scalar Multiplication over GF(2^m)},
journal ={Parallel and Distributed Processing Symposium, International},
volume = {4},
year = {2004},
isbn = {0-7695-2132-0},
pages = {144a},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303124},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Processing Symposium, International
TI - A Parallel Architecture for Fast Computation of Elliptic Curve Scalar Multiplication over GF(2^m)
SN - 0-7695-2132-0
SP
EP
A1 - Nazar A. Saqib,
A1 - Francisco Rodríguez-Henriquez,
A1 - Arturo Díaz-Pérez,
PY - 2004
KW - null
VL - 4
JA - Parallel and Distributed Processing Symposium, International
ER -
 
Nazar A. Saqib, Instituto Politécnico Nacional
Francisco Rodríguez-Henriquez, Instituto Politécnico Nacional
Arturo Díaz-Pérez, Instituto Politécnico Nacional
This paper presents a generic parallel architecture for fast elliptic curve scalar multiplication over binary extension fields. We show how the parallel strategy followed in this work leads to high performance designs. We also implemented the proposed architecture on reconfigurable hardware devices where the predicted expeditious performance figures were actually obtained. The results achieved show that our proposed design is able to compute GF(2191) elliptic curve scalar multiplication operations in 56.44 ?Secs.
Citation:
Nazar A. Saqib, Francisco Rodríguez-Henriquez, Arturo Díaz-Pérez, "A Parallel Architecture for Fast Computation of Elliptic Curve Scalar Multiplication over GF(2^m)," ipdps, vol. 4, pp.144a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 3, 2004
Usage of this product signifies your acceptance of the Terms of Use.