Physics, asked by SamirChaudhary4676, 11 months ago

Difference between weak and strong collision resistance

Answers

Answered by katniss72
2

Answer:

It's difference

Explanation:

weak collision resistance

a good example where we are actually only interested in weak collision resistance would be a simple password storage scheme. Assume we store user-provided passwords in a database by storing their hash. Authentication would succeed when the hash of some password a user provides is equal to the value that was stored previously (this is an inherently insecure scheme though, but please bear with me for the moment). Now in that case, the given x is the (unknown) original password that was provided earlier. If an attacker were capable of solving the "second preimage" problem efficiently, he could obtain an x' whose hash value is the same as that of the original x, and would thus be authenticated successfully. Please note that the capability to produce arbitrary collisions (i.e. solving the strong collision problem) is useless in general in this scenario because it is not too likely that the x and x' we get resemble actual passwords whose hashes have already been stored in the database.

Strong collision resistance

A different scenario where our concern is strong collision resistance instead is for example an application where you want to be able to look up arbitrary data stored in a database with the help of unique ids. Instead of issuing queries on the original data (which would often be very slow due the potentially unbounded size of the data), you would compute hashes of the data instead. Hashes are very compact, limited in their size and can thus be queried much more efficiently. As a matter of fact, in these cases you often don't mind the (second) pre-image resistance property of a hash function at all, mostly because the preimages themselves are no secret. What you do care about, though, is that you would absolutely want to avoid two distinct data sets to hash to the same value, which is essentially a collision. You don't care about any collision in particular, but you want this property to hold universally - i.e. you don't want any two data sets hash to the same value (imagine there is a 'unique constraint' defined on that column). Because security is often no issue in these applications, we often use non-cryptographic hashes, mostly because they perform better.

Answered by Dhruv4886
0

Difference between weak and strong collision resistance

Weak collision resistance and strong collision resistance are two important properties of hash functions that determine their level of security.

Weak collision resistance refers to the ability of a hash function to prevent the creation of different inputs that produce the same hash value. If a hash function has weak collision resistance, it means that an attacker can find two different inputs that produce the same hash value relatively easily, using methods such as brute force attacks or collision attacks.

This can be a significant security weakness, as attackers can exploit collisions to generate false data, bypass security mechanisms such as digital signatures, or corrupt databases.

Strong collision resistance is a more desirable property for hash functions, as it ensures that it is extremely difficult to find any two inputs that produce the same hash value.

Strong collision resistance means that an attacker would have to perform a comprehensive search of all possible input combinations to find a collision, which is computationally impracticable for most practical purposes. Strong collision resistance makes it much more difficult for attackers to exploit hash function weaknesses to compromise security systems.

Overall, the difference between weak and strong collision resistance lies in the level of security that they provide. Weak collision resistance allows for the possibility of collisions, which can be exploited by attackers to undermine the security of systems that use hash functions.

Strong collision resistance provides a much higher level of security by making it extremely difficult for attackers to create collisions, ensuring the integrity and confidentiality of data.

Learn more at

https://brainly.in/question/13178394

#SPJ6

Similar questions