A Pseudorandom Sequence--How Random Is It?

DOI10.2307/2324917MaRDI QIDQ2871083zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Jan Mycielski

Publication date 22 January 2014

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://zenodo.org/record/1235103

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cited in

(5)

• On the Ehrenfeucht-Mycielski sequence
• Related-key attacks against full Hummingbird-2
• The Linus sequence
• A linearly computable measure of string complexity
• A construction of a 𝜆-Poisson generic sequence

This page was built for publication: A Pseudorandom Sequence--How Random Is It?

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