Results 1 to 10 of about 20,342 (243)
Balanced Allocations and Double Hashing [PDF]
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2012 Further updated, small improvements/typos ...
Michael Mitzenmacher
core +5 more sources
Some Attacks Against a Double Length Hash Proposal [PDF]
Cryptography and Communications, 2005 At FSE 2005, Nandi et al proposed a method to turn an n-bit compression function into a 2n-bit compression function. In the black-box model, the security of this double length hash proposal against collision attacks is proven, if no more than Ω(22n/3) oracle queries to the underlying n-bit function are made.
Lars R. Knudsen, Frédéric Muller
+8 more sources
Double hashing technique in closed hashing search process [PDF]
IOP Conference Series: Materials Science and Engineering, 2017 The search process is used in various activities performed both online and offline, many algorithms that can be used to perform the search process one of which is a hash search algorithm, search process with hash search algorithm used in this study using double hashing technique where the data will be formed into the table with same length and then ...
Robbi Rahim +2 more
openalex +2 more sources
More analysis of double hashing [PDF]
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George S. Lueker, Mariko Molodowitch
openalex +3 more sources
Double Hashing Thresholds via Local Weak Convergence [PDF]
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2013 A lot of interest has recently arisen in the analysis of multiple-choice "cuckoo hashing" schemes. In this context, a main performance criterion is the load threshold under which the hashing scheme is able to build a valid hashtable with high probability in the limit of large systems; various techniques have successfully been used to answer this ...
Mathieu Leconte
openalex +4 more sources
Quantum Free-Start Collision Attacks on Double Block Length Hashing with Round-Reduced AES-256
IACR Transactions on Symmetric Cryptology, 2021 Recently, Hosoyamada and Sasaki (EUROCRYPT 2020), and Xiaoyang Dong et al. (ASIACRYPT 2020) proposed quantum collision attacks against AES-like hashing modes AES-MMO and AES-MP.
Amit Kumar Chauhan +2 more
doaj +3 more sources
Complexity analysis and performance of double hashing sort algorithm [PDF]
Journal of the Egyptian Mathematical Society, 2019 Sorting an array of n elements represents one of the leading problems in different fields of computer science such as databases, graphs, computational geometry, and bioinformatics. A large number of sorting algorithms have been proposed based on different strategies. Recently, a sequential algorithm, called double hashing sort (DHS) algorithm, has been
Hazem M. Bahig
openalex +3 more sources
Double-Bit Quantization for Hashing
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to its fast query speed and low storage cost. Because it is NP hard to directly compute the best binary codes for a given data set, mainstream hashing methods ...
Weihao Kong, Wu-Jun Li
openalex +3 more sources
Generic Attacks on Double Block Length Sponge Hashing
IACR Transactions on Symmetric CryptologyThe sponge construction is one of the main modes of operation for hash functions. Using a permutation of width b = r + c, the sponge construction with rate r and capacity c is indifferentiable up to Ω(2c/2) permutation calls.
Gaëtan Leurent, César Mathéus
doaj +3 more sources
The analysis of double hashing(Extended Abstract) [PDF]
Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976 In this paper we analyze the performance of a well known algorithm known as double hashing [Knuth]. In this method we probe the hash table along arithmetic progressions, where both the initial element and the increment of the progression are chosen randomly and independently depending only on the key K of the search.
Leo J. Guibas, Endre Szemerédi
openalex +2 more sources