Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences
DOI10.1007/978-3-319-55227-9_5zbMATH Open1409.11138OpenAlexW2593872646MaRDI QIDQ5267793FDOQ5267793
Richard M. Höfer, Arne Winterhof
Publication date: 13 June 2017
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55227-9_5
generating functionautomatic sequenceLegendre sequencelinear recurrence sequencebinomial coefficientslinear complexityexpansion complexitythree-square theorem
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Permutation polynomials, de Bruijn sequences, and linear complexity
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Suites algébriques, automates et substitutions
- Automatic Sequences
- Progress in Cryptology - INDOCRYPT 2003
- On the joint linear complexity profile of explicit inversive multisequences
- The least quadratic non residue
- The distribution of quadratic residues and non‐residues
- On the arithmetic autocorrelation of the Legendre sequence
- On the use of expansion series for stream ciphers
- Expansion complexity and linear complexity of sequences over finite fields
Cited In (6)
- Title not available (Why is that?)
- On the pseudorandomness of automatic sequences
- Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure
- Pseudorandom sequences derived from automatic sequences
- The straight line complexity of small factorials and primorials
- On the linear complexity of some new \(q\)-ary sequences
This page was built for publication: Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267793)
