Abstract
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-random generators from one-way permutations (the Blum-Micali-Yao approach) can be used for building extractors as well. Using this new technique we build extractors that do not use designs and polynomial-based error-correcting codes and that are very simple and efficient. For example, one extractor produces each output bit separately in O(log2 n) time. These extractors work for weak sources with min entropy λ n, for arbitrary constant λ> 0, have seed length O(log2 n), and their output length is ≈ n λ/3.
This is a preview of subscription content, log in via an institution to check access.
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
Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing 13(4), 850–864 (1984)
Dziembowski, S., Maurer, U.: Optimal randomizer efficiency in the bounded-storage model. Journal of Cryptology 17(1), 5–26 (2004); Conference version appeared in Proc. of STOC 2002 (2002)
Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (2000)
Håstad, J., Impagliazzo, R., Levin, L., Luby, M.: Construction of a pseudo-random generator from any one-way function. SIAM Journal on Computing 28(4) (1999)
Hartman, T., Raz, R.: On the distribution of the number of roots of polynomials and explicit logspace extractors. Random Structures & Algorithms 23(3), 235–263 (2003)
Impagliazzo, R.: Very strong one-way functions and pseudo-random generators exist relative to a random oracle (January 1996) (manuscript)
Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997), May 1997, pp. 220–229. Association for Computing Machinery, New York (1997)
Lu, C.J.: Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology 17(1), 27–42 (2004)
Nisan, N., Wigderson, A.: Hardness vs. randomness. Journal of Computer and System Sciences 49, 149–167 (1994)
Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in trevisan’s extractor. In: Proceedings of the 30th ACM Symposium on Theory of Computing, May 1999, pp. 149–158. ACM Press, New York (1999)
Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin EATCS 77, 67–95 (2002)
Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudo-random generator. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (2001)
Trevisan, L.: Constructions of near-optimal extractors using pseudo-random generators. In: Proceedings of the 30th ACM Symposium on Theory of Computing, May 1999, pp. 141–148. ACM Press, New York (1999)
Trevisan, L.: Extractors and pseudorandom generators. Journal of the ACM 48(4), 860–879 (2001)
Ta-Shma, A., Zuckerman, D.: Extractor codes. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, pp. 193–199 (2001)
Ta-Shma, A., Zuckerman, D., Safra, S.: Extractors from Reed-Muller codes. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (2001)
Vadhan, S.: On constructing locally computable extractors and cryptosystems in the bounded-storage model. J. of Cryptology 17(1), 43–77 (2004)
Yao, A.: Theory and application of trapdoor functions. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pp. 80–91 (1982)
Zimand, M.: Computational Complexity: A Quantitative Perspective. North-Holland Mathematics Studies, vol. 196. Elsevier, Amsterdam (2004)
Zimand, M.: Simple extractors via constructions of cryptographic pseudo-random generators. Technical Report 0501075, Computing Research Repository (January 2005), Available at http://arxiv.org/abs/cs.CC/0501075
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zimand, M. (2005). Simple Extractors via Constructions of Cryptographic Pseudo-random Generators. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_10
Download citation
DOI: https://doi.org/10.1007/11523468_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)