Results 21 to 30 of about 19,856 (256)
Theoretical and Experimental Analysis of Cryptographic Hash Functions
Journal of Telecommunications and Information Technology, 2019 The paper presents a theoretical introduction to the cryptographic hash function theory and a statistical experimental analysis of selected hash functions.
Jacek Tchórzewsk +1 more
doaj +1 more source
Journal of King Saud University: Computer and Information Sciences, 2020 Data Integrity is one of the primary concepts in information security. The main task of the cryptographic hash function is to assure the integrity of the transmitted data.
Mishal Almazrooie +5 more
doaj +1 more source
Non-Relaxation Deep Hashing Method for Fast Image Retrieval
IEEE Access, 2023 Deep hashing methods utilize an end-to-end framework to mutually learn feature representations and hash codes, thereby achieving a better retrieval performance.
Xiaofei Li
doaj +1 more source
ACM Journal of Experimental Algorithmics, 1997 In this paper an efficient open address hash function called exponential hashing is developed. The motivation for this hash function resulted from our ongoing efforts to apply dynamical systems theory to the study of hashing; however, the analysis conducted in this paper is primarily based on traditional number theory. Proofs of optimal table parameter
Bradley J. Smith +2 more
openaire +2 more sources
Cryptanalysis of the Tiger Hash Function [PDF]
, 2007 Tiger is a cryptographic hash function with a 192-bit hash value. It was proposed by Anderson and Biham in 1996. Recently, weaknesses have been shown in round-reduced variants of the Tiger hash function. First, at FSE 2006, Kelsey and Lucks presented a collision attack on Tiger reduced to 16 and 17 (out of 24) rounds with a complexity of about 244 and ...
Mendel, Florian, Rijmen, Vincent
openaire +2 more sources
IEEE Access, 2023 One of the first and most used hashing algorithms in blockchains is SHA-256 so the main aim of this paper is how to increase the security level of the blockchain based on the increasing hashing algorithm security.
Salwa M. Serag Eldin +7 more
doaj +1 more source
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract This research focuses on addressing the privacy issues in healthcare advancement monitoring with the rapid establishment of the decentralised communication system in the Internet of Medical Things (IoMT). An integrated blockchain homomorphic encryption standard with an in‐build supervised learning‐based smart contract is designed to improvise ...
Chandramohan Dhasarathan +7 more
wiley +1 more source
On the Indifferentiability of the Grøstl Hash Function [PDF]
, 2010 The notion of indifferentiability, introduced by Maurer et al., is an important criterion for the security of hash functions. Concretely, it ensures that a hash function has no structural design flaws and thus guarantees security against generic attacks up to the proven bounds. In this work we prove the indifferentiability of Grostl, a second round SHA-
Elena Andreeva 0001 +2 more
openaire +3 more sources
Challenging the increased resistance of regular hash functions against birthday attacks
Journal of Mathematical Cryptology, 2012 At Eurocrypt 2004, Bellare and Kohno presented the concept of a regular hash function. For a hash function to be regular, every hash value must have the same number of preimages in the domain.
Mouha Nicky, Sekar Gautham, Preneel Bart
doaj +1 more source
Hash‐One: a lightweight cryptographic hash function
IET Information Security, 2016 The increased demand for lightweight applications has triggered the need for appropriate security mechanisms in them. Lightweight cryptographic hash functions are among the major responses toward such a requirement. The authors thus have a handful of such hash functions such as QUARK, PHOTON, SPONGENT and GLUON introduced already.
Puliparambil Megha Mukundan +3 more
openaire +1 more source