Practical construction and analysis of pseudo-randomness primitives

DOI10.1007/s00145-007-9009-3zbMath1147.68020DBLPjournals/joc/HastadN08OpenAlexW2887959728WikidataQ56958898 ScholiaQ56958898MaRDI QIDQ2482337

Mats Näslund, Johan T. Håstad

Publication date: 16 April 2008

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

Full work available at URL: https://doi.org/10.1007/s00145-007-9009-3

zbMATH Keywords

One-way functionExact securityHard core functionPseudo random generator

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cites Work

• One way functions and pseudorandom generators
• Modern cryptography, probabilistic proofs and pseudo-randomness
• A software-optimized encryption algorithm
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• A Pseudorandom Generator from any One-way Function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Practical construction and analysis of pseudo-randomness primitives