A Case for a parallelizable hash

Show simple item record

dc.contributor.author Kaminsky, Alan
dc.contributor.author Radziszowski, Stanisław
dc.date.accessioned 2009-04-06T21:21:58Z
dc.date.available 2009-04-06T21:21:58Z
dc.date.issued 2008
dc.identifier.citation Alan Kaminsky and Stanislaw Radziszowski. A case for a parallelizable hash. MILCOM 2008, San Diego, CA, USA, November 2008.
dc.identifier.uri http://hdl.handle.net/1850/8866
dc.description Slide presentation can be found at the following link: http://www.cs.rit.edu/~ark/20081117/slide01.html
dc.description.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 multi year 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.
dc.language.iso en_US
dc.publisher IEEE
dc.title A Case for a parallelizable hash
dc.type Article

Files in this item

Files Size Format View
AKaminskyArticle11-2008.pdf 170.6Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse