Skip to main content
13 events
when toggle format what by license comment
Jan 15, 2016 at 8:39 comment added Daniel Showing uset time to brute force an attack really depends in how mich computing power an attacker can access. This could potentially deliver a false sense of security.
Jan 13, 2016 at 17:10 answer added Ben timeline score: 2
Aug 11, 2011 at 14:46 history edited AviD
edited tags
Jun 23, 2011 at 13:01 vote accept Incognito
Jun 23, 2011 at 7:03 comment added this.josh @user502 And with true randomness you could have a key of all ones or all zeroes, which we specifically try to avoid. You could even improbably have a hundred keys of all ones or zeroes. Thats why we like pseudorandomness: the great taste of randomness with half the calories!
Jun 20, 2011 at 13:21 comment added Incognito @user502 Thanks for that, searching for untruths is often a powerful problem solving tool that so many people forget to think about.
Jun 20, 2011 at 12:56 comment added user502 One of the mathematically cool things about true randomness is that you can't measure it accurately. Because the kolmogorov complexity of a string is noncomputable, you can never say how random a string is. All you can say is how random a string isn't, based on the best compression of it you've found so far.
Jun 20, 2011 at 9:32 answer added user185 timeline score: 6
Jun 19, 2011 at 3:08 comment added this.josh Just a cautionary note about usability of passwords. Strong passwords are good only to the point at which people remember them and keep them confidential.
Jun 18, 2011 at 23:03 comment added AviD Very closely related, but not duplicate: security.stackexchange.com/questions/2687/…
Jun 18, 2011 at 22:03 answer added nealmcb timeline score: 18
Jun 18, 2011 at 20:25 history tweeted twitter.com/#!/StackSecurity/status/82182282353451008
Jun 18, 2011 at 18:37 history asked Incognito CC BY-SA 3.0