Exploiting Collision in Hash functions

Exploiting Collision in Hash functions

I am a computer science student at my last year in college. My graduation project is about doing a comparative study about exploiting collision in hash functions and testing whether specific techniques that can cause collision on a certain hash function can work on another. Simply put, the project is about testing various (up to 3) hash functions vulnerability to various collision techniques and saying why it worked or not (e.g. technique A caused collision on hash function B but it couldn’t do so on hash function A because reasons) . The problem is, I’m relatively new to such topics and I want to know the different techniques or methods that are used to cause collision and the respective hash functions they work on. So, can anyone please give any research material on this topic? I downloaded a lot of research papers/related studies of Masters and PhD but they are a bit complicated and usually focus on one method that works on one hash function.

Thanks in advance.

submitted by /u/Villian97
[link] [comments]

top scoring links : crypto
Cryptography is the art of creating mathematical assurances for who can do what with data, including but not limited the classical example of encrypting messages so that only the key-holder can read it. Cryptography lives at an intersection of math, programming, and computer science. This subreddit covers the theory and practice of modern and *strong* cryptography, and it is a technical subreddit focused on the algorithms and implementations of cryptography.

Related posts

Leave a Comment