Linear complexity and expansion complexity of some number theoretic sequences

DOI10.1007/978-3-319-55227-9_5MaRDI QIDQ5267793zbMATH OpenOpenAlexFDO

Authors 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 functionautomatic sequenceLegendre sequencelinear recurrence sequencebinomial coefficientslinear complexityexpansion complexitythree-square theorem

Mathematics Subject Classification ID

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

Recommendations

• Expansion complexity and linear complexity of sequences over finite fields
• On the \(N\)th linear complexity of automatic sequences
• Linear Complexity and Random Sequences
• Linear complexity and related complexity measures
• On the linear complexity of Legendre-Sidelnikov sequences

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• Automatic Sequences
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Expansion complexity and linear complexity of sequences over finite fields
• Linear complexity and related complexity measures
• On the arithmetic autocorrelation of the Legendre sequence
• On the joint linear complexity profile of explicit inversive multisequences
• On the use of expansion series for stream ciphers
• Permutation polynomials, de Bruijn sequences, and linear complexity
• Progress in Cryptology - INDOCRYPT 2003
• Pseudorandom sequences
• Suites algébriques, automates et substitutions
• The distribution of quadratic residues and non‐residues
• The least quadratic non residue

Cited in

(8)

• On the pseudorandomness of automatic sequences
• scientific article; zbMATH DE number 1972837 (Why is no real title available?)
• Pseudorandom sequences derived from automatic sequences
• Measures of pseudorandomness: arithmetic autocorrelation and correlation measure
• The straight line complexity of small factorials and primorials
• On the \(N\)th linear complexity of automatic sequences
• On the linear complexity of some new q-ary sequences
• Expansion complexity and linear complexity of sequences over finite fields

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)