Results 181 to 190 of about 1,687 (211)
Some of the next articles are maybe not open access.
The analysis of double hashing(Extended Abstract)
Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976In 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.
Leonidas J. Guibas, Endre Szemerédi
openaire +1 more source
Double-Hashing Operation Mode for Encryption
2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC), 2017Block ciphers, hash-based encryption, and public-key ciphers are examples of data encryption techniques with different desired features. Strong block ciphers, like AES, must run in some mode of operation to encrypt data larger than the block size. Public-key ciphers, like RSA, are costly and usually used for key-sharing rather than encrypting the data ...
Sultan Almuhammadi, Ahmad Amro
openaire +1 more source
Remainder Quotient Double Hashing Technique in Closed Hashing Search Process
SSRN Electronic Journal, 2019Searching is one of the most important process in many activities to access the data or elements. It can be done both in online and offline mode. Many algorithms are used in data structure to perform search process. Hash search algorithm is one of them which are independent of the number of elements inserted into the table.
STUTI PANDEY, Abhay Kumar Agarwal
openaire +1 more source
Deep Double Center Hashing for Face Image Retrieval
2021Hashing is an effective and widely used technology for fast approximate nearest neighbor search in large-scale images. In recent years, it has been combined with a powerful feature learning model, convolutional neural network(CNN), to boost the efficiency of large-scale image retrieval. In this paper, we introduce a new Deep Double Center Hashing (DDCH)
Xin Fu, Wenzhong Wang, Jin Tang 0001
openaire +1 more source
Collision Resistant Double-Length Hashing
2010We give collision resistance bounds for blockcipher based, double-call, double-length hash functions using (k, n)-bit blockciphers with k > n. Ozen and Stam recently proposed a framework [21] for such hash functions that use 3n-to-2n-bit compression functions and two parallel calls to two independent blockciphers with 2n-bit key and n-bit block size.
Ewan Fleischmann +3 more
openaire +1 more source
Attacks on Fast Double Block Length Hash Functions
Journal of Cryptology, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lars R. Knudsen +2 more
openaire +1 more source
On optimal arrangements of keys with double hashing
Journal of Algorithms, 1985Summary: 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 +2 more sources
, 1990 Analysis of Double Block Length Hash Functions
2003The 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 +2 more
openaire +1 more source
Attacks on a double length blockcipher-based hash proposal
Cryptography and Communications, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yiyuan Luo, Xuejia Lai, Tiejun Jia
openaire +2 more sources