DocumentCode :
2237193
Title :
Skein Tree Hashing on FPGA
Author :
Schorr, Aric ; Lukowiak, Marcin
Author_Institution :
Dept. of Comput. Eng., Rochester Inst. of Technol., Rochester, NY, USA
fYear :
2010
fDate :
13-15 Dec. 2010
Firstpage :
292
Lastpage :
297
Abstract :
This paper focuses on design and analysis of a Field Programmable Gate Array (FPGA) hardware for Skein´s tree hashing mode. Several approaches on how to modify sequential hashing cores, and create scalable control logic in order to provide for high-speed parallel hashing hardware are presented and analyzed. The results are compared to the current sequential designs of Skein, providing a complete analysis of the performance of Skein in custom FPGA hardware. The post place-and-route results show that our tree based Skein-256 design achieved a throughput of 3 Gbps using two cores, and 5.6 Gbps for four cores as compared to 1.6 Gbps for sequential systems. The design is parametrizable using leaf-size (YL), nodefanout (YF), and internal block size (ISBIT). The control logic follows the same methodology, but is designed for a specific number of cores (NCORE) to correctly handle the core assignment strategy and control.
Keywords :
cryptography; field programmable gate arrays; file organisation; Skein tree hashing mode; bit rate 1.6 Gbit/s; bit rate 3 Gbit/s; bit rate 5.6 Gbit/s; core assignment strategy; custom FPGA hardware; field programmable gate array hardware; high-speed parallel hashing hardware; internal block size; leaf-size; nodefanout; scalable control logic; sequential designs; sequential hashing cores;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Reconfigurable Computing and FPGAs (ReConFig), 2010 International Conference on
Conference_Location :
Quintana Roo
Print_ISBN :
978-1-4244-9523-8
Electronic_ISBN :
978-0-7695-4314-7
Type :
conf
DOI :
10.1109/ReConFig.2010.84
Filename :
5695321
Link To Document :
بازگشت