Results 31 to 40 of about 154,141 (333)
Bottom-k and Priority Sampling, Set Similarity and Subset Sums with Minimal Independence [PDF]
We consider bottom-k sampling for a set X, picking a sample S_k(X) consisting of the k elements that are smallest according to a given hash function h. With this sample we can estimate the relative size f=|Y|/|X| of any subset Y as |S_k(X) intersect Y|/k.
Thorup, Mikkel
core +1 more source
Evolving hash functions by means of genetic programming [PDF]
Proceedings of the 8th annual conference on Genetic and evolutionary computation. Seattle, Washington, USA, July 08-12, 2006The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use
Estébanez Tascón, César +3 more
core +5 more sources
Hash functions for priority queues
Summary: The complexity of priority queue operations is analyzed with respect to the cell probe computational model of \textit{A. Yao} [J. Assoc. Comput. Mach. 28, 615-628 (1981; Zbl 0462.68079)]. A method utilizing families of hash functions is developed which permits priority queue operations to be implemented in constant worst-case time provided ...
M. Fredman, János Komlós, M. Ajtai
openaire +4 more sources
Challenging the increased resistance of regular hash functions against birthday attacks
At Eurocrypt 2004, Bellare and Kohno presented the concept of a regular hash function. For a hash function to be regular, every hash value must have the same number of preimages in the domain.
Mouha Nicky, Sekar Gautham, Preneel Bart
doaj +1 more source
Hash Algorithm In Verification Of Certificate Data Integrity And Security
The hash function is the most important cryptographic primitive function and is an integral part of the blockchain data structure. Hashes are often used in cryptographic protocols, information security applications such as Digital Signatures and message ...
Muhammad Rehan Anwar +2 more
doaj +1 more source
Universal classes of hash functions
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of ...
J. Lawrence Carter, Mark N. Wegman
openaire +3 more sources
Secure Parallel Image Cryptographic Hash Function Using a Novel 2D High-Randomness Hyperchaotic Map
For image data, the processing of each pixel using a cryptographic hash function is linear, and the existing cryptographic hash function lacks parallel processing of image width and height.
Mingrui Qi, Dongdong Wang
doaj +1 more source
Grayscale Image Authentication using Neural Hashing
Many different approaches for neural network based hash functions have been proposed. Statistical analysis must correlate security of them. This paper proposes novel neural hashing approach for gray scale image authentication.
Kutlu, Yakup, Yayık, Apdullah
core +2 more sources
Cryptanalysis of the Tiger Hash Function [PDF]
Tiger is a cryptographic hash function with a 192-bit hash value. It was proposed by Anderson and Biham in 1996. Recently, weaknesses have been shown in round-reduced variants of the Tiger hash function. First, at FSE 2006, Kelsey and Lucks presented a collision attack on Tiger reduced to 16 and 17 (out of 24) rounds with a complexity of about 244 and ...
Mendel, Florian, Rijmen, Vincent
openaire +3 more sources
Discrete Semantics-Guided Asymmetric Hashing for Large-Scale Multimedia Retrieval
Cross-modal hashing technology is a key technology for real-time retrieval of large-scale multimedia data in real-world applications. Although the existing cross-modal hashing methods have achieved impressive accomplishment, there are still some ...
Jun Long +3 more
doaj +1 more source

