Constructing Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on an Odd Number of Variables
スポンサーリンク
概要
- 論文の詳細を見る
It is well known that Boolean functions used in stream and block ciphers should have high algebraic immunity to resist algebraic attacks. Up to now, there have been many constructions of Boolean functions achieving the maximum algebraic immunity. In this paper, we present several constructions of rotation symmetric Boolean functions with maximum algebraic immunity on an odd number of variables which are not symmetric, via a study of invertible cyclic matrices over the binary field. In particular, we generalize the existing results and introduce a new method to construct all the rotation symmetric Boolean functions that differ from the majority function on two orbits. Moreover, we prove that their nonlinearities are upper bounded by $2^{n-1}-\binom{n-1}{\lfloor\frac{n}{2}\rfloor}+2(n-6)$.
- 2012-06-01
著者
-
Kan Haibin
The Department Of Computer Science & Engineering Fudan University:graduate School And Informatio
-
PENG Jie
the Department of Mathematics and Statistics, Central China Normal University
関連論文
- Trellis Properties of Product Codes(Coding Theory)
- Constructing Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on an Odd Number of Variables