Results 31 to 40 of about 5,211,169 (196)
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
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
Secure Parallel Image Cryptographic Hash Function Using a Novel 2D High-Randomness Hyperchaotic Map
MathematicsFor image data, the processing of each pixel using a cryptographic hash function is linear, and the existing cryptographic hash function lacks parallel processing of image width and height.
Mingrui Qi, Dongdong Wang
doaj +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 +4 more sources
, 2020 Examples of Grover's search algorithm for finding preimages of scaled down versions of Sponge Hash, and Blake2 Hash constructions in OpenQASM language.
Stefano Carrazza, Sergi Ramos
core +1 more source
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 +3 more sources
Bridging distributed hash tables in wireless ad-hoc networks [PDF]
, 2007 The adaptation of structured P2P networks, i.e. Distributed Hash Tables (DHTs), to wireless ad-hoc networks has been investigated in recent years. Existing work assume all peers would come to an agreement on establishing one uniform DHT across the ...
Cheng, L., Lawrence Cheng
core +1 more source
Hash Algorithm In Verification Of Certificate Data Integrity And Security
Aptisi Transactions on Technopreneurship, 2021 The hash function is the most important cryptographic primitive function and is an integral part of the blockchain data structure. Hashes are often used in cryptographic protocols, information security applications such as Digital Signatures and message ...
Muhammad Rehan Anwar +2 more
doaj +1 more source
Extended integer tent maps and dynamic hash function
Tongxin xuebao, 2010 Based on the analysis of uniform distribution property of the extended integer tent maps,a novel dynamic hash function with the output length of 160bit was constructed.In addition,the MD structure was improved so that the capacity of collision resistance
LIU Jian-dong
doaj +2 more sources