Cubic Boolean functions with highest resiliency
暂无分享,去创建一个
[1] Anne Canteaut,et al. Decomposing bent functions , 2002, Proceedings IEEE International Symposium on Information Theory,.
[2] Anne Canteaut,et al. Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5 , 2000, EUROCRYPT.
[3] Tadao Kasami,et al. On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes , 1976, Inf. Control..
[4] Anne Canteaut,et al. Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions , 2000, EUROCRYPT.
[5] Tadao Kasami,et al. On the weight structure of Reed-Muller codes , 1970, IEEE Trans. Inf. Theory.
[6] Palash Sarkar,et al. Nonlinearity Bounds and Constructions of Resilient Boolean Functions , 2000, CRYPTO.
[7] Palash Sarkar,et al. Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions , 2000, IACR Cryptol. ePrint Arch..
[8] Pascale Charpin,et al. On Propagation Characteristics of Resilient Functions , 2002, Selected Areas in Cryptography.
[9] Anne Canteaut,et al. On cryptographic properties of the cosets of R(1, m) , 2001, IEEE Trans. Inf. Theory.
[10] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[11] Claude Carlet,et al. On Correlation-Immune Functions , 1991, CRYPTO.
[12] Claude Carlet,et al. A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction , 2002, CRYPTO.
[13] Thomas Siegenthaler,et al. Correlation-immunity of nonlinear combining functions for cryptographic applications , 1984, IEEE Trans. Inf. Theory.
[14] Yuriy Tarannikov,et al. Spectral analysis of high order correlation immune functions , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).