Results 71 to 80 of about 416,985 (179)

Practical Preimage Attacks on 3-Round Keccak-256 and 4-Round Keccak[r=640, c=160]

IACR Transactions on Symmetric Cryptology
Recently, linear structures and algebraic attacks have been widely used in preimage attacks on round-reduced Keccak. Inherited by pioneers’ work, we make some improvements for 3-round Keccak-256 and 4-round Keccak[r=640, c=160].
Xiaoen Lin, Le He, Hongbo Yu
doaj   +1 more source

Preimage Attack on Hashing with Polynomials proposed at ICISC\u2706 [PDF]

, 2006
In this paper, we suggest a preimage attack on Hashing with Polynomials \cite{Shpilrain06b}. The algorithm has $n$-bit hash output and $n$-bit intermediate state. (for example, $n=163$).
Donghoon Chang
core   +1 more source

Secure and Efficient Multi-Authority Attribute-Based Encryption Scheme From Lattices

IEEE Access, 2019
Attribute-based encryption (ABE) mechanism on lattices can against quantum attack and guarantees fine-grained access control of encrypted data, and it has been widely used in cloud computing and privacy protection.
Yuan Liu, Licheng Wang, Lixiang Li, Xixi Yan   +3 more
doaj   +1 more source

Preimage Attack on Parallel FFT-Hashing

, 2008
Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multi-permutation which helps in proving its resistance to collision attacks.
Abstract Parallel, Fft-hashing C. P. Schnorr, Donghoon Chang   +2 more
core  

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

IACR 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, Jian Guo, Shun Li, Phuong Pham, Tianyu Zhang   +4 more
doaj   +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

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

IACR 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, Shun Li, Huina Li, Weidong Qiu, Siwei Sun   +4 more
doaj   +1 more source

Preimage Attacks on 3, 4, and 5-Pass HAVAL [PDF]

, 2008
This paper proposes preimage attacks on hash function HAVAL whose output length is 256 bits. This paper has three main contributions; a preimage attack on 3-pass HAVAL at the complexity of 2225, a preimage attack on 4-pass HAVAL at the complexity of 2241, and a preimage attack on 5-pass HAVAL reduced to 151 steps at the complexity of 2241. Moreover, we
Yu Sasaki 0001, Kazumaro Aoki
openaire   +2 more sources

Improved Quantum Cryptanalysis of MD5 and SHA-1

IEEE Access
MD5 and SHA-1 are widely studied hash functions in cryptanalysis, owing to their well-structured round functions and historical significance in cryptography.
Kyungbae Jang, Hwajeong Seo, Anupam Chattopadhyay   +2 more
doaj   +1 more source

Practical (Second) Preimage Attacks on TCS_SHA-3 [PDF]

, 2013
TCS\_SHA-3 is a family of four cryptographic hash functions that are covered by an US patent (US 2009/0262925). The digest sizes are 224, 256, 384 and 512 bits.
Gautham Sekar, Soumyadeep Bhattacharya
core   +1 more source