Results 11 to 20 of about 1,630,039 (238)
Search framework for neutral bits and boomerangs in SHA‐1 collision attacks [PDF]
IET Information Security, 2023 Neutral bits and boomerangs are key techniques for accelerating collision search in SHA‐1 attacks. The current acceleration techniques for SHA‐1 near‐collision attacks are reviewed and a generic search framework for neutral bits and boomerangs is ...
Degang Li, Yang Yang, Guang Zeng
doaj +2 more sources
Chosen-Key Distinguishers on 12-Round Feistel-SP and 11-Round Collision Attacks on Its Hashing Modes
IACR Transactions on Symmetric Cryptology, 2016 Since Knudsen and Rijmen proposed the known-key attacks in ASIACRYPT 2007, the open-key model becomes more and more popular. As the other component of the open-key model, chosen-key model was applied to the full attacks on AES-256 by Biryukov et al.
Xiaoyang Dong, Xiaoyun Wang
doaj +3 more sources
Adaptive Chosen-Plaintext Collision Attack on Masked AES in Edge Computing
IEEE Access, 2019 Edge computing handles delay-sensitive data and provides real-time feedback, while it brings data security issues to edge devices (such as IoT devices and edge servers). Side-channel attacks main threaten to these devices.
Yaoling Ding +5 more
doaj +2 more sources
An Efficient Collision Power Attack on AES Encryption in Edge Computing
IEEE Access, 2019 Edge computing has become a promising paradigm for the context-aware and delay-sensitive IoT data analytics. For the sake of security, some cryptographic algorithms such as AES, RSA, and so on, are employed for the encryption communication and ...
Yongchuan Niu +3 more
doaj +2 more sources
Collision Attack on XTR and a Countermeasure with a Fixed Pattern [PDF]
, 2005 Recently, XTR is considered as one of good candidates for more energy efficient cryptosystems. Among the family of XTR algorithms, the Improved XTR Single Exponentiation (XTR-ISE) is the most efficient one suitable for ubiquitous computer. Even though the security of such devices against side channel attacks is very dangerous, there are few works on ...
Dong‐Guk Han +4 more
openalex +4 more sources
Collision attack on reduced-round Camellia [PDF]
Science in China Series F, 2005 Camellia is the final winner of 128-bit block cipher in NESSIE. In this paper, we construct some efficient distinguishers between 4-round Camellia and a random permutation of the blocks space. By using collision-searching techniques, the distinguishers are used to attack on 6, 7, 8 and 9 rounds of Camellia with 128-bit key and 8, 9 and 10 rounds of ...
Wenling Wu, Dengguo Feng
openalex +3 more sources
Collision Attack on 5 Rounds of Grøstl [PDF]
Fast Software Encryption Workshop, 2014 In this article, we describe a novel collision attack for up to 5 rounds of the Grostl hash function. This significantly improves upon the best previously published results on 3 rounds. By using a new type of differential trail spanning over more than one message block we are able to construct collisions for Grostl-256 on 4 and 5 rounds with complexity
Florian Mendel +2 more
semanticscholar +3 more sources
A Symbolic Intruder Model for Hash-Collision Attacks [PDF]
, 2006 In the recent years, several practical methods have been published to compute collisions on some commonly used hash functions. In this paper we present a method to take into account, at the symbolic level, that an intruder actively attacking a protocol ...
Chevalier, Yannick, Kourjieh, Mounira
core +5 more sources
A Collision Attack on a Double-Block-Length Compression Function Instantiated with 8-/9-Round AES-256 [PDF]
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2015 This paper presents the first non-trivial collision attack on the double-block-length compression function presented at FSE 2006 instantiated with round-reduced AES-256: \(f_0(h_0\Vert h_1,M)\Vert f_1(h_0\Vert h_1,M)\) such that $$\begin{aligned} f_0 ...
Jiageng Chen +3 more
openalex +2 more sources
Plaintext-based Side-channel Collision Attack [PDF]
IACR Communications in CryptologySide-channel Collision Attacks (SCCA) is a classical method that exploits information dependency leaked during cryptographic operations. Unlike collision attacks that seek instances where two different inputs to a cryptographic algorithm yield identical outputs, SCCAs specifically target the internal state, where identical outputs are more likely ...
Lichao Wu +3 more
openalex +2 more sources