Skip to main content
SpringerLink
Log in

Linear complexity profile of binary sequences with small correlation measure

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Summary

A high linear complexity profile is a desirable feature of sequences used for cryptographical purposes. For a given binary sequence we estimate its linear complexity profile in terms of the correlation measure, which was introduced by Mauduit and Sárközy. We apply this result to certain periodic sequences including Legendre sequences, Sidelnikov sequences and other sequences related to the discrete logarithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences, Altenberger Strasse 69, 4040 Linz, Austria

    Nina Brandstätter

  2. Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences, Altenberger Strasse 69, 4040 Linz, Austria

    Arne Winterhof

Authors
  1. Nina Brandstätter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arne Winterhof
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brandstätter, N., Winterhof, A. Linear complexity profile of binary sequences with small correlation measure. Period Math Hung 52, 1–8 (2006). https://doi.org/10.1007/s10998-006-0008-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10998-006-0008-1

Search

Navigation