Results 131 to 140 of about 20,415 (157)
Some of the next articles are maybe not open access.
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 +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), 2014Hashing 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
2005In 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
2009We 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 +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
Density-Based Clustering by Double-Bit Quantization Hashing
2019Grouping data into the different parts, while the objects in the same part have the most similarity with each other and cannot belong to the other parts, called data clustering. Clustering used for data analysis in data mining, so far, many different algorithms for clustering have been offered.
Mahdieh Dehghani +2 more
openaire +1 more source
On the Prerequisite of Coprimes in Double Hashing
2019Hashing is a widely used technique for performing dictionary operations. Even though it is selected from the problem of collision, alternative hashing technique, open addressing has been developed. One such open addressing scheme, double hashing uses two hash functions to perform the search.
openaire +1 more source
Cryptanalysis of Double-trapdoor Hash Function and Multi-Trapdoor Hash Function Schemes
2021 International Conference on Networking and Network Applications (NaNA), 2021Xu An Wang, Yunxuan Su, Jindan Zhang
openaire +1 more source
Double locality sensitive hashing Bloom filter for high-dimensional streaming anomaly detection
Information Processing and Management, 2023Ruliang Xiao
exaly
Deep Learning-Based Image Retrieval With Unsupervised Double Bit Hashing
IEEE Transactions on Circuits and Systems for Video Technology, 2023Jing-Ming Guo +2 more
exaly