CN101383703A - Dynamic Encryption System and Method Based on Generalized Information Domain - Google Patents

Abstract

The present invention provides a dynamic encryption system based on the generalized information domain, which includes a connected pseudo-random code generator based on the generalized information domain, and an encryption and decryption subsystem. The encryption and decryption subsystem includes encryption and decryption subsystems; The pseudo-random code generator includes an initial address information IV generation module, an IV normalization module, an m module, a constraint processing module, and a key length judgment module connected in sequence, and the m module is also connected with the activity background generation module, and the activity background generation module The modules include a physical reconstruction module and a logical reconstruction module; both the encryption and decryption subsystems include a grouping coefficient and round key generation module, a grouping module, a position exchange module, and a replacement operation module. The invention introduces the generalized information domain, realizes the transfer of the security problem of the key to the security problem of the generalized information domain, and has strong resistance to conventional cryptographic analysis.

Description

Dynamic Encryption System and Method Based on Generalized Information Domain

technical field

The invention relates to the field of cryptography, in particular to a dynamic encryption system and method based on a generalized information domain.

Background technique

In recent years, computer network has developed rapidly and is widely used in various fields such as politics, military affairs, economy and science, and more and more information has been effectively transmitted and stored. Due to the openness of the computer network, information may be stolen in the process of transmission and storage, and the confidentiality, integrity, availability and non-repudiation of information all need to be realized by cryptographic technology. Modern high-performance computers can automatically analyze and intercept transmitted information, and can search hundreds of bottom codes per second, thus posing a serious threat to information security. The information field is eager to have more secure, convenient and effective means of information protection.

As one of the basic theories of network security, cryptography has attracted great attention and attracted more and more researchers to invest in the field of cryptography; at the same time, due to the actual needs in real life and the development and changes of computing technology, Many new topics and new directions have appeared in every research field of cryptography. For example, the AES solicitation activity led to a climax of block cipher research in international cryptography. At the same time, in the field of public key cryptography, ECC has attracted widespread attention due to its advantages of high security and fast calculation speed.

Encryption technology is mainly divided into symmetric cipher and asymmetric cipher, and symmetric cipher is further divided into stream cipher and block cipher. Stream ciphers are represented by the RC4 algorithm, while block ciphers are represented by DES and AES. Traditional block ciphers usually carry out definite scrambling diffusion transformation, which makes the system have some specific properties. As a result, the system is vulnerable to linear analysis, differential analysis, algebraic attack and other cryptanalysis methods to a certain extent, thus affecting its security. sex. As the first and most important modern symmetric encryption algorithm, the most serious weakness of DES is the short key length. This weakness became more obvious in the 1990s. In July 1998, the Cryptography Research Society, the Advanced Wireless Technology Association and the Electronic Frontier Foundation jointly constructed a key search machine called Deep crack, and successfully found the DES challenge key after 56 hours of searching, which shows that Computing technology in the late 1990s used 56-bit keys that were too short for an otherwise secure single-key cipher. A subsequent improvement is the multi-round DES with increased key length. AES, which is also a symmetric encryption, is an encryption algorithm obviously based on mathematical theory, relying on the relevant properties of finite fields/finite rings for encryption and decryption. Currently the most discussed is the algebraic attack on AES (XSL). Existing research shows that if the XSL attack is a polynomial time of the number of algorithm rounds, the security of AES does not increase exponentially with the number of rounds. Due to its definite grouping, definite key length and definite scrambling diffusion algorithm, AES is unsatisfactory when it comes to large amounts of data and data with high correlation. Symmetric cryptosystems all involve key issues, and pseudorandom codes are usually used as keys.

Traditional encryption algorithms have the following problems:

(1) For traditional encryption algorithms, such as AES, etc., the generation of its key (that is, pseudo-random code) can usually be represented by a two-tuple

K=(m, IV)

Among them, K is the key; m is the key generation algorithm, which is usually difficult to keep secret; IV is the initial value, that is, the seed value required by the algorithm, which is kept secret; m and IV are directly related to the key, and the key generation algorithm generally uses The iterative method starts from the initial value IV to iteratively generate the key; the traditional encryption algorithm has definite scrambling and diffusion transformation, and the encrypted information depends on the key. On the other hand, the key needs to be encrypted for storage/encrypted transmission/secret channel transmission; Therefore, the key to the security problem of traditional algorithms lies in the key;

(2) The decryption key needs to be transmitted to the decryption party through an encryption method or a secret channel to decrypt the ciphertext. During the transmission process, both the ciphertext and the decryption key may be intercepted, so it is possible to pass the ciphertext-only attack or password Analyzing and cracking the ciphertext, so that the information transmission loses the security guarantee, which also greatly increases the complexity of key management;

(3) Due to various reasons in the traditional encryption algorithm, a key is often used repeatedly in the actual use process, and there are security problems caused by multiple reuse.

Contents of the invention

The primary purpose of the present invention is to overcome the shortcomings and deficiencies of the above-mentioned prior art, and provide a dynamic encryption system based on the generalized information domain. The group structure enables the encryption and decryption parties to have a common activity background obtained through the transformation of the generalized information domain. From the encryption party to the decryption party, the key does not appear explicitly and does not involve the transmission of the key, so that the problem of key security can be extended to the generalized The transfer of security issues in the information domain; the system can obtain any activity background through physical and logical reconstruction of the generalized information domain. Existing research shows that the complexity of this transformation is an NP-hard problem; encryption rounds, packet length Dynamically variable, the scrambling diffusion algorithm is completely determined by the permutation characteristics of the key and the statistical characteristics of the segments.

The object of the present invention is also to provide a method for realizing encryption and decryption of the dynamic encryption system based on the generalized information domain.

The purpose of the present invention is achieved through the following technical solutions: the dynamic encryption system based on the generalized information domain includes a connected pseudo-random code generator and an encryption and decryption subsystem based on the generalized information domain, and the encryption and decryption subsystem includes an encryption subsystem and a decryption subsystem. system;

The encryption subsystem includes grouping coefficients and round key generation modules, grouping modules, dual position exchange modules, and permutation operation modules that are connected in sequence; the decryption subsystem includes grouping coefficients and round key generation modules, grouping modules, and permutation operations that are connected in sequence module, dual position exchange module; and the encryption subsystem and the decryption subsystem share the same grouping coefficient and round key generation module;

The pseudo-random code generator based on the generalized information domain includes an initial address information (IV) generation module, an IV normalization module, a key generation algorithm (m) module, a constraint processing module, and a key length judgment module connected in sequence, The m module is also connected with the active background generation module;

At the same time, the pseudo-random code generator based on the generalized information domain is connected with the grouping coefficient and the round key generation module, the dual position exchange module, and the permutation operation module in the encryption subsystem and the decryption subsystem respectively. The key generation module is also connected with the m module through a breakpoint entry.

The active background generating module is mainly composed of a physical reconstruction module and a logical reconstruction module.

Any data that can be represented as a binary code in a computer is called the generalized information field (IF).

