Constructions of S-boxes with uniform sharing

DOI10.1007/S12095-018-0345-YzbMATH Open1412.94218OpenAlexW2795283078WikidataQ128579106 ScholiaQ128579106MaRDI QIDQ2632834FDOQ2632834

Authors: Kerem Varici, Svetla Nikova, Ventzislav Nikov, Vincent Rijmen 

Publication date: 15 May 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/645162

Recommendations

• Constructing TI-friendly substitution boxes using shift-invariant permutations
• Threshold implementations of small S-boxes
• Threshold implementations of all \(3 \times 3\) and \(4 \times 4\) S-boxes
• Enabling 3-share threshold implementations for all 4-bit S-boxes
• Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Vectorial Boolean functions for cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Classification of 4 Bit S-Boxes
• Secure hardware implementation of nonlinear functions in the presence of glitches
• Threshold implementations of all \(3 \times 3\) and \(4 \times 4\) S-boxes
• Threshold Implementations Against Side-Channel Attacks and Glitches
• Strong 8-bit sboxes with efficient masking in hardware

Cited In (3)

• Constructing TI-friendly substitution boxes using shift-invariant permutations
• On cryptographic properties of \((n+1)\)-bit S-boxes constructed by known \(n\)-bit S-boxes
• Constructing S-boxes with low multiplicative complexity

This page was built for publication: Constructions of S-boxes with uniform sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632834)