Linear complexity profile of binary sequences with small correlation measure

N Brandstätter, A Winterhof - Periodica Mathematica Hungarica, 2006 - Springer
N Brandstätter, A Winterhof
Periodica Mathematica Hungarica, 2006Springer
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.
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果