Change search
ReferencesLink to record
Permanent link

Direct link
Practical construction and analysis of pseudo-randomness primitives
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.ORCID iD: 0000-0002-5379-345X
2008 (English)In: Journal of Cryptology, ISSN 0933-2790, E-ISSN 1432-1378, Vol. 21, no 1, 1-26 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2008. Vol. 21, no 1, 1-26 p.
Keyword [en]
hard core function, one-way function, pseudo random generator, exact, security
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-17289DOI: 10.1007/s00145-007-9009-3ISI: 000252826900001ScopusID: 2-s2.0-38849092133OAI: diva2:335332

QC 20100525

Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2012-09-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Håstad, Johan
By organisation
Numerical Analysis and Computer Science, NADA
In the same journal
Journal of Cryptology
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 43 hits
ReferencesLink to record
Permanent link

Direct link