Results 161 to 170 of about 1,519 (199)

Double-Hashing Operation Mode for Encryption

2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC), 2017
Block 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

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   +1 more source

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   +2 more sources

Collision Resistant Double-Length Hashing

2010
We 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, Christian Forler, Michael Gorski, Stefan Lucks   +3 more
openaire   +1 more source

Deep Double Center Hashing for Face Image Retrieval

2021
Hashing 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

Double-Coding Density Sensitive Hashing

2017
This paper proposes a double-coding density sensitive hashing (DCDSH) method. DCDSH accomplishes approximate nearest neighbor (ANN) search tasks based on its double coding scheme. First, DCDSH generates real-valued hash codes by projecting objects along the principle hyper-planes.
Xiaoliang Tang, Xing Wang 0002, Di Jia, Weidong Song, Xiangfu Meng   +4 more
openaire   +1 more source

Remainder Quotient Double Hashing Technique in Closed Hashing Search Process

SSRN Electronic Journal, 2019
Searching 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

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   +2 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