Skip to main content
17 events
when toggle format what by license comment
Jun 17, 2020 at 8:17 history edited CommunityBot
Commonmark migration
Nov 11, 2014 at 11:14 comment added humanityANDpeace @catpnosis valid hint. Yet the danger/attack depends on knowing the other combined entropy sources more imporantly than on a flaw of the combining process
S Feb 18, 2014 at 22:05 history suggested cHiMp CC BY-SA 3.0
corrected spelling, fixed grammar, improved readability
Feb 18, 2014 at 21:40 review Suggested edits
S Feb 18, 2014 at 22:05
Feb 10, 2014 at 16:35 comment added catpnosis Note of dangers of combining many sources of entropy for cryptography: blog.cr.yp.to/20140205-entropy.html
Jan 8, 2014 at 18:28 vote accept Shad
Jan 8, 2014 at 14:04 comment added mikeazo cleaned up some comments
Jan 5, 2014 at 23:03 history tweeted twitter.com/#!/StackCrypto/status/419967454132326400
Jan 5, 2014 at 14:27 history edited Shad CC BY-SA 3.0
clarified question based on comments.
Jan 5, 2014 at 9:33 review Close votes
Jan 5, 2014 at 16:11
Jan 5, 2014 at 7:36 answer added Seth timeline score: 6
Jan 5, 2014 at 5:00 answer added Dennis timeline score: 4
Jan 5, 2014 at 3:50 answer added Chloe timeline score: -1
Jan 5, 2014 at 0:18 comment added B-Con I think the canonical way to combine two numbers uniformly distributed between 0 and n is to just add them mod n. (Eg, XOR is often used for doing so, and it is just bitwise addition mod 2.) In the case of floating point, however, it may introduce precision bias due to precision limitations.
Jan 4, 2014 at 23:27 comment added Shad @CodesInChaos huh, yes I could. Is that the proper way to combine two sources of entropy? [fwiw, it's javascript, so I have Math.random for free, but would need to implement sha1/another hash in code.]
Jan 4, 2014 at 23:18 comment added CodesInChaos can't you just hash them and map the hash to 0..1?
Jan 4, 2014 at 23:17 history asked Shad CC BY-SA 3.0