China 
Africa 
Explore chapters and articles related to this topic
Cryptographic Foundations of Blockchain Technology
Published in Rajdeep Chakraborty, Anupam Ghosh, Valentina Emilia Bălaş, Ahmed A Elngar, Blockchain, 2023
Although a theoretical collision attack on SHA-1 was provided in [2] as early as 2004, it was only in 2017 that a practical collision was obtained [4]. Note that a collision attack on a hash function only affects scenarios where collision resistance is required. However, recently, chosen-prefix collisions on SHA-1 is provided in [3]. This new attack is much more threatening for real protocols because it allows building two messages with arbitrary prefixes that have the same hash values. As an example, the authors of [3] provided a PGP/GnuPG impersonation attack. Therefore, SHA-1 should be avoided at all costs.
A Survey of Intrusion Detection Systems in Wireless Sensor Networks
Published in Georgios Kambourakis, Asaf Shabtai, Constantinos Kolias, Dimitrios Damopoulos, Intrusion Detection and Prevention for Mobile Ecosystems, 2017
Eleni Darra, Sokratis K. Katsikas
A hash collision attack tries to find two messages having the same hash. Such an attack, if successful, could be used to tamper with existing certificates, as the adversary might be able to construct a valid certificate corresponding to the hash collision [24].
MQTT Vulnerabilities, Attack Vectors and Solutions in the Internet of Things (IoT)
Published in IETE Journal of Research, 2023
Ahmed J. Hintaw, Selvakumar Manickam, Mohammed Faiz Aboalmaaly, Shankar Karuppayah
Hash collision: Detecting the same hash value which is obtained by the hash function of two input strings is the critical key aim of the collision attack. As noted in [127], two different inputs are the potential to result in the same output if the hush function consists of the lengths of the variable input and the lengths of the short fixed output. This scenario is called a collision. Regarding MQTT, the vulnerable hush function which may be applied to secure MQTT could result in such an attack. Below Table 11 presents the details of the security objects achievements and counteractions related to the data-based attack.
A secure hash function based on feedback iterative structure
Published in Enterprise Information Systems, 2019
Yijun Yang, Fei Chen, Jianyong Chen, Yong Zhang, Kai Leung Yung
Avalanche performance and collision resistance are closely related to each other. The essence of collision attack is to explore the relevance between two different hash values. The faster to achieve avalanche performance, the more difficult to construct a successful collision attack from irregular random hash values since attackers have to eliminate difference in shorter iterative steps (Yang and Chen 2017). Existing differential attacks can generate local collision in 23 steps (Wang et al. 2004). Therefore, FISH-based hash functions also have better performance on collision resistance. Following is the collision test on FISH-based hash functions.