Constructing Correlation Immune Symmetric Boolean Functions

スポンサーリンク

概要

• 論文の詳細を見る

• A Boolean function is said to be correlation immune if its output leaks no information about its input values. Such functions have many applications in computer security practices including the construction of key stream generators from a set of shift registers. Finding methods for easy construction of correlation immune Boolean functions has been an active research area since the introduction of the notion by Siegenthaler. In this paper, we present several constructions of nonpalindromic correlation immune symmetric Boolean functions. Our methods involve finding binomial coefficient identities and obtaining new correlation immune functions from known correlation immune functions. We also consider the construction of higher order correlation immunity symmetric functions and propose a class of third order correlation immune symmetric functions on n variables, where n+1(≥9) is a perfect square.

• （社）電子情報通信学会の論文
• 2011-07-01

著者

• Kan Haibin

  School Of Compute Science Fudan University

• Peng Jie

  School Of Mathematical Sciences Fudan University

関連論文

• A New Quaternion Design for Space-Time-Polarization Block Code with Full Diversity
• New Balanced Boolean Functions with Good Cryptographic Properties
• Constructing Even-Variable Symmetric Boolean Functions with High Algebraic Immunity
• Constructing Correlation Immune Symmetric Boolean Functions
• Annihilators and Algebraic Immunity of Symmetric Boolean Functions
• A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity"
• A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity"
• Practically Feasible Design for Convolutional Network Code

スポンサーリンク