TW201528754A - Encryption and decryption system and method using chaotic mapping with spatial-temporal perturbation - Google Patents

Abstract

The present invention provides an encryption and decryption system and method using chaotic mapping with spatial-temporal perturbation for secure communication. A chaotic cryptographic operator in a transmitting terminal loads a plaintext message and securely transmits the plaintext message from the transmitting terminal to a receiving terminal. A chaotic cryptographic encryptor in the transmitting terminal executes an encryption process. The chaotic cryptographic operator executes at least one iterative operation of the encryption and decryption system and method using chaotic mapping with spatial-temporal perturbation to generate a set of keys. Execute the exclusive-or operation to the plaintext message and the set of keys to generate a set of ciphertext blocks. A chaotic cryptographic receiver receives the set of ciphertext blocks and the set of keys transmitted from the transmitting terminal. A chaotic cryptographic decryptor executes the exclusive-or operation to the set of ciphertext blocks and the set of keys to generate a decrypted plaintext message.

Description

Time disturbance chaotic map encryption and decryption system and method

The invention relates to a time-disturbing chaotic map encryption and decryption system and method for secret communication, which can transmit a plaintext message from a sender to a receiver in a secret manner, which belongs to the cipher stream encryption method in the symmetric encryption method. It has the characteristics of large key space, non-linearity, unpredictability and fast calculation speed.

It is generally known that there are many kinds of encryption and decryption methods used in secure communication, in which chaos theory is applied to cryptography, although there are many previous studies, but in avoiding the influence of chaotic window, uniformity, dynamic The impact of degradation, the selection of keys, and security must be strengthened. In practice, the cost is often too high and the speed is not fast enough. It is also a common flaw. In view of this, the inventors have developed a new design, which has the advantages of the above-mentioned disadvantages, large key space, non-linearity, unpredictability, fast calculation speed, and the like, and can be any 16-bit or more. The digital computing component of the adder, such as CPU, GPU, MPU, MCU, DSP, FPGA, SoC, etc., can be implemented.

The main object of the present invention is to provide a time-disturbing chaotic map encryption and decryption system and method for secret communication, which can transmit a plaintext message from a sender to a receiver in a secure manner, which belongs to the password stream in the symmetric encryption method. The encryption method has the characteristics of large key space, non-linearity, unpredictability, fast calculation speed, etc., and generally has an adder of 16 bits or more. The digital computing components, such as CPU, GPU, MPU, MCU, DSP, FPGA, SoC, etc., can be implemented, and the chaotic window can be selected to avoid the effects of chaotic window and dynamic degradation, and have uniformity. And security.

For the above purposes, the present invention provides a time disturbance for secure communication The chaotic map encryption and decryption system can transmit a plaintext message from a sending end to a receiving end in a secret manner, including at least one chaotic cipher operator, a chaotic cipher encryptor, a chaotic cipher receiver and a chaotic cipher decryptor; The chaotic cryptographic operator is respectively disposed in the transmitting end and the receiving end; and the chaotic cryptographic operator performs the at least one time disturbance by inputting an initial state to the chaotic cryptographic operator in the transmitting end. An iterative operation of the chaotic map encryption and decryption system generates a key group; wherein the chaotic cipher is set in the sender, the chaotic cipher encrypts the plaintext message, and the plaintext message and the gold The key group is mutually exclusive to generate a ciphertext block group; wherein the chaotic cipher receiver is disposed in the receiving end, wherein the chaotic cipher receiver receives the ciphertext block group transmitted from the transmitting end and The initial state; the chaotic cryptographic operator is implemented by inputting the initial state to the chaotic cipher operator in the receiving end At least one time interrupting the iterative operation of the chaotic map encryption and decryption system to generate the same key group as in the transmitting end; and wherein the chaotic password decryptor is disposed in the receiving end, wherein the chaotic password decryptor The ciphertext cell block group and the key group are mutually exclusive operations to generate a decrypted plaintext message.

In implementation, the chaotic cipher operator described above includes an operational switch, a Input convergence end, a pseudo random number register, a key output end, a delay length shift register, a cyclic shift register, and an iterative operator; wherein the operation open relationship is used to initiate the chaotic cryptographic operation Performing an iterative operation of the chaotic map encryption and decryption system for the time disturbance; The input convergence end selects the initial state or an iterative state. When the initial state is selected, an initial pseudo random number and an initial cyclic displacement random number are input through the input rendezvous end, and the initial pseudo random number is transmitted to the An iterative operator, and the initial cyclic displacement random number generates a cyclic displacement of the initial pseudo random number to generate a pseudo random number, and when the iterative state is selected, a cyclic displacement random number in the cyclic shift register and An iterative pseudo random number in the pseudo random number register is input through the input rendezvous end, and the iterative pseudo random number is transmitted to the iterative operator, and the cyclic displacement random number generates a cyclic shift of the iterative pseudo random number. Generating the pseudo random number; wherein the pseudo random number includes a key element, an updated cyclic shift random number, an update time delay factor random number, and an update time delay factor data source; wherein the key output is used Outputting the key element; wherein the update cyclic displacement random number is stored in the cyclic shift register to form the cyclic displacement random number; The delay length shift register uses the update time delay factor random number and the update time delay factor data source to generate a time delay factor, and truncates the time delay factor to form a truncated time delay factor, and And storing the truncated time delay factor in the delay length shift register; wherein the iterative operator brings the initial pseudo random number received from the input convergence end or the iterative pseudo random number into a chaotic map And generating a mutually exclusive pseudo-random number with the truncated time delay factor, and generating the new iteration pseudo-random number, and storing the new iteration pseudo-random number into the pseudo-random number register to form the iterative pseudo-random number; And wherein the key group is composed of at least one of the key elements output by the chaotic cryptographic operator after at least one time of the iterative operation of the chaotic map encryption and decryption system.

In implementation, the iterative operation of the time-disturbed chaotic map encryption and decryption system is defined by a digital time-spaced chaotic system combined with a set of variant logistic maps.

In implementation, the aforementioned set of variant logistic maps includes a variant logistic map, which is defined as follows: Ψ _{α , P} ( x ): [0, 1] → [0, 1],

Where α N,p [0,1] is the control parameter and x is the state variable.

In implementation, the digital time-interfering chaotic system is an N-dimensional digital time-interfering chaotic system, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, :I→I,I=[0,1], θ _i is defined in the parameter space θ _i , θ _i is Control parameters, and x I based state variable; x therefore the dynamic behavior of the system can be expressed as _{x n +1 = f θ (x} n), where n is the number of iterations of operation of the system; in the discretization of the performance, the accuracy of m bits At this time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The N-dimensional digital time-interfering chaotic system is defined as: or Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where

In the implementation, the digital time-interfering chaotic system is an N×M-dimensional digital time-interfering chaotic system, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, j =1,...,M, :I→I,I=[0,1], θ _{( i , j )} is defined in the parameter space θ _{( i , j )} , and θ _{( i , j )} is Control parameters, and x I based state variable, and therefore the dynamic behavior of the system x can be expressed as _{x n +1 = f θ (x} n), where n is the number of iterations of operation of the system; in the discretization of the performance, the accuracy of m bits At this time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The digital time-interference chaotic system of the N×M dimension is defined as: or The ♁ is a mutually exclusive operation (XOR), 1 i N,1 j M, n is the number of iterations, where

In implementation, the aforementioned set of variant Logistic mappings is composed of N variant Logistic maps, which are defined as follows: Where α _i N, p _i [0,1] is the control parameter, i =1,...,N, x is the state variable; wherein the digital time-interfering chaotic system is combined with the definition of the variant logistic map as follows: The dynamic behavior of x can be expressed x _{n +1} = Ψ _{α , P} ( x _n ), where n is the number of iterative operations; in the case of discretization, when the calculation precision is m bits, the closed interval I is expressed as I _m , At this time, the α system is expressed as , At this time, the p system is expressed as , At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost bit of d _n is And To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The iterative operation system of the time-disturbed chaotic map encryption and decryption system is defined as: Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where

