Expansion complexity and linear complexity of sequences over finite fields
DOI10.1007/s12095-016-0189-2zbMath1409.94855arXiv1606.06482OpenAlexW3103347853MaRDI 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 fieldscryptographylinear complexitybinomial coefficientspseudorandom sequencesexpansion complexity
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: Expansion complexity and linear complexity of sequences over finite fields