Discuss: Cryptanalysis: Collision attack in Hashing
by Prashant Gawade
Discussion is open —
there are 2 reader comments.
Add yours.
1. Pavan Prakash Tekur | 28 Sep 2005 4:58 PM
Its good article, though I find that you should have explained Birthday paradox, due to which the probablility of finding a collision is 2^x/2 where x is the total hash size. Other wise this is a brief and good work
2. Akshay | 29 Nov 2005 11:04 AM
Hi All
Pavan I agree with you, its really very interesting and nice Article.If possible PAVAN contact me, I really need your help urgently.aks.gup@gmail.com... it is regarding RMIT Info Security Course
Regards
Akshay