Last update: Sun Jan 6 02:01:01 MST 2019
@Article{Lenstra:2017:TPR,
author = "Arjen K. Lenstra and Benjamin Wesolowski",
title = "Trustworthy public randomness with sloth, unicorn, and
trx",
journal = j-INT-J-APPL-CRYPTOGR,
volume = "3",
number = "4",
pages = "330--343",
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1504/IJACT.2017.089354",
ISSN = "1753-0563 (print), 1753-0571 (electronic)",
ISSN-L = "1753-0563",
bibdate = "Wed Jan 2 17:53:45 MST 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www.math.utah.edu/pub/tex/bib/ijact.bib;
http://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "https://www.inderscienceonline.com//doi/pdf/10.1504/IJACT.2017.089354",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Applied Cryptography",
journal-URL = "http://www.inderscienceonline.com/loi/ijact",
keywords = "public random number generation; random beacon;
slow-timed hash",
}