• DocumentCode
    1936234
  • Title

    Scalable FPGA design and performance analysis of PHASH hashing function

  • Author

    Zalewski, Przemyslaw ; Lukowiak, Marcin ; Radziszowski, Stanis Law

  • Author_Institution
    Dept. of Comput. Eng., Rochester Inst. of Technol., Rochester, NY, USA
  • fYear
    2009
  • fDate
    25-27 June 2009
  • Firstpage
    320
  • Lastpage
    323
  • Abstract
    This paper presents an FPGA design and performance analysis of a recently proposed parallelizable hash function- PHASH. The main feature of PHASH is that it is able to process multiple data blocks at once making it suitable for achieving ultra high-performance. It utilizes the W cipher, as described in the Whirlpool hashing function at its core. A Virtex-4 FX60 FPGA was used in order to verify functionality of the implementation of the algorithm in hardware. To achieve high performance, state-of-the-art Virtex-5 LX330 FPGA was used as target platform. PHASH achieved a throughput over 15 Gbps using a single W cipher instance and 182 Gbps for 16 instances. For fair comparison of the performance of PHASH with widely accepted SHA-512 and Whirlpool hashing functions we have also developed their high performance implementations targeting the same FPGA platforms. SHA-512 implementation attained a throughput of 1828 Mbps, and Whirlpool attains 7687 Mbps.
  • Keywords
    cryptography; field programmable gate arrays; network synthesis; PHASH; Virtex-5 LX330; W cipher; Whirlpool; hashing function; performance analysis; scalable FPGA design; Circuit analysis computing; Computer science; Concurrent computing; Design engineering; Electronic mail; Field programmable gate arrays; Hardware; Integrated circuit technology; Performance analysis; Throughput; hash function; performance analysis; scalable FPGA design;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Mixed Design of Integrated Circuits & Systems, 2009. MIXDES '09. MIXDES-16th International Conference
  • Conference_Location
    Lodz
  • Print_ISBN
    978-1-4244-4798-5
  • Electronic_ISBN
    978-83-928756-1-1
  • Type

    conf

  • Filename
    5289606