High-speed pseudorandom number generation with small memory

DOI10.1007/3-540-48519-8_21MaRDI QIDQ4941819zbMATH OpenFDO

Authors William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan

Publication date 26 July 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48519-8_21

zbMATH Keywords

keyed secure hash functionpseudorandom generatorssecurity requirementsvariants of pseudorandom functions

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Design of Practical and Provably Good Random Number Generators
• Construction of RNG using random automata and ``one-way functions
• scientific article; zbMATH DE number 3928174
• scientific article; zbMATH DE number 910854
• On a Fast Version of a Pseudorandom Generator

Cited in

(7)

• Efficient deterministic and non-deterministic pseudorandom number generation
• Searching for compact algorithms: \texttt{CGEN}
• A fast pseudorandom number generator with BLAKE hash function
• Sponge-based pseudo-random number generators
• Design of Practical and Provably Good Random Number Generators
• Construction of RNG using random automata and ``one-way functions
• MaD0: an ultrafast nonlinear pseudorandom number generator

This page was built for publication: High-speed pseudorandom number generation with small memory

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