Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rotation-k Affine-Power-Affine-like Multiple Substitution-Boxes for Secure Communication

Published 18 Jul 2016 in cs.CR | (1607.05024v1)

Abstract: Substitution boxes with thorough cryptographic strengths are essential for the development of strong encryption systems. They are the only portions capable of inducing nonlinearity in symmetric encryption systems. Bijective substitution boxes having both high nonlinearities and high algebraic complexities are the most desirable to thwart linear, differential and algebraic attacks. In this paper, a method of constructing algebraically complex and cryptographically potent multiple substitution boxes is proposed. The multiple substitution boxes are synthesized by applying the concept of rotation-k approach on the affine-power-affine structure. It is shown that the rotation-k approach inherits all the features of affine-power-affine structure. Performance assessment of all the proposed substitution boxes is done against nonlinearity, strict avalanche criteria, bits independent criteria, differential probability, linear approximation probability and algebraic complexity. It has been found that the proposed substitution boxes have outstanding cryptographic characteristics and outperform the various recent substitution boxes.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.