Local randomness in pseudorandom sequences

DOI10.1007/BF00196773zbMath0748.65008OpenAlexW1999184463MaRDI QIDQ1180515

Ueli M. Maurer, James L. Massey

Publication date: 27 June 1992

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

cryptographypseudorandom number generatorcryptographic securitylocal randomizationperfect local randomizerperfect local randomness

Mathematics Subject Classification ID

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

Related Items (4)

A complexity measure for families of binary sequences ⋮ An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions ⋮ Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes ⋮ About Feistel Schemes with Six (or More) Rounds

Cites Work

• A Mathematical Theory of Communication
• On the power of two-point based sampling
• On a set of almost deterministic k-independent random variables
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Simple Unpredictable Pseudo-Random Number Generator
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• An updated table of minimum-distance bounds for binary linear codes
• A spectral characterization of correlation-immune combining functions
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Pairwise Statistical Independence
• On a Sequence of Almost Deterministic Pairwise Independent Random Variables
• Wire-Tap Channel II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local randomness in pseudorandom sequences