Expansion complexity and linear complexity of sequences over finite fields
From MaRDI portal
Publication:517722
DOI10.1007/s12095-016-0189-2zbMath1409.94855arXiv1606.06482MaRDI QIDQ517722
László Mérai, Harald Niederreiter, Arne Winterhof
Publication date: 27 March 2017
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.06482
finite fields; cryptography; linear complexity; binomial coefficients; pseudorandom sequences; expansion complexity
68Q25: Analysis of algorithms and problem complexity
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure, SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER, Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences, Complexity of automatic sequences, On the \(N\)th linear complexity of automatic sequences, Hamming correlation of higher order, Perfect linear complexity profile and apwenian sequences, Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences, Pseudorandom sequences derived from automatic sequences, Algebraic dependence in generating functions and expansion complexity, On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence
Cites Work
- On the joint linear complexity profile of explicit inversive multisequences
- Analysis and design of stream ciphers
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- Permutation polynomials, de Bruijn sequences, and linear complexity
- On the use of expansion series for stream ciphers
- Shift-register synthesis and BCH decoding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
