Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences

DOI10.1007/978-3-319-55227-9_5zbMath1409.11138OpenAlexW2593872646MaRDI QIDQ5267793

Arne Winterhof, Richard M. Höfer

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

zbMATH Keywords

generating functionlinear complexitybinomial coefficientsLegendre sequenceautomatic sequencelinear recurrence sequenceexpansion complexitythree-square theorem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

Pseudorandom sequences derived from automatic sequences ⋮ On the pseudorandomness of automatic sequences ⋮ Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the arithmetic autocorrelation of the Legendre sequence
• Expansion complexity and linear complexity of sequences over finite fields
• On the joint linear complexity profile of explicit inversive multisequences
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Permutation polynomials, de Bruijn sequences, and linear complexity
• The least quadratic non residue
• The distribution of quadratic residues and non‐residues
• Suites algébriques, automates et substitutions
• Automatic Sequences
• On the use of expansion series for stream ciphers
• Progress in Cryptology - INDOCRYPT 2003

This page was built for publication: Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences