Reputation
Top tag
Next privilege 250 Rep.
 Sep 24 awarded Autobiographer Sep 19 revised Why not the one-time pad with pseudo-number generator Replaced with a link that doesn't require login Sep 19 suggested approved edit on Why not the one-time pad with pseudo-number generator Aug 18 awarded Critic Aug 16 comment MIT says: mathematical theory behind encryption is wrong. What are the consequences? Out of ALL the answers, this is the only one that actually approaches the subject, and the only that successfully answers the question and successfully critique the original article. Thank you. Aug 15 comment MIT says: mathematical theory behind encryption is wrong. What are the consequences? This in no way should be the accepted the answer. Aug 7 awarded Supporter May 16 awarded Teacher May 16 comment SHA-1:Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? @D.W. Okay, with the help of Antony Vennard, I think the answer is a bit better now. May 16 awarded Editor May 16 revised SHA-1:Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? deleted 2 characters in body May 16 comment SHA-1:Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? @D.W. I have looked at it and thought about it, but that's all I was able to figure out. Probability of one coin being head is 0.5, two coins being heads is 0.5*0.5, 3 coins is 0.5*0.5*0.5 so 128 coins is 0.5^128, and then we have a lot of combinations to for these coins to occur which is Comb(128, 160), then we multiply the two numbers. Since you think it's wrong, please help know what is right, a little hint would be a;right as well. May 16 comment SHA-1:Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? @D.W. Yeah, I kind of thought so, it's a bit beyond me. Please, edit the question to correct the "formula", we'd all learn something. May 15 answered SHA-1:Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output?