In the implementation, the time-disturbing chaotic map encryption and decryption system is further provided with a linear feedback displacement register, so that the iterative operation of the time-disturbed chaotic map encryption and decryption system is defined as follows: The linear feedback shift register is LFSR( n ).

In implementation, the aforementioned time disturbs the chaotic map encryption and decryption system, wherein in the performance of discretization, when the calculation accuracy is m =32 bits, , where a _j {0,1}, and Can be re-represented as a binary vector: [ a ₀ ,..., a _j ,..., a _{m -1} ]; an initial cyclic displacement random number Generate a cyclic shift of [ a ₀ ,..., a _j ,..., a _{m -1} ] make Where b _j {0,1}, and [b ₀ ,...,b _j ,...,b _{m -1} ] includes an update cyclic displacement random number r _c , an update time delay factor random number r _d , a gold Key element And an update time delay factor data source , where r _d =[b ₀ ,...,b ₂ ], can be expressed as r _c =[b ₃ ,...,b ₇ ], can be expressed as At this time, the initial cyclic displacement random number The value is set to the value of the updated cyclic displacement random number r _c , that is, the updated cyclic displacement random number r _c is used for the random number used to generate the cyclic displacement next time. The iterative operation system of the time-disturbed chaotic map encryption and decryption system is defined as: Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where

Where LFSR( n ) is the linear feedback shift register.

In implementation, the length of the aforementioned key group is greater than or equal to the length of the plaintext message.

In addition, the present invention also provides a time-disturbing chaotic map encryption and decryption method for secure communication, which may select a synthetic encryption and decryption process or a decomposition encryption and decryption process to encrypt a plaintext message loaded in a sender. Transmitting from the transmitting end to a receiving end, wherein the synthetic encryption decryption process comprises a synthetic encryption process and a synthetic decryption process; The synthesizing encryption process is performed on the transmitting end, and includes the following steps: inputting an initial state to a chaotic cipher operator in the transmitting end; and performing, by the chaotic cryptographic operator, the chaotic mapping encryption and decryption method at least once An iterative operation to generate a key group, wherein the length of the key group is greater than or equal to the length of the plaintext message; and the plaintext message is mutually exclusive with the key group by a chaotic cipher encryptor to generate a key a ciphertext block group; wherein the synthesizing and decrypting process is performed at the receiving end, comprising the steps of: receiving, by a chaotic cipher receiver, the ciphertext block group from the transmitting end and the initial state; and inputting the initial state; The chaotic cryptographic operator in the receiving end causes the chaotic cryptographic operator to perform an iterative operation of the chaotic map encryption and decryption system at least once to generate the same key group as in the transmitting end; and a chaotic The cryptographic decryptor mutually exclusiveizes the ciphertext block group with the key group to generate a synthesized decrypted plaintext message; The decomposition encryption and decryption process includes a decomposition encryption process and a decomposition decryption process; wherein the decomposition encryption process is performed at the transmitting end, and includes the following steps: Step 1: input the initial state to the chaotic cryptographic operator in the transmitting end Step 2: Performing an iterative operation of the time-disturbed chaotic map encryption and decryption method by the chaotic cryptographic operator to generate a key element; Step 3: extracting a piece of the plaintext message by the chaotic cipher encryptor to form a plaintext cell a block, wherein the length of the plaintext block is the same as the length of the key element; step 4: the chaotic cipher encrypts the plaintext block and the key element to perform a mutually exclusive operation to generate a ciphertext block; Step 5: Repeat step 2, step 3, and step 4 until the plaintext message is captured; step 6: combine the ciphertext cell blocks generated in step 4 each time to form the ciphertext block group; The decomposing and decrypting process is performed on the receiving end, and includes the following steps: Step 1: Connected by the chaotic password receiver The end of transmission from the ciphertext block groups to the initial cell state; Step II: The initial state of the input to the receiving end The chaotic cryptographic operator; step 3: performing an iterative operation of the time-disturbed chaotic map encryption and decryption method by the chaotic cryptographic operator in the receiving end to generate the key element; step 4: each step three And generating the key element group to form the key group, if the length of the key group is less than the ciphertext block group, repeat step 3, if the length of the key group is greater than or equal to the ciphertext block group Then, step 5 is performed; step 5: the ciphertext block group and the key group are mutually exclusive operation by the chaotic crypto-decryptor to generate a decomposed and decrypted plaintext message.

In implementation, the aforementioned iteration of the chaotic map encryption and decryption method The operation includes the following steps: starting an operation switch to start the chaotic cryptographic operator to perform an iterative operation of the time-disturbing chaotic map encryption and decryption method; selecting an initial state or an iterative state by an input rendezvous end, wherein when the In an initial state, an initial pseudo random number and an initial cyclic displacement random number are input via the input rendezvous end, and the initial pseudo random number is transmitted to an iterative operator, and the initial cyclic displacement random number generates the initial pseudo random number. Cycling displacement, and generating a pseudo-random number, and when the iterative state is selected, one of the cyclic displacement random numbers in a cyclic shift register and one of the pseudo-random number registers in the pseudo-random register are merged via the input End input, the iterative pseudo random number is transmitted to the iterative operator, and the cyclic displacement random number generates a cyclic shift of the iterative pseudo random number to generate the pseudo random number, wherein the pseudo random number includes the key element, An update cyclic shift random number, an update time delay factor random number, and an update time delay factor data source; The key output end outputs the key element; the cyclic shift random number is formed by storing the update cyclic shift random number in the cyclic shift register; and the update time delay is used by a delay length shift register The factor random number and the update time delay factor data source generate a time delay factor, and the time delay factor is truncated to form a truncated time delay factor, and the truncated time delay factor is stored in the delay In the displacement register, the initial pseudo-random number received from the input convergence end or the iterative pseudo-random number is brought into a chaotic map by the iterative operator and mutually exclusive with the truncated time delay factor Computing, generating a new iteration pseudo-random number, and storing the new iteration pseudo-random number into the pseudo-random number register to form the iterative pseudo-random number; wherein the key group is composed of the chaotic cipher operator At least one of the key elements outputted after the iterative operation of the chaotic map encryption and decryption method is disturbed at least once.

In implementation, the aforementioned time-disturbing chaotic map encryption and decryption method is A digital time-interfering chaotic system combined with a set of variant Logistic maps performs an iterative operation of the time-disturbed chaotic map encryption and decryption method.

In implementation, the aforementioned set of variant logistic maps includes a variant logistic map, which is defined as follows: Ψ _{α , P} ( x ): [0, 1] → [0, 1],

Where α N,p [0,1] is the control parameter and x is the state variable.

In implementation, the digital time-interfering chaotic system is an N-dimensional digital time-interfering chaotic system, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, :I→I,I=[0,1], θ _i is defined in the parameter space θ _i , θ _i is Control parameters, and x I based state variable; x therefore the dynamic behavior of the system can be expressed as _{x n +1 = f θ (x} n), where n is the number of iterations of operation of the system; in the discretization of the performance, the accuracy of m bits At this time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The N-dimensional digital time-interfering chaotic system is defined as: or Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where

In implementation, the digital time-interfering chaotic system is an N×M-dimensional digital time-interfering chaotic system, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, j =1,...,M, :I→I,I=[0,1], θ _{( i , j )} is defined in the parameter space θ _{( i , j )} , and θ _{( i , j )} is Control parameters, and x I based state variable, and therefore the dynamic behavior of the system x can be expressed as _{x n +1 = f θ (x} n), where n is the number of iterations of operation of the system; in the discretization of the performance, the accuracy of m bits At this time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost bit of d _n is And To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The digital time-interference chaotic system of the N×M dimension is defined as: or The ♁ is a mutually exclusive operation (XOR), 1 i N,1 j M, n is the number of iterations, where

In implementation, the aforementioned set of variant Logistic mappings is composed of N variant Logistic maps, which are defined as follows: , where I=[0,1],

Where α _i N, p _i [0,1] is the control parameter, i =1,...,N, x is the state variable; wherein the digital time-interfering chaotic system combined with the definition of the variant logistic map is as follows: The dynamic behavior of x can be expressed as x _{n +1} =Ψ _{α , P} ( x _n ), where n is the number of iterative operations; in the case of discretization, when the calculation precision is m bits, the closed interval I is expressed as I _m . At this time, the α system is expressed as , At this time, the p system is expressed as , At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, , where << is the left-shifting operator, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The iterative operation of the time-disturbed chaotic map encryption and decryption method is defined as: Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where

In implementation, the aforementioned time-disturbing chaotic map encryption and decryption method is a linear feedback displacement register, and the iterative operation of the time-disturbed chaotic map encryption and decryption method is defined as follows: The linear feedback shift register is LFSR( n ).

In implementation, the foregoing time disturbs the chaotic map encryption and decryption method, wherein in the performance of discretization, when the calculation precision is m =32 bits, , where a _j {0,1}, and Can be re-represented as a binary vector: [ a ₀ ,..., a _j ,..., a _{m -1} ]; an initial cyclic displacement random number Generate a cyclic shift of [ a ₀ ,..., a _j ,..., a _{m -1} ] make Where b _j {0,1}, and [b ₀ ,...,b _j ,...,b _{m -1} ] includes an update cyclic displacement random number r _c , an update time delay factor random number r _d , a gold Key element And an update time delay factor data source , where r _d =[b ₀ ,...,b ₂ ], can be expressed as r _c =[b ₃ ,...,b ₇ ], can be expressed as At this time, the initial cyclic displacement random number The value is set to the value of the updated cyclic displacement random number r _c , that is, the updated cyclic displacement random number r _c is used for the random number used to generate the cyclic displacement next time. The iterative operation of the time-disturbed chaotic map encryption and decryption method is defined as: Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where Where LFSR( n ) is the linear feedback shift register.

In order to further understand the present invention, the specific embodiments of the present invention and the effects achieved thereby are described in detail below with reference to the drawings and drawings.

1‧‧‧Send

2‧‧‧ Receiver

3‧‧‧Chaotic Password Encryptor

4‧‧‧Chaotic password receiver

5‧‧‧Chaotic Password Decryptor

6‧‧‧ Key Group

7‧‧‧Clear message

8‧‧‧Mciven block group

9‧‧‧Decrypting plaintext messages

10‧‧‧Synthesis and decryption of plaintext messages

11‧‧‧Mingwen Community Block

12‧‧‧Mciven block

13‧‧‧ Decomposing and decrypting plaintext messages

20‧‧‧Chaotic cryptographic operator

21‧‧‧Operation switch

22‧‧‧Input meeting end

23‧‧‧Pseudo-random number register

24‧‧‧key output

25‧‧‧Delay length shift register

26‧‧‧Circular Displacement Register

27‧‧‧ Iterative Operator

28‧‧‧Linear Feedback Displacement Register

30‧‧‧Initial pseudo-random number

31‧‧‧Initial cyclic displacement random number

32‧‧‧Pseudo-random number

33‧‧‧cyclic displacement random number

34‧‧‧Iterative pseudo-random number

35‧‧‧Key Elements

36‧‧‧Update cyclic displacement random number

37‧‧‧Update time delay factor random number

38‧‧‧Update time delay factor data source

39‧‧‧Time delay factor

40‧‧‧Truncate time delay factor

41‧‧‧New iteration pseudo-random number

50‧‧‧Chaotic mapping

51‧‧‧Exclusive operation

52‧‧‧Digital time chaotic chaotic system

53‧‧‧A set of variant logistic maps

54‧‧‧Variable Logistic Mapping

55‧‧‧N-dimensional digital time-interfering chaotic system

56‧‧‧N-M dimension digital time-interfering chaotic system

57‧‧‧N variant logistic maps

60‧‧‧ initial state

61‧‧‧ Iteration state

62‧‧‧Synthesis encryption and decryption process

63‧‧‧Synthesis encryption process

64‧‧‧Synthesis and decryption process

65‧‧‧ Decomposition and decryption process

66‧‧‧Decomposition encryption process

67‧‧‧Decomposition and decryption process

70‧‧‧ Iterative operation

FIG. 1 is a specific embodiment of a time-disturbing chaotic map encryption and decryption system for secure communication according to the present invention.

2 is a structural diagram of a chaotic cipher operator of another embodiment of a time-interfering chaotic map encryption and decryption system for secure communication according to the present invention.

FIG. 3 is a flowchart of a synthetic encryption and decryption method for a time-interfering chaotic map encryption and decryption method for secure communication according to the present invention.

Figure 4 is a flow chart of decomposition and decryption of a time-disturbing chaotic map encryption and decryption method for secure communication according to the present invention.

Figure 5 is a flow chart showing the time delay factor of the truncated chaotic map encryption and decryption method for time-sharing of secure communication.

Figure 6 is a flow chart of a cyclic shift of a time-interfering chaotic map encryption and decryption method for secure communication according to the present invention.

Figure 7 is a flow chart of a process for decomposing encryption and decryption in an embodiment of a time-disturbing chaotic map encryption and decryption method for secure communication.

Figure 8 is a logistic mapping function diagram.

Figure 9 is a diagram of a broken line mapping mapping function.

10 and 11 are function diagrams of a variant logistic map for a time-interfering chaotic map encryption and decryption method for secure communication.

Please refer to FIG. 1 , which is a time disturbance for secure communication according to the present invention. A specific embodiment of the chaotic map encryption and decryption system includes a transmitting end 1 and a receiving end 2; the transmitting end 1 includes a chaotic cipher encryptor 3 and a chaotic cipher computing unit 20; and the receiving end 2 includes a chaotic cipher The receiver 4, a chaotic cipher operator 20 and a chaotic cipher decoder 5 are provided.

Passing an initial state 60 to the chaotic cipher operator 20 in the transmitting end 1 And causing the chaotic cryptographic operator 20 to perform at least one time-interfering chaotic mapping encryption and decryption system iterative operation 70 to generate a key group 6; the chaotic cipher encryptor 3 loads a plaintext message 7 and the plaintext message 7 The key group 6 generates a ciphertext block group 8 via the mutual exclusion operation 51.

The chaotic cipher receiver 4 receives the ciphertext block group 8 transmitted from the transmitting end 1 and The initial state 60; via the input initial state 60 to the chaotic cryptographic operator 20 in the receiving end 2; and then the chaotic cryptographic operator 20 performs at least one time-interfering chaotic mapping encryption and decryption system iterative operation 70 to generate and transmit within the transmitting end 1 The same key group 6; the chaotic crypto-decryptor 5 generates a decrypted plaintext message 9 by the ciphertext block group 8 and the key group 6 via the mutual exclusion operation 51, whereby the plaintext message 7 is transmitted from the transmitting end 1 through the secret mode. Transfer to the receiving end 2.

Please refer to FIG. 2, which is a chaotic password according to another embodiment of the present invention. The flowchart of the structure of the operator 20 and the iterative operation 70 includes an arithmetic switch 21, an input rendezvous terminal 22, a pseudo random number register 23, a key output terminal 24, and a delay length shift register 25. A cyclic shift register 26 and an iterative operator 27.

