Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Journal of Cryptology
  3. Article
Practical Construction and Analysis of Pseudo-Randomness Primitives
Download PDF
Download PDF
  • Published: 15 September 2007

Practical Construction and Analysis of Pseudo-Randomness Primitives

  • Johan Håstad1 &
  • Mats Näslund2 

Journal of Cryptology volume 21, pages 1–26 (2008)Cite this article

  • 230 Accesses

  • 2 Citations

  • Metrics details

Abstract

We give a careful, fixed-size parameter analysis of a standard (Blum and Micali in SIAM J. Comput. 13(4):850–864, 1984; Goldreich and Levin in Proceedings of 21st ACM Symposium on Theory of Computing, pp. 25–32, 1989) way to form a pseudo-random generator from a one-way function and then pseudo-random functions from said generator (Goldreich et al. in J. Assoc. Comput. Mach. 33(4):792–807, 1986) While the analysis is done in the model of exact security, we improve known bounds also asymptotically when many bits are output each round and we find all auxiliary parameters efficiently, giving a uniform result. These optimizations makes the analysis effective even for security parameters/key-sizes supported by typical block ciphers and hash functions. This enables us to construct very practical pseudo-random generators with strong properties based on plausible assumptions.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. W. Alexi, B. Chor, O. Goldreich, C.P. Schnorr, RSA and Rabin functions: Certain parts are as hard as the whole, SIAM J. Comput. 17(2), 194–209 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. N. Alon, J. Spencer, The Probabilistic Method, 2nd edn. (Wiley, New York, 2000)

    MATH  Google Scholar 

  3. M. Bellare, A. Desai, E. Jokipii, P. Rogaway, A concrete security treatment of symmetric encryption: analysis of the DES modes of operation, in Proceedings of the 38th IEEE Conference on Foundations of Computer Science, 1997, pp. 394–403

  4. A. Biryukov, A. Shamir, Cryptanalytic time/memory/data tradeoffs for stream ciphers, in Advances in Cryptology-ASIACRYPT 2000. Lecture Notes in Computer Science, vol. 1976 (Springer, Berlin, 2000), pp. 1–13

    Chapter  Google Scholar 

  5. M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput. 13(4), 850–864 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Daemen, V. Rijmen, AES proposal: Rijndael, www.nist.gov/aes/

  7. D. Eastlake, S. Crocker, J. Schiller, Randomness recommendations for security, RFC 1750, IETF, 1994

  8. O. Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudo-Randomness (Springer, Berlin, 1999)

    MATH  Google Scholar 

  9. O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions, J. Assoc. Comput. Mach. 33(4), 792–807 (1986)

    MathSciNet  Google Scholar 

  10. O. Goldreich, L.A. Levin, A hard core predicate for any one way function, in Proceedings of 21st ACM Symposium on Theory of Computing, 1989, pp. 25–32

  11. G. Hast, Nearly one-sided tests and the Goldreich–Levin predicate, SIAM J. Comput. 28, 1364–1396 (1999)

    Article  MathSciNet  Google Scholar 

  12. J. Håstad, R. Impagliazzo, L.A. Levin, M. Luby, Pseudo-random number generators from any one-way function, SIAM J. Comput. 28, 1364–1396 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Håstad, M. Näslund, Practical construction and analysis of pseudo-randomness primitives, in Advances in Cryptology—Asiacrypt 2001, ed. by C. Boyd. Lecture Notes in Computer Science, vol. 2248 (Springer, Berlin, 2001), pp. 442–459

    Chapter  Google Scholar 

  14. J. Håstad, M. Näslund, BMGL: Synchronous key-stream generator with provable security, in Proceedings of the 1st Open NESSIE Workshop, 13–14 November 2000

  15. J. Håstad, M. Näslund, Improved analysis of the BMGL key-stream generator, in Proceedings of the 2nd Open NESSIE Workshop, 12–13 September 2001

  16. D. Knuth, Seminumerical Algorithms, 2nd edn. The Art of Computer Programming, vol. 2 (Addison-Wesley, Reading, 1982)

    Google Scholar 

  17. L. Levin, One-way functions and pseudo-random generators, Combinatorica 7, 357–363 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  18. L. Levin, Randomness and non-determinism, J. Symb. Log. 58(3), 1102–1103 (1993)

    Google Scholar 

  19. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error Correcting Codes (North-Holland, Amsterdam, 1977)

    MATH  Google Scholar 

  20. G. Marsaglia, The Diehard statistical tests, http://stat.fsu.edu/~geo/diehard.html

  21. M. Näslund, Universal hash functions & hard-core bits, in Proceedings of Advances in Cryptology—Eurocrypt 1995. Lecture Notes in Computer Science, vol. 921 (Springer, Berlin, 1995), pp. 356–366

    Google Scholar 

  22. S. Pyka, The statistical evaluation of the NESSIE submission BMGL, NESSIE Public report NES/DOC/SAG/WP3/039/1, 2001

  23. P. Rogaway, D. Coppersmith, A software-optimized encryption algorithm, J. Cryptol. 11(4), 273–287 (1988)

    Article  Google Scholar 

  24. B. Schneier, Applied Cryptography (Wiley, New York, 1995)

    Google Scholar 

  25. U.V. Vazirani, V.V. Vazirani, Efficient and secure pseudo-random number generation, in Proceedings of 25th IEEE Symposium on Foundations of Computer Science, 1984, pp. 458–463

  26. A.C. Yao, Theory and applications of trapdoor functions, in Proceedings of 23rd IEEE Symposium on Foundations of Computer Science, 1982, pp. 80–91

Download references

Author information

Authors and Affiliations

  1. Royal Inst. of Technology, 10044, Stockholm, Sweden

    Johan Håstad

  2. Communications Security Lab, Ericsson Research, 16480, Stockholm, Sweden

    Mats Näslund

Authors
  1. Johan Håstad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mats Näslund
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mats Näslund.

Additional information

Communicated by Moti Yung

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Håstad, J., Näslund, M. Practical Construction and Analysis of Pseudo-Randomness Primitives. J Cryptol 21, 1–26 (2008). https://doi.org/10.1007/s00145-007-9009-3

Download citation

  • Received: 18 June 2003

  • Revised: 25 February 2007

  • Published: 15 September 2007

  • Issue Date: January 2008

  • DOI: https://doi.org/10.1007/s00145-007-9009-3

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Hard core function
  • One-way function
  • Pseudo random generator
  • Exact security
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature