Optimality and Beyond: The Case of 4x4 S-boxes

被引:0
|
作者
Picek, Stjepan [1 ]
Ege, Baris [1 ]
Papagiatmopoulos, Kostas [1 ]
Batina, Lejla [1 ]
Jakobovic, Domagoj [2 ]
机构
[1] Radboud Univ Nijmegen, Digital Secur Grp ICIS, NL-6525 ED Nijmegen, Netherlands
[2] Univ Zagreb, Fac Elect Engn & Comp, Zagreb 41000, Croatia
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
S-boxes with better transparency order are expected to have higher side-channel resistance. For 8x8 S-boxes this is not practical, considering the costs of lookup-table implementations and deterioration of many properties like nonlinearity or delta uniformity. However, if we concentrate on the 4x4 S-box size we can observe that it is possible to obtain S-boxes with better transparency order while maintaining proper "classical" properties. To prove this, we experiment with PRINCE and PRESENT S-boxes. We use various methods and show that evolutionary algorithms are also viable in obtaining the lowest known transparency order value for the nonlinearity value of 4. Next, we show that affine transformation changes the transparency order while keeping "classical" properties intact. By using this technique, it is possible to generate optimal S-boxes with improved DPA-related properties.
引用
收藏
页码:80 / 83
页数:4
相关论文
共 50 条
  • [1] Generation of 8 x 8 S-boxes using 4 x 4 optimal S-boxes
    Tiwari, Vikas
    Singh, Ajeet
    Tentu, Appala Naidu
    Saxena, Ashutosh
    INTERNATIONAL JOURNAL OF INFORMATION AND COMPUTER SECURITY, 2023, 20 (3-4) : 399 - 413
  • [2] Multiplicative complexity of bijective 4 x 4 S-boxes
    Zajac, Pavol
    Jokay, Matus
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2014, 6 (03): : 255 - 277
  • [3] Threshold Implementations of All 3 x 3 and 4 x 4 S-Boxes
    Bilgin, Begul
    Nikova, Svetla
    Nikov, Ventzislav
    Rijmen, Vincent
    Stuetz, Georg
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2012, 2012, 7428 : 76 - 91
  • [4] On the classification of 4 bit S-Boxes
    Leander, G.
    Poschmann, A.
    ARITHMETIC OF FINITE FIELDS, PROCEEDINGS, 2007, 4547 : 159 - +
  • [5] Multiplicative complexity of bijective 4×4 S-boxes
    Pavol Zajac
    Matúš Jókay
    Cryptography and Communications, 2014, 6 : 255 - 277
  • [6] Construction of S-boxes with LBN and DBN ≥ 4
    Pal, Sonu
    Pal, Saibal. K.
    Panigrahi, Anupama
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2023, 26 (06): : 1665 - 1682
  • [7] Monolithic InP optical crossconnects: 4x4 and beyond
    Fish, GA
    Mason, B
    Coldren, LA
    DenBaars, SP
    PHOTONICS IN SWITCHING, PROCEEDINGS, 2000, 32 : 17 - 19
  • [8] Lightweight and Side-channel Secure 4 x 4 S-Boxes from Cellular Automata Rules
    Ghoshal, Ashrujit
    Sadhukhan, Rajat
    Patranabis, Sikhar
    Datta, Nilanjan
    Picek, Stjepan
    Mukhopadhyay, Debdeep
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2018, 2018 (03) : 311 - 334
  • [9] On weakly APN functions and 4-bit S-Boxes
    Fontanari, Claudio
    Pulice, Valentina
    Rimoldi, Anna
    Sala, Massimiliano
    FINITE FIELDS AND THEIR APPLICATIONS, 2012, 18 (03) : 522 - 528
  • [10] Classification of 4-bit S-Boxes for BOGI Permutation
    Kim, Seonggyeom
    Hong, Deukjo
    Sung, Jaechul
    Hong, Seokhie
    IEEE ACCESS, 2020, 8 : 210935 - 210949