Results 1 to 10 of about 20,667 (230)
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
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
exaly +5 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
Load Thresholds for Cuckoo Hashing with Double Hashing
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018 In k-ary cuckoo hashing, each of cn objects is associated with k random buckets in a hash table of size n. An l-orientation is an assignment of objects to associated buckets such that each bucket receives at most l objects. Several works have determined load thresholds c^* = c^*(k,l) for k-ary cuckoo hashing; that is, for c < c^* an l-orientation ...
Michael Mitzenmacher +2 more
+6 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
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
Double-Hashing Algorithm for Frequency Estimation in Data Streams [PDF]
CoRR, 2022 Frequency estimation of elements is an important task for summarizing data streams and machine learning applications. The problem is often addressed by using streaming algorithms with sublinear space data structures. These algorithms allow processing of large data while using limited data storage.
Nikita Seleznev +2 more
openalex +3 more sources
Attacks on Fast Double Block Length Hash Functions [PDF]
Journal of Cryptology, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lars R. Knudsen +2 more
openalex +2 more sources
Quantum-inspired improved African vultures optimization algorithm for efficient placement of IoT service in edge computing environment [PDF]
Scientific ReportsThe emergence of 5G networks has led to development of Edge Computing (EC) environments, which offer improved support for applications that rely on the Internet of Things (IoT).
B. Panjavarnam +3 more
doaj +2 more sources
IACR Transactions on Symmetric CryptologyAt EUROCRYPT 2020, Hosoyamada and Sasaki proposed the first dedicated quantum collision attacks on hash functions. Their proposal presented a quantum adaptation of the rebound attack and revealed that differential trails, which have too low probability ...
Dongjae Lee, Seokhie Hong
doaj +3 more sources