Results 291 to 300 of about 10,475,631 (365)
Some of the next articles are maybe not open access.
Simple hash function using discrete-time quantum walks
Quantum Information Processing, 2018Yu-Guang Yang
exaly +2 more sources
Journal of the ACM, 1999 Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Alon, Noga +4 more
openaire +2 more sources
Parallel chaotic hash function based on the shuffle-exchange network
Nonlinear Dynamics, 2015Je Sen Teh, Azman Samsudin, Amir Akhavan
exaly +2 more sources
Cryptologia, 2019
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Dhananjoy Dey +3 more
openaire +2 more sources
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Dhananjoy Dey +3 more
openaire +2 more sources
2021
So far we have studied various hash function properties as well as use cases of hash functions. When unkeyed or used with a public key, hash functions can be collision resistant, second-preimage resistant, or one-way.
Marc Fischlin, Arno Mittelbach
openaire +2 more sources
So far we have studied various hash function properties as well as use cases of hash functions. When unkeyed or used with a public key, hash functions can be collision resistant, second-preimage resistant, or one-way.
Marc Fischlin, Arno Mittelbach
openaire +2 more sources
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
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
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
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