The method for realizing encryption and decryption using the above-mentioned dynamic encryption system based on the generalized information domain includes an encryption process and a decryption process. The encryption process is specifically as follows:

(1) The active background generation module obtains a certain subspace of the IF through the physical reconstruction of the selected IF, and then logically reconstructs the subspace into the active background;

(2) The IV generation module generates initial address information (IV), and the IV normalization module compresses or stretches the IV into a binary address string of a certain length, and divides it into n blocks:

_{x1 x2} ... X _n

As an n-dimensional logical address in the active context;

(3) The m module transforms the n-dimensional logical bit address and physical space in the active background, and extracts a k-bit long bit string from the active background in each address migration and incorporates it into the key sequence. In order to obtain the migration address, the constrained processing module performs constrained processing according to the frequency difference between the maximum value and the minimum value of the previous k-bit bit string value to obtain a correction value. Then the m module incorporates the correction value into the address sequence, and obtains a new n-dimensional migration address through translation;

(4) the key length judging module judges whether the length of the key is sufficient according to preset parameters, if not enough, then repeat step (3) operation, if enough, then output the key;

(5) Generate grouping coefficient and round key Key _r --- Select the number of encryption rounds for the user, the system automatically realizes the selection of each round of grouping coefficient and round key generation, and controls the grouping coefficient of each round within a certain range of rounds No repetition; the pseudo-random code generator based on the generalized information domain generates a bit string with a length of one byte or word, and selects the grouping coefficient n _r of the r-th round in the grouping coefficient set according to the value of the bit string, and then returns Step (3), the pseudo-random code generator based on the generalized information domain continues to generate Long round key Key _r ; repeat step (5) until all the grouping coefficients and round keys are generated, and finally the round key Key _r of each round is sequentially spliced into key K. This grouping coefficient is related to the operation of steps (6), (7), and (8), and the rounds of encryption can be increased according to the needs of scrambling diffusion;

的块为单位，按步骤(6)、(7)、(8)进行R轮加密；For multiple rounds of encryption, record n′=max(n _r ), r=1, 2, ..., R, where R is the number of encryption rounds, and the size is selected in turn as

The block is the unit, according to steps (6), (7), (8) to carry out R-round encryption;

；(6) Grouping scheme --- Group the key K according to the grouping coefficient n _r , and the grouping coefficient determines the address space of the plaintext group permutation encryption as

;

k_i和

形成对偶地址对。分析各个k_i的统计特性后进行相应的移位和对偶地址对应内容的交换处理；这些处理是由密钥的排列特性决定的，因此使用不同的密钥，加密时采取的移位及交换处理是不同的；(7) Dual position exchange --- the content _ki of the key K group represents the intra-group address of the encryption space group, and the bitwise inversion of _ki is obtained

k _i and

Form a dual address pair. After analyzing the statistical characteristics of each _ki , carry out the corresponding shifting and exchange processing of the corresponding content of the dual address; these processes are determined by the arrangement characteristics of the key, so different keys are used, and the shifting and exchange processing adopted during encryption is different;

占1bit，即视为二进制流的形式。在完成位置交换后，按以下公式计算出A′值(A′作为第r+1轮的A使用)：(8) Permutation operation --- the round key is Key _r = (K ₁ , K ₂ , ..., K _i ), the plaintext encryption space grouping A = (A ₀ , A ₁ , ..., A _i ), and the corresponding ciphertext grouping is $A\′=(A_0^{\′},A_1^{\′},...,A_i^{\′}).$ where K _i , A _i ,

Occupying 1 bit, it is regarded as the form of binary stream. After the position exchange is completed, the value of A' is calculated according to the following formula (A' is used as A in the r+1 round):

