Collision attack

About: Collision attack is a research topic. Over the lifetime, 1093 publications have been published within this topic receiving 28389 citations.

Incorporating a New Hash Function in OpenPGP and SSL/TLS

Abstract: MD5 and SHA-1 are the most common hash functions used in most security protocols and implementations. However, recent discoveries show that these hash functions are not secure as they should be, which necessitate the need for deploying a new hash function. This implies a number of changes for all major cryptographic protocols. This paper analyzes OpenPGP and SSL/TLS protocols showing all the necessary changes to make the transition to a new hash function

Protecting signatures using collision-resistant hash functions

Abstract: A message is hashed with a first hash function to generate a first hashed message, and then the first hashed message is hashed with a second hash function to generate a second hashed message. The second hashed message is then signed. The first hash function may be a domain extender, such as a TCR (target-collision resistant) hash. The second hash function may be a random oracle. The second hash function may be slower than the first hash function. A signature scheme such as DSA, PSS-RSA, or Cramer-Shoup may be used.

The FSR-255 family of hash functions with a variable length of hash result

Abstract: In the paper a family of cryptographic hash functions with a variable length of hash result, called the FSR-255 family, is presented. The hash functions are defined by some processing structures based on seventeen 15-stage nonlinear feedback shift registers. The feedback functions can be modified by the user to customize the hash function. An algorithm for computing the hash result of length r≤255 is given. It was successfully tested against the birthday attack: no collisions have been found. The FSR-255 family hardware implementation is presented at the level of logical structure. The circuit is designed for implementing as a full custom ASIC, and is optimized to increase the processing rate. The device is capable of working on-line, and can be customized by the user.

Omega network hash construction

Abstract: Problem statement: Cryptographic hash functions are important cryptographic primitives. They are commonly used for data integrity checking and data authentication. Most of the cryptographic hash functions are based on the Merkle-Damgard construction. The basic Merkle-Damgard construction runs over the input sequentially, which can lead to problems when the input size is large since the computation time increases linearly. Approach: Therefore, an alternative architecture which can reduce the computation time is needed, especially in today’s world where multi-core processors and multithreaded programming are common. An Omega Network Hash Construction (ONHC) run parallel in multi-core machine has been proposed as an alternative to the existing hash constructions. Result: The ONHC performed better than the Merkle-Damgard construction. ONHC permutation architecture also showed improved security strength in term of digest value randomness when compared to Merkle-Damgard construction. Conclusion: Therefore, it is believed that the proposed ONHC is a valuable structure that can improve the performance of any hash function that can run on top of it.