A group theoretic approach to construct cryptographically strong substitution boxes

Abstract

In this paper, we present a method to construct a substitution box used in encryption applications. The proposed algorithm for the construction of substitution box relies on the linear fractional transform method. The design methodology is simple, while the confusion-creating ability of the new substitution box is complex. The strength of the proposed substitution box is evaluated, and an insight is provided to quantify the confusion-creating ability. In addition, tests are performed to assess the vulnerability of the encrypted data to algebraic and statistical attacks. The substitution box is critically analyzed by strict avalanche criterion, bit independent criterion, differential approximation probability test, linear approximation probability test, non-linearity test, and majority logic criterion. The performance of the proposed substitution box is also compared with those of some of the well-known counterparts including AES, APA, Gray, S₈, Skipjack, Xyi, and prime of residue substitution boxes. It is apparent that the performance, in terms of confusion-creating ability, of the new substitution box is better than those of some of the existing non-linear components used in encryption systems. The majority logic criterion is applied to these substitution boxes to further evaluate the strength and usefulness.