A PRELIMINARY EXPLORATION OF STRIPED HASHING - A probabilistic scheme to speed up existing hash algorithms

George I. Davida, Jeremy A. Hansen

Abstract

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.

References

  1. Chapweske, J. and Mohr, G., 2003. Tree Hash EXchange format (THEX). http://www.open-content.net /specs/draft-jchapweske-thex-02.html
  2. Davida, G. and Matt, B., 1985. Crypto-Secure Operating Systems. In AFIPS Conf. Proc., Nat'l Comp. Conf.
  3. Davida, G., Desmedt, Y., and Matt, B., 1989. Defending Systems Against Viruses Through Cryptographic Authentication. In Rogue Programs: Viruses, Worms and Trojan Horses, Van Nostrand Reinhold. New York.
  4. Ganesan, P., Venugopalan, R., Peddabachagari, P., Dean, A., Mueller, F., and Sichitiu, M., 2003. Analyzing and Modeling Encryption Overhead for Sensor Network Nodes. In Proc. 2nd ACM Int'l Conf. Wireless Sensor Networks & Appl.
  5. Hansen, J., 2005. Cryptographic Authentication of Processes and Files to Protect a Trusted Base. Unpublished Master's thesis, University of Wisconsin, Milwaukee.
  6. Kaminsky, D., 2004. MD5 To Be Considered Harmful Someday. http://www.doxpara.com/md5_someday.pdf
  7. Kim, G. and Spafford, E., 1994. The Design and Implementation of Tripwire: A File System Integrity Checker. In Proc. 2nd ACM Conf. Comp. and Comm. Security.
  8. Menezes, A., van Oorschot, P., and Vanstone, S., 2001. Handbook of Applied Cryptography, CRC Press. Boca Raton, FL, 5th Printing.
  9. Naor, M. and Yung, M., 1989. Universal One-Way Hash Functions and their Cryptographic Applications. In Proc. 21st Ann. ACM Symp. Theory of Comp.
  10. Schneier, B., 1996. Applied Cryptography, John Wiley and Sons, Inc. New York, NY, 2nd Edition.
  11. Touch, J., 1995. Performance Analysis of MD5. In Proc. ACM SIGCOMM 7895 Conf. Appl., Tech., Arch., & Prot. for Comp. Comm.
Download


Paper Citation


in Harvard Style

I. Davida G. and A. Hansen J. (2005). A PRELIMINARY EXPLORATION OF STRIPED HASHING - A probabilistic scheme to speed up existing hash algorithms . In Proceedings of the Second International Conference on e-Business and Telecommunication Networks - Volume 1: ICETE, ISBN 972-8865-32-5, pages 364-367. DOI: 10.5220/0001414003640367


in Bibtex Style

@conference{icete05,
author={George I. Davida and Jeremy A. Hansen},
title={A PRELIMINARY EXPLORATION OF STRIPED HASHING - A probabilistic scheme to speed up existing hash algorithms},
booktitle={Proceedings of the Second International Conference on e-Business and Telecommunication Networks - Volume 1: ICETE,},
year={2005},
pages={364-367},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001414003640367},
isbn={972-8865-32-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on e-Business and Telecommunication Networks - Volume 1: ICETE,
TI - A PRELIMINARY EXPLORATION OF STRIPED HASHING - A probabilistic scheme to speed up existing hash algorithms
SN - 972-8865-32-5
AU - I. Davida G.
AU - A. Hansen J.
PY - 2005
SP - 364
EP - 367
DO - 10.5220/0001414003640367