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
Efficient Amplification of the Security of Weak Pseudo-Random Function Generators
Download PDF
Download PDF
  • Published: January 2003

Efficient Amplification of the Security of Weak Pseudo-Random Function Generators

  • Myers1 

Journal of Cryptology volume 16, pages 1–24 (2003)Cite this article

Abstract. We show that given a PRFG (pseudo-random function generator) G that is (1/nc) -partially secure there exists a polynomial p such that the construction g 1 (x ⊕ r1) ⊕ · ⊕ g p(n) (x ⊕ r p(n) ) produces a strongly secure PRFG, where g i ∈ G and r i are strings of random bits, and the key for the new PRFG is composed of the r i 's and keys for the g i 's. This is the first ``natural'' construction of a (totally secure) PRFG from a partially secure PRFG. Using results of Luby and Rackoff, this result also demonstrates how to construct a PRPG ``naturally'' from a partially secure PRPG.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, 10 King's College Road, Toronto, Ontario, Canada M5S 3G4 myers@cs.toronto.edu, , , , , , CA

    Myers

Authors
  1. Myers
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Myers, . Efficient Amplification of the Security of Weak Pseudo-Random Function Generators . J. Cryptology 16, 1–24 (2003). https://doi.org/10.1007/s00145-002-0007-1

Download citation

  • Received: 24 July 2002

  • Revised: 06 December 2002

  • Issue Date: January 2003

  • DOI: https://doi.org/10.1007/s00145-002-0007-1

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

  • Key words. Pseudo-randomness, Security amplification, Function generators, XOR Lemma.
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