713 search results - page 29 / 143 » Dispersing Hash Functions |
110
click to vote
CTRSA
2011
Springer
14 years 1 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
CHES
2010
Springer
14 years 10 months ago
2010
Springer
The need for lightweight (that is, compact, low-power, low-energy) cryptographic hash functions has been repeatedly expressed by application designers, notably for implementing RFI...
104
click to vote
GLOBECOM
2008
IEEE
14 years 9 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
135
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
115
click to vote
CTRSA
2007
Springer
15 years 3 months ago
2007
Springer
FORK-256 is a hash function presented at FSE 2006. Whereas SHA-like designs process messages in one stream, FORK-256 uses four parallel streams for hashing. In this article, we pre...