Cryptographic properties of modified AES-like S-boxes

Using AES-like S-boxes (generated using finite field inversion) provides an excellent starting point for generating S-boxes with some specific design criteria dictated by the implemented cipher and still maintaining all the most commonly recognized cryptographic criteria to a large extent. This paper presents the results of statistical analysis of fulfilment of those basic cryptographic criteria by the modified AES-like S-boxes that do have neither equivalence nor cycles.