{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:42Z","timestamp":1725456762396},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642347030"},{"type":"electronic","value":"9783642347047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34704-7_26","type":"book-chapter","created":{"date-parts":[[2012,10,18]],"date-time":"2012-10-18T22:38:37Z","timestamp":1350599917000},"page":"379-392","source":"Crossref","is-referenced-by-count":0,"title":["Pseudorandom Generators Based on Subcovers for Finite Groups"],"prefix":"10.1007","author":[{"given":"Chenggen","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maozhi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput.\u00a017(2), 194\u2013209 (1988)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generator cryptographically strong sequences of the pseudo-random bits. SIAM J. Comput.\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11745853_27","volume-title":"Public Key Cryptography - PKC 2006","author":"O. Chevassut","year":"2006","unstructured":"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.\u00a03958, pp. 410\u2013426. Springer, Heidelberg (2006)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-71677-8_28","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"R.R. Farashahi","year":"2007","unstructured":"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.\u00a04450, pp. 426\u2013441. Springer, Heidelberg (2007)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"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\u201341 (1980)","DOI":"10.1109\/SFCS.1980.34"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/18.841170","volume":"46","author":"A. Juels","year":"2000","unstructured":"Juels, A., Jakobsson, M., Shriver, E., Hillyer, B.K.: How to turn loaded dice into fair coins. IEEE Transactions on Information Theory\u00a046(3), 911\u2013921 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, 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)","DOI":"10.1145\/73007.73009"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-30580-4_8","volume-title":"Public Key Cryptography - PKC 2005","author":"K. Gj\u00f8steen","year":"2005","unstructured":"Gj\u00f8steen, K.: Symmetric Subgroup Membership Problems. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 104\u2013119. Springer, Heidelberg (2005)"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00145-004-0215-y","volume":"18","author":"R. Gennaro","year":"2005","unstructured":"Gennaro, R.: An improved pseudo-random genreator based on the discrete logarithm problem. J. Cryptol.\u00a018(2), 91\u2013110 (2005)","journal-title":"J. Cryptol."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(90)90010-U","volume":"34","author":"O. Goldreich","year":"1990","unstructured":"Goldreich, O.: A note on computational indistinguishability. Infor. Proc. Letters\u00a034, 277\u2013281 (1990)","journal-title":"Infor. Proc. Letters"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of cryptography, basis tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/s00145-008-9033-y","volume":"22","author":"W. Lempken","year":"2009","unstructured":"Lempken, W., Magliveras, S.S., van Trung, T., Wei, W.: A public key cryptosystem based on non-abelian finite groups. J. Cryptol.\u00a022, 62\u201374 (2009)","journal-title":"J. Cryptol."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF02924858","volume":"54","author":"S.S. Magliveras","year":"1984","unstructured":"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\u00a054, 203\u2013223 (1984)","journal-title":"Rend. del Sem. Matemat. e Fis. di Milano"},{"key":"26_CR14","first-page":"972","volume-title":"Proceedings of the 29th Midwest Symposium on Circuits and Systems","author":"S.S. Magliveras","year":"1986","unstructured":"Magliveras, S.S.: A cryptosystem from logarithmic signatures of finite groups. In: Proceedings of the 29th Midwest Symposium on Circuits and Systems, pp. 972\u2013975. Elsevier, Amsterdam (1986)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BFb0038493","volume-title":"Computing in the 90\u2019s","author":"S.S. Magliveras","year":"1991","unstructured":"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.\u00a0507, pp. 199\u2013205. Springer, Heidelberg (1991)"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF02451113","volume":"5","author":"S.S. Magliveras","year":"1992","unstructured":"Magliveras, S.S., Memon, N.D.: Algebraic properties of cryptosystem PGM. J. Cryptol.\u00a05, 167\u2013183 (1992)","journal-title":"J. Cryptol."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00145-001-0018-3","volume":"15","author":"S.S. Magliveras","year":"2002","unstructured":"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.\u00a015, 285\u2013297 (2002)","journal-title":"J. Cryptol."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Marquardt, P., Svaba, P., van Trung, T.: Pseudorandom number generators based on random convers for finite groups. Des. Codes Cryptogr. (2011)","DOI":"10.1007\/s10623-011-9485-1"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-45600-7_38","volume-title":"Information and Communications Security","author":"J.M. Gonz\u00e1lez Nieto","year":"2001","unstructured":"Gonz\u00e1lez 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.\u00a02229, pp. 352\u2013363. Springer, Heidelberg (2001)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10623-004-1721-5","volume":"36","author":"J.M.G. Nieto","year":"2005","unstructured":"Nieto, J.M.G., Boyd, C., Dawson, E.: A public key cryptosystem based on the subgroup membership problem. Des. Codes Cryptogr.\u00a036, 301\u2013316 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0055737","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"S. Patel","year":"1998","unstructured":"Patel, S., Sundaram, G.S.: An Efficient Discrete Log Pseudo Random Generator. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 304\u2013317. Springer, Heidelberg (1998)"},{"key":"26_CR22","unstructured":"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"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10623-009-9329-4","volume":"55","author":"H. Shi","year":"2010","unstructured":"Shi, H., Jiang, S., Qin, Z.: More efficient DDH pseudo-random generators. Des. Codes Cryptogr.\u00a055, 45\u201364 (2010)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"26_CR24","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"Shor, P.: Polynomial time algorithms for prime factorization and discrete logarithms on quantum computers. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Some group-theoretic algorithms. In: Newman, M.F. (ed.) Topics in Algebra. Lecture Notes in Math., vol.\u00a0697, pp. 108\u2013124. Springer (1978)","DOI":"10.1007\/BFb0103126"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11935230_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"R. Steinfeld","year":"2006","unstructured":"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.\u00a04284, pp. 194\u2013209. Springer, Heidelberg (2006)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-47719-5_18","volume-title":"Information Security and Privacy","author":"A. Yamamura","year":"2001","unstructured":"Yamamura, A., Saito, T.: Private Information Retrieval Based on the Subgroup Membership Problem. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol.\u00a02119, pp. 206\u2013220. Springer, Heidelberg (2001)"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Yao, A.: Theory and Applications of Trapdoor Functions. In: Proc. IEEE FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34704-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T05:59:30Z","timestamp":1643522370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34704-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642347030","9783642347047"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34704-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}