The operation switch 21 is used to start the chaotic cryptographic operator 20 to perform an iterative operation. Count 70. The input rendezvous end 21 can select an initial state 60 or an iterative state 61. When the initial state 60 is selected, an initial pseudo random number 30 and an initial cyclic displacement random number 31 are passed through the input rendezvous end 21 Input, the initial pseudo-random number 30 is transmitted to the iterative operator 27, and the initial cyclic-displacement random number 31 produces a cyclically displaced initial pseudo-random number 30, producing a pseudo-random number 32, and when the iterative state 61 is selected, the cyclic shift One of the cyclic shift random number 33 and one of the pseudo random number register 23 in the register 26 is input via the input rendezvous end 21, and the iterative pseudo random number 34 is transmitted to the iterative operator 27, and the loop The displacement random number 33 produces a cyclic shift of the iterative pseudo-random number 34, and produces a pseudo-random number 32. The pseudo-random number 32 includes a key element 35, an updated cyclic shift random number 36, an update time delay factor random number 37, and an update time delay factor data source 38. The key output terminal 24 is for outputting a key element 35; the key group 6 is composed of at least one key element 35 output by the chaotic cipher operator 20 after at least one iteration operation 70. The updated cyclic displacement random number 36 is stored in the cyclic shift register 26 to form a cyclic displacement random number 33. The delay length shift register 25 uses the update time delay factor random number 37 and the update time delay factor data source 38 to generate a time delay factor 39 and truncates the time delay factor 39 to form a truncated time delay factor of 40. And the truncated time delay factor 40 is stored in the delay length shift register 25. The iterative operator 27 brings the initial pseudo-random number 30 or the iterative pseudo-random number 34 received from the input rendezvous end 21 into a chaotic map 50 and generates a mutually exclusive operation 51 with the truncated time delay factor 40 to generate a new one. The pseudo-random number 41 is iterated, and the new iteration pseudo-random number 41 is stored in the pseudo-random number register 23 to form an iterative pseudo-random number 34.

In another embodiment, the length of the key group 6 is greater than or equal to the plaintext message 7 The length.

In another embodiment, the iterative operation 70 is performed by a digital time-interfering chaotic system 52. Combined with a set of variant Logistic maps 53, wherein the set of variant logistic maps 53 is a chaotic map 50.

In another embodiment, the set of variant logistic maps 53 includes a variant logistic map 54 defined as follows: Ψ _{α , P} ( x ): [0, 1] → [0, 1],

Where α N,p [0,1] is the control parameter, x is the state variable; the variant logistic map 54 is segmented continuously and the segment can be divided, and its only critical point is the parameter p (ie Ψ(p)=0), and it has 2α fixed points; when α=1, the variant logistic map 54 can be regarded as a logistic map g _r and a line map f _p,q synthesized. And g _r and f _{p,q are} defined as follows: g _r ( x )= rx (1- x ), where 3.57< r There is chaotic behavior at 4 o'clock; f _p,q :[0,1]→[0,1], Where p,q (0,1); when , Time, Is an identity function; Which Time, Please refer to Fig. 8, which is the graph of g _r when the control parameter r = 4; please refer to Fig. 9 for the control parameter p=0.3, q=0.5, f _p,q ; please refer to Fig. 10 is a graph of Ψ _{α and P} when the control parameter α = 1, p = 0.3; refer to Fig. 11 for the control parameter α = 20, p = 0.3, Ψ _{α , P} ; Design a fixed vertex that maps the original Logistic Via control parameter p [0,1], freely move horizontally in the [0,1] interval on the x- axis, so the vertex of the new function is (p,1); and increasing this horizontal control parameter p will not only have the generation of chaotic empty windows. There is also a strong nonlinear effect; then multiplied by α The simple operation of N and mod 1 can be regarded as a vertical control operation; the vertical parameter α is controlled within a natural number, which can effectively increase the complexity, and there is no chaotic window, and when α is enough Large, but more evenly distributed.

In another embodiment, the digital time-interfering chaotic system 52 can be an N-dimensional digital time-interfering chaotic system 55, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, :I→I,I=[0,1], θ _i is defined in the parameter space θ _i , θ _i is Control parameters, and x I based state variable; x therefore the dynamic behavior of the system can be expressed as _{x n +1 = f θ (x} n), where n is a line number of 70 iteration; discretization in the performance, the accuracy of m bits In the case of elementary time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Please refer to Figure 5, let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor 39 d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost bit of d _n is And To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor of 40 Was introduced to disturb The dynamic behavior is truncated by the truncation function h to the last l - m bit in the l- bit of the time delay factor 39 d _n , and the remaining m bits are output, The system is defined as: The N-dimensional digital time-interference chaotic system 55 is defined as: or Where ♁ is a mutual exclusion operation 51 (XOR), i =1,...,N, n is the number of iteration operations 70, where

In another embodiment, the digital time-interfering chaotic system 52 can be an N×M-dimensional digital time-interfering chaotic system 56, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, j =1,...,M, :I→I,I=[0,1], θ _{( i , j )} is defined in the parameter space θ _{( i , j )} , and θ _{( i , j )} is Control parameters, and x I based state variable, and therefore the dynamic behavior of the system x can be expressed as _{x n +1 = f θ (x} n), where n is a line number of 70 iteration; discretization in the performance, the accuracy of m bits In the case of elementary time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Please refer to Figure 5, let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor 39 d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor of 40 Was introduced to disturb The dynamic behavior is truncated by the truncation function h to the last l - m bit in the l- bit of the time delay factor 39 d _n , and the remaining m bits are output, The system is defined as: The digitally time-interfering chaotic system 56 of the N×M dimension is defined as: or The ♁ is a mutual exclusion operation 51 (XOR), 1 i N,1 j M, n is the number of iterations 70, of which

In another embodiment, the set of variant Logistic maps 53 is composed of N variant logistic maps 57, which are defined as follows: , where I=[0,1],

Where α _i N, p _i [0,1] is a control parameter, i = 1, ..., N , x is the system state variables; chaotic systems 52 wherein the number of bits of the set of defined binding variant Logistic map 53 as follows: x the dynamic behavior of the system can be Expressed as x _{n +1} = Ψ _{α , P} ( x _n ), where n is the number of iterations 70; in the case of discretization, when the calculation accuracy is m bits, the closed interval I is expressed as I _m , At this time, the α system is expressed as , At this time, the p system is expressed as , At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Please refer to Figure 5, let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor 39 d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor of 40 Was introduced to disturb The dynamic behavior is truncated by the truncation function h to the last l - m bit in the l- bit of the time delay factor 39 d _n , and the remaining m bits are output, The system is defined as: Time-disturbed chaotic map encryption and decryption system iterative operation 70 is defined as: Where ♁ is a mutual exclusion operation 51 (XOR), i =1,...,N, n is the number of iteration operations 70, where

In another embodiment, a linear feedback shift register 28 is further provided to cause the iterative operation 70 to be defined as follows: The linear feedback shift register 28 is LFSR( n ).

In another embodiment, in the case of discretization, when the calculation accuracy is m = 32 bits, , where a _j {0,1}, and The system can be re-represented as a binary vector: [ a ₀ ,..., a _j ,..., a _{m -1} ]; see Figure 6, an initial cyclic displacement random number 31 Generate a cyclic shift of [ a ₀ ,..., a _j ,..., a _{m -1} ] make Where b _j {0,1}, and [b ₀ ,...,b _j ,...,b _{m -1} ] includes an update cyclic displacement random number 36 r _c , an update time delay factor random number 37 r _d , a key element 35 And an update time delay factor data source 38 , among them Can be expressed as Can be expressed as At this time, the initial cyclic displacement random number 31 The value is set to update the value of the cyclic displacement random number 36 r _c , that is, the update cyclic displacement random number 36 r _c is used for the random number used to generate the cyclic displacement next time. Time-disturbed chaotic map encryption and decryption system iterative operation 70 is defined as: Where ♁ is a mutual exclusion operation 51 (XOR), i =1,...,N, n is the number of iteration operations 70, where Wherein LFSR( n ) is a linear feedback shift register 28; see FIG. 7, which is a flowchart of a process of decomposing encryption and decryption according to an embodiment of the present invention, wherein the process of decomposing encryption is as follows: , i =1, . . . , N, form a group of key elements 35, and divide the plaintext message into a block 16 of a plaintext block containing 16×N bits per cell block, and perform the key element 35 with the plaintext block 11 Mutually exclusive operation 51 produces one ciphertext block 12 of 16 x N bits; an iterative operation 70 is performed to generate a new set of key elements 35, and a new set of key elements 35 is associated with the next The plaintext cell block 11 performs a mutual exclusion operation 51 to generate a new ciphertext cell block 12; the above steps are repeated until all the plaintext cell blocks 11 are encrypted; wherein the decryption and decryption process is as follows: each ciphertext block 12 performs a mutual exclusion operation 51 with each of the individual key elements 35 corresponding thereto, and generates a decomposed and decrypted plaintext message 13, and each of the decomposed and decrypted plaintext messages 13 is set to complete the decomposition and decryption process.

