Enumeration of balanced symmetric functions over GF(p)

详细信息    查看全文

• 作者：Shaojing Fu ; Chao Li ; Kanta Matsuura ; Longjiang Qu
• 关键词：Cryptography ; Symmetric function ; Balanced function ; Permutation ; Equivalence class
• 刊名：Information Processing Letters
• 出版年：2010
• 出版时间：1 July 2010
• 年：2010
• 卷：110
• 期：14-15
• 页码：544-548
• 全文大小：159 K

文摘

Symmetric functions display some interesting properties since this class of functions are invariant under permutation of indices. In this paper, we prove that the construction and enumeration of the number of balanced symmetric functions over GF(p) are equivalent to solving an equation system and enumerating the solutions, as a result we obtain the exact number of n-variable balanced symmetric functions by searching the solutions of the equation system. When n and p become large, we give a lower bound on number of balanced symmetric functions over GF(p), and the lower bound provides best known result.