UA133751U - METHOD OF CRYPTOGRAPHICAL TRANSFER 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 that 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 cyclic shift and modulation operations 2 (ShiftRow) - using appropriate devices, functional sliding coding operations (SlidCode) - 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 the primitive binary Galois GF field (2 ). As the affine transformation matrix M, we use variable inverted symmetric matrices, which are selected according to the value of the cycle key. Functional operations of substitution, mixing, cyclic shifting and modulo 2 addition and sliding coding are not fixed but depend on s. Come key. iterative processing primitive cryptographic transformations occur in the order substitution (substitution), stirring (permutation), functional cyclic shift operations and addition modulo 2 (ShiftRow), functional coding moving operations (SlidCode).

Description

The utility 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 permutation blocks (P-blocks); substitution ( 5ЙиБ5ийсиоп) - using substitution blocks (5-blocks); functional operations of cyclic shift and addition modulo 2 - using appropriate devices. Iterative processing consists in multiple execution of the same groups of transformations, which provide the necessary conditions for the stability of cryptographic transformation: scattering (using P-blocks) and shuffling (using 5-blocks) 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 parameter values are used landslide

The closest analogue to the proposed technical solution is an 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 (regttshayop) - using cube shuffling blocks (ReptiyaZO blocks ); substitution (5Yirziyshiop) - 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. At the same time, the bit blocks of the Information sequence are presented in the form of three-dimensional matrices (cubes) and as a C-block they form a variable three-dimensional matrix of substitutions, and it 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 CE(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 closest analogue are that for the cryptographic transformation of information as a 5-block, a fixed substitution matrix is used, 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 the 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 make it possible to flexibly change the parameters of cryptographic processing and dynamically control the processes of substitution, shuffling, cyclic shift and addition by modulo 2 and sliding coding of information data in three-dimensional space, and that the functional operations of substitution, shuffling, cyclic shift and addition by modulo 2 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 (zYir5iyshiop), shuffling (reppshaikop), functional operations of cyclic shift and addition modulo 2 (ZPiYKkOm/), functional operations of sliding coding (5IiasSoae).

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 (5iSode) - with the help of mixed Gray codes, according to the useful model, bit blocks of the information sequence are presented in the form of three-dimensional matrices (cubes) and that as a 5-block they 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 bo 148 over the primitive binary Galois field SB(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 key and that the functional operations of substitution, shuffling, cyclic shift and addition modulo 2 and sliding coding are not fixed, but depend on the state of the key, and that iterative processing by primitive cryptographic transformations takes place in such a way properties: substitution (5!yB5Shsiop), shuffling (regtshiaiyop), functional operations of cyclic shift and addition modulo 2 (ZpPShKOm/), functional operations of sliding coding (51IiySode).

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 substitution, shuffling, cyclic shift and addition by modulo 2 and sliding coding.

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: shuffling (reptshayop) - with the help of cubes shuffling blocks (P-blocks); substitution (5!йБ51йшШЙоп) - using blocks of substitutions (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 (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 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 the affine transformation uses variable inverse symmetric matrices that are chosen according to the value of the cyclic key, and that the functional operations of substitution, shuffling, cyclic shift and addition modulo 2, and sliding coding are not fixed but depend on the state of the key, and that iterative processing by primitive cryptographic transformations takes place in the following sequence: substitution (5yr5IShyShshiop), shuffling (reptshatsop), functional operations of cyclic shift and addition modulo 2 (ZPSHKOm/), functional operations of sliding coding (51IiySode).

The cyclic key is produced from the encryption key using the production algorithm

From the keys. 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 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 substitution, shuffling, cyclic shift and addition by module 2 and sliding coding of information data in three-dimensional space.

Sources of information: 1. "RIR5 ROV 46-3" GEOEVAI IMEOVMATIOM RAVOSEBBIMIA ZTAMOANVOV ROVI SATIOM, RATA EMSAMRTIOM ZTAMOANVO (OE5) 1999 OKiobeg 25, radez 26. pEruLlymly. emeguzres.sot/MIZT/MIZT-RIRB/dompioaa. рыр?"зрес-РИР5 РОИВ 46-3.030171. рай 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 201404060; application 04/16/2014; published 06/25/2015, Bulletin Mo 12. - 5 p.

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 (reptiiyaop) - with the help of cubes shuffling blocks (P-blocks); substitution (zibv5iyshiop) - using substitution blocks (5 blocks); functional operations of cyclic shift and addition modulo 2 (ZPSHNVOmU) - with the help of appropriate devices, functional operations of sliding coding (5iIiySode) - with the help of 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 as a 5-block form a variable three-dimensional matrix of substitutions, which is 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 CE(2), while as a matrix M affine transformation uses variable inverse symmetric matrices, which are chosen according to the value of the cyclic key, and that the functional substitution operation, shuffling, cyclic shift and addition modulo 2 and sliding coding are not fixed, and depend on the state of the key, and that iterative processing by primitive cryptographic transformations occurs in the following sequence: substitution (5!yB5iyshiop), shuffling (reptiiayop), functional operations of cyclic shift and addition by modulo 2 (ZPIYNOMm), functional operations of sliding coding. (5IiaSoavie).