In another embodiment, the key is defined as follows: Key = {(β ₁ , q ₁ ),...(β _i ,q _i ),...,(β _N ,q _N )}, where β _i {1,...,2 ^m -1},q _i {1,...,2 ^m -1}, i =1,...,N; therefore the parameters of the set of variant logistic maps 53 can be set by the key: α _i = 2 ¹⁰ β _i , p _i = q _i /2 ^m , where i =1,...,N; so design α _i must be greater than 1000, so α _i is large enough; key space: Suppose the computer can calculate k times of multiplication per second, and each iteration 70 needs to calculate 3N multiplications. The output of the bit, the output speed of the encryption and decryption can be estimated as:

So when k = 10 ⁹ and m = 32, the output speed can be estimated to be about 5.3 Gbits/sec.

Referring to Figures 3 and 4, the present invention also provides a time-disturbing chaotic map encryption and decryption method for secure communication, which may select a synthetic encryption decryption process 62 or a decomposition encryption decryption process 65, which will be used in a transmitting end 1 Loading one of the plaintext messages 7 is transmitted from the sender 1 in a secure manner. The composite encryption decryption process 62 includes a synthetic encryption process 63 and a synthetic decryption process 64; wherein the decomposition encryption decryption process 65 includes a decomposition encryption process 66 and a decomposition decryption process 67.

The synthetic encryption process 63 is performed at the transmitting end 1, and includes the following steps: input An initial state 60 to a chaotic cryptographic operator 20 in the transmitting end 1; at least one iterative operation 70 is performed by the chaotic cryptographic operator 20 to generate a key set 6, wherein the length of the key set 6 is greater than or equal to the plaintext message The length of 7; and a plaintext message 7 and a key group 6 are mutually exclusive operation 51 by a chaotic cipher encryptor 3 to generate a ciphertext block group 8.

The synthetic decryption process 64 is performed at the receiving end 2 and includes the following steps: The chaotic cipher receiver 4 receives the ciphertext block group 8 from the transmitting end 1 and the initial state 60; inputs the initial state 60 to the chaotic cipher operator 20 in the receiving end 2; causes the chaotic cipher operator 20 to perform at least one time perturbation chaos Mapping the encryption and decryption system's iterative operation 70 to generate the same key group 6 as in the transmitting end 1; and a chaotic cryptographic decryptor 5 to cipher the ciphertext block group 8 and the key group 6 to perform a mutually exclusive operation 51 to generate A synthetic decryption plaintext message 10.

The decomposition encryption process 66 is performed at the transmitting end 1, and includes the following steps: One: input the initial state 60 to the chaotic cipher operator 20 in the transmitting end 1; Step 2: perform an iterative operation 70 by the chaotic cipher operator 20 to generate a key element 35; Step 3: by the chaotic cipher encryptor 3 A plaintext message 7 is taken to form a plaintext cell block 11, wherein the length of the plaintext cell block 11 is the same as the length of the key element 35; and step 4: the plaintext cell block 11 and the key element 35 are mutually exclusive by the chaotic cipher encryptor 3. The operation 51 is performed to generate a ciphertext block 12; Step 5: repeat step 2, step 3, and step 4 until the plaintext message 7 is retrieved; step 6: each time the ciphertext cell generated in step 4 is executed Block 12 is assembled into a ciphertext block group 8.

The decomposition decryption process 67 is performed at the receiving end 2 and includes the following steps: A: receiving the ciphertext block group 8 from the transmitting end 1 and the initial state 60 by the chaotic cipher receiver 4; Step 2: inputting the initial state 60 to the chaotic cipher operator 20 in the receiving end 2; Step 3: by the receiving end The chaotic cryptographic operator 20 in 2 performs an iterative operation 70 of a time-interfering chaotic map encryption and decryption method to generate a key element 35; step 4: grouping the key elements 35 generated in each step three into a key group 6, If the length of the key group 6 is smaller than the ciphertext block group 8, repeat step 3, if the length of the key group 6 is greater than or equal to the ciphertext block group 8, perform step 5; step 5: the chaotic password decryptor 5 The ciphertext block group 8 and the key group 6 perform a mutually exclusive operation 51 to generate a decomposed and decrypted plaintext message 13.

In another embodiment, the iterative operation 70 includes the following steps: An operational switch 21 is activated to initiate the chaotic cryptographic operator 20 to perform an iterative operation 70; an initial state 60 or an iterative state 61 is selected by an input rendezvous terminal 22, wherein an initial pseudorandom number 30 is selected when the initial state 60 is selected. And an initial cyclic shift random number 31 is input via the input rendezvous terminal 22, the initial pseudo random number 30 is transmitted to an iterative operator 27, and the initial cyclic shift random number 31 generates a cyclic shift of the initial pseudorandom number 30 to generate a pseudo. The random number 32, and when the iteration state 61 is selected, one of the cyclic shift random number 33 in one of the cyclic shift registers 26 and one of the pseudo random number registers 23 in the pseudo random number register 23 are input via the input rendezvous end 22 The iterative pseudo-random number 34 is passed to the iterative operator 27, and the cyclically-displaced random number 33 produces a cyclically shifted iterative pseudo-random number 34, producing a pseudo-random number 32, wherein the pseudo-random number 32 includes a key element 35, an update a cyclic shift random number 36, an update time delay factor random number 37, and an update time delay factor data source 38; a key element 35 is output by a key output terminal 24, wherein the key group 6 is composed of Chaotic cipher operator 20 is composed of at least one key element 35 outputted after at least one iteration operation 70; by storing the updated cyclic displacement random number 36 in the cyclic shift register 26, a cyclic displacement random number 33 is formed; The delay length shift register 25 uses the update time delay factor random number 37 and the update time delay factor data source 38 to generate a time delay factor 39 and truncates the time delay factor 39 to form a truncated time delay factor 40, The truncated time delay factor 40 is stored in the delay length shift register 25; the initial pseudo random number 30 or the iterative pseudo random number 34 received from the input rendezvous end 22 is brought into a chaotic map by the iterative operator 27. In 50, a mutually exclusive operation 51 is generated with the truncated time delay factor 40, and a new iteration pseudo-random number 41 is generated, and the new iteration pseudo-random number 41 is stored in the pseudo-random number register 23 to form an iterative pseudo. Random number 34.

In another embodiment, the iterative operation 70 is performed by a digital time-interfering chaotic system 52 in conjunction with a set of variant logistic maps 53, wherein the set of variant logistic maps 53 is a chaotic map 50.

In another embodiment, the set of variant logistic maps 53 includes a variant logistic map 54 defined as follows: Ψ _{α , P} ( x ): [0, 1] → [0, 1],

Where α N,p [0,1] is the control parameter, x is the state variable; the variant logistic map 54 is segmented continuously and the segment can be divided, and its only critical point is the parameter p (ie Ψ(p)=0), and it has 2α fixed points; when α=1, the variant logistic map 54 can be regarded as a logistic map g _r and a line map f _p,q synthesized. And g _r and f _{p,q are} defined as follows: g _r ( x )= rx (1- x ), where 3.57< r There is chaotic behavior at 4 o'clock; f _p,q :[0,1]→[0,1],

Where p,q (0,1); when , Time, Is an identity function; Which When, Ψ _{1, P} = g ₄ ; Please refer to Figure 8, which is the graph of g _r when the control parameter r = 4; please refer to Figure 9, when the control parameter is p=0.3, q=0.5, The graph of f _p,q ; please refer to Fig. 10, which is the graph of Ψ _{α and P} when the control parameter α=1, p=0.3; please refer to Fig. 11 for the control parameter α=20, p=0.3 When, Ψ _{α , P} graphics; so designed to fix the fixed vertices of the original Logistic Via control parameter p [0,1], freely move horizontally in the [0,1] interval on the x- axis, so the vertex of the new function is (p,1); and increasing this horizontal control parameter p will not only have the generation of chaotic empty windows. There is also a strong nonlinear effect; then multiplied by α The simple operation of N and mod 1 can be regarded as a vertical control operation; the vertical parameter α is controlled within a natural number, which can effectively increase the complexity, and there is no chaotic window, and when α is enough Large, but more evenly distributed.

