Tobin, R. Joshua and Malone, David (2012) Hash Pile Ups: Using Collisions to Identify Unknown Hash Functions. In: 7th International Conference on Risk and Security of Internet and Systems (CRiSIS) 2012. IEEE, pp. 1-6. ISBN 978-1-4673-3087-9
Preview
DM-Hash-Pile-ups.pdf
Download (135kB) | Preview
Abstract
Hash functions are often used to consistently assign
objects to particular resources, for example to load balancing
in networks. These functions can be randomly selected from a
family, to prevent attackers generating many colliding objects,
which usually results in poor performance.We describe a number
of attacks allowing us to identify which hash function from a
family is being used by observing a relatively small number of
collisions. This knowledge can then be used to generate a large
number of colliding inputs. In particular we detail attacks against
small families of hashes, Pearson-like hash functions and linear
hashes, such as the Toeplitz hash used in Microsoft’s Receive
Side Scaling.
Item Type: | Book Section |
---|---|
Additional Information: | This is the postprint version of the paper, which is available at DOI: 10.1109/CRISIS.2012.6378946 . This work was supported by Science Foundation Ireland grant 08/SRC/I1403 and 07/SK/I1216a. |
Keywords: | Has piles; computer network security; cryptography; resource allocation; statistical analysis; |
Academic Unit: | Faculty of Science and Engineering > Research Institutes > Hamilton Institute |
Item ID: | 6011 |
Identification Number: | 10.1109/CRISIS.2012.6378946 |
Depositing User: | Dr. David Malone |
Date Deposited: | 09 Apr 2015 14:13 |
Publisher: | IEEE |
Refereed: | Yes |
Funders: | Science Foundation Ireland (SFI) |
Related URLs: | |
URI: | https://mu.eprints-hosting.org/id/eprint/6011 |
Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
Downloads
Downloads per month over past year