UA134472U - METHOD OF CRYPTOGRAPHICAL TRANSFER OF INFORMATION - Google Patents

Abstract

The method of cryptographic transformation of information is that the information sequence is submitted in the form of 256 bit blocks, which are subject to iterative processing by primitive cryptographic transformations: permutation - using blocks of mixing cubes (P-blocks); substitution - by means of substitution blocks (S-blocks); Functional Loop-shift and Module 2 (ShiftRow) Functions - Using Appropriate Devices, SlidCode Functional Functions 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 permutation matrix is formed, which is constructed by obtaining a multiplicatively inverse x-1 element over the extended Galois finite field GF (28) and by performing an affine transformation y = M · x-1 + (over a primitive binary Galois GF field (2 ) Variable inverted symmetric arrays are selected as the affine transformation matrices, which are selected according to the value of the cycle key. Functional mixing and sliding coding operations are not fixed, but depend on the state of the key. chnymy transformations occur in the order substitution (substitution), stirring (permutation), functional cyclic shift operation addition modulo 2 (ShiftRow), functional coding moving operations (SlidCode).

Description

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

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 (reptshayop) - using blocks of permutations (P-blocks); substitution (5ЙиБ5ийшиоп ) - with the help of substitution blocks (5-blocks); functional operations of cyclic shift and addition modulo 2 - with the help of appropriate devices. Iterative processing consists in repeatedly performing the same groups of transformations that provide the necessary conditions for the stability of the cryptographic transformation: scattering (using P -blocks) and shuffling (using 5-blocks) of information data.

The disadvantages of this method are that for the cryptographic transformation of information as a 5-block, a fixed matrix of substitutions is used, 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 for the functional shuffling operation, fixed values of the shift parameters are used .

The closest to the proposed technical solution, chosen as the closest analogue, is the improved method of cryptographic transformation (21), 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 (reptshayop) - using blocks of shuffling cubes (blocks of Reptia30); substitution (5yirviyshiop) - with the help of substitution blocks (5-blocks); functional operations of cyclic shift and addition modulo 2 (ZpPISHKOm/) - with the help of appropriate devices. At the same time, the bit blocks of the information sequence are provided in in the form of three-dimensional matrices (cubes) and how the 5Z-block forms a variable three-dimensional matrix of substitutions, and is constructed by obtaining the multiplicative inverse element x" over the extended finite Galois field CE(29) and by performing the affine transformation y-M:x"D over the primitive binary field Galois CE(2), and you are the matrix M of the affine transformation use variable inverse symmetric matrices which

Zo is chosen 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 closest analog method are that for cryptographic transformation of information a fixed substitution matrix acts as a 5-block, 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 the 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 allow the conspiracy to flexibly change the parameters of cryptographic processing and dynamically control the processes of shuffling and sliding coding of information data in three-dimensional space, and that the functional operations of shuffling and sliding coding are not fixed, but depend on the state of the key, and that iterative processing with primitive cryptographic transformations occurs in the following sequence: substitution (z!irziysiop), shuffling (regtsiyop), functional operations of cyclic shift and addition by module 2 (ZpPShKoOm/), functional operations of sliding coding (51IiySode).

The task is solved due to 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: shuffling (regttiiayop) - using cubes shuffling blocks (P-blocks) ; substitution (zyr5iyshiop) - using substitution blocks (5-blocks); functional operations of cyclic shift and addition modulo 2 (ZPSHKOm/) - with the help of appropriate devices, functional operations of sliding coding (5iIiySode) - with the help of mixed Gray codes, in which, according to a useful model, the bit blocks of the information sequence are presented in the form of three-dimensional matrices ( cubes) and that as a 5-block form a variable three-dimensional substitution matrix, which is constructed by obtaining the multiplicative inverse element x' over the extended finite Galois field CE(28) and by performing the affine transformation y-M.'x-148 over the primitive binary Galois field SIE(2), while as the 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 operations of shuffling and sliding coding are not fixed, but depend on the state of the key, and that iterative processing by primitive cryptographic transformations occur in the following sequence: substitution (ziryshiop), mixing (reptshiiatsiop), functional operations of cyclic shift and addition by module 2 (ZpshkKoOmu), functional operations of sliding coding (5iIiaSoae).

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 processes of shuffling and sliding coding.

The method of cryptographic transformation of information is implemented 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: shuffling (reptshayop) - with the help of cubes shuffling blocks (P-blocks); substitution (zIirbiysiop) - with the help of substitution blocks (5-blocks); functional operations of cyclic shift and addition according to module 2 (ZPSHAOm) - with the help of appropriate devices; functional operations of sliding coding (BiidSocié) - with the help of 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 CE(25) and by performing the affine transformation (1) over the primitive binary Galois field CE(2), at the same time as a symmetric matrix M affine transformation uses variable inverse symmetric matrices, which are chosen according to the value of the cyclic key, and that the functional operations of scrambling and sliding coding are not fixed, but depend on the state of the key, and that iterative processing by primitive cryptographic transformations occurs in the following sequence: substitution (5!ЙБ5ийшиоп ), shuffling (reppshaikop), functional operations of cyclic shift and addition by modulo 2 (ЗПиЙКкоМ/), functional operations of sliding coding (5IiasSoae).

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, with the help of a cyclic 4-byte key, can

To be chosen from a large set of inverse matrices. 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 parameter of shuffling, substitution, cyclic shift and sliding coding is 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 (remains 7 with 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 processes of mixing and sliding coding of information data in three-dimensional space.

Sources of information: 1. RIR5 ROV 46-3" EEROEVAI IMEOVMATIOM RVOSEB5IMA ZTAMOANVNOB ROVI SATIOM. rATA EMSAMRTIOM ZTAMOANVO (OE5) 1999 OkyuoBbeg 25, radez 26. peruLlymly. emeguzres.sot/MIZT/MIZT-RIRB/dompiosaya. ryr-?"zres BIRO ROV 46-3.030171. rai 2. Patent of Ukraine for a utility model Mo 99696, IPC p09S 1/00 (2015.01). The method of cryptographic transformation of information / Biletskyi A.Ya., Navrotskyi D.O.; applicant and patent holder National Aviation University. - MOI 201404060; statement 16.04.2014; published 25.06.2015, Bull. Mo 12-5 p.m.

Claims (1)

USEFUL MODEL FORMULA 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: shuffling (regtshayop) - using cube shuffling blocks (P-blocks); substitution (zIireiyshiop) - using blocks of substitutions (5-blocks); functional operations of cyclic shift and addition according to modulo 2 (ZpPiiKoOU/) - with the help of appropriate devices, functional operations of sliding coding (5iiiSode) 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 that as a Z-block they 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 binary Galois field CE( 2), and 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 operations of scrambling and sliding coding are not fixed, but depend on the state of the key, and that the iterative processing by primitive cryptographic transformations occurs in the following sequence: substitution , shuffling (regtshayop), functional operations of cyclic shift addition by modulo 2 (ZpPyKoOU/), functional operations of sliding coding (51iaSoae).