Local randomness in pseudorandom sequences

DOI10.1007/BF00196773MaRDI QIDQ1180515zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Publication:5751835
• Local Randomness in Polynomial Random Number and Random Function Generators
• A note on local randomness in polynomial random number and random function generators
• scientific article; zbMATH DE number 176069

Cites work

• scientific article; zbMATH DE number 4201454 (Why is no real title available?)
• scientific article; zbMATH DE number 3957197 (Why is no real title available?)
• scientific article; zbMATH DE number 4084824 (Why is no real title available?)
• scientific article; zbMATH DE number 3352656 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• scientific article; zbMATH DE number 3196560 (Why is no real title available?)
• scientific article; zbMATH DE number 4182680 (Why is no real title available?)
• A Mathematical Theory of Communication
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A Simple Unpredictable Pseudo-Random Number Generator
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• A spectral characterization of correlation-immune combining functions
• An updated table of minimum-distance bounds for binary linear codes
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On a Sequence of Almost Deterministic Pairwise Independent Random Variables
• On a set of almost deterministic k-independent random variables
• On the power of two-point based sampling
• Pairwise Statistical Independence
• Wire-Tap Channel II

Cited in

(12)

• Algebraic attacks against random local functions and their countermeasures
• A note on local randomness in polynomial random number and random function generators
• scientific article; zbMATH DE number 177622 (Why is no real title available?)
• Pseudorandom generators with long stretch and low locality from random local one-way functions
• scientific article; zbMATH DE number 4186979 (Why is no real title available?)
• A complexity measure for families of binary sequences
• Local Randomness in Polynomial Random Number and Random Function Generators
• An improvement of pseudorandomization against unbounded attack algorithms -- the case of fingerprint codes
• About Feistel schemes with six (or more) rounds
• Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes
• An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
• Algebraic attacks against random local functions and their countermeasures

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

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