International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 23 April 2015

Arjen K. Lenstra, Benjamin Wesolowski
ePrint Report ePrint Report
Many applications require trustworthy generation of public random numbers. It is shown how this can be achieved using a hash function

that is timed to be as slow as desired (sloth), while the correctness

of the resulting hash can be verified quickly. It is shown how sloth

can be used for uncontestable random number generation (unicorn),

and how unicorn can be used for a new trustworthy random elliptic

curves service (trx) and random-sample voting.

Expand

Additional news items may be found on the IACR news page.