all InfoSec news
Maximal Leakage of Masked Implementations Using Mrs. Gerber's Lemma for Min-Entropy. (arXiv:2305.06276v1 [cs.IT])
cs.CR updates on arXiv.org arxiv.org
A common countermeasure against side-channel attacks on secret key
cryptographic implementations is $d$th-order masking, which splits each
sensitive variable into $d+1$ random shares. In this paper, maximal leakage
bounds on the probability of success of any side-channel attack are derived for
any masking order. Maximal leakage (Sibson's information of order infinity) is
evaluated between the sensitive variable and the noisy leakage, and is related
to the conditional ``min-entropy'' (Arimoto's entropy of order infinity) of the
sensitive variable given the leakage. …
attack attacks channel entropy key masking order random secret secret key side-channel side-channel attack side-channel attacks variable