On a decentralized trustless pseudo-random number generation algorithm
From MaRDI portal
Publication:515398
DOI10.1515/JMC-2016-0019zbMATH Open1405.68435OpenAlexW2571322993MaRDI QIDQ515398FDOQ515398
Authors: S. Popov
Publication date: 16 March 2017
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2016-0019
Recommendations
- Robust random number generation for peer-to-peer systems
- scientific article; zbMATH DE number 822310
- scientific article; zbMATH DE number 3928174
- scientific article; zbMATH DE number 1834026
- scientific article; zbMATH DE number 17389
- scientific article; zbMATH DE number 1728306
- An efficient pseudo-random generator provably as secure as syndrome decoding
- An ultrafast cryptographically secure pseudorandom number generator
- Distributed random number generation
Random number generation in numerical analysis (65C10) Distributed algorithms (68W15) Authentication, digital signatures and secret sharing (94A62)
Cites Work
Cited In (2)
This page was built for publication: On a decentralized trustless pseudo-random number generation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515398)