Results 71 to 80 of about 442,051 (179)
Practical Preimage Attacks on 3-Round Keccak-256 and 4-Round Keccak[r=640, c=160]
IACR Transactions on Symmetric CryptologyRecently, 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
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 +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 +2 more
core
Improved Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
IACR Transactions on Symmetric CryptologyThe 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
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
SAT-Based Space Partitioning and Applications to Ascon-Hash256 Cryptanalysis
IACR Transactions on Symmetric CryptologyWe 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
Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019 Troika is a recently proposed sponge-based hash function for IOTA’s ternary architecture and platform, which is developed by CYBERCRYPT. In this paper, we introduce the preimage attack on 2 and 3 rounds of Troika with a divide-and-conquer approach. Instead of directly matching a given hash value, we propose equivalent conditions to determine whether a ...
LIU, Fukang, ISOBE, Takanori
openaire +4 more sources
Improved Quantum Cryptanalysis of MD5 and SHA-1
IEEE AccessMD5 and SHA-1 are widely studied hash functions in cryptanalysis, owing to their well-structured round functions and historical significance in cryptography.
Kyungbae Jang +2 more
doaj +1 more source
On the Complexity of Khovratovich et.al\u27s Preimage Attack on Edon-R
, 2009 Based on the analysis made by van Oorschot and Wiener for the complexity of parallel memoryless collision search, we show that the memoryless meet-in-the-middle attack which is one part of the whole preimage attack of Khovratovich et. al.
Rune Steinsmo Ødegård +1 more
core +1 more source
Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings [PDF]
, 2012 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