scientific article; zbMATH DE number 1440878

MaRDI QIDQ4949324zbMATH OpenFDO

Authors John Kelsey, Bruce Schneier, Niels Ferguson

Publication date 11 September 2002

zbMATH Keywords

authentication protocolsblock cipher chaining modescryptographydigital signature schemesrandom numbersseedssession keysYarrow cryptographic pseudorandom number generators

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A note on Yao's theorem about pseudo-random generators
• scientific article; zbMATH DE number 2081080
• Practical construction and analysis of pseudo-randomness primitives
• Designated-verifier pseudorandom generators, and their applications
• scientific article; zbMATH DE number 3919629
• scientific article; zbMATH DE number 1834026
• An analytic approach to secure pseudo-random generation
• Coupled pseudo random number generators and their cryptographic applications
• The Current Status in Design of Efficient Provably Secure Cryptographic Pseudorandom Generators

Cited in

(6)

• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• A brief and understandable guide to pseudo-random number generators and specific models for security
• No time to hash: on super-efficient entropy accumulation
• An efficient binary sequence generator with cryptographic applications
• The Current Status in Design of Efficient Provably Secure Cryptographic Pseudorandom Generators
• On Random Number Generation for Kernel Applications

Describes a project that uses

Uses Software

• CryptoLib

This page was built for publication:

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