Sensitivities and block sensitivities of elementary symmetric Boolean functions-Reference-Cited by-同舟云学术

Sensitivities and block sensitivities of elementary symmetric Boolean functions

Published:2021-01-01 Issue:1 Volume:15 Page:434-453
ISSN:1862-2984
Container-title:Journal of Mathematical Cryptology
language:en
Short-container-title:

Author:

Zhang Jing¹,Li Yuan²,Adeyeye John O.²

Affiliation:

1. Mathematics Department, Governors State University , IL , 60484 , USA

2. Department of Mathematics, Winston-Salem State University , NC , 27110 , USA

Abstract

Abstract Boolean functions have important applications in molecular regulatory networks, engineering, cryptography, information technology, and computer science. Symmetric Boolean functions have received a lot of attention in several decades. Sensitivity and block sensitivity are important complexity measures of Boolean functions. In this paper, we study the sensitivity of elementary symmetric Boolean functions and obtain many explicit formulas. We also obtain a formula for the block sensitivity of symmetric Boolean functions and discuss its applications in elementary symmetric Boolean functions.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Computational Mathematics,Computer Science Applications

Link

https://www.degruyter.com/document/doi/10.1515/jmc-2020-0042/pdf

Reference33 articles.

1. Arnold RF , Harrison MA . Algebraic properties of symmetric and partially symmetric Boolean functions. IEEE Trans Electronic Comput. 1963;EC-12 (3):244–51.

2. Cai J-Y , Green F , Thierauf T. On the correlation of symmetric functions. Math Syst Theory. 1996;29 (3):245–58.

3. Canteaut A , Videau M. Symmetric Boolean functions. IEEE Trans Inf Theory. 2005;51 (8):2791–811.

4. Castro FN , González OE , Medina LA. A divisibility approach to the open boundary cases of Cusick-Li-Stănicăs conjecture. Cryptogr Commun. 2015;7 (4):379–402.

5. Castro FN , González OE , Medina LA. Diophantine equations with binomial coefficients and perturbation of symmetric Boolean functions. IEEE Trans Inf Theory. 2018;143 64 (2):1347–60.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Certificate complexity of elementary symmetric Boolean functions;Theoretical Computer Science;2022-11