collisions in hash functions are unavoidable. if you find one collision (messages A and B have the same hash), how easy is it to manufacture another collision (messages C and D have the same hash), or even an infinite collection of collisions?
can cryptographic hash functions be designed to prevent collisions from easily yielding more collisions?
No comments :
Post a Comment