In another embodiment, the digital time-interfering chaotic system 52 can be an N-dimensional digital time-interfering chaotic system 55, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, :I→I,I=[0,1], θ _i is defined in the parameter space θ _i , θ _i is Control parameters, and x I based state variable; x therefore the dynamic behavior of the system can be expressed as _{x n +1 = f θ (x} n), where n is a line number of 70 iteration; discretization in the performance, the accuracy of m bits In the case of elementary time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Please refer to Figure 5, let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor 39 d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor of 40 Was introduced to disturb The dynamic behavior is truncated by the truncation function h to the last l - m bit in the l- bit of the time delay factor 39 d _n , and the remaining m bits are output, The system is defined as: The N-dimensional digital time-interference chaotic system 55 is defined as: or Where ♁ is a mutual exclusion operation 51 (XOR), i =1,...,N, n is the number of iteration operations 70, where

In another embodiment, the digital time-interfering chaotic system 52 can be an N×M-dimensional digital time-interfering chaotic system 56, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, j =1,...,M, :I→I,I=[0,1], θ _{( i , j )} is defined in the parameter space θ _{( i , j )} , and θ _{( i , j )} is Control parameters, and x I based state variable, and therefore the dynamic behavior of the system x can be expressed as _{x n +1 = f θ (x} n), where n is a line number of 70 iteration; discretization in the performance, the accuracy of m bits In the case of elementary time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Please refer to Figure 5, let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor 39 d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor of 40 Was introduced to disturb The dynamic behavior is truncated by the truncation function h to the last l - m bit in the l- bit of the time delay factor 39 d _n , and the remaining m bits are output, The system is defined as: The digitally time-interfering chaotic system 56 of the N×M dimension is defined as: or The ♁ is a mutual exclusion operation 51 (XOR), 1 i N,1 j M, n is the number of iterations 70, of which

In another embodiment, the set of variant Logistic maps 53 is composed of N variant logistic maps 57, which are defined as follows: , where I=[0,1],

Where α _i N, p _i [0,1] is a control parameter, i = 1, ..., N , x is the system state variables; chaotic systems 52 wherein the number of bits of the set of defined binding variant Logistic map 53 as follows: x the dynamic behavior of the system can be Expressed as x _{n +1} = Ψ _{α , P} ( x _n ), where n is the number of iterations 70; in the case of discretization, when the calculation accuracy is m bits, the closed interval I is expressed as I _m , At this time, the α system is expressed as , At this time, the p system is expressed as , At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Please refer to Figure 5, let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor 39 d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor of 40 Was introduced to disturb The dynamic behavior is truncated by the truncation function h to the last l - m bit in the l- bit of the time delay factor 39 d _n , and the remaining m bits are output, The system is defined as: The iterative operation 70 of the time-disturbing chaotic map encryption and decryption method is defined as: Where ♁ is a mutual exclusion operation 51 (XOR), i =1,...,N, n is the number of iteration operations 70, where

In another embodiment, a linear feedback shift register 28 is further provided to cause the iterative operation 70 to be defined as follows: The linear feedback shift register 28 is LFSR( n ).

In another embodiment, in the case of discretization, when the calculation accuracy is m = 32 bits, , where a _j {0,1}, and The system can be re-represented as a binary vector: [ a ₀ ,..., a _j ,..., a _{m -1} ]; see Figure 6, an initial cyclic displacement random number 31 Generate a cyclic shift of [ a ₀ ,..., a _j ,..., a _{m -1} ] make Where b _j {0,1}, and [b ₀ ,...,b _j ,...,b _{m -1} ] includes an update cyclic displacement random number 36 r _c , an update time delay factor random number 37 r _d , a key element 35 And an update time delay factor data source 38 , among them Can be expressed as Can be expressed as At this time, the initial cyclic displacement random number 31 The value is set to update the value of the cyclic displacement random number 36 r _c , that is, the update cyclic displacement random number 36 r _c is used for the random number used to generate the cyclic displacement next time. The iterative operation 70 of the time-disturbing chaotic map encryption and decryption method is defined as: Where ♁ is a mutual exclusion operation 51 (XOR), i =1,...,N, n is the number of iteration operations 70, where Wherein LFSR( n ) is a linear feedback shift register 28; see FIG. 7, which is a flowchart of a process of decomposing encryption and decryption according to an embodiment of the present invention, wherein the process of decomposing encryption is as follows: , i =1, . . . , N, form a group of key elements 35, and divide the plaintext message into a block 16 of a plaintext block containing 16×N bits per cell block, and perform the key element 35 with the plaintext block 11 Mutually exclusive operation 51 produces one ciphertext block 12 of 16 x N bits; an iterative operation 70 is performed to generate a new set of key elements 35, and a new set of key elements 35 is associated with the next The plaintext cell block 11 performs a mutual exclusion operation 51 to generate a new ciphertext cell block 12; the above steps are repeated until all the plaintext cell blocks 11 are encrypted; wherein the decryption and decryption process is as follows: each ciphertext block 12 performs a mutual exclusion operation 51 with each of the individual key elements 35 corresponding thereto, and generates a decomposed and decrypted plaintext message 13, and each of the decomposed and decrypted plaintext messages 13 is set to complete the decomposition and decryption process.

In another embodiment, the key is defined as follows: Key = {(β ₁ , q ₁ ),...(β _i ,q _i ),...,(β _N ,q _N )}, where β _i {1,...,2 ^m -1},q _i {1,...,2 ^m -1}, i =1,...,N; therefore the parameters of the set of variant logistic maps 53 can be set by the key: α _i = 2 ¹⁰ β _i , p _i = q _i /2 ^m , where i =1,...,N; so design α _i must be greater than 1000, so α _i is large enough; key space: Suppose the computer can calculate k times of multiplication per second, and each iteration 70 needs to calculate 3N multiplications. The output of the bit, the output speed of the encryption and decryption can be estimated as:

So when k = 10 ⁹ and m = 32, the output speed can be estimated to be about 5.3 Gbits/sec.

The above is a specific embodiment of the present invention and the technical means employed, and many variations and modifications can be derived therefrom based on the disclosure or teachings herein. The role of the invention is not to be exceeded in the spirit of the specification and the drawings, and should be considered as within the technical scope of the present invention.

In summary, according to the above disclosure, the present invention can achieve the intended purpose of the invention, and provides a time-disturbing chaotic map encryption and decryption system and method for secret communication, which is of great industrial value. File an invention patent application.

1‧‧‧Send

2‧‧‧ Receiver

3‧‧‧Chaotic Password Encryptor

4‧‧‧Chaotic password receiver

5‧‧‧Chaotic Password Decryptor

6‧‧‧ Key Group

7‧‧‧Clear message

8‧‧‧Mciven block group

9‧‧‧Decrypting plaintext messages

20‧‧‧Chaotic cryptographic operator

51‧‧‧Exclusive operation

70‧‧‧ Iterative operation

Claims (19)

