William R. Speirs

Learn More
We explore the idea of creating a hash function that produces an s-bit digest from a compression function with an n-bit output, where s > n. This is accomplished by truncating a hash function with a digest size of ℓn-bits. Our work answers the question of how large ℓ can be while creating a digest of sn-bits securely. We prove that our construction is(More)
FASH is a cryptographic hash function that is more then 5 times faster then SHA1 making it more suited for large amounts of data. However, this increase in speed comes at the cost of security. Although all tests performed in this paper show that FASH is as secure as SHA1, FASH has a higher rate of collision. FASH was created as a replacement for SHA1 in(More)
  • 1