Jump and hop randomness tests for binary sequences
From MaRDI portal
Recommendations
- A new randomness test for bit sequences
- Modifications of Knuth randomness tests for integer and binary sequences
- On random binary sequences
- Periodic template tests: a family of statistical randomness tests for a collection of binary sequences
- scientific article; zbMATH DE number 1526592
- On a pseudorandom property of binary sequences
- Binary Pseudo-Random Sequences Theory
- On the measures of pseudorandomness of binary sequences.
- Practical next bit test for evaluating pseudorandom sequences
- Deterministic alternatives to statistical tests in binary pattern generators
Cites work
- scientific article; zbMATH DE number 4062985 (Why is no real title available?)
- scientific article; zbMATH DE number 177032 (Why is no real title available?)
- Analysis and design of stream ciphers
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- Linear Complexity and Random Sequences
- Linear complexity and related complexity measures
- Linear complexity profiles and jump complexity
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Shift-register synthesis and BCH decoding
- The Probabilistic Theory of Linear Complexity
- The measures of pseudorandomness and the NIST tests
Cited in
(2)
This page was built for publication: Jump and hop randomness tests for binary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2130056)