Anna Guinet
Ruhr University Bochum, Bochum, Germany

Jan Schoone
Radboud University, Nijmegen, the Netherlands

Niklas Höher
Ruhr University Bochum, Bochum, Germany

Dina Hesse
Ruhr University Bochum, Bochum, Germany

Tim Güneysu
Ruhr University Bochum, Bochum, Germany

Keywords: probing model, masking, PRNG, LFSR, Walsh-Hadamard transform

Abstract

Masking is a widely adopted countermeasure to protect cryptographic implementations from side-channel attacks. Subsequent research has focused on designing masking schemes and formally proving their security, notably through the development of automated tools, within models abstracting the reality of a sidechannel analysis. These designs rely on an external source of randomness; however, there is currently no consensus on the choice of (pseudo-)random number generators for masking. To the best of our knowledge, existing formal proofs for masking security do not consider particular choices of random number generators, but rather assume that they yield uniformly distributed and independent random variables. In that context, we introduce the first verification framework that jointly analyzes a pseudorandom number generator— specifically, but not limited to, a linear feedback shift register—and a masking scheme, in the d-probing model. Our framework relies on the Walsh-Hadamard transform by drawing on techniques from linear cryptanalysis, which we extend to the robust probing model. We demonstrate our method on 4-bit and 8-bit S-boxes, provide a detailed analysis of the formal verification outcomes, and corroborate the findings with practical evaluations on an FPGA.