Binary linear transformation method for diffusion layer in substitution-permutation network block encryption

Abstract

The invention provides a binary linear transformation method for a diffusion layer in substitution-permutation network block encryption. The method mainly comprises the following steps of: transforming an 8-order Latin square to form a binary matrix, the Hamming weights of each row and each list of which are 8*8 of 5; and then detecting whether the matrix meets linear independence of random 3 lists, if passing the test, detecting whether the test of the matrix is reversible, if so, judging the matrix as a proper matrix. The invention provides a new binary linear transformation method for the diffusion layer in the substitution-permutation network block encryption; and the method has the advantages of simple implementation logic and high running efficiency, and meanwhile does not lose the attack resistance of a code structure.

Description

technical field [0001] The invention relates to a linear transformation method, in particular to a binary linear transformation method applied to a diffusion layer in substitution-permutation network block encryption. Background technique [0002] Information security itself covers a wide range, and from the perspective of security requirements, it involves information confidentiality, integrity, availability, authentication and non-repudiation. Among them, encryption technology is the core technology to ensure information security. Cryptographic technology mainly includes symmetric cryptographic algorithms and asymmetric cryptographic algorithms and protocols. Cryptographic algorithms are mainly divided into two categories: symmetric cryptographic algorithms and asymmetric cryptographic algorithms. A symmetric encryption algorithm means that the encryption key and the decryption key are the same, or knowing one of the keys is easy to derive the other key. Usually, the en...

AI Technical Summary

Problems solved by technology

The upper bound of the number of branches of the 8×8 binary matrix has been proved to be 5, which cannot reach the theoretical optimal value of 9

Kanda et al. found 10080 8×8 binary matrices with 5 branches (MasayukiKanda, Youichi Takashima, Tsutomu Matsumoto, et al. A Strategy for Constructing Fast RoundFunctions with Practical Security Against Differential and Linear Cryptanalysis, SAC'98, LNCS1556, 1999, pp.264-279), their method is to search by a computer program according to certain limited conditions, the calculation complexity of this algorithm is very large, and it cannot exhaust all situations

Images