Construction of nonlinear resilient boolean functions using "small" affine functions

被引:22
作者
Sarkar, P [1 ]
Maitra, S [1 ]
机构
[1] Indian Stat Inst, Appl Stat Unit, Kolkata 700108, W Bengal, India
关键词
algebraic degree; balancedness; Boolean functions; correlation immunity; nonlinearity; resiliency;
D O I
10.1109/TIT.2004.833366
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this correspondence, we use affine functions on a small number of variables to construct resilient functions on a large number of variables. We show that by properly combining these functions it is possible to achieve high nonlinearity and high algebraic degree. An important contribution of the correspondence is to show that for each order of resiliency m, it is possible to find infinitely many odd and even positive integers n, such that it is possible to construct (maximum degree) n-variable, m-resilient functions having nonlinearity strictly greater than 2(n-1) - 2([n/2]). We also present construction of some important functions on a small number of variables.
引用
收藏
页码:2185 / 2193
页数:9
相关论文
共 21 条
[11]  
PASALIC E, 2001, P WORKSH COD CRYPT W, V6
[12]  
PATTERSON NJ, 1990, IEEE T INFORM THEORY, V36, P443
[13]   BENT FUNCTIONS [J].
ROTHAUS, OS .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 20 (03) :300-305
[14]  
Sarkar P, 2000, LECT NOTES COMPUT SC, V1807, P485
[15]  
Sarkar P, 2000, LECT NOTES COMPUT SC, V1880, P515
[16]  
Seberry J., 1994, Advances in Cryptology - EUROCRYPT '93. Workshop on the Theory and Application of Cryptographic Techniques Proceedings, P181
[17]  
Seberry J., 1994, Advances in Cryptology - CRYPTO '93. 13th Annual International Cryptology Conference Proceedings, P49
[19]  
Stanica P, 2004, LECT NOTES COMPUT SC, V3017, P161
[20]  
Tarannikov Y., 2000, Progress in Cryptology - INDOCRYPT 2000. First International Conference in Cryptology in India. Proceedings (Lecture Notes in Computer Science Vol.1977), P19