A near optimal S-box design

  • Authors:
  • Debojyoti Bhattacharya;Nitin Bansal;Amitava Banerjee;Dipanwita RoyChowdhury

  • Affiliations:
  • IIT-Kharagpur, Kharagpur, India;IIT-Kharagpur, Kharagpur, India;IIT-Kharagpur, Kharagpur, India;IIT-Kharagpur, Kharagpur, India

  • Venue:
  • ICISS'07 Proceedings of the 3rd international conference on Information systems security
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work a cryptographically robust S-box based on nonlinear Cellular Automata rules has been developed. Properties suggest that the robustness of the proposed construction is better than that proposed by Seberry et al. [1]. Though the proposed S-box is not optimal to the linear and differential attacks like Rijndael S-box, its immunity towards linear cryptanalysis and robustness against differential cryptanalysis is high and it lacks algebraic relations over finite field. Due to the presence of synchronous elements in its architecture, timing constraints can also be fulfilled efficiently if hardware masking is done on the circuit to prevent it against power attack. Also due to Cellular Automata based structure, the S-box can be efficiently implemented in hardware and in software for high speed design.