A method for analyzing repetitive pseudorandom sequences by the criterion of Markov chain entropy
From MaRDI portal
Publication:6043937
DOI10.1134/s1995080223020385OpenAlexW4377230575MaRDI QIDQ6043937
Sergeĭ Viktorovich Shalagin, V. M. Zakharov
Publication date: 25 May 2023
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080223020385
stochastic matrixcriterion of Markov chain entropypseudorandom sequence analysisquality assessment accuracy
Cites Work
- Pseudorandom number generators based on random covers for finite groups
- Verifiable multi-secret sharing based on LFSR sequences
- Analysis and properties of maximal-length sequences
- A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs
- Shift-register synthesis and BCH decoding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A method for analyzing repetitive pseudorandom sequences by the criterion of Markov chain entropy