On Linear Complexity of Kronecker Sequences(Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• Recently six conjectures on linear complexities (LC) of some Kronecker sequences of two or three component sequences are proposed by Karkkainen. In [8], the LC of Kronecker sequences of two component sequences were studied by Uehara and Imamura, their results are true except in the case when e_b 【greater than or equal】2 or when e_a=e_b=1. In this paper the LC for Kronecker sequences of two component sequences are determined completely, and it is shown that all the six conjectures are true except in some special cases, which are listed and corrected.

• 社団法人電子情報通信学会の論文
• 2003-11-01

著者

• HU Lei

  State Key Laboratory of Information Security (Graduate School of Chinese Academy of Sciences)

• Hu L

  State Key Lab. Of Information Security Chinese Acad. Of Sci. Beijing Chn

• WANG QuanLong

  State Key Laboratory of Information Security (Graduate School of Chinese Academy of Sciences)

• DAI ZongDuo

  State Key Laboratory of Information Security (Graduate School of Chinese Academy of Sciences)

• Hu Lei

  State Key Lab. Of Information Security Graduate School Of Chinese Acad. Of Sciences

関連論文

• Binary Constant Weight Codes Based on Cyclic Difference Sets
• New Family of Binary Sequences with Low Correlation
• A Family of Binary Sequences with 4-Valued Optimal Out-of-Phase Correlation and Large Linear Span(Information Theory)
• Constructing Boolean Functions by Modifying Maiorana-McFarland's Superclass Functions(Symmetric Key Cryptography)(Cryptography and Information Security)
• On Linear Complexity of Kronecker Sequences(Information Security)
• On Linear Complexity of Kronecker Sequences
• A Family of p-ary Binomial Bent Functions

スポンサーリンク