IEICE TRANSACTIONS on Fundamentals
A Note on the Confusion Coefficient of Boolean Functions
Summary :
Low confusion coefficient values can make side-channel attacks harder for vector Boolean functions in Block cipher. In this paper, we give new results of confusion coefficient for f ⊞ g, f ⊡ g, f ⊕ g and fg for different Boolean functions f and g, respectively. And we deduce a relationship on the sum-of-squares of the confusion coefficient between one n-variable function and two (n - 1)-variable decomposition functions. Finally, we find that the confusion coefficient of vector Boolean functions is affine invariant.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E106-A No.12 pp.1525-1530
- Publication Date
- 2023/12/01
- Publicized
- 2023/05/24
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2023EAP1009
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Yu ZHOU
Science and Technology on Communication Security Laboratory
Jianyong HU
Science and Technology on Communication Security Laboratory
Xudong MIAO
Science and Technology on Communication Security Laboratory
Xiaoni DU
Northwest Normal University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yu ZHOU, Jianyong HU, Xudong MIAO, Xiaoni DU, "A Note on the Confusion Coefficient of Boolean Functions" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 12, pp. 1525-1530, December 2023, doi: 10.1587/transfun.2023EAP1009.
Abstract: Low confusion coefficient values can make side-channel attacks harder for vector Boolean functions in Block cipher. In this paper, we give new results of confusion coefficient for f ⊞ g, f ⊡ g, f ⊕ g and fg for different Boolean functions f and g, respectively. And we deduce a relationship on the sum-of-squares of the confusion coefficient between one n-variable function and two (n - 1)-variable decomposition functions. Finally, we find that the confusion coefficient of vector Boolean functions is affine invariant.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2023EAP1009/_p
Copy
@ARTICLE{e106-a_12_1525,
author={Yu ZHOU, Jianyong HU, Xudong MIAO, Xiaoni DU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Note on the Confusion Coefficient of Boolean Functions},
year={2023},
volume={E106-A},
number={12},
pages={1525-1530},
abstract={Low confusion coefficient values can make side-channel attacks harder for vector Boolean functions in Block cipher. In this paper, we give new results of confusion coefficient for f ⊞ g, f ⊡ g, f ⊕ g and fg for different Boolean functions f and g, respectively. And we deduce a relationship on the sum-of-squares of the confusion coefficient between one n-variable function and two (n - 1)-variable decomposition functions. Finally, we find that the confusion coefficient of vector Boolean functions is affine invariant.},
keywords={},
doi={10.1587/transfun.2023EAP1009},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - A Note on the Confusion Coefficient of Boolean Functions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1525
EP - 1530
AU - Yu ZHOU
AU - Jianyong HU
AU - Xudong MIAO
AU - Xiaoni DU
PY - 2023
DO - 10.1587/transfun.2023EAP1009
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2023
AB - Low confusion coefficient values can make side-channel attacks harder for vector Boolean functions in Block cipher. In this paper, we give new results of confusion coefficient for f ⊞ g, f ⊡ g, f ⊕ g and fg for different Boolean functions f and g, respectively. And we deduce a relationship on the sum-of-squares of the confusion coefficient between one n-variable function and two (n - 1)-variable decomposition functions. Finally, we find that the confusion coefficient of vector Boolean functions is affine invariant.
ER -
English
