Results 41 to 50 of about 1,098,148 (248)
Hash Property and Fixed-Rate Universal Coding Theorems [PDF]
IEEE Transactions on Information Theory, 2010 submitted to IEEE Transactions on Information Theory, Mar. 2008.
Jun Muramatsu, Shigeki Miyake
openalex +5 more sources
Lightweight MACs from Universal Hash Functions [PDF]
, 2020 Lightweight cryptography is a topic of growing importance, with the goal to secure the communication of low-end devices that are not powerful enough to use conventional cryptography. There have been many recent proposals of lightweight block ciphers, but comparatively few results on lightweight Message Authentication Codes (MACs). Therefore, this paper
Duval, Sébastien, Leurent, Gaëtan
openaire +4 more sources
Universal classes of hash functions (Extended Abstract) [PDF]
Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77, 1977 This paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of the ...
J. Lawrence Carter, Mark N. Wegman
openalex +3 more sources
ForestDSH: a universal hash design for discrete probability distributions [PDF]
Data Mining and Knowledge Discovery, 2021 In this paper, we consider the problem of classification of $M$ high dimensional queries $y^1,\cdots,y^M\in B^S$ to $N$ high dimensional classes $x^1,\cdots,x^N\in A^S$ where $A$ and $B$ are discrete alphabets and the probabilistic model that relates data to the classes $P(x,y)$ is known.
Arash Gholami Davoodi +5 more
openaire +3 more sources
Invertible Universal Hashing and the TET Encryption Mode [PDF]
Annual International Cryptology Conference, 2007 This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using an n-bit block cipher, the resulting scheme can handle input of any bit-length between n and 2n and associated data of arbitrary length.
S. Halevi
semanticscholar +3 more sources
Fast and Powerful Hashing using Tabulation [PDF]
, 2016 Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical.
Thorup, Mikkel
core +3 more sources
On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 Cuckoo hashing, introduced by Pagh and Rodler [10], is a dynamic dictionary data structure for storing a set S of n keys from a universe U, with constant lookup time and amortized expected constant insertion time. For the analysis, space (2+e)n and Ω(log n)-wise independence of the hash functions is sufficient. In experiments mentioned in [10], several
Martin Dietzfelbinger, Ulf Schellbach
openaire +1 more source
Analysing the Performance of GPU Hash Tables for State Space Exploration [PDF]
EPTCS 263, 2017, pp. 1-15, 2017 In the past few years, General Purpose Graphics Processors (GPUs) have been used to significantly speed up numerous applications. One of the areas in which GPUs have recently led to a significant speed-up is model checking. In model checking, state spaces, i.e., large directed graphs, are explored to verify whether models satisfy desirable properties ...
arxiv +1 more source
$\varepsilon$-Almost collision-flat universal hash functions and mosaics of designs [PDF]
arXiv, 2023 We introduce, motivate and study $\varepsilon$-almost collision-flat (ACFU) universal hash functions $f:\mathcal X\times\mathcal S\to\mathcal A$. Their main property is that the number of collisions in any given value is bounded. Each $\varepsilon$-ACFU hash function is an $\varepsilon$-almost universal (AU) hash function, and every $\varepsilon ...
arxiv
More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function [PDF]
IEEE Transactions on Information Theory, Volume 62, Issue 4, 2213
- 2232 (2016), 2013 We explicitly construct random hash functions for privacy amplification (extractors) that require smaller random seed lengths than the previous literature, and still allow efficient implementations with complexity $O(n\log n)$ for input length $n$. The key idea is the concept of dual universal$_2$ hash function introduced recently.
arxiv +1 more source