If a hash function can really make some of these encryption algorithms simpler, I'm really excited to learn about it!
One thing that I'm confused about, is that I thought all functions have an inverse, so why is the hash function uninvertible?
How do you determine if a hash function is strongly collision free or just weekly collision-free?
Also, I'm still struggling how to go from m=x0+x1q to a discreet log problem.
No comments:
Post a Comment