How to Strengthen Pseudo-random Generators by Using Compression

DOI10.1007/11761679_9MaRDI QIDQ3593093zbMATH OpenOpenAlexFDO

Authors Aline Gouget, Hervé Sibert

Publication date 24 September 2007

Published in Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11761679_9

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1024042
• Fast Software Encryption
• scientific article; zbMATH DE number 1088915
• Shrinking generators and statistical leakage
• Design of Practical and Provably Good Random Number Generators

Cites work

• Advances in Cryptology - CRYPTO 2003
• Analysis and design of stream ciphers
• Fast Software Encryption
• Fast Software Encryption
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 1024042 (Why is no real title available?)
• scientific article; zbMATH DE number 1088915 (Why is no real title available?)
• scientific article; zbMATH DE number 2009965 (Why is no real title available?)
• scientific article; zbMATH DE number 2009966 (Why is no real title available?)
• scientific article; zbMATH DE number 2086709 (Why is no real title available?)
• Shift Register Sequences – A Retrospective Account
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems

Cited in

(1)

• Fast Software Encryption

Describes a project that uses

Uses Software

• eSTREAM

This page was built for publication: How to Strengthen Pseudo-random Generators by Using Compression

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