Using Poly-Dragon Cryptosystem in a Pseudorandom Number Generator Mstg

[1] HROMADA, V.-VOJVODA, M.: A note on Poly-Dragon cryptosystem, in: 14th Conference of Doctoral Students-ELITECH ’12, Bratislava, 2012.Search in Google Scholar

[2] MAGLIVERAS, S. S.-STINSON, D. R.-VAN TRUNG, T.: New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups, J. Cryptology 15 (2002), 285-297.10.1007/s00145-001-0018-3Search in Google Scholar

[3] MARQUARDT, P.-SVABA, P.-VAN TRUNG, T.: Pseudorandom number generators based on random covers for finite groups, Des. Codes Cryptogr. 64 (2012), 209-220.10.1007/s10623-011-9485-1Search in Google Scholar

[4] RUKHIN, A.-SOTO, J.-NECHVATAL, J.-SMID, M.-BARKER, E.-LEIGH, S.- -LEVENSON, M.-VANGEL, M.--BANKS, D.-HECKERT, A.-DRAY, J.-VO, S.: Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications in: NIST Special Publication 800-22, National Institute of Standards and Technology, Gaithersburg, MD, USA, 2010, http://csrc.nist.gov/rng.Search in Google Scholar

[5] SINGH, R. P.-SAIKIA, A.-SARMA, B. K.: Poly-Dragon: an efficient multivariate public key cryptosystem, J. Math. Cryptol. 4 (2010), 365-373.Search in Google Scholar

[6] SVABA, P.-VAN TRUNG, T.: On generation of random covers for finite groups. Tatra Mt. Math. Publ. 37 (2007), 105-112Search in Google Scholar