Results 11 to 20 of about 5,211,169 (196)
, 2009 We propose the cryptographic hash function Lane as a candidate for the SHA-3 competition organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation.
Indesteege, Sebastiaan +7 more
openaire +5 more sources
XML Data Integrity Based on Concatenated Hash Function [PDF]
, 2009 Data integrity is the fundamental for data authentication. A major problem for XML data authentication is that signed XML data can be copied to another document but still keep signature valid. This is caused by XML data integrity protecting.
Lu, Joan, Liu, Baolong, Yip, Yau Jim
core +5 more sources
Evolving hash functions by means of genetic programming [PDF]
, 2006 Proceedings of the 8th annual conference on Genetic and evolutionary computation. Seattle, Washington, USA, July 08-12, 2006The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use
Ribagorda Garnacho, Arturo +10 more
core +1 more source
The Grindahl Hash Functions [PDF]
, 2007 In this paper we propose the Grindahl hash functions, which are based on components of the Rijndael algorithm. To make collision search sufficiently difficult, this design has the important feature that no low-weight characteristics form collisions, and at the same time it limits access to the state.
Lars R. Knudsen +2 more
openaire +2 more sources
Merkle-Damgård Construction Method and Alternatives: A Review
Journal of Information and Organizational Sciences, 2017 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
IEEE Access, 2020 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
Multimixer-128: Universal Keyed Hashing Based on Integer Multiplication
IACR Transactions on Symmetric Cryptology, 2023 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
Programmable Hash Functions and Their Applications [PDF]
Journal of Cryptology, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Hofheinz (Dennis), E. Kiltz (Eike)
openaire +5 more sources
Annales UMCS, Informatica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomasz Bilski +3 more
openaire +2 more sources
A new hash function and its use in read mapping on genome [PDF]
AUT Journal of Mathematics and Computing, 2020 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