• DocumentCode
    2996847
  • Title

    Versatile FPGA Architecture for Skein Hashing Algorithm

  • Author

    Webster, David M. ; Lukowiak, Marcin

  • Author_Institution
    Dept. of Comput. Eng., Rochester Inst. of Technol., Rochester, NY, USA
  • fYear
    2011
  • fDate
    Nov. 30 2011-Dec. 2 2011
  • Firstpage
    268
  • Lastpage
    273
  • Abstract
    This paper focuses on the design and analysis of a versatile Field Programmable Gate Array (FPGA) hardware for the Skein hashing algorithm. A single design capable of processing individual messages sequentially, multiple messages using pipelined architecture, or executing Skein´s tree hashing mode using the same pipelined architecture was developed for the Skein-256 version of the algorithm. Emphasis was placed on efficient use of FPGA resources and detailed performance analysis of pipelined tree hashing. The design is compared with current sequential and tree hashing FPGA implementations. The post place-and-route results show that our design achieves a maximum throughput of 1.4Gbps in sequential mode, 6.6Gbps in multiple message mode, and 6.6Gbps in tree hashing mode on a Virtex-5 FPGA and 1.5Gbps, 7.7Gbps, and 7.7Gbps on a Virtex-6 respectively.
  • Keywords
    cryptography; field programmable gate arrays; pipeline processing; Skein hashing algorithm; Skein tree hashing mode; Skein-256 version; field programmable gate array; pipelined architecture; versatile FPGA architecture; Algorithm design and analysis; Field programmable gate arrays; Hardware; Pipelines; Registers; Throughput; Vegetation; FPGA; pipelining; tree hashing; versatile;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Reconfigurable Computing and FPGAs (ReConFig), 2011 International Conference on
  • Conference_Location
    Cancun
  • Print_ISBN
    978-1-4577-1734-5
  • Type

    conf

  • DOI
    10.1109/ReConFig.2011.93
  • Filename
    6128588