$\left\{\begin{array}{cc}{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0</span>}\\ {\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; \&NotEqual;</span>\mathrm{<span\; class="notranslate">\; 0</span>}\end{array}\right.<span\; class="notranslate">\; ;</span>$

When the above steps (6) to (8) are the rth round of encryption process performed by the encryption algorithm, the round of encryption ends, if the R round of encryption is not completed, steps (6) to (8) are repeated, otherwise turn to (9).

(9) If the plaintext has not been encrypted, return to (6); otherwise, the encryption is completed and the ciphertext is returned.

In the above method, the IV in step (2) is composed of one or more of system random number (SR), system internal time (ST), and specified content (SC), wherein SR and ST are obtained by calling a function, Realize the randomness and uniqueness of IV, and the specified content is given by the user to realize the personalization of IV.

In the above method, the function of the physical reconstruction in step (1) is to construct the selected generalized information domain (IF) into a physically visible subspace with a certain degree of discreteness; The obtained space is mapped into an n-dimensional logical space, which is discrete and random; the normalized IV is the address of a certain point in this high-dimensional logical space, and it is also the initial address for subsequent spatial trajectory transformation.

In the above-mentioned method, the IF described in step (1) can be any type of data, and is essentially an arbitrary long binary 0, 1 bit string in bytes, which has certain randomness and can be considered end-to-end of. The IF can be generated by an algorithm, such as a chaotic/hybrid chaotic system, or it can be an image, a text file, or a piece of code in memory. It can be labeled for ease of application. Consider using images and text files as generalized information domains during experiments, or use hybrid chaotic systems to generate different generalized information domains according to different initial values.

In the above method, the structure of the activity background described in step (1) under the selected generalized information collar has the following definition:

ABG-code IF-code [S ₁ /L ₁ ][,S ₂ /L ₂ ]…[Si/Li]… D ₁ , D ₂ , D ₃ [, D ₄ […]]

in:

ABG-code: activity background number, which is convenient for reference by code;

IF-code: generalized information domain number;

[S1/L1][,S2/L2]...[Si/Li]...: Physical reconstruction parameters, which can be chosen arbitrarily, resulting in a defined active background. Where Si is the offset and Li is the length expressed in decimal. The unit of physical reconstruction is byte;

D1, D2, D3[Di[,…]]: logic reconstruction parameters, Di is the dimension definition, expressed in decimal, gives the maximum subscript value of the dimension, optional in brackets, the unit of logic reconstruction is bit.

In the above method, the physical reconstruction module described in step (1) physically reconstructs the selected IF, and its specific operations are as follows:

If the physical reconstruction parameters are empty, the active background is equivalent to the selected information domain; if the physical reconstruction parameters are not empty, then a set of physical reconstruction parameters [Si/Li] is selected in turn, and the generalized information domain or the intermediate result From the fourth byte, a string of 0 and 1 with a length of Li bytes is intercepted as valid information. Physical reconstruction can expand the information of a generalized information domain into multiple physical information blocks of different activity backgrounds;

A set of discretization rules and algorithms are introduced in physical reconstruction to achieve the goal of one-way computability, high isolation and discretization. Therefore, by defining rules, physical reconstruction has the following characteristics:

a. One refactoring may cause multiple changes to a certain byte value, satisfying one-way computability;

b. Refactoring maintains random characteristics, such as the ratio of 0 and 1;

c. Reconstruct the physical structure that produces intermediate results or activity backgrounds, satisfying one-way computability, but there is no inverse function, and it is impossible to reversely calculate the upper-level results, which has a high degree of isolation.

In the above method, the logical reconstruction module described in step (1) performs logical reconstruction on the physically reconstructed IF to obtain the activity background, and its specific operations are as follows:

Convert the one-dimensional byte linear space into any multi-dimensional bit logic space, reconstruct the one-dimensional data obtained by physical reconstruction into D1×D2×…×Dn information blocks, then each bit corresponds to an address, and Each address can be represented by (y1, y2, ..., yn), and D1, D2, ..., Dn are the maximum subscript values of each dimension agreed in advance.

In the above method, the m ternary coordination of the IF, IV, and m modules described in steps (1), (2), and (3) realizes the trajectory migration in the background space, and the k-bit key is extracted during the migration process, and the key is modified simultaneously. Trajectories are migrated until the resulting length satisfies the requirement.

The decryption process of the decryption subsystem is basically the inverse process of the encryption process of the encryption subsystem. The execution sequence of the steps is as follows: grouping scheme, permutation operation, and dual position exchange.

The decryption process is as follows:

(1) The active background generation module obtains a certain subspace of the IF through the physical reconstruction of the selected IF, and then logically reconstructs the subspace into the active background;

(2) The IV generation module generates initial address information (IV), and the IV normalization module compresses or stretches the IV into a binary address string of a certain length, and divides it into n blocks:

_{x1 x2} ... X _n

As an n-dimensional logical address in the active context;

(3) The m module transforms the n-dimensional logical bit address and physical space in the active background, and in each address migration, extracts a k-bit long bit string from the active background and incorporates it into the key sequence, In order to obtain the migration address, the constraint processing module performs constraint processing according to the frequency difference between the maximum value and the minimum value of the previous k-bit bit string value to obtain a correction value; then the correction value is incorporated into the address sequence by the m module, through Translate to obtain a new n-dimensional migration address, and reserve the migration trajectory for future construction of the trajectory ring transformation matrix;

(4) the key length judging module judges whether the length of the key is sufficient according to preset parameters, if not enough, then repeat step (3) operation, if enough, then output the key;

长的轮密钥Key_r；重复步骤(5)，直到所有的分组系数及轮密钥生成完毕，最后把各轮的轮密钥Key_r依次拼接成密钥K。此分组系数关系到步骤(6)、(7)、(8)的操作；(5) Generation of grouping coefficients and round keys Key _r --- For the number of decryption rounds, the system automatically selects the grouping coefficients and generates round keys for each round, and controls the grouping coefficients of each round to not repeat within a certain range of rounds. The pseudo-random code generator based on the generalized information domain generates a bit string with a length of one byte or word, and selects the grouping coefficient n _r of the r-th round in the grouping coefficient set according to the value of the bit string, and then returns to step (3 ), continue to be generated by the pseudo-random code generator based on the generalized information domain

Long round key Key _r ; repeat step (5) until all the grouping coefficients and round keys are generated, and finally the round key Key _r of each round is sequentially spliced into key K. This grouping coefficient is related to the operation of steps (6), (7), (8);

During multiple rounds of decryption, record n'=max(n _r ), r=1, 2, ..., R, where R is the number of decryption rounds, and select blocks with a size of 2 ^n' as units in turn, according to step (7 ), (8), (9) carry out R round decryption;

(6) Grouping scheme --- Group the key K according to the grouping coefficient n _R-r+1 , and the grouping coefficient determines the address space for ciphertext group replacement and decryption as

(7) Replacement operation --- the round key is ${\mathrm{key}}_r^{\&prime;}=(K_1,K_2,...,K_i),$ is the Key _R-r+1 generated in step (5), the ciphertext decryption space grouping A=(A ₀ , A ₁ ,...,A _i ), and the corresponding plaintext grouping is $A\&prime;=(A_0^{\&prime;},A_1^{\&prime;},...,A_i^{\&prime;}).$ where K _i , A _i , Occupying 1 bit, it is regarded as the form of a binary stream. After the position exchange is completed, the value of A' is calculated according to the following formula (A' is used as A in the r+1 round):

$\left\{\begin{array}{cc}{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; \&NotEqual;</span>\mathrm{<span\; class="notranslate">\; 0</span>}\\ {\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0</span>}\end{array}\right.<span\; class="notranslate">\; ;</span>$

形成对偶地址对；分析各个k_i的统计特性后进行相应的移位和对偶地址对应内容的交换处理；这些处理是由密钥的排列特性决定的，因此使用不同的密钥，解密时采取的移位及交换处理是不同的；(8) Dual position exchange --- the content _ki of the key K group represents the intra-group address of the encryption space group, and the bitwise inversion of _ki is obtained k _i and

Form a pair of dual addresses; after analyzing the statistical characteristics of each _ki , perform corresponding shifting and exchange processing of the corresponding content of the dual address; these processes are determined by the arrangement characteristics of the key, so different keys are used, and the method used for decryption is Shift and swap are handled differently;

The above steps (6) to (8) are the rth round of decryption process performed by the decryption algorithm, and one round of decryption is over. If the R round of encryption is not completed, repeat steps (6) to (8), otherwise go to (9) ;

(9) If the ciphertext has not been decrypted, return to (6); otherwise, the decryption is completed and the plaintext is returned.

In the above method, the IV in step (2) is composed of one or more of system random number (SR), system internal time (ST), and specified content (SC), wherein SR and ST are obtained by calling a function, Realize the randomness and uniqueness of IV, and the specified content is given by the user to realize the personalization of IV.

In the above method, the function of the physical reconstruction in step (1) is to construct the selected generalized information domain (IF) into a physically visible subspace with a certain degree of discreteness; The obtained space is mapped into an n-dimensional logical space, which is discrete and random; the normalized IV is the address of a certain point in this high-dimensional logical space, and it is also the initial address for subsequent spatial trajectory transformation.

In the above-mentioned method, the IF described in step (1) can be any type of data, and is essentially an arbitrary long binary 0, 1 bit string in bytes, which has certain randomness and can be considered end-to-end of. The IF can be generated by an algorithm, such as a chaotic/hybrid chaotic system, or it can be an image, a text file, or a piece of code in memory. It can be labeled for ease of application. Consider using images and text files as generalized information domains during experiments, or use hybrid chaotic systems to generate different generalized information domains according to given different initial values.

In the above method, the structure of the activity background described in step (1) under the selected generalized information collar has the following definition:

ABG-code IF-code [S ₁ /L ₁ ][,S ₂ /L ₂ ]…[Si/Li]… D ₁ , D ₂ , D ₃ [, D ₄ [,…]]

in:

ABG-code: activity background number, which is convenient for reference by code;

IF-code: generalized information domain number;

[S1/L1][,S2/L2]...[Si/Li]...: Physical reconstruction parameters, which can be chosen arbitrarily, resulting in a defined active background. Where Si is the offset and Li is the length expressed in decimal. The unit of physical reconstruction is byte;

D1, D2, D3[Di[,…]]: logic reconstruction parameters, Di is the dimension definition, expressed in decimal, gives the maximum subscript value of the dimension, optional in brackets, the unit of logic reconstruction is bit.

In the above method, the physical reconstruction module described in step (1) physically reconstructs the selected IF, and its specific operations are as follows:

If the physical reconstruction parameters are empty, the active background is equivalent to the selected information domain; if the physical reconstruction parameters are not empty, then a set of physical reconstruction parameters [Si/Li] is selected in turn, and the generalized information domain or the intermediate result From the fourth byte, a string of 0 and 1 with a length of Li bytes is intercepted as valid information. Physical reconstruction can expand the information of a generalized information domain into multiple physical information blocks of different activity backgrounds;

A set of discretization rules and algorithms are introduced in physical reconstruction to achieve the goal of one-way computability, high isolation and discretization. Therefore, by defining rules, physical reconstruction has the following characteristics:

a. One refactoring may cause multiple changes to a certain byte value, satisfying one-way computability;

b. Refactoring maintains random characteristics, such as the ratio of 0 and 1;

c. Reconstruct the physical structure that produces intermediate results or activity backgrounds, satisfying one-way computability, but there is no inverse function, and it is impossible to reversely calculate the upper-level results, which has a high degree of isolation.

In the above method, the logical reconstruction module described in step (1) performs logical reconstruction on the physically reconstructed IF to obtain the activity background, and its specific operations are as follows:

Convert the one-dimensional byte linear space into any multi-dimensional bit logic space, reconstruct the one-dimensional data obtained by physical reconstruction into D1×D2×…×Dn information blocks, then each bit corresponds to an address, and Each address can be represented by (y1, y2, ..., yn), and D1, D2, ..., Dn are the maximum subscript values of each dimension agreed in advance.

In the above method, the m ternary coordination of the IF, IV, and m modules described in steps (1), (2), and (3) realizes the trajectory migration in the background space, and the k-bit key is extracted during the migration process, and the key is modified simultaneously. Trajectories are migrated until the resulting length satisfies the requirement.

Compared with the prior art, the dynamic encryption system based on the generalized information domain of the present invention has the following advantages:

(1) Introduce the concept of the generalized information domain, break through the limitation of the binary group, and expand it into a triplet (m, IV, IF) under the transformation of the generalized information domain. The encryption and decryption parties can generate any number, Keys of any length. From the encrypting party to the decrypting party, only the IV needs to be transmitted, the key does not appear explicitly, and does not involve the transmission of the key, so that the security of the key is transferred to the security of the generalized information domain, thereby greatly improving information security sex.

(2) Resistance to conventional cryptanalysis. The generalized information domain can obtain any number of activity backgrounds through physical reconstruction and logical reconstruction, and select one of them. The tunability of parameters in the reconstruction process involves the permutation and combination (exhaustive attack space) problem, and existing research shows that this transformation complexity is an NP-hard problem. At the same time, the dynamic grouping and position exchange selected by the system are nonlinear transformations, so as the number of rounds increases, the encryption time increases linearly, and the complexity of scrambling diffusion increases exponentially, so linear analysis, differential analysis, algebraic analysis Conventional cryptanalysis methods such as attacks are not suitable for this system.

Description of drawings

Fig. 1 is the structural representation of the system of the present invention;

Fig. 2 is the workflow of the system of the present invention.

Detailed ways

The present invention will be described in further detail below in conjunction with the embodiments and the accompanying drawings, but the embodiments of the present invention are not limited thereto.

Example

Fig. 1 shows that the present invention is based on the concrete structure of the dynamic encryption system of generalized information domain, comprises the pseudo-random code generator based on generalized information domain connected, encryption and decryption subcipher system, and this encryption and decryption subsystem comprises encryption subsystem, decryption subsystem system;

The encryption subsystem includes grouping coefficients and round key generation modules, grouping modules, dual position exchange modules, and permutation operation modules that are connected in sequence; the decryption subsystem includes grouping coefficients and round key generation modules, grouping modules, and permutation operations that are connected in sequence module, dual position exchange module; and the encryption subsystem and the decryption subsystem share the same grouping coefficient and round key generation module;

Wherein the pseudo-random code generator based on the generalized information domain includes an IV generation module, an IV normalization module, an m module, a constraint processing module, and a key length judging module connected in sequence, and the m module is also connected with the active background generation module at the same time connected, the active background generation module is mainly composed of a physical reconstruction module and a logical reconstruction module;

At the same time, the pseudo-random code generator based on the generalized information domain is respectively connected with the grouping coefficient in the encryption subsystem and the decryption subsystem, the round key generation module, the dual position exchange module, and the permutation operation module. The key generation module is also connected to the m module through a breakpoint entry.

Any data that can be represented as a binary code in a computer is called IF.

The method for implementing encryption and decryption using the above-mentioned dynamic encryption system based on the generalized information domain, as shown in Figure 2, includes an encryption process and a decryption process, and the encryption process is specifically as follows:

(1) The active background generation module obtains a certain subspace of the IF through the physical reconstruction of the selected IF, and then logically reconstructs the subspace into the active background;

(2) The IV generation module generates IV, and the IV normalization module compresses or stretches the IV into a binary address string of a certain length, and divides it into n blocks:

_{x1 x2} ... X _n

As an n-dimensional logical address in the active context;

(3) The m module transforms the n-dimensional logical bit address and physical space in the active background, and in each address migration, extracts a k-bit long bit string from the active background and incorporates it into the key sequence, In order to obtain the migration address, the constraint processing module performs constraint processing according to the frequency difference between the maximum value and the minimum value of the previous k-bit bit string value to obtain a correction value; then the correction value is incorporated into the address sequence by the m module, through Translate to obtain a new n-dimensional migration address;

(4) the key length judging module judges whether the length of the key is sufficient according to preset parameters, if not enough, then repeat step (3) operation, if enough, then output the key;

长的轮密钥Key_r；重复步骤(5)，直到所有的分组系数及轮密钥生成完毕，最后把各轮的轮密钥Key_r依次拼接成密钥K。此分组系数关系到步骤(6)、(7)、(8)的操作，根据置乱扩散的需要可以增加加密的轮次；(5) Generate grouping coefficient and round key Key _r --- Select the number of encryption rounds for the user, the system automatically realizes the selection of each round of grouping coefficient and round key generation, and controls the grouping coefficient of each round within a certain range of rounds Not repeating. The pseudo-random code generator based on the generalized information domain generates a bit string with a length of one byte or word, and selects the grouping coefficient n _r of the r-th round in the grouping coefficient set according to the value of the bit string, and then returns to step (3 ), continue to be generated by the pseudo-random code generator based on the generalized information domain

Long round key Key _r ; repeat step (5) until all the grouping coefficients and round keys are generated, and finally the round key Key _r of each round is sequentially spliced into key K. This grouping coefficient is related to the operation of steps (6), (7), and (8), and the rounds of encryption can be increased according to the needs of scrambling diffusion;

During multiple rounds of encryption, remember n'=max(n _r ), r=1, 2, ..., R, where R is the number of rounds of encryption, and select blocks with a size of 2 ^n' as units in turn, according to step (6 ), (7), (8) carry out R round encryption;

(6) Grouping scheme --- Group the key K according to the grouping coefficient n _r , and the grouping coefficient determines the address space of the plaintext group permutation encryption as

形成对偶地址对；分析各个k_i的统计特性后进行相应的移位和对偶地址对应内容的交换处理；这些处理是由密钥的排列特性决定的，因此使用不同的密钥，加密时采取的移位及交换处理是不同的；(7) Dual position exchange --- the content _ki of the key K group represents the intra-group address of the encryption space group, and the bitwise inversion of _ki is obtained k _i and

Form a dual address pair; analyze the statistical characteristics of each _ki and perform corresponding shifting and exchange processing of the corresponding content of the dual address; these processes are determined by the arrangement characteristics of the key, so different keys are used, and encryption is adopted Shift and swap are handled differently;

占1bit，即视为二进制流的形式，在完成位置交换后，按以下公式计算出A′值(A′作为第r+1轮的A使用)：(8) Permutation operation --- the round key is Key _r = (K ₁ , K ₂ , ..., K _i ), the plaintext encryption space grouping A = (A ₀ , A ₁ , ..., A _i ), and the corresponding ciphertext grouping is $A\&prime;=(A_0^{\&prime;},A_1^{\&prime;},...,A_i^{\&prime;}).$ where K _i , A _i ,

Occupying 1 bit, it is regarded as the form of a binary stream. After the position exchange is completed, the value of A' is calculated according to the following formula (A' is used as A in the r+1 round):

$\left\{\begin{array}{cc}{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0</span>}\\ {\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; \&NotEqual;</span>\mathrm{<span\; class="notranslate">\; 0</span>}\end{array}\right.<span\; class="notranslate">\; ;</span>$

When the above steps (6) to (8) are the rth round encryption process performed by the encryption algorithm, one round of encryption is over, if the R round of encryption is not completed, then repeat steps (6) to (8), otherwise go to (9) ;

(9) If the plaintext has not been encrypted, return to (6); otherwise, the encryption is completed and the ciphertext is returned.

In the above method, the m ternary coordination of the IF, IV, and m modules described in steps (1), (2), and (3) realizes the trajectory migration in the background space, and the k-bit key is extracted during the migration process, and the key is modified simultaneously. Trajectories are migrated until the resulting length satisfies the requirement.

In the above method, the IV in step (2) is composed of one or more of SR, ST, and SC, wherein SR, ST are obtained by calling a function to realize the randomness and uniqueness of the IV, and the specified content is given by the user. It is necessary to realize the personalization of IV.

In the above-mentioned method, the effect of the physical reconstruction described in step (1) is to construct the selected IF into a physically visible subspace with a certain degree of discreteness; the logical reconstruction is to map the space obtained by the physical reconstruction into The n-dimensional logical space is discrete and random; the normalized IV is the address of a certain point in this high-dimensional logical space, and it is also the initial address for subsequent spatial trajectory transformation.

In the above-mentioned method, the IF described in step (1) can be any type of data, and is essentially an arbitrary long binary 0, 1 bit string in bytes, which has certain randomness and can be considered end-to-end of. The IF can be generated by an algorithm, such as a chaotic/hybrid chaotic system, or it can be an image, a text file, or a piece of code in memory. It can be labeled for ease of application. Consider using images and text files as generalized information domains during experiments, or use hybrid chaotic systems to generate different generalized information domains according to given different initial values.

In the above method, the structure of the activity background described in step (1) under the selected generalized information collar has the following definition:

ABG-code IF-code [S ₁ /L ₁ ][,S ₂ /L ₂ ]…[Si/Li]… D ₁ , D ₂ , D ₃ [, D ₄ [,…]]

in:

ABG-code: activity background number, which is convenient for reference by code;

IF-code: generalized information domain number;

[S1/L1][,S2/L2]...[Si/Li]...: Physical reconstruction parameters, which can be chosen arbitrarily, resulting in a defined active background. Where Si is the offset and Li is the length expressed in decimal. The unit of physical reconstruction is byte;

D1, D2, D3[Di[,…]]: logic reconstruction parameters, Di is the dimension definition, expressed in decimal, gives the maximum subscript value of the dimension, optional in brackets, the unit of logic reconstruction is bit.

In the above method, the physical reconstruction module described in step (1) physically reconstructs the selected IF, and its specific operations are as follows:

If the physical reconstruction parameters are empty, the active background is equivalent to the selected information domain; if the physical reconstruction parameters are not empty, then a set of physical reconstruction parameters [Si/Li] are selected in turn, and the generalized information domain or intermediate result From the fourth byte, a string of 0 and 1 with a length of Li bytes is intercepted as valid information. Physical reconstruction can expand the information of a generalized information domain into multiple physical information blocks of different activity backgrounds;

A set of discretization rules and algorithms are introduced in physical reconstruction to achieve the goal of one-way computability, high isolation and discretization. Therefore, by defining rules, physical reconstruction has the following characteristics:

a. One refactoring may cause multiple changes to a certain byte value, satisfying one-way computability;

b. Refactoring maintains random characteristics, such as the ratio of 0 and 1;

c. Reconstruct the physical structure that produces intermediate results or activity backgrounds, satisfying one-way computability, but there is no inverse function, and it is impossible to reversely calculate the upper-level results, which has a high degree of isolation.

In the above method, the logical reconstruction module described in step (1) performs logical reconstruction on the physically reconstructed IF to obtain the activity background, and its specific operations are as follows:

Convert the one-dimensional byte linear space into any multi-dimensional bit logic space, reconstruct the one-dimensional data obtained by physical reconstruction into D1×D2×…×Dn information blocks, then each bit corresponds to an address, and Each address can be represented by (y1, y2, ..., yn), and D1, D2, ..., Dn are the maximum subscript values of each dimension agreed in advance.

Example definition:

4 Sample.txt [34/256], [568/512] 456, 355, 756

Indicates that the active background whose number is 4 is selected. To obtain the activity background, it is necessary to use the file named Sample.txt as a generalized information domain, and then perform physical and logical reconstruction. The physical reconstruction parameters [34/256], [568/512] indicate that from the 34th byte and the 568th byte, respectively select 256 and 512-byte long binary strings, and merge them into a long 768-byte ( 6144 bits) binary string. The logical reconstruction maps the 6144-bit long binary string into a 3-dimensional space, and the maximum subscript values of each dimension are 456, 355 and 756 respectively.

The decryption process is as follows:

(1) The active background generation module obtains a certain subspace of the IF through the physical reconstruction of the selected IF, and then logically reconstructs the subspace into the active background;

(2) The IV generation module generates IV, and the IV normalization module compresses or stretches the IV into a binary address string of a certain length, and divides it into n blocks:

_{x1 x2} ... X _n

As an n-dimensional logical address in the active context;

(3) The m module transforms the n-dimensional logical bit address and physical space in the active background, and in each address migration, extracts a k-bit long bit string from the active background and incorporates it into the key sequence, In order to obtain the migration address, the constraint processing module performs constraint processing according to the frequency difference between the maximum value and the minimum value of the previous k-bit bit string value to obtain a correction value; then the correction value is incorporated into the address sequence by the m module, through Translate to obtain a new n-dimensional migration address, and reserve the migration trajectory for future construction of the trajectory ring transformation matrix;

(4) the key length judging module judges whether the length of the key is sufficient according to preset parameters, if not enough, then repeat step (3) operation, if enough, then output the key;

长的轮密钥Key_r；重复步骤(5)，直到所有的分组系数及轮密钥生成完毕，最后把各轮的轮密钥Key_r依次拼接成密钥K。此分组系数关系到步骤(6)、(7)、(8)的操作；(5) Generation of grouping coefficients and round keys Key _r --- For the number of decryption rounds, the system automatically selects the grouping coefficients and generates round keys for each round, and controls the grouping coefficients of each round to not repeat within a certain range of rounds. The pseudo-random code generator based on the generalized information domain generates a bit string with a length of one byte or word, and selects the grouping coefficient n _r of the r-th round in the grouping coefficient set according to the value of the bit string, and then returns to step (3 ), continue to be generated by the pseudo-random code generator based on the generalized information domain

Long round key Key _r ; repeat step (5) until all the grouping coefficients and round keys are generated, and finally the round key Key _r of each round is sequentially spliced into key K. This grouping coefficient is related to the operation of steps (6), (7), (8);

For multiple rounds of decryption, record n′=max(n _r ), r=1, 2, ..., R, where R is the number of decryption rounds, and the size is selected in turn as The block is the unit, and R rounds of decryption are carried out according to steps (7), (8), and (9);

(6) Grouping scheme --- Group the key K according to the grouping coefficient n _R-r+1 , and the grouping coefficient determines the address space for ciphertext group replacement and decryption as

占1bit，即视为二进制流的形式，在完成位置交换后，按以下公式计算出A′值(A′作为第r+1轮的A使用)：(7) Replacement operation --- the round key is ${\mathrm{key}}_r^{\&prime;}=(K_1,K_2,...,K_i),$ is the Key _R-r+1 generated in step (5), the ciphertext decryption space grouping A=(A ₀ , A ₁ ,...,A _i ), and the corresponding plaintext grouping is $A\&prime;=(A_0^{\&prime;},A_1^{\&prime;},...,A_i^{\&prime;}).$ where K _i , A _i ,

Occupying 1 bit, it is regarded as the form of a binary stream. After the position exchange is completed, the value of A' is calculated according to the following formula (A' is used as A in the r+1 round):

$\left\{\begin{array}{cc}{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; \&NotEqual;</span>\mathrm{<span\; class="notranslate">\; 0</span>}\\ {\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0</span>}\end{array}\right.<span\; class="notranslate">\; ;</span>$

形成对偶地址对；分析各个k_i的统计特性后进行相应的移位和对偶地址对应内容的交换处理；这些处理是由密钥的排列特性决定的，因此使用不同的密钥，解密时采取的移位及交换处理是不同的；(8) Dual position exchange --- the content _ki of the key K group represents the intra-group address of the encryption space group, and the bitwise inversion of _ki is obtained k _i and

Form a pair of dual addresses; after analyzing the statistical characteristics of each _ki , perform corresponding shifting and exchange processing of the corresponding content of the dual address; these processes are determined by the arrangement characteristics of the key, so different keys are used, and the method used for decryption is Shift and swap are handled differently;

The above steps (6) to (8) are the rth round of decryption process performed by the decryption algorithm, and one round of decryption is over. If the R round of encryption is not completed, repeat steps (6) to (8), otherwise go to (9) ;

(9) If the ciphertext has not been decrypted, return to (6); otherwise, the decryption is completed and the plaintext is returned.

In the above method, the m ternary coordination in the IF, IV, and m modules described in steps (1), (2), and (3) realizes the trajectory migration in the background space, and the k-bit key is extracted during the migration process, and at the same time Modify the migration trajectory until the generated length meets the requirements.

In the above method, the IV in step (2) is composed of one or more of SR, ST, and SC, wherein SR, ST are obtained by calling a function to realize the randomness and uniqueness of the IV, and the specified content is given by the user. It is determined to realize the personalization of IV, such as: "hello, I am ××", IV is not used as the initial value of the algorithm, but contains the information of the initial address in the activity background.

In the above method, the function of the physical reconstruction described in (1) is to construct the selected IF into a physically visible subspace with a certain degree of discreteness; the logical reconstruction is to map the space obtained by the physical reconstruction into The n-dimensional logical space is discrete and random; the normalized IV is the address of a certain point in this high-dimensional logical space, and it is also the initial address for subsequent spatial trajectory transformation.

In the above-mentioned method, the IF described in step (1) can be any type of data, and is essentially an arbitrary long binary 0, 1 bit string in bytes, which has certain randomness and can be considered end-to-end of. The IF can be generated by an algorithm, such as a chaotic/hybrid chaotic system, or it can be an image, a text file, or a piece of code in memory. It can be labeled for ease of application. Consider using images and text files as generalized information domains during experiments, or use hybrid chaotic systems to generate different generalized information domains according to given different initial values.

In the above method, the structure of the activity background described in step (1) under the selected generalized information collar has the following definition:

ABG-code IF-code [S ₁ /L ₁ ][,S ₂ /L ₂ ]…[Si/Li]… D ₁ , D ₂ , D ₃ [, D ₄ [,…]]

in:

ABG-code: activity background number, which is convenient for reference by code;

IF-code: generalized information domain number;

[S1/L1][,S2/L2]...[Si/Li]...: Physical reconstruction parameters, which can be chosen arbitrarily, resulting in a defined active background. Where Si is the offset and Li is the length expressed in decimal. The unit of physical reconstruction is byte;

D1, D2, D3[Di[,…]]: logic reconstruction parameters, Di is the dimension definition, expressed in decimal, gives the maximum subscript value of the dimension, optional in brackets, the unit of logic reconstruction is bit.

In the above method, the physical reconstruction module described in step (1) physically reconstructs the selected IF, and its specific operations are as follows:

If the physical reconstruction parameters are empty, the active background is equivalent to the selected information domain; if the physical reconstruction parameters are not empty, then a set of physical reconstruction parameters [Si/Li] is selected in turn, and the generalized information domain or the intermediate result From the fourth byte, a string of 0 and 1 with a length of Li bytes is intercepted as valid information. Physical reconstruction can expand the information of a generalized information domain into multiple physical information blocks of different activity backgrounds;

A set of discretization rules and algorithms are introduced in physical reconstruction to achieve the goal of one-way computability, high isolation and discretization. Therefore, by defining rules, physical reconstruction has the following characteristics:

a. One refactoring may cause multiple changes to a certain byte value, satisfying one-way computability;

b. Refactoring maintains random characteristics, such as the ratio of 0 and 1;

c. Reconstruct the physical structure that produces intermediate results or activity backgrounds, satisfying one-way computability, but there is no inverse function, and it is impossible to reversely calculate the upper-level results, which has a high degree of isolation.

In the above method, the logical reconstruction module described in step (1) performs logical reconstruction on the physically reconstructed IF to obtain the activity background, and its specific operations are as follows:

Convert the one-dimensional byte linear space into any multi-dimensional bit logic space, reconstruct the one-dimensional data obtained by physical reconstruction into D1×D2×…×Dn information blocks, then each bit corresponds to an address, and Each address can be represented by (y1, y2, ..., yn), and D1, D2, ..., Dn are the maximum subscript values of each dimension agreed in advance.

Example definition:

4 Sample.txt [34/256], [568/512] 456, 355, 756

Indicates that the active background whose number is 4 is selected. To obtain the activity background, it is necessary to use the file named Sample.txt as a generalized information domain, and then perform physical and logical reconstruction. The physical reconstruction parameters [34/256], [568/512] indicate that starting from the 34th byte and the 568th byte, respectively select binary strings with a length of 256 and 512 bytes, and merge them into a length of 768 bytes ( 6144 bits) binary string. The logical reconstruction maps the 6144-bit long binary string into a 3-dimensional space, and the maximum subscript values of each dimension are 456, 355 and 756 respectively.

According to the triplets that generate keys from the generalized information domain, it can be known that triplets cooperate to generate keys, and neither of them is dispensable. The two sides of encryption/decryption have the same generalized information domain, which is agreed by both parties in advance and does not participate in the process of information transmission. The dynamic encryption algorithm uses the key in the encapsulation state. The encryption party generates the key according to the pre-agreed information field and encrypts it, and then sends the ciphertext and information header (including ABG number and IV) to the decryption party. The decryption party extracts the real decryption key from the agreed generalized information domain according to the IV to decrypt. From the encrypting party to the decrypting party, the key does not appear explicitly and does not involve the transmission of the key. If the security of the generalized information domain can be ensured, even if IV and m are disclosed, the security will not be affected. At this time, the key security problem is transformed into a generalized information domain security problem, and the key is no longer explicitly transmitted and managed, which greatly enhances security. Conventional cryptanalysis methods such as linear analysis, differential analysis, and algebraic attack are not suitable for the system of the present invention.

At present, the keys of many encryption systems are reused many times, thereby reducing the security of the system. The present invention greatly improves the security of the system.

The above-mentioned embodiment is a preferred embodiment of the present invention, but the embodiment of the present invention is not limited by the above-mentioned embodiment, and any other changes, modifications, substitutions, combinations, Simplifications should be equivalent replacement methods, and all are included in the protection scope of the present invention.

Claims (10)

1. The dynamic encryption system based on the generalized information domain is characterized in that: it includes a connected pseudo-random code generator and an encryption and decryption subsystem based on the generalized information domain, and the encryption and decryption subsystem includes an encryption subsystem and a decryption subsystem; The encryption subsystem includes grouping coefficients and round key generation modules, grouping modules, dual position exchange modules, and permutation operation modules that are connected in sequence; the decryption subsystem includes grouping coefficients and round key generation modules, grouping modules, and permutation operations that are connected in sequence module, dual position exchange module; and the encryption subsystem and the decryption subsystem share the same grouping coefficient and round key generation module; Wherein the pseudo-random code generator based on the generalized information domain includes an IV generation module, an IV normalization module, an m module, a constraint processing module, and a key length judging module connected in sequence, and the m module is also connected with the active background generation module at the same time connected; At the same time, the pseudo-random code generator based on the generalized information domain is respectively connected with the grouping coefficient in the encryption subsystem and the decryption subsystem, the round key generation module, the dual position exchange module, and the permutation operation module. The key generation module is also connected to the m module through a breakpoint entry. 2. The dynamic encryption system based on the generalized information domain according to claim 1, characterized in that: the active background generation module is mainly composed of a physical reconstruction module and a logical reconstruction module. 3. A method for implementing encryption using the dynamic encryption system based on the generalized information domain described in claim 1 or 2, characterized in that: it includes an encryption process and a decryption process, and the encryption process is specifically as follows: (1) The active background generation module obtains a certain subspace of the IF through the physical reconstruction of the selected IF, and then logically reconstructs the subspace into the active background; (2) The IV generation module generates IV, and the IV normalization module compresses or stretches the IV into a binary address string of a certain length, and divides it into n blocks: X _{I x2} … X _n As an n-dimensional logical address in the active context; (3) The m module transforms the n-dimensional logical bit address and the physical space in the active background to the space trajectory, and in each address migration, extracts a k-bit long bit string from the active background and incorporates it into the key sequence; In order to obtain the migration address, the constraint processing module performs constraint processing according to the frequency difference between the maximum value and the minimum value of the previous k-bit bit string value to obtain a correction value; then the correction value is incorporated into the address sequence by the m module, through Translate to obtain a new n-dimensional migration address; (4) the key length judging module judges whether the length of the key is sufficient according to preset parameters, if not enough, then repeat step (3) operation, if enough, then output the key; (5) Generate grouping coefficient and round key Key _r --- Select the number of encryption rounds for the user, the system automatically realizes the selection of each round of grouping coefficient and round key generation, and controls the grouping coefficient of each round within a certain range of rounds No repetition; the pseudo-random code generator based on the generalized information domain generates a bit string with a length of one byte or word, and selects the grouping coefficient n _r of the r-th round in the grouping coefficient set according to the value of the bit string, and then returns Step (3), the pseudo-random code generator based on the generalized information domain continues to generate

Long round key Key _r ; repeat step (5), until all grouping coefficients and round keys are generated, and finally splice the round key Key _r of each round into key K; During multiple rounds of encryption, remember n'=max(n _r ), r=1, 2, ..., R, where R is the number of rounds of encryption, and the blocks with a size of 2 ^n' are selected successively as units, and according to step (6 ), (7), (8) carry out R round encryption; (6) Grouping scheme --- Group the key K according to the grouping coefficient n _r , and the grouping coefficient determines the address space of the plaintext group permutation encryption as

; (7) Dual position exchange --- the content _ki of the key K group represents the intra-group address of the encryption space group, and the bitwise inversion of _ki is obtained

, k _i and

Form a dual address pair, analyze the statistical characteristics of each _ki , and perform corresponding shifting and exchange processing of the corresponding content of the dual address; these processes are determined by the arrangement characteristics of the key, so different keys are used, and the encryption method is adopted Shift and swap are handled differently; (8) Permutation operation --- the round key is Key _r = (K ₁ , K ₂ , ..., K _i ), the plaintext encryption space grouping A = (A ₀ , A ₁ , ..., A _i ), and the corresponding ciphertext grouping is $A\&prime;=(A_0^{\&prime;},A_1^{\&prime;},...,A_i^{\&prime;}),$ where K _i , A _i ,

Occupying 1 bit, it is regarded as the form of a binary stream. After the position exchange is completed, the A' value is calculated according to the following formula, and the A' is used as the A of the r+1 round: $\left\{\begin{array}{cc}{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0</span>}\\ {\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; \&NotEqual;</span>\mathrm{<span\; class="notranslate">\; 0</span>}\end{array}\right.<span\; class="notranslate">\; ;</span>$ When the above steps (6) to (8) are the rth round encryption process performed by the encryption algorithm, one round of encryption is over, if the R round of encryption is not completed, then repeat steps (6) to (8), otherwise go to (9) ; (9) If the plaintext has not been encrypted, return to (6), otherwise, the encryption is completed and the ciphertext is returned; The decryption process is as follows: (10) The active background generation module obtains a certain subspace of the IF through the physical reconstruction of the selected IF, and then logically reconstructs the subspace into the active background; (11) IV generation module produces IV, and IV normalization module compresses or stretches IV into the binary address string of definite length, and it is divided into n blocks: _{x1 x2} … X _n As an n-dimensional logical address in the active context; (12) The m module transforms the n-dimensional logical bit address and the physical space in the active background to the space trajectory, and in each address migration, extracts a k-bit long bit string from the active background and incorporates it into the key sequence, In order to obtain the migration address, the constraint processing module performs constraint processing according to the frequency difference between the maximum value and the minimum value of the previous k-bit bit string value to obtain a correction value; then the correction value is incorporated into the address sequence by the m module, through Translate to obtain a new n-dimensional migration address; (13) The key length judging module judges whether the length of the key is sufficient according to preset parameters, if not enough, then repeat step (12) operation, if enough, then output the key; (14) Generation of grouping coefficients and round key Key _r --- For the number of decryption rounds, the system automatically realizes the selection of each round of grouping coefficients and the generation of round keys, and controls the grouping coefficients of each round to not repeat within a certain range of rounds. The pseudo-random code generator based on the generalized information domain generates a bit string with a length of one byte or word, and selects the grouping coefficient n _r of the r-th round in the grouping coefficient set according to the value of the bit string, and then returns to step (12 ), continue to be generated by the pseudo-random code generator based on the generalized information domain

Long round key Key _r ; repeat step (14), until all grouping coefficients and round keys are generated, and finally the round key Key _r of each round is spliced into key K in turn; During multiple rounds of decryption, remember n'=max(n _r ), r=1, 2, ..., R, where R is the number of rounds of decryption, and the blocks with a size of 2 ^n' are selected successively as units, and according to step (15 ), (16), (17) carry out R round decryption; (15) Grouping scheme --- Group the key K according to the grouping coefficient n _R-r+1 , and the grouping coefficient determines the address space for ciphertext group replacement and decryption as

(16) Replacement operation --- the round key is ${\mathrm{key}}_r^{\&prime;}=(K_1,K_2,...,K_i),$ is the Key _R-r+1 generated in step (14), the ciphertext decryption space grouping A=(A ₀ , A ₁ ,...,A _i ), and the corresponding plaintext grouping is $A\&prime;=(A_0^{\&prime;},A_1^{\&prime;},...,A_i^{\&prime;}),$ where K _i , A _i ,

Occupying 1 bit, it is regarded as the form of a binary stream. After the position exchange is completed, the value of A' is calculated according to the following formula (A' is used as A in the r+1 round): $\left\{\begin{array}{cc}{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; \&NotEqual;</span>\mathrm{<span\; class="notranslate">\; 0</span>}\\ {\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; K</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}}<span\; class="notranslate">\; \&CirclePlus;</span>{\mathrm{<span\; class="notranslate">\; A</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>& \mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0</span>}\end{array}\right.<span\; class="notranslate">\; ;</span>$ (17) Dual position exchange --- the content _ki of the key K group represents the intra-group address of the encryption space group, and the bitwise inversion of _ki is obtained k _i and

Form a pair of dual addresses; after analyzing the statistical characteristics of each _ki , perform corresponding shifting and exchange processing of the corresponding content of the dual address; these processes are determined by the arrangement characteristics of the key, so different keys are used, and the method used for decryption is Shift and swap are handled differently; When the above steps (15) to (17) are the rth round of decryption process carried out by the decryption algorithm, one round of decryption ends, if the R round of encryption is not completed, then repeat steps (15) to (17), otherwise go to (18) ; (18) If the ciphertext has not been decrypted, return to (15), otherwise, the decryption is completed and the plaintext is returned. 4. The method for dynamic encryption and decryption based on generalized information domain according to claim 3, characterized in that: the IV in steps (2), (11) is composed of one of system random number, system internal time, specified content or It is composed of any number of items, among which the system random number and the internal time of the system are obtained by calling functions to realize the randomness and uniqueness of the IV, and the specified content is given by the user to realize the personalization of the IV. 5. The dynamic encryption and decryption method based on the generalized information domain according to claim 3 is characterized in that: the IF described in steps (1) and (10) is data of any type, essentially any data in bytes. A long string of binary 0, 1 bits. 6. The method for dynamic encryption and decryption based on generalized information domain according to claim 3, characterized in that: the IF in steps (1) and (10) is generated by an algorithm, or is an image, a text file or a section of code in memory . 7. The method for dynamic encryption and decryption based on generalized information domain according to claim 3, characterized in that: the structure of the activity background described in steps (1), (10) under the selected generalized information domain has the following definition: ABG-code IF-code [S ₁ /L ₁ ][,S ₂ /L ₂ ]…[Si/Li]… D ₁ , D ₂ , D ₃ [, D ₄ [,…]] Among them, ABG-code is the activity background number; IF-code is the generalized information domain number; [S1/L1][, S2/L2]...[Si/Li]...is the physical reconstruction parameter, where Si is the offset, Li is the length, and the unit of physical reconstruction is byte; D1, D2, D3[Di[,…]] are logic reconstruction parameters, Di is dimension definition. 8. The method for dynamic encryption and decryption based on generalized information domain according to claim 3, characterized in that: the physical reconstruction module described in steps (1) and (10) physically reconstructs the selected IF, wherein The specific operation is as follows: If the physical reconstruction parameters are empty, the active background is equivalent to the selected information domain; if the physical reconstruction parameters are not empty, then a set of physical reconstruction parameters [Si/Li] is selected in turn, and the generalized information domain or the intermediate result From the fourth byte, a string of 0 and 1 with a length of Li bytes is intercepted as valid information. 9. The method for dynamic encryption and decryption based on generalized information domain according to claim 3, characterized in that: the logic reconstruction module described in steps (1) and (10) performs logic reconstruction and acquisition activities on the selected IF background, the specific operations are as follows: The one-dimensional data obtained by physical reconstruction is reconstructed into information blocks of D1×D2×…×Dn. 10. The method for dynamic encryption and decryption based on generalized information domain according to claim 3, characterized in that: the steps (1), (2), (3), (10), (11), (12) described The m ternary coordination in the IF, IV, and m modules realizes the trajectory migration in the background space. During the migration process, the k-bit key is extracted, and the migration trajectory is modified at the same time until the generated length meets the requirements.

Images