Results 21 to 30 of about 10,475,631 (365)
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 +1 more source
Optimization of Tree Modes for Parallel Hash Functions: A Case Study [PDF]
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function ...
Atighehchi, Kevin, Rolland, Robert
core +1 more source
Cryptographic Hash Functions [PDF]
Cryptographic hash functions are an important tool of cryptography and play a fundamental role in efficient and secure information processing. A hash function processes an arbitrary finite length input message to a fixed length output referred to as the hash value.
Gauravaram, Praveen, Knudsen, Lars R.
openaire +3 more sources
Merkle-Damgård Construction Method and Alternatives: A Review
Cryptographic hash function is an important cryptographic tool in the field of information security. Design of most widely used hash functions such as MD5 and SHA-1 is based on the iterations of compression function by Merkle-Damgård construction method ...
Harshvardhan Tiwari
doaj +1 more source
Supervised Matrix Factorization Hashing With Quantitative Loss for Image-Text Search
Image-text hashing approaches have been widely applied in large-scale similarity search applications due to their efficiency in both search speed and storage efficiency.
Huan Zhao+3 more
doaj +1 more source
We constructed a hash function by using the idea of cayley graph, hash function based on computing a suitable matrix product in groups of the form SL2(F2 n ). We found collision between palindrome bit strings of length 2n+2 for the new construction. Here we reinforce the hash function by adding key to it and we claim that it will resists palindrome ...
K T Joju, Lilly P. L
openaire +1 more source
Multimixer-128: Universal Keyed Hashing Based on Integer Multiplication
In this paper we introduce a new keyed hash function based on 32-bit integer multiplication that we call Multimixer-128. In our approach, we follow the key-then-hash parallel paradigm. So, we first add a variable length input message to a secret key and
Koustabh Ghosh+2 more
doaj +1 more source
A new hash function and its use in read mapping on genome [PDF]
Mapping reads onto genomes is an indispensable step in sequencing data analysis. A widely used method to speed up mapping is to index a genome by a hash table, in which genomic positions of $k$-mers are stored in the table.
Farzaneh Salari+2 more
doaj +1 more source
From Graphs to Keyed Quantum Hash Functions [PDF]
We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them.
Ziatdinov, Mansur
core +2 more sources
Perceptual Audio Hashing Functions [PDF]
Perceptual hash functions provide a tool for fast and reliable identification of content. We present new audio hash functions based on summarization of the time-frequency spectral characteristics of an audio document. The proposed hash functions are based on the periodicity series of the fundamental frequency and on singular-value description of the ...
Ozer, H, Sankur, B, Memon, N, Anarim, E
openaire +4 more sources