Results 291 to 300 of about 154,141 (333)
Some of the next articles are maybe not open access.
Collections of Functions for Perfect Hashing
SIAM Journal on Computing, 1986Summary: Hashing techniques for accessing a table without searching it are usually designed to perform efficiently on the average over all possible contents of the table. If the table contents are known in advance, we might be able to choose a hashing function with guaranteed efficient (worst-case) performance.
Berman, Francine +4 more
openaire +3 more sources
Cryptographic Hash Functions [PDF]
, 2001 In this chapter, we discuss cryptographic hash functions. They are used, for example, in digital signatures. Throughout this chapter, we assume that Σ is an alphabet.
openaire +1 more source
Trapdoor Hash Functions and Their Applications
2019We introduce a new primitive, called trapdoor hash functions (TDH), which are hash functions H : {0, 1}n → {0, 1} λ with additional trapdoor function-like properties. Specifically, given an index i ∈ [n], TDHs allow for sampling an encoding key ek (that hides i) along with a corresponding trapdoor.
Dottling N. +5 more
openaire +3 more sources
Choosing Best Hashing Strategies and Hash Functions [PDF]
2009 IEEE International Advance Computing Conference, 2009 The paper gives the guideline to choose a best suitable hashing method hash function for a particular problem. After studying the various problem we find some criteria has been found to predict the best hash method and hash function for that problem. We present six suitable various classes of hash functions in which most of the problems can find their ...
Deepak Garg, Mahima Singh
openaire +1 more source
Journal of Information and Optimization Sciences, 2001
RC6 was a candidate encryption algorithm for AES selections which emphasizes on the security, simplicity and performance of the algorithm. The round keys of RC6 are generated from the input key words by a certain amount of “one-way” according to the authors’ claims.
Yi-Shiung Yeh, Jue-Sam Chou
openaire +2 more sources
RC6 was a candidate encryption algorithm for AES selections which emphasizes on the security, simplicity and performance of the algorithm. The round keys of RC6 are generated from the input key words by a certain amount of “one-way” according to the authors’ claims.
Yi-Shiung Yeh, Jue-Sam Chou
openaire +2 more sources
Learning to hash: forgiving hash functions and applications
Data Mining and Knowledge Discovery, 2008The problem of efficiently finding similar items in a large corpus of high-dimensional data points arises in many real-world tasks, such as music, image, and video retrieval. Beyond the scaling difficulties that arise with lookups in large data sets, the complexity in these domains is exacerbated by an imprecise definition of similarity. In this paper,
Shumeet Baluja, Michele Covell
openaire +2 more sources
2019
The main topic of this book is implementing hash tables; it’s only secondarily about hash functions. This is why you have assumed a priori that you have uniformly distributed hash keys. In reality, this is unlikely to be the case; real data are rarely random samples from the space of possible data values.
openaire +2 more sources
The main topic of this book is implementing hash tables; it’s only secondarily about hash functions. This is why you have assumed a priori that you have uniformly distributed hash keys. In reality, this is unlikely to be the case; real data are rarely random samples from the space of possible data values.
openaire +2 more sources
1996
We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
Shahram Bakhtiari +2 more
openaire +2 more sources
We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
Shahram Bakhtiari +2 more
openaire +2 more sources
IEEE Transactions on Computers, 2005
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Vandierendonck, Hans, De Bosschere, K.
openaire +2 more sources
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Vandierendonck, Hans, De Bosschere, K.
openaire +2 more sources
Hash functions and Cayley graphs
Designs, Codes and Cryptography, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources