JPH0126101B2 - - Google Patents

Claims (1)

[Claims] 1 2 ^{P 2l} is a permutation that swaps the 2 ^l+1・i−2 ^l −jth data with the 2 ^l+1・i−j th data of all n1 data, and the different permutation P _{2l is} When the resulting permutation is P _n and the identity permutation that does not exchange data is P ₀ , all the permutations P _k obtained by continuing are elements of the permutation set, in the row direction and column direction. The data in the block, each consisting of 2 ^{n1 + 2n} bits, is divided into 2 ⁿ¹ bits in the row and column directions, and one subblock is composed of 2 ⁿ¹ × 2 ⁿ¹ bits of data, and each row in the subblock is For input data of 2 ⁿ¹ bits in the direction (or column direction), the elements of the permutation set are arranged in order from P ₀ , P ₀ , P ₁ , P ₂ ,... corresponding to the position occupied by the subblock within the block. ,P _2o1-1
The order of each permutation is determined by applying one of the permutations P _k of the above method to a means of carrying out the exchange;
It has 2 ⁿ¹ independently operable memories m ₁ , m ₂ , ... m _2o1 that store the rearranged input data, and the address input a ₀ , of each of the 2 ⁿ¹ memories is
a ₁ ,...,a _o1-1 for n ₁ , the memory
m _2l+1