SLIDE 118 Introduction Countermeasures’ Dissection Information Extraction Attack Results Closed Source Evaluation Conclusion
Attack Path’s
P) ⊕ Ra AddRoundKey rin Sbox′ rout ShiftRows ShiftRows MixColumns MixColumns p
C
p
C
p
C
p′
p
Ra
p′
Multiplicative Pre-Computation
rm, rin, rout Sbox′
{0, . . . , 15} Computation p
C, p Ra
seed1 seed2
16 16
{0, 1, 2, 3} Computation p′
seed′
1
seed′
2 2 2
Inputs Pre-computation Encryption
- Attacker should at least:
◮ Get information rm ◮ Get information ra and c Uneven shuffling: ◮ No permutation ◮ 2-bit seeded permutations ◮ 16-bit seeded permutations ◮ All permutations can be enumerated ◮ We focus on the 2-bit seeded permutation
Olivier Bronchain Side-Channel Countermeasures’ Dissection 18 / 27