Concrete Evaluation of the Random Probing Security
This work addresses the problem of quantifying the security of masked implementations against random probing attacks for cryptographers and hardware security engineers.
This paper introduces Secret Recovery Probability (SRP) to quantify the informativeness of random probing leakages in masked implementations. It models intermediate variable relations using a parity equation system to evaluate SRP, demonstrating its effectiveness in assessing security against random probing attacks.
We study masked implementation's security when an adversary randomly probes each of its internal variables, intending to recover non-trivial knowledge about its secrets. We introduce a novel metric called Secret Recovery Probability (SRP) for assessing the informativeness of the probing leakages about the masked secrets. To evaluate SRP, our starting point is to describe the relations of the intermediate variables with a parity equation system where the target secret is an unknown of this system ...