Abstract
In this article, we describe a new approach for constructing pseudorandom generator using subcovers for large finite groups. The Gennaro generator (J Cryptol 15:91-110, 2005) and Farashahi et al. generator (PKC LNCS 4450: 426-441, 2007) can be specific instances of the new approach. We focus, in particular, on the class of symmetric group S n and construct the first pseudorandom generator based on non-abelian group whose security can be proven. We successfully carry out a test of the generator based on non-abelian group by using the NIST Statistical Test Suite.
This work is supported by NSFC Grant No.10990011
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17(2), 194–209 (1988)
Blum, M., Micali, S.: How to generator cryptographically strong sequences of the pseudo-random bits. SIAM J. Comput. 13(4), 850–864 (1984)
Chevassut, O., Fouque, P., Gaudry, P., Pointcheval, D.: The Twist-AUgmented Technique for Key Exchange. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 410–426. Springer, Heidelberg (2006)
Farashahi, R.R., Schoenmakers, B., Sidorenko, A.: Efficient Pseudorandom Generators Based on the DDH Assumption. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 426–441. Springer, Heidelberg (2007)
Furst, M., Hopcroft, J., Luks, E.: Polynomial-time algorithms for permutations groups. In: Proceeding of the 21st IEEE Symposium and Foundation of Camputation Sciense, pp. 36–41 (1980)
Juels, A., Jakobsson, M., Shriver, E., Hillyer, B.K.: How to turn loaded dice into fair coins. IEEE Transactions on Information Theory 46(3), 911–921 (2000)
HÃ¥stad, J., Impagliazzo, R., Levin, L., Luby, M.: A Pseudorandom generator from any one-way function. In: Proc. 21st ACM Symp. on Theory of Computing (1989)
Gjøsteen, K.: Symmetric Subgroup Membership Problems. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 104–119. Springer, Heidelberg (2005)
Gennaro, R.: An improved pseudo-random genreator based on the discrete logarithm problem. J. Cryptol. 18(2), 91–110 (2005)
Goldreich, O.: A note on computational indistinguishability. Infor. Proc. Letters 34, 277–281 (1990)
Goldreich, O.: Foundations of cryptography, basis tools. Cambridge University Press (2001)
Lempken, W., Magliveras, S.S., van Trung, T., Wei, W.: A public key cryptosystem based on non-abelian finite groups. J. Cryptol. 22, 62–74 (2009)
Magliveras, S.S., Oberg, B.A., Surkan, A.J.: A new random number generator from permutation groups. Rend. del Sem. Matemat. e Fis. di Milano 54, 203–223 (1984)
Magliveras, S.S.: A cryptosystem from logarithmic signatures of finite groups. In: Proceedings of the 29th Midwest Symposium on Circuits and Systems, pp. 972–975. Elsevier, Amsterdam (1986)
Magliveras, S.S., Memon, N.D.: Random Permutations from Logarithmic Signatures. In: Sherwani, N.A., Kapenga, J.A., de Doncker, E. (eds.) Great Lakes CS Conference 1989. LNCS, vol. 507, pp. 199–205. Springer, Heidelberg (1991)
Magliveras, S.S., Memon, N.D.: Algebraic properties of cryptosystem PGM. J. Cryptol. 5, 167–183 (1992)
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. Cryptol. 15, 285–297 (2002)
Marquardt, P., Svaba, P., van Trung, T.: Pseudorandom number generators based on random convers for finite groups. Des. Codes Cryptogr. (2011)
González Nieto, J.M., Boyd, C., Dawson, E.: A Public Key Cryptosystem Based on the Subgroup Membership Problem. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 352–363. Springer, Heidelberg (2001)
Nieto, J.M.G., Boyd, C., Dawson, E.: A public key cryptosystem based on the subgroup membership problem. Des. Codes Cryptogr. 36, 301–316 (2005)
Patel, S., Sundaram, G.S.: An Efficient Discrete Log Pseudo Random Generator. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 304–317. Springer, Heidelberg (1998)
Rukhin, A., et al.: Statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication 800-22, Revised April 2010, National Institute of Standards and Technology (2010), http://csrc.nist.gov/rng
Shi, H., Jiang, S., Qin, Z.: More efficient DDH pseudo-random generators. Des. Codes Cryptogr. 55, 45–64 (2010)
Shor, P.: Polynomial time algorithms for prime factorization and discrete logarithms on quantum computers. SIAM J. Comput. 26(5), 1484–1509 (1997)
Sims, C.C.: Some group-theoretic algorithms. In: Newman, M.F. (ed.) Topics in Algebra. Lecture Notes in Math., vol. 697, pp. 108–124. Springer (1978)
Steinfeld, R., Pieprzyk, J., Wang, H.: On the Provable Security of an Efficient RSA-Based Pseudorandom Generator. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 194–209. Springer, Heidelberg (2006)
Yamamura, A., Saito, T.: Private Information Retrieval Based on the Subgroup Membership Problem. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 206–220. Springer, Heidelberg (2001)
Yao, A.: Theory and Applications of Trapdoor Functions. In: Proc. IEEE FOCS, pp. 80–91 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, C., Xu, M., Tang, C. (2012). Pseudorandom Generators Based on Subcovers for Finite Groups. In: Wu, CK., Yung, M., Lin, D. (eds) Information Security and Cryptology. Inscrypt 2011. Lecture Notes in Computer Science, vol 7537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34704-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-34704-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34703-0
Online ISBN: 978-3-642-34704-7
eBook Packages: Computer ScienceComputer Science (R0)