UA140092U - METHOD OF CRYPTOGRAPHIC TRANSFORMATION OF INFORMATION - Google Patents

Abstract

The method of cryptographic transformation of information is that the information sequence is presented in the form of bit blocks, which are subject to iterative processing by primitive cryptographic transformations: functional operations of cyclic shift and addition modulo 2 (ShiftRow) - using appropriate devices, substitution - using substitution blocks (S-blocks); mixing (permutation) using blocks for mixing cubes (P-blocks); SlidCode functional operations using mixed Gray codes. Bit blocks of the information sequence are presented in the form of three-dimensional matrices (cubes). As an S-block, a variable three-dimensional substitution matrix is formed, which is constructed by obtaining a multiplicative inverse element x-1 over the extended Galois finite field GF (28) and by performing an affine transformation y = Flies-1 ++ over a primitive Galois binary field GF (2), variable inverse symmetric matrices are used as the matrix Μ of the affine transformation, which are selected according to the value of the cyclic key, and that the functional operation of sliding coding is not fixed, but depends on the state of the key, and that iterative processing of primitive cryptographic transformations occurs in the following sequence: cyclic shift and addition modulo 2 (ShiftRow), mixing (permutation), substitution (substitution), functional operations of sliding coding (SlidCode).

Description

The useful model belongs to the field of cryptographic protection of information and can be used in encryption tools in information processing systems to expand their capabilities.

There is a known method of cryptographic transformation (1), which is based on the fact that the information sequence is presented in the form of 64-bit blocks, which are subject to iterative processing by primitive cryptographic transformations: permutation (repetition) using permutation blocks (P-blocks); substitution (zIyB5iyshiop) - using blocks of substitutions (5-blocks); functional operations of cyclic shift and addition by modulo 2 - with the help of appropriate devices. Iterative processing consists in multiple execution of the same groups of transformations, which provide the necessary conditions for stability of cryptographic transformation: scattering (using P-blocks) and mixing (using 5-blocks) of information data.

The disadvantages of this method are that for cryptographic transformation of information in quality

A fixed matrix of substitutions stands out from the block, which does not allow to flexibly change the parameters of cryptographic processing and dynamically control the process of shuffling information data, as well as the fact that fixed values of shift parameters are used for the functional shuffling operation.

The closest to the proposed technical solution, chosen as a prototype, is the improved method of cryptographic transformation |2)|, which is based on the fact that the information sequence is presented in the form of bit blocks, which are subject to iterative processing by primitive cryptographic transformations: shuffling (regtshiiaiiiop) - according to using cubes mixing blocks (ReptiyaZ30 blocks); substitution (zyb5iyshiop) - using substitution blocks (5-blocks); functional operations of cyclic shift and addition according to module 2 (ZPSHAOm) - with the help of appropriate devices. At the same time, the bit blocks of the information sequence are presented in the form of three-dimensional matrices (cubes) and as a 5-block form a variable three-dimensional matrix of substitutions, which is constructed by obtaining the multiplicative inverse element x" over the extended finite Galois field CE(25) and by performing the affine transformation y-M .x"--8 over the primitive Galois binary field C(2), while as a matrix

M affine transformation uses variable inverse symmetric matrices, which are chosen

Zo according to the value of the cyclic key, and the functional operations of the cyclic shift are not fixed, but depend on the state of the key.

The disadvantages of the prototype method are that for cryptographic transformation of information as

C-block is a fixed substitution matrix, which does not allow to flexibly change the parameters of cryptographic processing and dynamically control the process of substitution of information data, and that for cryptographic transformation of information, the substitution parameters are fixed, and that for cryptographic transformation of information, the cyclic shift parameters are fixed.

The basis of a useful model is the task of creating a method of cryptographic transformation of information, which, due to the use of four three-dimensional cryptographic transformations (substitution, shuffling, cyclic shift and sliding coding), will make it possible to flexibly change the parameters of cryptographic processing and dynamically control the process of sliding coding of information data in three-dimensional space, and that the functional operation of sliding coding is not fixed, but depends on the state of the key, and that iterative processing by primitive cryptographic transformations occurs in the following sequence: functional operations of cyclic shift and addition modulo 2 (5PyAVoΩ), shuffling (reptiiaiiop), substitution (vyrviysiop), functional operations of sliding coding (51IiaSoavye).

The problem is solved by the fact that the method of cryptographic transformation of information, which consists in the fact that the information sequence is presented in the form of bit blocks, which are subject to iterative processing by primitive cryptographic transformations: functional operations of cyclic shift and addition modulo 2 (ZPIINOmM) - with the help of appropriate devices , substitution (5!yBr5iyshiop) - using blocks of substitutions (5-blocks); shuffling (repeating) with the help of cube shuffling blocks (P-blocks); functional operations of sliding coding (5ii4Sode) using mixed Gray codes. Bit blocks of the information sequence are presented in the form of three-dimensional matrices (cubes). How a 5-block forms a variable three-dimensional matrix of substitutions, which is built by obtaining the multiplicatively inverse element x! over the extended finite Galois field SKE(28) and by performing the affine transformation y-M.x" - VD over the primitive binary Galois field cE(2) while variable inverse symmetric matrices are used as the matrix M of the affine transformation, which are chosen according to the value of the cyclic of the key, and that the functional operation of sliding coding is not fixed, but depends on the state of the key, and that iterative processing by means of primitive cryptographic transformations takes place in the following sequence:

