Threshold implementations of small S-boxes

被引：35

作者：

Bilgin, Begul ^{[1
,2
,3
]}

Nikova, Svetla ^{[1
,2
]}

Nikov, Ventzislav ^{[4
]}

Rijmen, Vincent ^{[1
,2
]}

Tokareva, Natalia ^{[5
,6
]}

Vitkup, Valeriya ^{[5
,6
]}

机构：

[1] Katholieke Univ Leuven, ESAT COSIC, Leuven, Belgium

[2] iMinds, Leuven, Belgium

[3] Univ Twente, EEMCS DIES, NL-7500 AE Enschede, Netherlands

[4] NXP Semicond, Leuven, Belgium

[5] Sobolev Inst Math, Novosibirsk, Russia

[6] Novosibirsk State Univ, Novosibirsk 630090, Russia

来源：

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES | 2015年 / 7卷 / 01期

基金：

俄罗斯基础研究基金会;

关键词：

DPA; Masking; Glitches; Sharing; Nonlinear functions; S-box; Decomposition; POWER ANALYSIS; HARDWARE; MASKING; CLASSIFICATION;

D O I：

10.1007/s12095-014-0104-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Threshold implementation (TI) is a masking method that provides security against first-order DPAwithminimal assumptions on the hardware. It is based on multi-party computation and secret sharing. In this paper, we provide an efficient technique to find TIs for all 3 and 4-bit permutations which also covers the set of 3 x 3 and 4 x 4 invertible S-boxes. We also discuss alternative methods to construct shared functions by changing the number of variables or shares. Moreover, we further consider the TI of 5-bit almost bent and 6-bit almost perfect nonlinear permutations. Finally, we compare the areas of these various TIs.

引用

页码：3 / 33

页数：31

共 47 条

[21] On the classification of APN functions up to dimension five [J].

Brinkmann, Marcus ;

Leander, Gregor .

DESIGNS CODES AND CRYPTOGRAPHY, 2008, 49 (1-3) :273-288

[22] Codes, Bent Functions and Permutations Suitable for DES-like Cryptosystems [J].

Carlet C. ;

Charpin P. ;

Zinoviev V. .

Designs, Codes and Cryptography, 1998, 15 (2) :125-156

[23]

Coron JS, 2014, LECT NOTES COMPUT SC, V8441, P441, DOI 10.1007/978-3-642-55220-5_25

[24]

Daemen J., 1994, Fast Software Encryption. Cambridge Security Workshop Proceedings, P18

[25]

Daemen J., 2001, Fast Software Encryption. 7th International Workshop, FSE 2000. Proceedings (Lecture Notes in Computer Science Vol.1978), P134

[26]

deCanniere C., 2007, THESIS

[27] Unifying Leakage Models: From Probing Attacks to Noisy Leakage [J].

Duc, Alexandre ;

Dziembowski, Stefan ;

Faust, Sebastian .

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2014, 2014, 8441 :423-440

[28]

Golic JD, 2002, LECT NOTES COMPUT SC, V2523, P198

[29] Private circuits: Securing hardware against probing attacks [J].

Ishai, Y ;

Sahai, A ;

Wagner, D .

ADVANCES IN CRYPTOLOGY-CRYPTO 2003, PROCEEDINGS, 2003, 2729 :463-481

[30]

Knudsen L, 2010, LECT NOTES COMPUT SC, V6225, P16, DOI 10.1007/978-3-642-15031-9_2

← 1 2 3 4 5 →