Randomness in cryptography

DOI10.1007/978-3-319-18275-9_20MaRDI QIDQ2790444zbMATH OpenOpenAlexFDO

Authors Robert Rolland

Publication date 4 March 2016

Published in Computation, Cryptography, and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18275-9_20

zbMATH Keywords

cryptographydistinguisherpredictionpseudo-random generatorramdomnessseedYao theorem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 813732
• Binary Pseudo-Random Sequences Theory
• A comparison of two approaches to pseudorandomness
• scientific article; zbMATH DE number 861531
• scientific article; zbMATH DE number 708821

Cites work

• A note on Yao's theorem about pseudo-random generators
• scientific article; zbMATH DE number 861531 (Why is no real title available?)

Cited in

(4)

• A comparison of two approaches to pseudorandomness
• Randomness Re-use in Multi-recipient Encryption Schemeas
• scientific article; zbMATH DE number 813732 (Why is no real title available?)
• Random Sources for Cryptographic Systems

This page was built for publication: Randomness in cryptography

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