Paper Info
Title
An Efficient Affine Equivalence Algorithm for Multiple S-Boxes and a Structured Affine Layer.
Abstract
An affine equivalence problem is to find affine mappings A and B such that (F=Bcirc Scirc A) for given two permutations F and S, which was first studied by Biryukov et al. Their algorithm for solving an affine equivalence problem is quite efficient and has been used in the cryptanalytic toolbox for many cryptographic schemes. Recently, Baek et al. presented a specialized affine equivalence algorithm (SAEA), which solves an affine equivalence problem in the case that S is a concatenation of several smaller S-boxes. The SAEA is more efficient than the affine equivalence algorithm for special cases, but its complexity mainly depends on the entire input size of F.
Year
Venue
Field
2016
SAC
Affine transformation,Discrete mathematics,Affine shape adaptation,Combinatorics,Affine space,Affine combination,Affine coordinate system,Algorithm,Affine plane,Affine group,Affine hull,Mathematics
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Jung Hee Cheon11787129.74
Hyunsook Hong252.09
Joohee Lee3112.92
Jooyoung Lee457346.13