4:25 PM
5:09 PM
@FutureSecurity There was a general fear that our standard hash functions wouldn't actually be good random oracles
94
A random oracle is described by the following model: There is a black box. In the box lives a gnome, with a big book and some dice. We can input some data into the box (an arbitrary sequence of bits). Given some input that he did not see beforehand, the gnome uses his dice to generate a new out...
« first day (2593 days earlier) ← previous day next day → last day (2075 days later) »