Practical construction and analysis of pseudo-randomness primitives

DOI10.1007/S00145-007-9009-3MaRDI QIDQ2482337zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mats Näslund, Johan Hastad

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

Exact securityHard core functionOne-way functionPseudo random generator

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2081080
• Theory of Cryptography
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• How to Construct Pseudorandom Permutations from Pseudorandom Functions

Cites work

• A Pseudorandom Generator from any One-way Function
• A software-optimized encryption algorithm
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 1583765 (Why is no real title available?)
• scientific article; zbMATH DE number 1676656 (Why is no real title available?)
• scientific article; zbMATH DE number 3928174 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2081080 (Why is no real title available?)
• Modern cryptography, probabilistic proofs and pseudo-randomness
• One way functions and pseudorandom generators
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(8)

• A unified approach to the analysis of compound pseudorandom numbers
• Practical continuously non-malleable randomness encoders in the random oracle model
• Computing OR on a randomized fixed adversary CRCW PRAM
• Number-theoretic constructions of efficient pseudo-random functions
• A complete characterization of the evolution of RC4 pseudo random generation algorithm
• scientific article; zbMATH DE number 2081080 (Why is no real title available?)
• scientific article; zbMATH DE number 1440878 (Why is no real title available?)
• scientific article; zbMATH DE number 7754310 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482337)