UA133747U - 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. The bit blocks of the information sequence are presented in the form of three-dimensional matrices (cubes) and, as an S-block, form a variable three-dimensional matrix of substitutions, which is constructed by obtaining a multiplicatively inverse x-1 element over the extended Galois finite field GF (28) and by performing the affine transformation y = M (x-1 + (over the primitive Galois binary field GF (2).) As the affine transformation matrices M, we use variable inverted symmetric matrices, which are chosen according to the value of the cycle key, and that the functional mixing operation is not fixed, but dependent on the state of the key, and that the iterative processing of primitive cryptographic transformations occurs in the following sequence: substitution, permutation, loop cycling and adding modular 2 (ShiftRow), sliding operations ).

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 (reptiiayop) - using permutation blocks (P-blocks); substitution (zIyB5iyshiop ) - 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 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 acts, 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 analogue to the proposed useful model 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 (reptiiaiop) - using cubes shuffling blocks (blocks ReptiiZO); 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, and it is constructed by obtaining the multiplicatively inverse element x" over the extended finite Galois field CE(29) " by performing the affine transformation y-M .x"-DV over the primitive Galois binary field C(2), at the same time 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 there is a fixed matrix of substitutions that 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 useful model is based on 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 mixing information data in three-dimensional space, and that the functional shuffling operation is not fixed, but depends on the state of the key, and that the iterative processing by primitive cryptographic transformations occurs in the following sequences: substitution (5!yB5iysiop), shuffling (reptiiaiiyop), functional operations of cyclic shift and addition modulo 2 (ZPyVoOm), functional operations sliding coding operations (51st Code).

The task is solved due to the fact that in 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 (repetition) - with the help of cubes shuffling blocks (P-blocks) ; substitution (5!irviyshiop) - using substitution blocks (5-blocks); functional operations of cyclic shift and addition according to module 2 (Z5NSHNOm) - with the help of appropriate devices, functional operations of sliding coding (51IiaSode) - with the help of mixed codes

Gray, 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, as a 5-block, form a variable three-dimensional substitution matrix, which is constructed by obtaining the multiplicative inverse element x' over the extended final Galois field CE( 28) and by performing the affine transformation y-M.x 14r over the primitive Galois binary field CE(2), while as the matrices 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 shuffling operation is not fixed, but depends on the state of the key, and that the iterative processing with primitive cryptographic transformations occurs in the following sequence: substitution (5!yB5iysiop), shuffling (reptiiaiyop), functional operations of cyclic shift and addition modulo 2 (ZPIYNOMm), functional operations of sliding coding (51 Iia Soavie).

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 mixing process.

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 (regtshiiyaaiyop) - with the help of cube shuffling blocks (P-blocks); substitution (5!Ir5iyshiop) - using blocks of substitutions (5-blocks); functional operations of cyclic shift and addition according to module 2 (ZPSHAAOmM) - 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(23) 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 shuffling operation is not fixed, but depends on the state of the key, and that the iterative processing by primitive cryptographic transformations takes place in the following sequence: substitution (5!yB5iyshiop), shuffling (reptshaiiop), functional operations of cyclic shift and addition by modulo 2 (ZNSHNoOm), 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 enables the cryptographic process

From the transformation, it is possible to flexibly change the shuffling matrix 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 process of mixing information data in three-dimensional space.

Sources of information: 1. "RIR5 ROV 46-3" GEOEVAI IMEOVMATIOM RAVOSEBBIMIa ZTAMOANVOV ROVI ISATIOM. RATA EMSAMRTIOM ZTAMOANVO (OE5) 1999 OKiobeg 25. - R. 26. pErulymliemeguzres.sot/MIZT/MIZT-RIRB/dompioaia. рыр7зрес-РИРБ5 РОВ 46-3.0301 71. рай 2. Patent of Ukraine for a utility model Mo 99696, IPC Сс09С 1/00 (2015.01). The method of cryptographic transformation of information / Biletskyi A.Ya., Navrotskyi D.O.; applicant and patent holder National Aviation University. -Me ts201404060; statement 16.04.2014; published 25.06.2015, Bull. 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 that as a 5-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"--rD over the primitive binary Galois field CE (2), while as the matrices 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 shuffling operation 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 : substitution (5!yB5iyshiop), shuffling (replication), functional operations of cyclic shift and addition by module 2 (ZPyVoOm), functional operations of sliding coding (51iaiae).