658 search results - page 33 / 132 » The Grindahl Hash Functions |
105
Voted
ASIACRYPT
1992
Springer
15 years 4 months ago
1992
Springer
In [ZMI89,ZMI90] two constructions for a collision resistant hash function were proposed. The first scheme is based on a block cipher, and the second scheme uses modular arithmetic...
111
Voted
CHES
2010
Springer
15 years 1 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...
124
Voted
TCC
2012
Springer
13 years 8 months ago
2012
Springer
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
129
Voted
GLOBECOM
2008
IEEE
15 years 24 days 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...
165
Voted
GLOBECOM
2008
IEEE
15 years 7 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...