Results 31 to 40 of about 123,105 (127)
Universal classes of hash functions
Journal of Computer and System Sciences, 1979 AbstractThis 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 ...
J. Lawrence Carter, Mark N. Wegman
openaire +2 more sources
, 2009 We propose the cryptographic hash function Lane as a candidate for the SHA-3 competition organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation.
Indesteege, Sebastiaan +7 more
openaire +2 more sources
Energy Consumption of Hash Functions
Electronics and Electrical Engineering, 2012 We analyse energy efficiency versus quality characteristics of hashing algorithms in a mobile device and describe methodologies for energy measurement on a Java-enabled smart phone. Energy efficiency of 17 hash functions (Adler32, Crc16, Crc32, Haval256, MD2, MD4, MD5, MD6, SHA1, SHA224, SHA256, SHA384, SHA512, Skein, SV1, Tiger, Whirlpool) is ...
Damasevicius, R. +4 more
openaire +3 more sources
Hashing with binary autoencoders
, 2015 An attractive approach for fast search in image databases is binary hashing, where each high-dimensional, real-valued image is mapped onto a low-dimensional, binary vector and the search is done in this binary space.
Carreira-Perpiñán, Miguel Á. +1 more
core +1 more source
Analysis of hash function of Yi and Lam
Electronics Letters, 1998 A block cipher based hash function of Yi and Lam is analysed and shown to be significantly weaker than originally intended.
Martin, Keith M., Mitchell, Chris J
openaire +10 more sources
Hashing for Similarity Search: A Survey [PDF]
, 2014 Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database.
Ji, Jianqiu +3 more
core
Open problems in hash function security [PDF]
Designs, Codes and Cryptography, 2015 A cryptographic hash function compresses arbitrarily long messages to digests of a short and fixed length. Most of existing hash functions are designed to evaluate a compression function with a finite domain in a mode of operation, and the compression function itself is often designed from block ciphers or permutations.
Andreeva, Elena +2 more
openaire +2 more sources
PPP-Completeness with Connections to Cryptography [PDF]
, 2018 Polynomial Pigeonhole Principle (PPP) is an important subclass of TFNP with profound connections to the complexity of the fundamental cryptographic primitives: collision-resistant hash functions and one-way permutations.
Sotiraki, Katerina +2 more
core +1 more source
$\varepsilon$-Almost collision-flat universal hash functions and mosaics of designs
, 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.
Boche, Holger, Wiese, Moritz
core
, 2016 We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$ the expected ...
Knudsen, Mathias Bæk Tejs
core +1 more source