Engineering Notes
Created by admin on Mon, 09/01/2012 - 12:25
Sub Topic:
Birthday-Attack
Upload File:
Department:
Chapter Name:
Cryptography and network security
Description:
Sometimes what we also need is collision resistance it is hard to find two random
messages M and M1 such that H(M)=H(M1), This is called birthday attack and is based on a birthday paradox
Add new comment