Results 41 to 50 of about 10,388,112 (269)
A General Two-Step Approach to Learning-Based Hashing [PDF]
, 2013 Most existing approaches to hashing apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form.
Hengel, Anton van den +3 more
core +1 more source
Discrete Semantics-Guided Asymmetric Hashing for Large-Scale Multimedia Retrieval
Applied Sciences, 2021 Cross-modal hashing technology is a key technology for real-time retrieval of large-scale multimedia data in real-world applications. Although the existing cross-modal hashing methods have achieved impressive accomplishment, there are still some ...
Jun Long +3 more
doaj +1 more source
Efficient computation of hashes [PDF]
, 2014 The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel ...
+16 more
core +3 more sources
Extended integer tent maps and dynamic hash function
Tongxin xuebao, 2010 Based on the analysis of uniform distribution property of the extended integer tent maps,a novel dynamic hash function with the output length of 160bit was constructed.In addition,the MD structure was improved so that the capacity of collision resistance
LIU Jian-dong
doaj +2 more sources
A Fast Single-Key Two-Level Universal Hash Function
IACR Transactions on Symmetric Cryptology, 2017 Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty +2 more
doaj +1 more source
The breaking of the AR Hash Function [PDF]
DAIMI Report Series, 1993 <p>The AR hash function has been proposed by <em> Algorithmic Research Ltd</em>. It has been circulated in the ISO community (Working group 2, document WG2/N179), and is currently being used in practice in the German banking world. AR hash is based on DES and a variant of the CBC mode.
Damgård, Ivan Bjerre +1 more
openaire +5 more sources
Journal of King Saud University: Computer and Information Sciences, 2022 Provably secure keyless hash function uses Random Oracle (RO) or Sponge principles for the design and construction of security-centric hash algorithms. It capitalizes the aforesaid principles to produce outcomes like MD2, MD5, SHA-160, SHA-224/256, SHA ...
P. Karthik, P. Shanthi Bala
doaj
HMNT: Hash Function Based on New Mersenne Number Transform
IEEE Access, 2020 In the field of information security, hash functions are considered important as they are used to ensure message integrity and authentication. Despite various available methods to design hash functions, the methods have been proven to time inefficient ...
Ali Maetouq, Salwani Mohd Daud
doaj +1 more source
Ranking-Based Deep Hashing Network for Image Retrieval
IEEE Access, 2022 In large-scale image retrieval, the deep learning-based hashing methods have significantly progressed. However, most of the existing deep hashing methods still have the problems of low feature learning efficiency and weak ranking relationship ...
Zhisheng Zhang +5 more
doaj +1 more source
Bottom-k and Priority Sampling, Set Similarity and Subset Sums with Minimal Independence [PDF]
, 2013 We consider bottom-k sampling for a set X, picking a sample S_k(X) consisting of the k elements that are smallest according to a given hash function h. With this sample we can estimate the relative size f=|Y|/|X| of any subset Y as |S_k(X) intersect Y|/k.
Thorup, Mikkel
core +1 more source