Results 1 to 10 of about 123,105 (127)

Optimization of Tree Modes for Parallel Hash Functions: A Case Study [PDF]

, 2017
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function ...
Atighehchi, Kevin, Rolland, Robert
core   +1 more source

Evolving hash functions by means of genetic programming [PDF]

, 2006
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, Hernández, Julio C., Isasi, Pedro, Ribagorda, Arturo   +3 more
core   +5 more sources

Finding state-of-the-art non-cryptographic hashes with genetic programming [PDF]

, 2006
Proceding of: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006.The design of non-cryptographic hash functions by means of evolutionary computation is a relatively new and unexplored problem.
Estébanez Tascón, César, Hernández, Julio C., Isasi, Pedro, Ribagorda, Arturo   +3 more
core   +2 more sources

From Graphs to Keyed Quantum Hash Functions [PDF]

, 2016
We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them.
Ziatdinov, Mansur
core   +2 more sources

Regular and almost universal hashing: an efficient implementation [PDF]

, 2016
Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the ...
Ignatchenko, Sergey, Ivanchykhin, Dmytro, Lemire, Daniel   +2 more
core   +2 more sources

Grayscale Image Authentication using Neural Hashing

, 2016
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

A General Two-Step Approach to Learning-Based Hashing [PDF]

, 2013
Most existing approaches to hashing apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form.
Hengel, Anton van den, Lin, Guosheng, Shen, Chunhua, Suter, David   +3 more
core   +1 more source

Efficient computation of hashes [PDF]

, 2014
The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel ...
, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Blelloch G E, Blum M, Coron J S, Damgard I B, Hall E, Peter R Hobson, Raul H C Lopes, Ristenpart T, Sarkar P, Virginia N L Franqueira   +16 more
core   +3 more sources

Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence

, 2013
Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core   +1 more source

Bottom-k and Priority Sampling, Set Similarity and Subset Sums with Minimal Independence [PDF]

, 2013
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