Jump and hop randomness tests for binary sequences
From MaRDI portal
Publication:2130056
DOI10.1007/s12095-021-00538-3zbMath1487.94129OpenAlexW4210702399WikidataQ114849182 ScholiaQ114849182MaRDI QIDQ2130056
Publication date: 25 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00538-3
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Random measures (60G57) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Linear complexity profiles and jump complexity
- Analysis and design of stream ciphers
- The measures of pseudorandomness and the NIST tests
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- Linear Complexity and Random Sequences
- The Probabilistic Theory of Linear 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Jump and hop randomness tests for binary sequences