A Preliminary Exploration of Striped Hashing

@inproceedings{Davida2010APE,
  title={A Preliminary Exploration of Striped Hashing},
  author={George I. Davida and Jeremy A. Hansen},
  year={2010}
}
Hash algorithms generate a fixed-size output from a variable-size input. Typical algorithms will process every byte of the input to generate their output, which, on a very large input, can be time consuming. The hashes’ potential slowness, coupled with recently reported attacks on the MD5 and SHA-1 hash algorithms, prompted a look at hashing from a different perspective. By generating several “striped” hashes, we may speed up the hash verification by a factor of the chosen stripe size. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

MD5 to Be Considered Harmful Someday

IACR Cryptology ePrint Archive • 2004

Tree Hash EXchange format (THEX). http://www.open-content.net /specs/draft-jchapweske-thex-02.html

J. Chapweske, G. Mohr
2003

Crypto-Secure Operating Systems

G. Davida, B. Matt
In AFIPS Conf. Proc., Nat’l Comp. Conf • 1985

Similar Papers

Loading similar papers…