Double hashing - Open Access .click

Results 1 to 10 of about 19,467 (229)

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

Some Attacks Against a Double Length Hash Proposal [PDF]

, 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
openalex +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.
Lars R. Knudsen, Xuejia Lai, Bart Preneel +2 more
openalex +3 more sources

A Security Analysis of Double-Block-Length Hash Functions with the Rate 1 [PDF]

, 2006
Shoichi Hirose
openalex +1 more source

A Double-Layer Indemnity Enhancement Using LSTM and HASH Function Technique for Intrusion Detection System [PDF]