The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
혼동 계수 값이 낮으면 블록 암호의 벡터 부울 함수에 대한 부채널 공격이 더 어려워질 수 있습니다. 본 논문에서는 f ⊞ g, f ⊡ g, f ⊕ g and fg 다양한 부울 함수용 f and g, 각각. 그리고 우리는 둘 사이의 혼동 계수의 제곱합에 대한 관계를 추론합니다. n-변수 함수와 두 가지(n - 1)-변수 분해 함수. 마지막으로 벡터 부울 함수의 혼동 계수는 아핀 불변임을 알 수 있습니다.
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
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.
부
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
부
@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},}
부
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 -