A Case for a parallelizable hash

Show full item record

Redirect: RIT Scholars content from RIT Digital Media Library has moved from http://ritdml.rit.edu/handle/1850/9133 to RIT Scholar Works http://scholarworks.rit.edu/other/96, please update your feeds & links!
Title: A Case for a parallelizable hash
Author: Kaminsky, Alan; Radziszowski, Stanislaw
Abstract: On November 2, 2007, NIST (United States National Institute of Standards and Technology) announced an initiative to design a new secure hash function for this century, to be called SHA-3. The competition will be open and it is planned to conclude in 2012. These developments are quite similar to the recent history of symmetric block ciphers— breaking of the DES (Data Encryption Standard) and emergence of the AES (Advanced Encryption Standard) in 2001 as the winner of a multiyear NIST competition. In this paper we make a case that parallelizability should be one of the properties sought in the new SHA-3 design. We present a design concept for a parallelizable hash function called PHASH based on a block cipher, and we discuss PHASH’s performance and security.
Description: "A Case for a parallelizable hash", Proceedings of MILCOM'2008. Held in San Diego, CA: 16-19 November 2008. ©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Record URI: http://hdl.handle.net/1850/9133
Date: 2008

Files in this item

Files Size Format View
SRadziszowskiProceedings10-2008.pdf 121.7Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML

Advanced Search