Results 21 to 30 of about 12,444 (261)

The exponential hash function

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, Gregory L. Heileman, Chaouki T. Abdallah   +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

User privacy prevention model using supervised federated learning‐based block chain approach for internet of Medical Things

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, Mohammad Kamrul Hasan, Shayla Islam, Salwani Abdullah, Shailesh Khapre, Dalbir Singh, Abdulaziz A. Alsulami, Ali Alqahtani   +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, Bart Mennink, Bart Preneel   +2 more
openaire   +3 more sources

Universal hash functions from quantum procedures

Учёные записки Казанского университета: Серия Физико-математические науки, 2020
Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power.
F.M. Ablayev, M.T. Ziatdinov
doaj   +1 more source

Fast Counterfeit RFID Tags Detection With Slot Constraints

IEEE Access, 2023
RFID tags are prone to counterfeit attacks in supply chain scenarios. The attacker often uses counterfeit tags to replace stolen tags to avoid being detected by the inventory process.
Bing Zhang, Xu Hu, Shan Gao
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, Sindhu Manayankath, Chungath Srinivasan, Madathil Sethumadhavan   +3 more
openaire   +1 more source

Integrity verification for digital Holy Quran verses using cryptographic hash function and compression

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, Azman Samsudin, Adnan Abdul-Aziz Gutub, Muhammad Syukri Salleh, Mohd Adib Omar, Shahir Akram Hassan   +5 more
doaj   +1 more source

Can There Be a Two Way Hash Function?

IEEE Access
It is computationally impossible for one-way hash functions to obtain the original data again. In this study, Two Way Hash Function (TWHF) is proposed which provides the security properties of one-way hash functions. TWHF aims to hash/encrypt and decrypt
Timucin Koroglu, Refik Samet
doaj   +1 more source

Dispersing hash functions

Random Structures & Algorithms, 2000
AbstractWe define a family of functions F from a domain U to a range R to be dispersing if for every set S ⊆ U of a certain size and random h ∈ F, the expected value of ∣S∣ – ∣h[S]∣ is not much larger than the expectation if h had been chosen at random from the set of all functions from U to R.We give near‐optimal upper and lower bounds on the size of ...
openaire   +2 more sources