Open AccessAutomatic Search of Threshold Implementations of 4‐Bit S‐Boxes Resisting DPA
Author(s) -
Liu Bozhong,
Gong Zheng,
Qiu Weidong
Publication year - 2017
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2016.10.012
Subject(s) - bit (key) , implementation , computer science , arithmetic , algorithm , parallel computing , mathematics , programming language , computer network
The threshold implementation method of Substitution box (S‐box) has been proposed by Nikova et al. for resisting first‐order Differential power attacks with glitches. To lower the time complexity for a threshold implementation of a specific non‐linear function, one needs to decompose the function first and then search possible share methods for it. However, the time complexity for this search process is still non‐trivial. In this paper, an effective method of searching threshold implementations of 4‐bit S‐boxes is proposed. It mainly consists of two stages. For the decomposing stage, an efficient way of decomposing an S‐box is introduced. For the sharing stage, the search complexity is lowered by the technique of time memory trade‐off. As a result, threshold implementations of various lightweight block ciphers' S‐boxes are given. Moreover, our method is applied to each 4‐bit involutive S‐box and some candidates of threshold implementations are presented.