Results 11 to 20 of about 131,000 (194)
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
Improved 2-round collision attack on IoT hash standard ASCON-HASH [PDF]
HeliyonLightweight cryptography algorithms are a class of ciphers designed to protect data generated and transmitted by the Internet of Things. They typically have low requirements in terms of storage space and power consumption, and are well-suited for ...
Di Zhai +4 more
doaj +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
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 ...
Yannick Chevalier, Mounira Kourjieh
openalex +5 more sources
Preimage and collision attacks on reduced Ascon using algebraic strategies
CybersecurityAscon, a family of algorithms that supports hashing and authenticated encryption, is the winner of the NIST Lightweight Cryptography Project. In this paper, we propose an improved preimage attack against 2-round Ascon-XOF-64 with a complexity of $$2^{33}$
Qinggan Fu +3 more
doaj +2 more sources
New Semi-Free-Start Collision Attack Framework for Reduced RIPEMD-160
IACR Transactions on Symmetric Cryptology, 2019 RIPEMD-160 is a hash function published in 1996, which shares similarities with other hash functions designed in this time-period like MD4, MD5 and SHA-1.
Fukang Liu +5 more
doaj +3 more sources
Trust-Based Distributed Authentication Method for Collision Attack Avoidance in VANETs
IEEE Access, 2018 A vehicular ad hoc network (VANET) is a collection of mobile vehicles that aids roadside communication through vehicle-to-vehicle and vehicle-to-infrastructure operation modes.
A.M.R. Tolba
doaj +2 more sources
A Symbolic Intruder Model for Hash-Collision Attacks [PDF]
, 2007 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 execution may use these collision algorithms in reasonable time during the attack.
Yannick Chevalier, Mounira Kourjieh
openalex +5 more sources
Efficient Collision Search Attacks on SHA-0 [PDF]
, 2005 In this paper, we present new techniques for collision search in the hash function SHA-0. Using the new techniques, we can find collisions of the full 80-step SHA-0 with complexity less than 239 hash operations.
Xiaoyun Wang, Hongbo Yu, Yiqun Lisa Yin
openalex +3 more sources