Results 1 to 10 of about 20,505 (185)
Balanced Allocations and Double Hashing [PDF]
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014 Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +k g(x)) \bmod n$ for $k=0,1,2,...$ to
Alon N. +7 more
core +4 more sources
More Analysis of Double Hashing for Balanced Allocations [PDF]
2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 2015 With double hashing, for a key $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +i g(x)) \bmod n$ for $i=0,1,2,...$ to generate multiple hash values in the range $[0,n-1]$ from the initial two.
Mitzenmacher, Michael
core +4 more sources
The Cost of Bitcoin Mining Has Never Really Increased [PDF]
Frontiers in Blockchain, 2020 The Bitcoin network is burning a large amount of energy for mining. In this paper, we estimate the lower bound for the global mining energy cost for a period of 10 years from 2010 to 2020, taking into account changes in energy costs, improvements in ...
Yo-Der Song +3 more
doaj +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
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
+9 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 ...
Mitzenmacher, Michael +2 more
+6 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
openaire +4 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.
Knudsen, Lars R. +2 more
openaire +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.
Lueker, George S., Molodowitch, Mariko
openaire +3 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