Balanced Boolean Functions of σƒ>22n+2n+3(n≥4)-Reference-Cited by-同舟云学术

Balanced Boolean Functions of σ_ƒ>2²ⁿ+2ⁿ⁺³(n≥4)

Published:2015 Issue:6 Volume:E98.A Page:1313-1319
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

ZHOU Yu¹,WANG Lin¹,WANG Weiqiong²,DU Xiaoni³

Affiliation:

1. Science and Technology on Communication Security Laboratory

2. School of Science, Chang'an University

3. College of Mathematics and Information Science, Northwest Normal University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E98.A/6/E98.A_1313/_pdf

Reference14 articles.

1. [1] C.M. Adams and S.E. Tavares, “Generating and counting binary bent sequences,” IEEE Trans. Inf. Theory, vol.36, no.5, pp.1170-1173, 1990.

2. [2] P. Charpin and E. Psaslic, “On propagation characteristics of resilient functions,” SAC 2002, Lect. Notes Comput. Sci. 2595, pp.175-195, 2002.

3. [3] N.T. Courtois and M. Willi, “Algebraic attacks on stream ciphers with linear feedback,” Advances in Cryptology-Eurocrypt 2003, Lect. Notes Comput. Sci. 2656, pp.346-359, 2003.

4. [4] F. Göloglu and M.D. Yücel, “Necessary conditions on balanced Boolean functions with maximum nonlinearity,” Boolean functions: Cryptography and Applications, pp.1-10, 2005.

5. [5] B. Preneel, W. Leekwijck, L.V. Linden, et al., “Propagation characteristics of Boolean functions,” Advances in Cryptology-Eurocrypt'90, Lect. Notes Comput. Sci. 437, pp.155-165, 1991.