Results 201 to 210 of about 2,157,663 (242)

Double hashing

Journal of the American Society for Information Science, 1972
AbstractThis paper generalizes the direct‐chaining technique of hash coding in a manner that is useful for storing records on the basis of non‐unique search keys. Such a capability is of particular interest for library automation and information retrieval. Two hash functions are used instead of one, and to take advantage of the information contained in
openaire   +1 more source

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

Right Transfer Method Based on Double HASH Chain

Applied Mechanics and Materials, 2014
This Paper analyzes security issues during the process of the right transfer, sums up the basic needs during the transfer and the defects of existing rights transfer, and puts forward the right transfer program based on double HASH chain, which achieves the transfer of the digital right under the control of HASH Distance and meta-rights.
Ping Zhu, Mu Yao Lu
openaire   +1 more source

Double locality sensitive hashing Bloom filter for high-dimensional streaming anomaly detection

Information Processing & Management, 2023
Zhixia Zeng, Ruliang Xiao, Xinhong Lin, Tianjian Luo, Jiayin Lin   +4 more
semanticscholar   +1 more source

Chaotic Hashing Using Double Pendulum Dynamics

Traditional cryptographic hash functions rely on structured, deterministic transformations, which may limit their adaptability and unpredictability. In this work, we investigate a chaos-based hashing mechanism that leverages the nonlinear and highly sensitive dynamics of a double pendulum.
Akshaj Devireddy, Sanay Nesargi, Joshua Yoo   +2 more
openaire   +1 more source

K-means based double-bit quantization for hashing

2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP), 2014
Hashing function is an efficient way for nearest neighbor search in massive dataset because of low storage cost and low computational cost. However, it is NP hard problem to transform data points from the original space into a new hypercube space directly. Typically, the most of hashing methods choose a two-stage strategy. In the first stage, dimension
openaire   +1 more source

Asymmetric low-rank double-level cooperation for scalable discrete cross-modal hashing

Expert systems with applications, 2023
Ruihan Chen, Junpeng Tan, Yinghong Zhou, Zhijing Yang, Feiping Nie, Tianshui Chen   +5 more
semanticscholar   +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

Security of Cyclic Double Block Length Hash Functions

2009
We provide a proof of security for a huge class of double block length hash function that we will call Cyclic-DM . Using this result, we are able to give a collision resistance bound for Abreast-DM , one of the oldest and most well-known constructions for turning a block cipher with n -bit block length and 2n -bit key length into a 2n -bit ...
Ewan Fleischmann, Michael Gorski, Stefan Lucks   +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