loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: George I. Davida and Jeremy A. Hansen

Affiliation: Center for Cryptography, Computer and Network Security, University of Wisconsin - Milwaukee, United States

Keyword(s): Hashing, MD5, probability, SHA, striping.

Related Ontology Subjects/Areas/Topics: Cryptographic Techniques and Key Management ; Information and Systems Security ; Operating Systems Security ; Viruses and Worms

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.188.61.223

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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; ISSN 2184-3236, SciTePress, pages 364-367. DOI: 10.5220/0001414003640367

@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},
issn={2184-3236},
}

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
IS - 2184-3236
AU - I. Davida, G.
AU - A. Hansen, J.
PY - 2005
SP - 364
EP - 367
DO - 10.5220/0001414003640367
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic