Abstract
This paper is devoted to random-bit simulation of probability densities, supported on
References
[1] C. Aghamohammadi and J. P. Crutchfield, Thermodynamics of random number generation, Phys. Rev. E 95 (2017), no. 6, Article ID 13. 10.1103/PhysRevE.95.062139Search in Google Scholar
[2] C. Blundo, A. De Santis, G. Persiano and U. Vaccaro, Randomness complexity of private computation, Comput. Complexity 8 (1999), no. 2, 145–168. 10.1007/s000370050025Search in Google Scholar
[3] L. Devroye, Nonuniform Random Variate Generation, Springer, New York, 1986. 10.1007/978-1-4613-8643-8Search in Google Scholar
[4] L. Devroye and C. Gravel, The expected bit complexity of the von Neumann rejection algorithm, Stat. Comput. 27 (2017), no. 3, 699–710. 10.1007/s11222-016-9648-zSearch in Google Scholar
[5] N. C. Dwarakanath and S. D. Galbraith, Sampling from discrete Gaussians for lattice-based cryptography on a constrained device, Appl. Algebra Engrg. Comm. Comput. 25 (2014), no. 3, 159–180. 10.1007/s00200-014-0218-3Search in Google Scholar
[6] P. Flajolet and N. Saheb, The complexity of generating an exponentially distributed variate, J. Algorithms 7 (1986), no. 4, 463–488. 10.1016/0196-6774(86)90014-3Search in Google Scholar
[7] G. Kindler and D. Romik, On distributions computable by random walks on graphs, SIAM J. Discrete Math. 17 (2004), no. 4, 624–633. 10.1137/S089548010343106XSearch in Google Scholar
[8] D. E. Knuth and A. C. Yao, The complexity of nonuniform random number generation, Algorithms and Complexity, Academic Press, New York (1976), 357–428. Search in Google Scholar
[9] J. Lumbroso, Optimal discrete uniform generation from coin flips, and applications, preprint (2013), https://arxiv.org/abs/1304.1916. Search in Google Scholar
[10] V. Nekrutkin, On the complexity of binary floating point pseudorandom generation, Monte Carlo Methods Appl. 22 (2016), no. 2, 109–116. 10.1515/mcma-2016-0105Search in Google Scholar
[11] S.-I. Pae, Interval algorithms for coin flipping, JCSNS Int. J. Comp. Sci. Netw. Secur. 10 (2010), no. 2, 55–60. Search in Google Scholar
[12] B. B. Pokhodzeĭ, Transformation of random bits into random variables with arbitrary discrete distributions (in Russian), Vestnik Leningrad. Univ. Mat. Mekh. Astronom. 1 (1985), 39–43. Search in Google Scholar
[13] S. Roy, F. Vercauteren and I. Verbauwhede, High precision discrete gaussian sampling on FPGAs, Selected Areas in Cryptography, Lecture Notes in Comput. Sci. 8282, Springer, Berlin (2013), 383–401. Search in Google Scholar
[14] M.-J. Saarinen, Gaussian sampling precision in lattice cryptography, IACR Cryptology ePrint Archive Report 2015/953 (2015), https://eprint.iacr.org/2015/953. Search in Google Scholar
[15] Y. Shi, Quantum and classical tradeoffs, Theoret. Comput. Sci. 344 (2005), no. 2–3, 335–345. 10.1016/j.tcs.2005.03.053Search in Google Scholar
© 2020 Walter de Gruyter GmbH, Berlin/Boston