A time-disturbing chaotic map encryption and decryption system for secret communication, which can transmit a plaintext message from a sender to a receiver in a secure manner, including: at least one chaotic cipher operator, respectively disposed at the sender and the The receiving end first inputs an initial state to the chaotic cryptographic operator in the transmitting end, and then causes the chaotic cryptographic operator to perform an iterative operation of the chaotic mapping encryption and decryption system at least once to generate a key. a chaotic cipher encryptor is disposed in the sender, the chaotic cipher encrypts the plaintext message, and the ciphertext message and the key group are mutually exclusive to generate a ciphertext block group a chaotic cipher receiver is disposed in the receiving end, wherein the chaotic cipher receiver receives the ciphertext block group transmitted from the transmitting end and the initial state, and first inputs the initial state to the receiving end In the chaotic cryptographic operator, the chaotic cryptographic operator is further executed to perform the iterative operation of the chaotic map encryption and decryption system at least once. And generating the same key group as the sending end; a chaotic cryptographic decryptor is disposed in the receiving end, wherein the chaotic crypto-decryptor mutually exclusiveizes the ciphertext block group and the key group And generate a decrypted plaintext message. The time-disturbing chaotic map encryption and decryption system for confidential communication, as described in claim 1, wherein the chaotic cryptographic operator includes an operational switch, an input rendezvous end, a pseudo-random number register, and a gold a key output end, a delay length shift register, a cyclic shift register, and an iterative operator; wherein the operation open relationship is used to start the chaotic cipher operator to perform the time perturbation An iterative operation of the chaotic mapping encryption and decryption system, wherein the input convergence end selects the initial state or an iterative state, and when the initial state is selected, an initial pseudo random number and an initial cyclic displacement random number are input through the input convergence end Transmitting the initial pseudo random number to the iterative operator, and the initial cyclic displacement random number generates a cyclic displacement of the initial pseudo random number to generate a pseudo random number, and when the iterative state is selected, the cyclic displacement temporarily One of the cyclic displacement random numbers in the register and one of the pseudo-random number registers, the iterative pseudo-random number is input via the input convergence end, and the iterative pseudo-random number is transmitted to the iterative operator, and the cyclic displacement random number is Generating the iterative pseudo-random number to generate a pseudo-random number, wherein the pseudo-random number includes a key element, an updated cyclic displacement random number, an update time delay factor random number, and an update time delay factor data source , wherein the key output is used to output the key element, wherein the update cyclic displacement random number is stored in the cyclic displacement Forming the cyclic displacement random number, wherein the delay length shift register uses the update time delay factor random number and the update time delay factor data source to generate a time delay factor, and truncating the time delay factor Forming a truncated time delay factor and storing the truncated time delay factor in the delay length shift register, wherein the iterative operator is to receive the initial pseudo random number from the input convergence end Or the iterative pseudo-random number is brought into a chaotic map and a mutually exclusive operation is generated with the truncated time delay factor, and a new iterative pseudo-random number is generated, and the new iteration pseudo-random number is stored in the pseudo-random number. Forming, in the register, the iterative pseudo-random number, and wherein the key group is at least one of the key elements output by the chaotic cryptographic operator after at least one time of the iterative operation of the chaotic map encryption and decryption system composition. For example, the time-disturbed chaotic map encryption and decryption system for secure communication, as described in claim 1, wherein the iterative operation of the time-disturbed chaotic map encryption and decryption system is combined with a set of variant logistic maps by a digital time-interfering chaotic system. Defined. The time-disturbed chaotic map encryption and decryption system for secure communication, as described in claim 3, wherein the set of variant logistic maps comprises a variant logistic map, which is defined as follows: Ψ _{α , P} ( x ): [ 0,1]→[0,1], Where α N,p [0,1] is the control parameter and x is the state variable. The time-disturbing chaotic map encryption and decryption system for secure communication, as described in claim 3, wherein the digital time-interfering chaotic system is an N-dimensional digital time-interference chaotic system, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, :I→I,I=[0,1], θ _i is defined in the parameter space θ _i , θ _i is Control parameters, and x I based state variable; x therefore the dynamic behavior of the system can be expressed as _{x n +1 = f θ (x} n), where n is the number of iterations of operation of the system; in the discretization of the performance, the accuracy of m bits At this time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The N-dimensional digital time-interfering chaotic system is defined as: or Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where The time-disturbing chaotic map encryption and decryption system for secure communication, as described in claim 3, wherein the digital time-interference chaotic system is an N×M-dimensional digital time-interference chaotic system, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, j =1,...,M, :I→I,I=[0,1], θ _{( i , j )} is defined in the parameter space θ _{( i , j )} , and θ _{( i , j )} is Control parameters, and x I based state variable, and therefore the dynamic behavior of the system x can be expressed as _{x n +1 = f θ (x} n), where n is the number of iterations of operation of the system; in the discretization of the performance, the accuracy of m bits At this time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The digital time-interference chaotic system of the N×M dimension is defined as: or The ♁ is a mutually exclusive operation (XOR), 1 i N,1 j M, n is the number of iterations, where The time-disturbed chaotic map encryption and decryption system for secure communication, as described in claim 3, wherein the set of variant logistic maps is composed of N variant logistic maps, which are defined as follows: , where I=[0,1], Where α _i N, p _i [0,1] is the control parameter, i =1,...,N, x is the state variable; wherein the digital time-interfering chaotic system is combined with the definition of the variant logistic map as follows: The dynamic behavior of x can be expressed x _{n +1} = Ψ _{α , P} ( x _n ), where n is the number of iterative operations; in the case of discretization, when the calculation precision is m bits, the closed interval I is expressed as I _m , At this time, the α system is expressed as , At this time, the p system is expressed as , At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The iterative operation system of the time-disturbed chaotic map encryption and decryption system is defined as: Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where For example, the time-disturbed chaotic map encryption and decryption system for secret communication described in claim 7 is further provided with a linear feedback displacement register, so that the iterative operation of the time-disturbed chaotic map encryption and decryption system is defined as follows: The linear feedback shift register is LFSR( n ). The time-disturbing chaotic map encryption and decryption system for secure communication, as described in claim 8 of the patent application scope, wherein in the performance of discretization, when the calculation accuracy is m =32 bits, , where a _j {0,1}, and Can be re-represented as a binary vector: [ a ₀ ,..., a _j ,..., a _{m -1} ]; an initial cyclic displacement random number Generate a cyclic shift of [ a ₀ ,..., a _j ,..., a _{m -1} ] make Where b _j {0,1}, and [b ₀ ,...,b _j ,...,b _{m -1} ] includes an update cyclic displacement random number r _c , an update time delay factor random number r _d , a gold Key element And an update time delay factor data source , where r _d =[b ₀ ,...,b ₂ ], can be expressed as r _c =[b ₃ ,...,b ₇ ], can be expressed as At this time, the initial cyclic displacement random number The value is set to the value of the updated cyclic displacement random number r _c , that is, the updated cyclic displacement random number r _c is used for the random number used to generate the cyclic displacement next time. The iterative operation system of the time-disturbed chaotic map encryption and decryption system is defined as: Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where Where LFSR( n ) is the linear feedback shift register. The time-disturbing chaotic map encryption and decryption system for secure communication, as described in claim 1, wherein the length of the key group is greater than or equal to the length of the plaintext message. A time-disturbing chaotic map encryption and decryption method for secret communication, which can select a synthetic encryption and decryption process or a decomposition encryption and decryption process to load a plaintext message in a sender And transmitting to the receiving end in a secure manner, where the synthetic encryption and decryption process comprises: a synthetic encryption process, performed by the sending end, comprising the steps of: inputting an initial state to one of the chaotic passwords in the transmitting end An operator: performing, by the chaotic cryptographic operator, at least one iteration operation of the time-interfering chaotic map encryption and decryption method to generate a key group, wherein the length of the key group is greater than or equal to the length of the plaintext message; The chaotic cipher encrypts the plaintext message and the key group to perform a mutually exclusive operation to generate a ciphertext block group; and a synthesizing and decrypting process is performed at the receiving end, comprising the following steps: receiving by a chaotic cipher receiver The ciphertext cell block group from the transmitting end and the initial state; inputting the initial state to a chaotic cipher operator in the receiving end, so that the chaotic cipher operator performs at least one time perturbation chaotic map encryption and decryption system Iterating the operation to generate the same key group as in the transmitting end; and the ciphertext is small by a chaotic crypto-decryptor The block group and the key group are mutually exclusive operations to generate a synthetic decrypted plaintext message; wherein the decomposing encryption and decryption process comprises: a decomposing encryption process, performed on the transmitting end, comprising the following steps: Step 1: inputting the initial a state to the chaotic cryptographic operator in the transmitting end; step 2: performing an iterative operation of the time-disturbing chaotic map encryption and decryption method by the chaotic cryptographic operator to generate a key element; Step 3: The chaotic cipher encrypts a piece of the plaintext message to form a plaintext block, wherein the length of the plaintext block is the same as the length of the key element; and step 4: the plaintext is encrypted by the chaotic cipher The cell block and the key element are mutually exclusive operations to generate a ciphertext block; step 5: repeat step two, step three, step four until the plaintext message is retrieved; step six: each execution The ciphertext cell block generated in step 4 is assembled into the ciphertext cell block group; a decomposing and decrypting process is performed on the receiving end, and includes the following steps: Step 1: receiving, by the chaotic cipher receiver, the sending end The ciphertext cell block group and the initial state; Step 2: input the initial state to the chaotic cipher operator in the receiving end; Step 3: Performing the time perturbation by the chaotic cipher operator in the receiving end An iterative operation of the chaotic map encryption and decryption method to generate the key element; step 4: assembling the key element generated in each step three into the key group If the length of the key group is smaller than the ciphertext block group, repeat step 3, if the length of the key group is greater than or equal to the ciphertext block group, perform step 5; step 5: the chaotic password decryptor The ciphertext cell block group and the key group are mutually exclusive operations to generate a decomposed and decrypted plaintext message. Time-disturbed chaotic map encryption for secure communication as described in claim 11 The decryption method, wherein the time disturbing the iterative operation of the chaotic map encryption and decryption method comprises the following steps: starting an operation switch to start the chaotic cryptographic operator to perform an iterative operation of the time-disturbed chaotic map encryption and decryption method; Selecting the initial state or an iterative state, wherein when the initial state is selected, an initial pseudo random number and an initial cyclic displacement random number are input through the input rendezvous end, and the initial pseudo random number is transmitted to an iterative operator, And the initial cyclic displacement random number generates a cyclic displacement of the initial pseudo random number to generate a pseudo random number, and when the iterative state is selected, a cyclic displacement random number and a pseudo random number in a cyclic shift register An iterative pseudo random number in the register is input through the input convergence end, and the iterative pseudo random number is transmitted to the iterative operator, and the cyclic displacement random number generates a cyclic shift of the iterative pseudo random number to generate the pseudo a random number, wherein the pseudo random number includes the key element, an updated cyclic displacement random number, and an update a delay factor random number and an update time delay factor data source; the key element is output by a key output terminal; and the cyclic shift displacement is randomly generated by storing the update cyclic displacement random number into the cyclic shift register a time delay factor is generated by a delay length shift register using the update time delay factor random number and the update time delay factor data source, and the time delay factor is truncated to form a truncated time delay a factor, and storing the truncated time delay factor in the delay length shift register; wherein the iterative operator brings the initial pseudo random number received from the input convergence end or the iterative pseudo random number into a a chaotic map and a mutually exclusive operation with the truncated time delay factor, generating a new iterative pseudo-random number, and storing the new iteration pseudo-random number into the pseudo-random number Forming the iterative pseudo-random number in the number register, wherein the key group is at least one of the key elements output by the chaotic cryptographic operator after the iterative operation of the chaotic map encryption and decryption method at least once. Composed of. For example, the time-disturbed chaotic map encryption and decryption method for secret communication described in claim 11 is performed by a digital time-interfering chaotic system combined with a set of variant logistic maps to perform iteration of the time-disturbed chaotic map encryption and decryption method. Operation. The time-disturbed chaotic map encryption and decryption method for secure communication, as described in claim 13, wherein the set of variant logistic maps includes a variant logistic map, which is defined as follows: Ψ _{α , P} ( x ): [ 0,1]→[0,1], Where α N,p [0,1] is the control parameter and x is the state variable. The time-disturbing chaotic map encryption and decryption method for secure communication, as described in claim 13, wherein the digital time-interference chaotic system is an N-dimensional digital time-interference chaotic system, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, :I→I,I=[0,1], θ _i is defined in the parameter space θ _i , θ _i is Control parameters, and x I based state variable; x therefore the dynamic behavior of the system can be expressed as _{x n +1 = f θ (x} n), where n is the number of iterations of operation of the system; in the discretization of the performance, the accuracy of m bits At this time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The N-dimensional digital time-interfering chaotic system is defined as: or Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where The time-disturbing chaotic map encryption and decryption method for secure communication, as described in claim 13, wherein the digital time-interference chaotic system is an N×M-dimensional digital time-interference chaotic system, which is defined as follows: To define a set of one-dimensional chaotic maps f _θ in a closed interval, where i =1,...,N, j =1,...,M, :I→I,I=[0,1], θ _{( i , j )} is defined in the parameter space θ _{( i , j )} , and θ _{( i , j )} is Control parameters, and x I based state variable, and therefore the dynamic behavior of the system x can be expressed as _{x n +1 = f θ (x} n), where n is the number of iterations of operation of the system; in the discretization of the performance, the accuracy of m bits At this time, the closed interval I is expressed as I _m . At this time, f _θ is expressed as At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The digital time-interference chaotic system of the N×M dimension is defined as: or The ♁ is a mutually exclusive operation (XOR), 1 i N,1 j M, n is the number of iterations, where For example, the time-disturbed chaotic map encryption and decryption method for confidential communication as described in claim 13 of the patent scope, wherein the set of variant logistic maps is composed of N variant logistic maps, which are defined as follows: , where I=[0,1], Where α _i N, p _i [0,1] is the control parameter, i =1,...,N, x is the state variable; wherein the digital time-interfering chaotic system is combined with the definition of the variant logistic map as follows: The dynamic behavior of x can be expressed x _{n +1} = Ψ _{α , P} ( x _n ), where n is the number of iterative operations; in the case of discretization, when the calculation precision is m bits, the closed interval I is expressed as I _m , At this time, the α system is expressed as , At this time, the p system is expressed as , At this time, the x system is expressed as , , Can be re-represented as , where a _j {0,1}; Let G _l :Π ^l I _m →I _l be a nonlinear multivariable single-valued function, where I _l is when the calculation precision is 1 bit, l m , The G _l system takes a fixed bit in the first l state variable of the current state variable x _n and combines it into a l- bit time delay factor d _n : Where g _k :I _m →{0,1}, , k=1,..., m , where the leftmost one of d _n is and To calculate d _{n +1} , in fact, all the bits of d _n are shifted to the left by one bit, that is, Where <<< is to shift the operator to the left, which is defined as: ,among them Let h:I _l →I _m be a truncation function, h truncates the last l - m bit in the input l bit, and outputs the remaining m bits, a truncated time delay factor Was introduced to disturb The dynamic behavior is that the truncation function h truncates the last l - m bit in the l- bit of the time delay factor d _n and outputs the remaining m bits, The system is defined as: The iterative operation system of the time-disturbed chaotic map encryption and decryption system is defined as: Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where For example, the time-disturbing chaotic map encryption and decryption method for confidential communication described in claim 17 is a linear feedback displacement register, and the iterative operation of the time-disturbed chaotic map encryption and decryption method is defined as follows: The linear feedback shift register is LFSR( n ). For example, the time-disturbed chaotic map encryption and decryption system for secure communication as described in claim 18, wherein in the case of discretization, when the calculation accuracy is m =32 bits, , where a _j {0,1}, and Can be re-represented as a binary vector: [ a ₀ ,..., a _j ,..., a _{m -1} ]; an initial cyclic displacement random number Generate a cyclic shift of [ a ₀ ,..., a _j ,..., a _{m -1} ] make Where b _j {0,1}, and [b ₀ ,...,b _j ,...,b _{m -1} ] includes an update cyclic displacement random number r _c , an update time delay factor random number r _d , a gold Key element And an update time delay factor data source , where r _d =[b ₀ ,...,b ₂ ], can be expressed as r _c =[b ₃ ,...,b ₇ ], can be expressed as At this time, the initial cyclic displacement random number The value is set to the value of the updated cyclic displacement random number r _c , that is, the updated cyclic displacement random number r _c is used for the random number used to generate the cyclic displacement next time. The iterative operation system of the time-disturbed chaotic map encryption and decryption system is defined as: Where ♁ is a mutually exclusive operation (XOR), i =1,...,N, n is the number of iterations, where Where LFSR( n ) is the linear feedback shift register.