IACR Cryptology ePrint Archive · 2015 · 49 citations · 4 references
ComputingComputer ScienceAuthenticationCryptographyFormal MethodsCryptographic HashingHash FunctionsRandom Number GenerationCryptographic Random Number GenerationHash Function ImplementationRandom Number Generator VerificationRandomness GenerationSecure Random Number Generation
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. 1
4
David Chaum, Richard Carback, Jeremy Clark et al. · Maryland Shared Open Access Repository (USMAI Consortium) · 2008 · 159 citations · Full text
Hardware implementation of a Montgomery modular multiplier in a systolic array
Berna Örs, Lejla Batina, Bart Preneel et al. · 2004 · 63 citations
How to manipulate curve standards:a white paper for the black hat
DJ Daniel Bernstein, Tung Chou, Chitchanok Chuengsatiansup et al. · TU/e Research Portal · 2014 · 17 citations · Full text