Transparency order (
) is one of the indicators used to measure the resistance of
-function to differential power analysis. At present, there are three definitions:
, redefined transparency order (
...), and modified transparency order (
). For the first time, we give one necessary and sufficient condition for
-function reaching
and completely characterize
-functions reaching
for any
and
. We find that any
-function cannot reach
for odd
. Based on the matrix product, the necessary conditions for
-function reaching
or
are given, respectively. Finally, it is proved that any balanced
-function cannot reach the upper bound on
(or
,
).
On the Signal-to-Noise Ratio for Boolean Functions ZHOU, Yu; ZHAO, Wei; CHEN, Zhixiong ...
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
12/2020, Letnik:
E103.A, Številka:
12
Journal Article
Recenzirano
The notion of the signal-to-noise ratio (SNR), proposed by Guilley, et al. in 2004, is a property that attempts to characterize the resilience of (n,m)-functions F=(f1,...,fm) (cryptographic S-boxes) ...against differential power analysis. But how to study the signal-to-noise ratio for a Boolean function still appears to be an important direction. In this paper, we give a tight upper and tight lower bounds on SNR for any (balanced) Boolean function. We also deduce some tight upper bounds on SNR for balanced Boolean function satisfying propagation criterion. Moreover, we obtain a SNR relationship between an n-variable Boolean function and two (n-1)-variable decomposition functions. Meanwhile, we give SNR(f⊞g) and SNR(f⊡g) for any balanced Boolean functions f,g. Finally, we give a lower bound on SNR(F), which determined by SNR(fi) (1≤i≤m), for (n,m)-function F=(f1,f2,…,fm).
On the signal-to-noise ratio for Boolean functions ZHOU, Yu; ZHAO, Wei; CHEN, Zhixiong ...
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
2020
Journal Article
Recenzirano
The notion of the signal-to-noise ratio (SNR), proposed by Guilley, et al in 2004, is a property that attempts to characterize the resilience of (n,m)-functions F = (f1, ..., fm) (cryptographic ...S-boxes) against differential power analysis. But how to study the signal-to-noise ratio for a Boolean function still appears to be an important direction. In this paper, we give a tight upper and tight lower bounds on SNR for any (balanced) Boolean function. We also deduce some tight upper bounds on SNR for balanced Boolean function satisfying propagation criterion. Moreover, we obtain a SNR relationship between an n-variable Boolean function and two (n-1)-variable decomposition functions. Meanwhile, we give SNR(f⊞g) and SNR(f⊡g) for any balanced Boolean functions f, g. Finally, we give a lower bound on SNR(F), which determined by SNR(fi) (1≤i≤m), for (n,m)-function F = (f1, f2, …, fm).
PDF
