Random Active Shield

Sébastien Briais (1) , Jean-Michel Cioranesco (2) , Jean-Luc Danger (3) , Sylvain Guilley (3) , David Naccache (4, 5) , Thibault Porteboeuf (1)

1 Secure-IC S.A.S
2 UP2 - Université Panthéon-Assas
3 Télécom ParisTech
4 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
5 LIENS - Laboratoire d'informatique de l'école normale supérieure

Recently, some active shielding techniques have been broken (e.g. by FlyLogic). The caveat is that their geometry is easy to guess, and thus they can be bypassed with an affordable price. This paper has two contributions. First of all, it provides a definition of the objectives of shielding, which is seldom found in publicly available sources. Notably, we precise the expected functionality, but also the constraints it must meet to be both manufacturable and secure. Second, we propose an innovative solution based on random shielding. The goal of this shielding is to make the geometry of the shield difficult to recognize, thereby making the ''identification'' phase of the attack harder than in previous schemes. Also, a proof of the shielding existence for two layers of metal is provided, which guarantees that the generation of the layout will succeed. Finally, we provide real tests of the shield generation algorithm, that show it is computationally tractable even for large areas to protect.

Mots clés: Active shield; spaghetti routing; harder identification phase; traveling salesman problem; genetic algorithms

Domaines: Cryptographie et sécurité [cs.CR]; Algorithme et structure de données [cs.DS]

Sébastien Briais, Jean-Michel Cioranesco, Jean-Luc Danger, Sylvain Guilley, David Naccache, et al.. Random Active Shield. Fault Diagnosis and Tolerance in Cryptography, Sep 2012, Leuven, Belgium. 11 p., ⟨10.1109/FDTC.2012.11⟩. ⟨hal-00721569v2⟩