China
Africa
Explore chapters and articles related to this topic
Combinatorics
Published in Paul L. Goethals, Natalie M. Scala, Daniel T. Bennett, Mathematics in Cyber Research, 2022
Hashes are used as building blocks for more complex security mechanisms, and the collision resistance—the inability to easily find hash collisions—is a major factor in the level of security provided. We showed that the probability of a collision is inversely proportional to the size of the hash, and so larger hashes will be more collision resistant. Larger hashes are also more resource intensive to compute, so applications must balance computational efficiency with security.
H
Published in Phillip A. Laplante, Dictionary of Computer Science, Engineering, and Technology, 2017
hash collision in a hash table, the consequence of a hash function producing a hash key which selects a non-empty equivalence class as the place to put the new value. When a nonempty equivalence class is discovered, either the value will be placed in it, or a new equivalence class can be selected by using a secondary hash.
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.
Efficient name matching based on a fast two-dimensional filter in named data networking
Published in International Journal of Parallel, Emergent and Distributed Systems, 2019
The performance of any HT based lookup will be affected by the employed hash function in two ways. Firstly, the computational overhead of the hash function, and secondly, the quality of the its generated hash values. In the proposed approach, it is necessary to employ an effective hash function that has the ability to calculates hashes fastly for character strings, and has low hash collision probability to minimize HT chain length. Siphash [37] presents an adequate equilibrium as it provides collision resistance and analogous performance to non-cryptographic hashes.