Morin

November 15th, 2001, 16:05

Hello everybody!

I have a small beginners question I was hoping someone might be able to help me out on. I've started looking into cryptography a bit and have been finding it very interesting. The concepts and math behind the algorithms are initially difficult but I'm getting there slowly, and more importantly enjoying it.

My question though pertains to breaking implementations of various algorithms. I've seen many places where people talk about an implementation being broken due to a weak random number generator. It may be my own lack of knowledge thats preventing me from understanding this but I can't for the life of me figure out how you could utilize the fact that a weak generator was used to break an implementation. Even more then that, how would one go about realizing that the number generator used in the first place was weak? Any insight you guys could give about this kind of stuff would be of great help.

Thanks!

I have a small beginners question I was hoping someone might be able to help me out on. I've started looking into cryptography a bit and have been finding it very interesting. The concepts and math behind the algorithms are initially difficult but I'm getting there slowly, and more importantly enjoying it.

My question though pertains to breaking implementations of various algorithms. I've seen many places where people talk about an implementation being broken due to a weak random number generator. It may be my own lack of knowledge thats preventing me from understanding this but I can't for the life of me figure out how you could utilize the fact that a weak generator was used to break an implementation. Even more then that, how would one go about realizing that the number generator used in the first place was weak? Any insight you guys could give about this kind of stuff would be of great help.

Thanks!