Efficient amplification of the security of weak pseudo-random function generators

DOI10.1007/S00145-002-0007-1zbMath1031.94013OpenAlexW2885319196MaRDI QIDQ1402360

Steven Myers

Publication date: 27 August 2003

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-002-0007-1

zbMATH Keywords

XOR lemmadiamond isolation lemmapartially secure pseudo-random function generatorsecurity amplification

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (1)

A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch

This page was built for publication: Efficient amplification of the security of weak pseudo-random function generators