Results 1 to 10 of about 156,209 (186)
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
Annales UMCS, Informatica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bilski, Tomasz +3 more
openaire +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
, 2023 AbstractHash functions are one-way functions that map arbitrary-length input to fixed-length output. Moreover, they have many cryptographic applications, such as integrity checks, password storage, and signatures. Cryptographic hash functions have some additional properties that can be formulated as hard problems: pre-image resistance, second pre-image
Urs Wagner, Thomas Lugrin
openaire +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
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 +3 more
core +5 more sources
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 ...
+16 more
core +3 more sources
Cryptographic Hash Functions: [PDF]
IEICE ESS Fundamentals Review, 2010 Cryptographic hash functions are an important tool of cryptography and play a fundamental role in efficient and secure information processing. A hash function processes an arbitrary finite length input message to a fixed length output referred to as the hash value.
Kan YASUDA, Yu SASAKI
openaire +4 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
Random Structures & Algorithms, 2000 AbstractWe define a family of functions F from a domain U to a range R to be dispersing if for every set S ⊆ U of a certain size and random h ∈ F, the expected value of ∣S∣ – ∣h[S]∣ is not much larger than the expectation if h had been chosen at random from the set of all functions from U to R.We give near‐optimal upper and lower bounds on the size of ...
openaire +2 more sources