Results 81 to 90 of about 4,088 (185)

A (Second) Preimage Attack on the GOST Hash Function [PDF]

open access: yes, 2008
In this article, we analyze the security of the GOST hash function with respect to (second) preimage resistance. The GOST hash function, defined in the Russian standard GOST-R 34.11-94, is an iterated hash function producing a 256-bit hash value. As opposed to most commonly used hash functions such as MD5 and SHA-1, the GOST hash function defines, in ...
Mendel, Florian   +2 more
openaire   +2 more sources

Improved Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing

open access: yesIACR Transactions on Symmetric Cryptology
The Nostradamus attack was originally proposed as a security vulnerability for a hash function by Kelsey and Kohno at EUROCRYPT 2006. It requires the attacker to commit to a hash value y of an iterated hash function H.
Xiaoyang Dong   +4 more
doaj   +1 more source

SAT-Based Space Partitioning and Applications to Ascon-Hash256 Cryptanalysis

open access: yesIACR Transactions on Symmetric Cryptology
We introduce an efficient SAT-based space partitioning technique that enables systematic exploration of large search spaces in cryptanalysis. The approach divides complex search spaces into manageable subsets through combinatorial necklace generation ...
Guozhen Liu   +4 more
doaj   +1 more source

Linear Cancellations in the MitM Attacks on Sponge Functions

open access: yesIACR Transactions on Symmetric Cryptology
At EUROCRYPT 2023, Qin et al. proposed the MitM attack framework on sponge functions by separating the message bits into two sets of neutral bits.
Lingyue Qin   +5 more
doaj   +1 more source

Quantum algorithms for hash preimage attacks

open access: yesQuantum Engineering, 2020
Ping Wang   +3 more
openaire   +1 more source

Indifferentiability of the Sponge Hash Family: New Attacks and the Optimal Construction

open access: yesIACR Transactions on Symmetric Cryptology
The sponge construction is subject to an indifferentiability security bound of c/2 bits, where c denotes the capacity. For a given b-bit permutation, the sponge construction allows sacrificing the rate r = b − c to achieve the theoretically optimal ...
Hongli Li   +3 more
doaj   +1 more source

On the Security of Split-and-Lookup-Based ZK-Friendly Primitives

open access: yesIACR Transactions on Symmetric Cryptology
Arithmetization-Oriented hash functions are optimized for their verification to be efficiently implemented within various proof systems, but they are often too slow when evaluated on a regular machine.
Antoine Bak, Léo Perrin
doaj   +1 more source

Implementation and Optimization of Zero-Knowledge Proof Circuit Based on Hash Function SM3. [PDF]

open access: yesSensors (Basel), 2022
Yang Y   +7 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy