loading...
An Elliptic Curve Cryptosystem Design Based on FPGA Pipeline Folding
Heraklion, Crete, Greece July 08-July 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IOLTS.2007.1513th IEEE International On-Line Testi ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Osama Al-Khaleel, Case Western Reserve University, USA
Chris Papachristou, Case Western Reserve University, USA
Francis Wolff, Case Western Reserve University, USA
Kiamal Pekmestzi, National Technical University, Greece
In this paper we present an efficient design technique for implementing the Elliptic Curve Cryptographic (ECC) Scheme in FPGAs. Our technique is based on a novel and efficient implementation of modular multiplication which is the core operation of ECC. To implement large bit-length multiplications we used a novel partitioning and pipeline folding scheme to fit at least 256-bit modular multiplications on a single Virtex-4 FPGA. Comparisons to several other schemes are presented.
Citation:
Osama Al-Khaleel, Chris Papachristou, Francis Wolff, Kiamal Pekmestzi, "An Elliptic Curve Cryptosystem Design Based on FPGA Pipeline Folding," iolts, pp.71-78, 13th IEEE International On-Line Testing Symposium (IOLTS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.