Results 211 to 220 of about 3,836,696 (241)

External Double Hashing with Choice

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2006
A novel extension to external double hashing providing significant reduction to both successful and unsuccessful search lengths is presented. The experimental and analytical results demonstrate the reductions possible. This method does not restrict the hashing table configuration parameters and utilizes very little additional storage space per bucket ...
openaire   +2 more sources

Another Glance at Double-Length Hashing

2009
We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE '09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use one or two calls to a 2n -bit key, n -bit block blockcipher.
Parker, Matthew G., Özen, Onur, Stam, Martijn   +2 more
openaire   +3 more sources

Robust Video Hashing Based on Double-Layer Embedding

IEEE Signal Processing Letters, 2011
A robust video hashing scheme for video content identification and authentication is proposed, which is called Double-Layer Embedding scheme. Intra-cluster Locally Linear Embedding (LLE) and inter-cluster Multi-Dimensional Scaling (MDS) are used in the scheme.
Jiande Sun, Xiushan Nie, Ju Liu
exaly   +2 more sources

Attacks on Fast Double Block Length Hash Functions

Journal of Cryptology, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lars R. Knudsen, Xuejia Lai, Bart Preneel   +2 more
openaire   +1 more source

On optimal arrangements of keys with double hashing

Journal of Algorithms, 1985
Summary: Given a set of n keys, the keys are arranged in a hash table of size n such that the worst-case retrieval time is minimized. It is shown that, when double hashing is used, one can, with probability 1-o(1), arrange the keys to achieve a worst-case retrieval time O(log n). This gives a solution to an open problem of \textit{R. L.
openaire   +3 more sources

Analysis of Double Block Length Hash Functions

2003
The security of double block length hash functions and their compression functions is analyzed in this paper. First, the analysis of double block length hash functions by Satoh, Haga, and Kurosawa is investigated. The focus of this investigation is their analysis of the double block length hash functions with the rate 1 whose compression functions ...
Mitsuhiro Hattori, Shoichi Hirose, Susumu Yoshida   +2 more
openaire   +1 more source

Flexible Packet Matching with Single Double Cuckoo Hash

IEEE Communications Magazine, 2017
In modern switches, a packet can go through a number of processing steps to determine, for example, if the packet has to be discarded due to security policies, if it needs to be marked for quality of service or to determine the next hop for the packet.
Levy G, Pontarelli S, Reviriego P
openaire   +2 more sources

Attacks on a double length blockcipher-based hash proposal

Cryptography and Communications, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yiyuan Luo, Xuejia Lai, Tiejun Jia
openaire   +3 more sources

On the Security of the Double-Block-Length Hash Function NCASH

2019
In this work, we study the security analysis of a newly proposed Non-linear Cellular Automata-based Hash function, NCASH. The uncomplicated structure of this double-block-length hash function instigates us to scrutinize its construction by analyzing the security of the design.
Tapadyoti Banerjee, Dipanwita Roy Chowdhury   +1 more
openaire   +1 more source

Towards Optimal Double-Length Hash Functions

2005
In this paper we design several double length hash functions and study their security properties in the random oracle model. We design a class of double length hash functions (and compression functions) which includes some recent constructions [4,6,10] .
openaire   +1 more source