On the public citation graph

Local randomness in pseudorandom sequences

https://doi.org/10.1007/bf00196773

0 signed · 46 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot

A Mathematical Theory of Communication

inferredcites →https://doi.org/10.1002/j.1538-7305.1984.tb00072.xopenalex-snapshot

Wire-Tap Channel II

inferredcites →https://doi.org/10.1007/0-387-34799-2_14openalex-snapshot

Efficient, Perfect Random Number Generators

inferredcites →https://doi.org/10.1007/3-540-45961-8_19openalex-snapshot

On the Construction of Random Number Generators and Random Function Generators

inferredcites →https://doi.org/10.1007/3-540-46885-4_42openalex-snapshot

On the Security of Schnorr’s Pseudo Random Generator

inferredcites →https://doi.org/10.1007/978-3-322-96647-6openalex-snapshot

Primality and Cryptography

inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot

A fast and simple randomized parallel algorithm for the maximal independent set problem

inferredcites →https://doi.org/10.1016/0885-064x(89)90015-0openalex-snapshot

On the power of two-point based sampling

inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot

The Theory of Error-Correcting Codes

inferredcites →https://doi.org/10.1090/s0002-9939-1971-0279857-5openalex-snapshot

On a Sequence of Almost Deterministic Pairwise Independent Random Variables

inferredcites →https://doi.org/10.1109/18.6037openalex-snapshot

A spectral characterization of correlation-immune combining functions

inferredcites →https://doi.org/10.1109/proc.1980.11608openalex-snapshot

The theory of error-correcting codes

inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot

Theory and application of trapdoor functions

inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot

Theory and application of trapdoor functions

inferredcites →https://doi.org/10.1109/sfcs.1985.55openalex-snapshot

The bit extraction problem or t-resilient functions

inferredcites →https://doi.org/10.1109/tit.1977.1055688openalex-snapshot

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

inferredcites →https://doi.org/10.1109/tit.1987.1057356openalex-snapshot

An updated table of minimum-distance bounds for binary linear codes

inferredcites →https://doi.org/10.1137/0213053openalex-snapshot

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

inferredcites →https://doi.org/10.1137/0215025openalex-snapshot

A Simple Unpredictable Pseudo-Random Number Generator

inferredcites →https://doi.org/10.1137/0215074openalex-snapshot

A Simple Parallel Algorithm for the Maximal Independent Set Problem

inferredcites →https://doi.org/10.1214/aoms/1177700007openalex-snapshot

Pairwise Statistical Independence

inferredcites →https://doi.org/10.1214/aop/1176996762openalex-snapshot

On a Set of Almost Deterministic $k$-Independent Random Variables

inferredcites →https://doi.org/10.2307/1402860openalex-snapshot

Constructions and Combinatorial Problems in Design of Experiments

inferredcites →https://doi.org/10.2307/2007943openalex-snapshot

Primality and Cryptography.

inferredcites →https://doi.org/10.2307/2284487openalex-snapshot

Constructions and Combinatorial Problems in Design of Experiments.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-47555-9_21openalex-snapshot

A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators

inferred← citeshttps://doi.org/10.1007/3-540-60590-8_22openalex-snapshot

On the need for multipermutations: Cryptanalysis of MD4 and SAFER

inferred← citeshttps://doi.org/10.1007/3-540-69710-1_8openalex-snapshot

About Feistel Schemes with Six (or More) Rounds

inferred← citeshttps://doi.org/10.1007/978-1-4471-5079-4_11openalex-snapshot

The Blum-Blum-Shub Generator and Related Ciphers

inferred← citeshttps://doi.org/10.1007/978-1-4615-2694-0_27openalex-snapshot

The Strong Secret Key Rate of Discrete Random Triples

inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_6openalex-snapshot

On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission

inferred← citeshttps://doi.org/10.1007/bf00125078openalex-snapshot

Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes

inferred← citeshttps://doi.org/10.1007/bf00202271openalex-snapshot

An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions

inferred← citeshttps://doi.org/10.1007/bf02684562openalex-snapshot

Using error-correcting encoders to design local-random sequence generators

inferred← citeshttps://doi.org/10.1007/pl00003817openalex-snapshot

On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited

inferred← citeshttps://doi.org/10.1007/s00145-001-0010-yopenalex-snapshot

Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications

inferred← citeshttps://doi.org/10.1016/j.vlsi.2026.102715openalex-snapshot

ExpanderGraph-128: A novel graph-theoretic block cipher with formal security analysis and hardware implementation

inferred← citeshttps://doi.org/10.1023/a:1008207230165openalex-snapshot

Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions

inferred← citeshttps://doi.org/10.1023/a:1008337029047openalex-snapshot

Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography

inferred← citeshttps://doi.org/10.1023/a:1025962825241openalex-snapshot

A complexity measure for families of binary sequences

inferred← citeshttps://doi.org/10.1109/aqtr.2016.7501282openalex-snapshot

BITMIX: A hardware accelerated randomized symmetric encryption method

inferred← citeshttps://doi.org/10.1109/isit.2015.7282995openalex-snapshot

Maximal Correlation Secrecy

inferred← citeshttps://doi.org/10.1145/266420.266452openalex-snapshot

Improved security bounds for pseudorandom permutations

inferred← citeshttps://doi.org/10.1201/9781315371993-25openalex-snapshot

AG codes, Weierstraß points and universal hashing

inferred← citeshttps://doi.org/10.17747/teds-2018openalex-snapshot

PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON TECHNOLOGY & ENTREPRENEURSHIP IN DIGITAL SOCIETY

inferred← citeshttps://doi.org/10.17747/teds-2018-86-89openalex-snapshot

Asymptotic Enumeration of Binary Orthogonal Arrays*

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.