Results 81 to 90 of about 2,959 (212)

Quantum Amplitude Hash Function for Quantum Evidence Integrity

open access: yesIEEE Access
The integrity of evidence, a core principle of digital forensics, is essential for ensuring the reliability and admissibility of evidence in legal proceedings.
Donggun Lee, Hanbeom Shin, Seokhie Hong
doaj   +1 more source

Hash function based on arithmetic coding and public-key cryptography [PDF]

open access: green, 2010
René Ndoundam   +2 more
openalex   +1 more source

Secure Sensitive Data Sharing Using RSA and ElGamal Cryptographic Algorithms with Hash Functions [PDF]

open access: gold, 2022
Abidemi Emmanuel Adeniyi   +4 more
openalex   +1 more source

Skyscraper: Fast Hashing on Big Primes

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. Such hash functions are notably slow,
Clémence Bouvier   +6 more
doaj   +1 more source

Sarmal: A cryptographic hash function

open access: yes, 2020
Recent years witnessed the continuous works on analysis of cryptographic hash functions which reveal that most of them are not as secure as claimed. Wang et al. presented the first full round collisions on MD4 and RIPEMD using a new attack technique on hash functions which is based on differential cryptanalysis.
openaire   +1 more source

On graph-based cryptographic hash functions

open access: yes, 2009
Hash functions are an invaluable tool for cryptography. They must primarily satisfy collision resistance, but standardized hash functions like SHA also satisfy stronger properties needed for the wide range of their applications. The design of many hash functions including SHA is based on a compression function that is close to a block cipher and on a ...
openaire   +2 more sources

Black-Box Property of Cryptographic Hash Functions [PDF]

open access: yes, 2012
We define a new black-box property of cryptographic hash function families H :{0,1}K ×{0,1}*→{0,1}y which guarantees that for a randomly chosen hash function H K from the family, everything "non-trivial" we are able to compute having access to the key K , we can compute only with oracle access to H K . If a hash function family is pseudo-random and has
openaire   +1 more source

A New Design of Cryptographic Hash Function: Gear

open access: bronze, 2016
Abdulaziz M Alkandari   +3 more
openalex   +2 more sources

Home - About - Disclaimer - Privacy