functional operations of cyclic shift and addition by module 2 (ZpPIiNoOm), shuffling (reptiiaiop), substitution (zyiBziysiop), functional operations of sliding coding (51iaSoavye).

The technical result that can be obtained when implementing a useful model consists in obtaining the ability to flexibly change the parameters of cryptographic processing of information data and dynamically control the sliding coding process.

The method of cryptographic transformation of information is realized by the fact that the information sequence is presented in the form of 256-bit blocks, which are subject to iterative processing by primitive cryptographic transformations: functional operations of cyclic shift and addition modulo 2 (ZPISHNOMm) - with the help of appropriate devices, substitution (vybyyshiop) - with the help of blocks of substitutions (5-blocks); shuffling (reptshiayop) - with the help of cubes shuffling blocks (P-blocks); functional operations of sliding coding (BidSoade) - using mixed Gray codes. As a 5-block, there is a variable matrix of substitutions, which is constructed by obtaining the multiplicative inverse element x" over the extended finite Galois field SB(23) and by performing the affine transformation (1) over the primitive binary Galois field CE(2), while as a symmetric matrix M of the affine transformation, variable inverse symmetric matrices are used, which are chosen according to the value of the cyclic key, and that the functional operation of sliding coding is not fixed, but depends on the state of the key, and that iterative processing by primitive cryptographic transformations occurs in the following sequence: functional operations of cyclic shift and addition modulo 2 (ZpPiiNOm), shuffling (reptshaiiop), substitution (5!irviyshiop), functional operations of sliding coding (5iIiaSoave).

The cyclic key is generated from the encryption key using the key generation algorithm. The length of the cyclic key is equal to the length of the block. Cycle keys are generated from the encryption key using key expansion. The extended key is a linear array of 4-byte words. That is, at each iteration of the cryptographic transformation, a corresponding symmetric matrix M is used, which can be selected from a large set of inverse matrices with the help of a cyclic 4-byte key. This makes it possible to flexibly change the shuffling matrix in the process of cryptographic transformation and dynamically control the process of shuffling, substitution, cyclic shift and sliding coding of information data.

З Depending on the state of the round key, the parameters of shuffling, substitution, cyclic shift and sliding coding are selected, by adding modulo 2 all bytes of the key, setting 1 in the lower digit of the result of addition (to form an odd value) and getting rid of the higher digit of the result of addition (it remains 7 out of 8 significant bits). The final value determines the amount of shift in the current round.

Thus, due to the use of variable inverse symmetric matrices and a variable (dependent on the round key) substitution function, it is possible to apply dynamically changing substitution matrices and different values of sliding coding as a 5-block at each iteration of the cryptographic transformation of information, which makes it possible to flexibly change the parameters of cryptographic processing and dynamically control the process of sliding coding of information data in three-dimensional space.

Sources of information: 1. "RIR5 ROV 46-3" RGEOEVAI IMEOVMATIOM RVOSEBZ5IMa ZTAMOANVOZ ROVI ISATIOM. RATA EMSAMRTIOM ZTAMOANVO (OE5), 1999 OkyuoBbeg 25. - R. 26. pEruLlymly. emeguzres.sot/MIZT/MIZT-RIRB/dompiosaya. рыр?"zres-BIRO ROV 46-3.030171. rai 2. Patent of Ukraine for utility model Mo 99696, IPC Сс09С 1/00 (2015.01). Method of cryptographic transformation of information / Biletskyi A.Ya., Navrotskyi D.O.; applicant and patent holder National Aviation University - Mo c201404060; application 04/16/2014; published 06/25/2015, Mo 12 Bull. - 5 p.

Claims (1)

USEFUL MODEL FORMULA A method of cryptographic transformation of information, which consists in the fact that the information sequence is presented in the form of bit blocks, which are subject to iterative processing by primitive cryptographic transformations: functional operations of cyclic shift and addition modulo 2 (ZPSHNOmM) - with the help of appropriate devices, substitution ( 5!Irviyshiop) - with the help of substitution blocks (5-blocks); shuffling (repeating) with the help of cube shuffling blocks (P-blocks); functional operations of sliding coding (5iiySode) using mixed Gray codes, which is distinguished by the fact that the bit blocks of the information sequence are presented in the form of three-dimensional matrices (cubes) and how the 5-block forms a variable 60 three-dimensional matrix of substitutions, which are built by obtaining the multiplicatively inverse element x! over the extended finite Galois field CE(25) and by performing the affine transformation y-M.x"-8 over the primitive binary Galois field SK(2), while as a matrix The M affine transformation uses variable inverse symmetric matrices, which are chosen according to the value of the cyclic key, and that the functional operation of sliding coding is not fixed, but depends on the state of the key, and that the iterative processing by primitive cryptographic transformations occurs in the following sequence: functional operations of cyclic shift and addition by module 2 (5PAVoΩ), mixing (reptiiaiiop), substitution (virviyshiop), functional operations of sliding coding (51iaSoavier).