Authors: Arjen K. Lenstra; Benjamin Wesolowski
Addresses: Laboratory for Cryptologic Algorithms, École Polytechnique Fédérale de Lausanne, Station 14, CH-1015 Lausanne, Switzerland ' Laboratory for Cryptologic Algorithms, École Polytechnique Fédérale de Lausanne, Station 14, CH-1015 Lausanne, Switzerland
Abstract: 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.
Keywords: public random number generation; random beacon; slow-timed hash.
International Journal of Applied Cryptography, 2017 Vol.3 No.4, pp.330 - 343
Available online: 12 Jan 2018 *Full-text access for editors Access for subscribers Purchase this article Comment on this article