Further Constructions of Almost Resilient Functions

Almost resilient function is the generalization of resilient function and have important applications in multiple authenticate codes and almost security cryptographic Boolean functions.In this paper,some secondary constructions are provided.In particular, the theorem 3 in [6] is improved. As e-almost(n, 1, k)-CI functions plays an important role in the secondary constructions, we concluded some properties and constructions. Specially we presented a spectrum characterization of balanced almost CI function, which can be used to identify a balanced almost CI function by computing its walsh spectra.

[1]  Yuliang Zheng,et al.  Cryptographically resilient functions , 1997, IEEE Trans. Inf. Theory.

[2]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[3]  Kaoru Kurosawa,et al.  Almost security of cryptographic Boolean functions , 2004, IEEE Transactions on Information Theory.

[4]  Kevin T. Phelps,et al.  Coding Theory and Cryptography : The Essentials , 2022 .

[5]  Palash Sarkar,et al.  Improved construction of nonlinear resilient S-boxes , 2005, IEEE Trans. Inf. Theory.

[6]  Enes Pasalic,et al.  A construction of resilient functions with high nonlinearity , 2003, IEEE Trans. Inf. Theory.

[7]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[8]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  James L. Massey,et al.  A spectral characterization of correlation-immune combining functions , 1988, IEEE Trans. Inf. Theory.

[10]  Ed Dawson,et al.  On construction of resilient functions , 1996, ACISP.

[11]  Qiaoyan Wen,et al.  Constructions of Almost Resilient Functions , 2005, CANS.

[12]  P. Sarkar,et al.  Improved construction of nonlinear resilient S-boxes , 2002, IEEE Transactions on Information Theory.