Standard

Derivatives of bent functions in connection with the bent sum decomposition problem. / Shaporenko, Alexander.

In: Designs, Codes, and Cryptography, Vol. 91, No. 5, 05.2023, p. 1607-1625.

Research output: Contribution to journal › Article › peer-review

Harvard

Shaporenko, A 2023, 'Derivatives of bent functions in connection with the bent sum decomposition problem', Designs, Codes, and Cryptography, vol. 91, no. 5, pp. 1607-1625. https://doi.org/10.1007/s10623-022-01167-4

APA

Shaporenko, A. (2023). Derivatives of bent functions in connection with the bent sum decomposition problem. Designs, Codes, and Cryptography, 91(5), 1607-1625. https://doi.org/10.1007/s10623-022-01167-4

Vancouver

Shaporenko A. Derivatives of bent functions in connection with the bent sum decomposition problem. Designs, Codes, and Cryptography. 2023 May;91(5):1607-1625. Epub 2022 Dec 29. doi: 10.1007/s10623-022-01167-4

Author

Shaporenko, Alexander. / Derivatives of bent functions in connection with the bent sum decomposition problem. In: Designs, Codes, and Cryptography. 2023 ; Vol. 91, No. 5. pp. 1607-1625.

BibTeX

@article{cb533763728741d7be2f3dda1bceb087,
title = "Derivatives of bent functions in connection with the bent sum decomposition problem",
abstract = "In this paper, we investigate when a balanced function can be a derivative of a bent function. We prove that every nonconstant affine function in an even number of variables n is a derivative of (2n-1-1)∣ Bn-2∣ 2 bent functions, where Bn is the set of all bent functions in n variables. Based on this result, we propose a new iterative lower bound for the number of bent functions. We study the property of balanced functions that depend linearly on at least one of their variables to be derivatives of bent functions. We show the connection between this property and the “bent sum decomposition problem”. We use this connection to prove that if a balanced quadratic Boolean function is a derivative of a Boolean function, then this function is a derivative of a bent function.",
keywords = "Bent functions, Bent sum decomposition problem, Boolean functions, Derivatives of a bent function, Lower bound for the number of bent functions",
author = "Alexander Shaporenko",
note = "Acknowledgements: The work is supported by Mathematical Center in Akademgorodok under Agreement No. 075-15-2022-281 with the Ministry of Science and Higher Education of the Russian Federation. The author would like to thank Natalia Tokareva for her support and attention to this work. The author is also very grateful to the reviewers for their valuable remarks and comments.",
year = "2023",
month = may,
doi = "10.1007/s10623-022-01167-4",
language = "English",
volume = "91",
pages = "1607--1625",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
publisher = "Springer Netherlands",
number = "5",

}

RIS

TY - JOUR

T1 - Derivatives of bent functions in connection with the bent sum decomposition problem

AU - Shaporenko, Alexander

N1 - Acknowledgements: The work is supported by Mathematical Center in Akademgorodok under Agreement No. 075-15-2022-281 with the Ministry of Science and Higher Education of the Russian Federation. The author would like to thank Natalia Tokareva for her support and attention to this work. The author is also very grateful to the reviewers for their valuable remarks and comments.

PY - 2023/5

Y1 - 2023/5

N2 - In this paper, we investigate when a balanced function can be a derivative of a bent function. We prove that every nonconstant affine function in an even number of variables n is a derivative of (2n-1-1)∣ Bn-2∣ 2 bent functions, where Bn is the set of all bent functions in n variables. Based on this result, we propose a new iterative lower bound for the number of bent functions. We study the property of balanced functions that depend linearly on at least one of their variables to be derivatives of bent functions. We show the connection between this property and the “bent sum decomposition problem”. We use this connection to prove that if a balanced quadratic Boolean function is a derivative of a Boolean function, then this function is a derivative of a bent function.

AB - In this paper, we investigate when a balanced function can be a derivative of a bent function. We prove that every nonconstant affine function in an even number of variables n is a derivative of (2n-1-1)∣ Bn-2∣ 2 bent functions, where Bn is the set of all bent functions in n variables. Based on this result, we propose a new iterative lower bound for the number of bent functions. We study the property of balanced functions that depend linearly on at least one of their variables to be derivatives of bent functions. We show the connection between this property and the “bent sum decomposition problem”. We use this connection to prove that if a balanced quadratic Boolean function is a derivative of a Boolean function, then this function is a derivative of a bent function.

KW - Bent functions

KW - Bent sum decomposition problem

KW - Boolean functions

KW - Derivatives of a bent function

KW - Lower bound for the number of bent functions

UR - https://www.scopus.com/inward/record.url?eid=2-s2.0-85145178721&partnerID=40&md5=e0bc7bc2fc6db7002cf92fcb5ed55f39

UR - https://www.mendeley.com/catalogue/437613a8-db3d-3997-bb9f-b23f18eebe8c/

U2 - 10.1007/s10623-022-01167-4

DO - 10.1007/s10623-022-01167-4

M3 - Article

VL - 91

SP - 1607

EP - 1625

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 5

ER -

ID: 45661315