Results 201 to 210 of about 20,342 (243)

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

Evolutionary double-pipe prefix-free hash function

Journal of Information and Optimization Sciences, 2020
Recent works have presented collision attacks based on differentiability of classical hash functions. In this article a new hash function is proposed with enhanced Merkle-Damgard construction.
openaire   +1 more source

Double hash function scheme in wireless sensor networks

2011 World Congress on Information and Communication Technologies, 2011
Wireless sensor networks are a new class of distributed systems that are an integral part of the physical space they inhabit. Key distribution plays an important role in wireless sensor networks. In WSN, node capture attack is the most series attack. The aim of this paper is to improve the resistance against the node capture attack.
T.D. Subash, C. Divya
openaire   +1 more source

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.
null Xiushan Nie, null Ju Liu, null Jiande Sun, null Wei Liu   +3 more
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

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

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