Results 81 to 90 of about 416,985 (179)
Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings [PDF]
We extend and improve biclique attacks, which were recently introduced for the cryptanalysis of block ciphers and hash functions. While previous attacks required a primitive to have a key or a message schedule, we show how to mount attacks on the primitives with these parameters fixed, i.e. on permutations. We introduce the concept of sliced bicliques,
openaire +3 more sources
Linear Cancellations in the MitM Attacks on Sponge Functions
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
(pseudo) preimage attack on round-reduced grstl hash function and others
The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by NIST. In this paper, we study the preimage resistance of the Grøstl hash function.
Feng Dengguo +5 more
core +1 more source
Distinguishing Attack and Second-Preimage Attack on the CBC-like MACs [PDF]
In this paper, we first present a new distinguisher on the CBC-MAC based on a block cipher in Cipher Block Chaining (CBC) mode. It can also be used to distinguish other CBC-like MACs from random functions. The main results of this paper are on the second-
Keting Jia +3 more
core +1 more source
On the Collision and Preimage Resistance of Certain Two-Call Hash Functions
In this paper we present concrete collision and preimage attacks on a large class of compression function constructions making two calls to the underlying ideal primitives.
Søren S. Thomsen +8 more
core +1 more source
Indifferentiability of the Sponge Hash Family: New Attacks and the Optimal Construction
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
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
Quantum algorithms for hash preimage attacks
Ping Wang 0005 +3 more
openaire +1 more source
Post-Quantum Secure Identity-Based Proxy Blind Signature Scheme on a Lattice. [PDF]
Li F, Yang M, Song Z, Wang P, Li G.
europepmc +1 more source
Quantum hash function based on controlled alternate lively quantum walks. [PDF]
Hou P, Shang T, Zhang Y, Tang Y, Liu J.
europepmc +1 more source

