Practical construction and analysis of pseudo-randomness primitives

DOI10.1007/3-540-45682-1_26MaRDI QIDQ4474190zbMATH OpenFDO

Authors Mats Näslund, Johan Hastad

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2248/22480442.htm

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Recommendations

• Practical construction and analysis of pseudo-randomness primitives
• On the Power of the Randomized Iterate
• On the Power of the Randomized Iterate
• Theory of Cryptography
• How to construct pseudorandom permutations from single pseudorandom functions

Cited in

(10)

• A unified approach to the analysis of compound pseudorandom numbers
• Practical continuously non-malleable randomness encoders in the random oracle model
• Practical construction and analysis of pseudo-randomness primitives
• On the minimal hardware complexity of pseudorandom function generators
• 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
• Yarrow-160: Notes on the design and analysis of the Yarrow cryptographic pseudorandom number generator
• scientific article; zbMATH DE number 7754310 (Why is no real title available?)
• Performance improvement for the GGM-construction of pseudorandom functions

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 Q4474190)