Results 1 to 10 of about 13,015 (291)
Designing Two Secure Keyed Hash Functions Based on Sponge Construction and the Chaotic Neural Network [PDF]
Entropy, 2020 In this paper, we propose, implement, and analyze the structures of two keyed hash functions using the Chaotic Neural Network (CNN). These structures are based on Sponge construction, and they produce two variants of hash value lengths, i.e., 256 and 512
Nabil Abdoun +5 more
doaj +2 more sources
Synthetic and real data sets for benchmarking non-cryptographic hash functions [PDF]
Data in Brief, 2019 The overall assessment of non-cryptographic functions is very complex and there is not a widely used benchmark. These data have been collected and created as a benchmark for testing non-cryptographic hash functions.
Yago Saez +3 more
doaj +2 more sources
Perceptual Audio Hashing Functions [PDF]
EURASIP Journal on Advances in Signal Processing, 2005 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.
Emin Anarım +3 more
doaj +4 more sources
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
openalex +4 more sources
A secure and efficient cryptographic hash function based on NewFORK-256
Egyptian Informatics Journal, 2012 Cryptographic hash functions serve as a fundamental building block of information security and are used in numerous security applications and protocols such as digital signature schemes, construction of MAC and random number generation, for ensuring data
Harshvardhan Tiwari, Krishna Asawa
doaj +2 more sources
Programmable Hash Functions and Their Applications [PDF]
Journal of Cryptology, 2008 We introduce a new information-theoretic primitive called programmable hash functions(PHFs). PHFs can be used to programthe output of a hash function such that it contains solved or unsolved discrete logarithm instances with a certain probability. This is a technique originally used for security proofs in the random oracle model.
Dennis Hofheinz, Eike Kiltz
openalex +5 more sources
Hash Functions Using Chaotic Iterations
Journal of Algorithms & Computational Technology, 2010 In this paper, a novel formulation of discrete chaotic iterations in the field of dynamical systems is given. Their topological properties are studied: it is mathematically proven that, under some conditions, these iterations have a chaotic behavior as ...
Jacques M. Bahi, Christophe Guyeux
doaj +7 more sources
IEEE Access, 2023 With the enormous growth in Internet of Things (IoT) applications, the volume of data shared among IoT devices is vastly increasing. Extensive IoT device connectivity and substantial data transmission have made information integrity susceptible to ...
Susila Windarta +6 more
doaj +1 more source
IEEE Access, 2022 In modern cryptography, hash functions are considered as one of the key components for secure communication. They play a vital role in a wide range of applications such as ensuring the authentication and integrity of the data, in forensic investigation ...
Darshana Upadhyay +3 more
doaj +1 more source
Keyed Parallel Hash Algorithm Based on Multiple Chaotic Maps (KPHA-MCM)
IEEE Access, 2021 Hash functions are considered as the core of cryptography, which are the basic technique used for data security. Cryptographic hash functions also can be used to achieve the integrity of large data such as the data stored in a hard disk and set of ...
Roayat Ismail Abdelfatah +2 more
doaj +1 more source