Results 81 to 90 of about 442,051 (179)

Preimage Attacks against PKC98-Hash and HAS-V

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
We propose preimage attacks against PKC98-Hash and HAS-V. PKC98-Hash is a 160-bit hash function proposed at PKC 1998, and HAS-V, a hash function proposed at SAC 2000, can produce hash values of 128+32k (k = 0, 1,..., 6) bits. These hash functions adopt the Merkle-Damgard and Davies-Meyer constructions.
Yu Sasaki 0001, Florian Mendel, Kazumaro Aoki   +2 more
openaire   +2 more sources

Linear Cancellations in the MitM Attacks on Sponge Functions

IACR 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, Boxin Zhao, Qingliang Hou, Keting Jia, Gaoli Wang, Xiaoyang Dong   +5 more
doaj   +1 more source

Distinguishing Attack and Second-Preimage Attack on the CBC-like MACs [PDF]

, 2009
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, Xiaoyun Wang, Guangwu Xu, Zheng Yuan   +3 more
core   +1 more source

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

IACR 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, Changlun Li, Honggang Hu, Fengmei Liu   +3 more
doaj   +1 more source

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

IACR 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

On the Collision and Preimage Resistance of Certain Two-Call Hash Functions

, 2010
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, Praveen Gauravaram, Naderi, Majid, Nasour Bagheri, Gauravaram, Praveen, Majid Naderi, Thomsen, Søren S., Thomsen, Søren Steffen, Bagheri, Nasour   +8 more
core   +1 more source

Post-Quantum Secure Identity-Based Proxy Blind Signature Scheme on a Lattice. [PDF]

Entropy (Basel), 2023
Li F, Yang M, Song Z, Wang P, Li G.
europepmc   +1 more source

(Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others (Extended Version) [PDF]

, 2012
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.
Shuang Wu, Dengguo Feng, Jian Guo, Jian Zou, Wenling Wu, Le Dong   +5 more
core   +1 more source

Quantum hash function based on controlled alternate lively quantum walks. [PDF]

Sci Rep, 2023
Hou P, Shang T, Zhang Y, Tang Y, Liu J.
europepmc   +1 more source

(pseudo) preimage attack on round-reduced grstl hash function and others

, 2012
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, Zou Jian, Guo Jian, Wu Shuang, Dong Le, Wu Wenling   +5 more
core   +1 more source