A method and system for encrypting archives based on a six-dimensional multi-scroll conservative hyperchaotic system

Abstract

This invention discloses an archive encryption method and system based on a six-dimensional multi-scroll conservative hyperchaotic system, relating to the fields of information security and data encryption technology. The method involves constructing a six-dimensional multi-scroll conservative hyperchaotic system; converting the archive text to be encrypted into a byte sequence and performing grouping processing; obtaining the hash value of each grouped text block; linearly mixing the user-input initial vector with the normalized hash value to generate a system key; initializing the chaotic system using the key and iteratively generating a chaotic sequence; flattening the text blocks; rearranging the byte order according to the scrambled index sequence; performing Gray code conversion on each byte in the scrambled result and then performing an XOR operation; and concatenating the temporary ciphertext streams of each group in their original order to form a complete ciphertext byte stream as the final encryption result. This invention enhances the initial value sensitivity and randomness of the system; and simultaneously improves the confidentiality and anti-attack performance of archive data during transmission and storage.

Description

Technical Field

[0001] This invention relates to the field of information security and data encryption technology, specifically to a file encryption method and system based on a six-dimensional multi-scroll conservative hyperchaotic system. Background Technology

[0002] With the rapid development of the internet and big data technologies, archival data (such as structured text, metadata, and documents) has become a core carrier for enterprise, government, and personal privacy management. Compared to image or audio / video data, archival data is characterized by frequent access, diverse formats, and long lifecycles, making it more vulnerable to security threats such as leakage, tampering, and replay attacks. Traditional encryption methods have significant limitations in protecting archival data. For example, traditional symmetric encryption algorithms use fixed initial values, and the same plaintext can be encrypted multiple times to generate the same ciphertext, allowing attackers to exploit the repetition of ciphertext to launch replay attacks. Traditional public-key encryption algorithms rely on mathematical problems and are weak against the avalanche effect of small changes in plaintext, making it difficult to detect data tampering. Furthermore, when encrypting large-scale text sets or extremely long texts serially, traditional methods have limited throughput and cannot meet real-time requirements.

[0003] Chaotic encryption, due to its initial value sensitivity, pseudo-randomness, and unpredictability, is considered a potential lightweight encryption solution. In particular, high-dimensional conservative hyperchaotic systems, possessing properties such as multiple positive Lyapunov exponents, energy conservation, and phase space volume conservation, theoretically offer greater dynamic complexity and resistance to attacks. However, existing research on chaotic encryption suffers from the following problems:

[0004] 1. Current archival text encryption mostly uses low-dimensional dissipative chaos, which has a limited key space and is susceptible to problems such as periodic window recurrence and orbital degradation, making it difficult to resist brute-force attacks.

[0005] 2. Most chaotic encryption research focuses on image and audio data, while text data has characteristics such as character discretization and semantic sensitivity, making it difficult for existing methods to balance encryption strength and computational efficiency.

[0006] 3. Traditional chaotic encryption relies on serial iteration, which cannot make full use of parallel computing architectures such as GPUs / FPGAs, resulting in low efficiency for large-scale data encryption. Summary of the Invention

[0007] The purpose of this invention is to propose an archive encryption method and system based on a six-dimensional multi-scroll conservative hyperchaotic system, which can ensure that even a small change in plaintext can trigger a drastic change in the global ciphertext, while supporting efficient parallel encryption of large-scale archive data, thereby meeting the high-security requirements for archive data protection.

[0008] According to a first aspect of the present disclosure, a file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system is provided, comprising the following steps:

[0009] Constructing a six-dimensional multi-scroll conservative hyperchaotic system;

[0010] The file text to be encrypted is converted into a byte sequence and then processed into groups;

[0011] Obtain the hash value of each text block after grouping, and linearly mix the initial vector input by the user with the normalized hash value to generate the system key Key;

[0012] The system key Key is used as the initial value of the six-dimensional multi-scroll conservative hyperchaotic system. The chaotic system is initialized and chaotic sequences X, Y, Z, U, V, W are generated iteratively. Sequence X is sorted in ascending order to obtain the scrambled index sequence X1. Sequences Y, Z, U, V, W are quantized into integer sequences Y1, Z1, U1, V1, W1 for byte-level diffusion.

[0013] Flatten the text block and rearrange the byte order according to the scrambling index sequence X1 to obtain the scrambling result P1; perform Gray code conversion on each byte in the scrambling result P1 and then perform an XOR operation to reassemble it into the byte sequence P2;

[0014] Perform a byte-by-byte XOR operation on the byte sequence P2 and the chaotic sequence X1 to generate a temporary ciphertext stream; concatenate the temporary ciphertext streams of each group in the original order to form a complete ciphertext byte stream; output the ciphertext byte stream in a unified encoding format as the final encryption result.

[0015] In one embodiment, the mathematical model of the six-dimensional multi-scroll conservative hyperchaotic system is as follows:

[0016]

[0017] Where x i For system variables, Π i Let 'a' be a system parameter; introduce nonlinear terms into the x1 and x2 components of the gradient vector. l is a parameter that controls the number and position of the reels.

[0018] In one embodiment, the hash value normalization method is as follows:

[0019]

[0020] Where hex2dec(·) represents mapping a single hexadecimal character to an integer between 0 and 15, and the normalized result is hk. kGiven the region ∈(0,1), let the initial vector input by the user be (p1,p2,…,p6). Linearly mix this vector with the normalized hash value to obtain the system key Key.

[0021] x k,0 =p k +hk k k = 1, 2, ..., 6

[0022] Ultimately, with (x) 1,0 ,x 2,0 ,…,x 6,0 ) is used as the initial value for a six-dimensional multi-scroll conservative hyperchaotic system.

[0023] In one embodiment, the Gray code conversion method is as follows:

[0024]

[0025] Where B is the original byte and G is the converted Gray code byte; each Gray code byte G is decomposed into 8 bit planes (bits 7 to 0), forming 8 binary sequences S1 to S8 of length L, specifically:

[0026]

[0027] Where G(i) is the Gray code value (0~255) of the i-th byte, S k (i) represents the gray code of the 7th to 0th bit of the i-th byte, k=1 corresponds to the 7th bit (most significant bit), and k=8 corresponds to the 0th bit (least significant bit).

[0028] In one embodiment, the binary sequences S1 to S8 are bitwise XORed with the chaotic sequences and their combinations to generate the diffused bit planes D1 to D8, specifically:

[0029]

[0030] in This indicates bitwise XOR, and all sequences have a length of L.

[0031] Merge D1 to D8 bitwise to restore them to their byte values, and reassemble them into byte sequence P2:

[0032] P2(i)=Bin2Dec(D1(i),D2(i),…,D8(i))i=0,1,…,L-1.

[0033] In one embodiment, the temporary ciphertext stream is obtained by performing a byte-by-byte XOR operation between the byte sequence P2 and the chaotic sequence X1 as follows:

[0034]

[0035] In one embodiment, the ciphertext byte stream E is output in a uniform encoding format, including converting each ciphertext byte into its corresponding two-digit hexadecimal representation and concatenating them into a string, specifically:

[0036] C = ihex(E(0)), hex(E(1)), ...]

[0037] Alternatively, the ciphertext bytes can be encoded into a Base64 string, specifically:

[0038] C = Base64Encode(E).

[0039] According to a second aspect of the present disclosure, an archive encryption system based on a six-dimensional multi-scroll conservative hyperchaotic system is provided, comprising:

[0040] The system establishes a module to construct a six-dimensional multi-scroll conservative hyperchaotic system;

[0041] The preprocessing module converts the archive text to be encrypted into a byte sequence and performs grouping processing.

[0042] The key generation module obtains the hash value of each text block after grouping, and linearly mixes the initial vector input by the user with the normalized hash value to generate the system key Key;

[0043] The quantization module uses the system key Key as the initial value of the six-dimensional multi-scroll conservative hyperchaotic system, initializes the chaotic system and iteratively generates chaotic sequences X, Y, Z, U, V, W, sorts sequence X in ascending order to obtain scrambled index sequence X1, and quantizes sequences Y, Z, U, V, W into integer sequences Y1, Z1, U1, V1, W1 for byte-level diffusion.

[0044] The scrambling module flattens the text block, rearranges the byte order according to the scrambling index sequence X1, and obtains the scrambling result P1. After Gray code conversion of each byte in the scrambling result P1, an XOR operation is performed to reassemble it into the byte sequence P2.

[0045] The encryption module performs a byte-by-byte XOR operation on the byte sequence P2 and the chaotic sequence X1 to generate a temporary ciphertext stream; it then concatenates the temporary ciphertext streams of each group in their original order to form a complete ciphertext byte stream; finally, it outputs the ciphertext byte stream in a unified encoding format as the final encryption result.

[0046] According to a third aspect of the present disclosure, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and running on the memory, wherein the processor executes the program to implement the file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system.

[0047] According to a fourth aspect of the present disclosure, a computer-readable storage medium is provided having a computer program stored thereon that, when executed by a processor, implements the aforementioned file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system.

[0048] Compared with the prior art, the above technical solutions adopted in this invention have the following advantages: 1. The construction and analysis of a six-dimensional multi-scroll Hamiltonian conservative hyperchaotic system, through the energy conservation mechanism and nonlinear scroll term design, has at least two positive Lyapunov exponents and a rich phase space topology, which significantly improves the complexity and unpredictability of dynamic behavior.

[0049] 2. By combining the SHA-256 hash value of the file blocks with a user-defined initial value, the initial state of the chaotic system is dynamically generated through a coupling mechanism. This design achieves a differential avalanche effect at the block level, enhancing the sensitivity and security of the key.

[0050] 3. A parallel encryption process based on byte Gray code bit-plane diffusion and multi-round dual XOR feedback not only significantly improves statistical randomness (information entropy approaches the theoretical maximum value), but also meets the high throughput requirements of parallel encryption of large-scale archives.

[0051] 4. This method outperforms low-dimensional dissipative chaotic systems and traditional encryption algorithms in terms of randomness index, resistance to differential analysis, resistance to replay attacks, and resistance to parallel reconstruction. It is suitable for real-time archive encryption and large-scale distributed archive security protection systems. Attached Figure Description

[0052] The accompanying drawings, which form part of this application, are used to provide a further understanding of this application. The illustrative embodiments of this application and their descriptions are used to explain this application and do not constitute an undue limitation of this application.

[0053] Figure 1 Flowchart of an archive encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system;

[0054] Figure 2 Initial value sensitivity analysis diagram for a six-dimensional multi-scroll conservative hyperchaotic system;

[0055] Figure 3 Lyapunov exponent plot and bifurcation plot of a six-dimensional multi-scroll conservative hyperchaotic system with respect to parameter a;

[0056] Figure 4 Lyapunov exponent plot and bifurcation plot of a six-dimensional multi-scroll conservative hyperchaotic system with respect to parameter Π6;

[0057] Figure 5 A Poincaré cross-section of a six-dimensional multi-scroll conservative hyperchaotic system;

[0058] Figure 6 The three-dimensional phase diagram of a six-dimensional multi-scroll conservative hyperchaotic system on x1-x2-x3;

[0059] Figure 7 Two-dimensional phase diagrams of a six-dimensional multi-scroll conservative hyperchaotic system on different planes;

[0060] Figure 8 This is a flowchart illustrating the overall process of encrypting archives.

[0061] Figure 9 A flowchart for Gray code bit plane segmentation. Detailed Implementation

[0062] The present disclosure will be further described below with reference to the accompanying drawings and embodiments.

[0063] It should be noted that the following detailed descriptions are illustrative and intended to provide further explanation of this application. Unless otherwise specified, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application pertains.

[0064] It should be noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the exemplary embodiments according to this application. As used herein, the singular form is intended to include the plural form as well, unless the context clearly indicates otherwise. Furthermore, it should be understood that when the terms "comprising" and / or "including" are used in this specification, they indicate the presence of features, steps, operations, devices, components, and / or combinations thereof.

[0065] It should be noted that the flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of methods and systems according to various embodiments of this disclosure. It should be noted that each block in a flowchart or block diagram may represent a module, segment, or portion of code, which may include one or more executable instructions for implementing the logical functions specified in the various embodiments. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than that shown in the drawings. For example, two consecutively represented blocks may actually be executed substantially in parallel, or they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the flowcharts and / or block diagrams, and combinations of blocks in the flowcharts and / or block diagrams, may be implemented using a dedicated hardware-based system that performs the specified functions or operations, or using a combination of dedicated hardware and computer instructions.

[0066] Example 1:

[0067] like Figure 1 As shown, this embodiment provides a file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system, including the following steps:

[0068] Step 1: Construct a six-dimensional multi-scroll conservative hyperchaotic system;

[0069] Specifically, a six-dimensional Hamiltonian conservative hyperchaotic system with two or more positive Lyapunov exponents, energy conservation properties, and a multistable orbital structure is used to provide a highly complex and initial-condition-sensitive dynamic basis for subsequent keystream generation; its mathematical model is shown in the following equation:

[0070] Where x i For system variables, Π i 'a' represents system parameters;

[0071] Introduce nonlinear terms into the x1 and x2 components of the gradient vector. l represents the parameter controlling the number and position of the scrolls. This nonlinear construction enhances the helical torque and multi-steady-state switching mechanism, increases the system's chaos, makes the system more unpredictable, and generates complex scrolling phenomena, i.e., the system's trajectory forms a helical structure in the state space. The system possesses multi-scroll attractor properties, and by appropriately selecting parameters, high-dimensional hyperchaotic behavior can be generated to enhance the randomness and encryption strength of the sequence;

[0072] Taking parameters [Π1,Π2,Π3,Π4,Π5,Π6,a] = [15,9,6,3,12,2,2], and setting the initial conditions to [111111] and [111111+1e-15] respectively, and setting the sampling time to 0.05, we obtain several chaotic sequences within the time range t∈[0,50] as follows: Figure 2 As shown, the system exhibits significant dynamic differences with small changes in the initial state, indicating that the system is highly sensitive to initial conditions. The system parameters are set to [Π1,Π2,Π3,Π4,Π5,Π6,a]=[15,9,6,3,12,2,2] by default, and the initial value is set to [x...]. 10 ,x 20 ,x 30 ,x 40 ,x 50 ,x 60 ] = [1,1,1,1,1,1], l1 = 3, l2 = 3. From Figure 3As can be seen, the system has at least two positive Lyapunov exponents, and the sum of the Lyapunov exponents is always zero, proving that the system is hyperchaotic and conservative. The bifurcation diagram shows that when other initial parameters remain constant and parameter 'a' changes, the bifurcation diagram is symmetric about the zero point, and the system's motion state is basically chaotic or hyperchaotic except at the zero point. This is also confirmed by the Lyapunov exponent diagram.

[0073] Set the system parameters to [Π1,Π2,Π3,Π4,Π5,Π6] = [15,9,6,3,12,Π6], with an initial value of [x]. 10 ,x 20 ,x 30 ,x 40 ,x 50 ,x 60 ] = [1,1,1,1,1,1], where Π6 varies in the range [0,10]. The bifurcation diagram and Lyapunov exponent spectrum of the system with respect to the state parameter Π6 can be seen as follows: Figure 4 As can be seen, within a wide parameter range, the system consistently possesses two or more positive Lyapunov exponents, and its bifurcation graph exhibits good ergodicity. This implies that the system can maintain a hyperchaotic state throughout the wide parameter range. Based on the set initial parameters, the Poincaré section of the partial plane at x4 = 0 is shown below. Figure 5 As shown, the Poincaré cross-section of the system contains a large number of dense points, almost filling the entire phase space, and there are no stable straight lines or closed loops in the cross-section. This proves that under the given parameters, the system is in a chaotic or hyperchaotic state, and the system has strong complexity and randomness. From Figure 6 and Figure 7 As can be seen from the phase trajectory diagrams on different dimensions and planes, the system's motion trajectory has a high degree of ergodicity, and under specific parameters, the system's phase trajectory diagram exhibits a multi-scroll phenomenon.

[0074] Step 2: Convert the file text to be encrypted into a byte sequence and process it into groups;

[0075] Specifically, the file text to be encrypted is converted into a byte sequence according to UTF-8 or ASCII encoding, and the resulting byte sequence is divided into multiple groups of 128 bytes each. For the last group that is less than 128 bytes, PKCS#7 is used to pad it to a fixed length to ensure that all groups have the same length, thus meeting the requirements of stability and parallelism of the encryption structure.

[0076] according to Figure 8As shown, the text "Hello World!" to be encrypted is grouped and padded. Using UTF-8 encoding, a 12-byte sequence is obtained: 48656C 6C 6F 20576F 726C 6421. The original text is 12 bytes, which is less than 128 bytes. The last group is padded to 128 bytes using PKCS#7. The padded content is 116 bytes, and each padded value is 0x74.

[0077] Step 3: Obtain the hash value of each text block after grouping, and linearly mix the initial vector input by the user with the normalized hash value to generate the system key Key;

[0078] The SHA-256 hash function is used to calculate the hash value of the text block of the file to be encrypted, resulting in a hash string HK of 64 hexadecimal characters. Only the first 60 characters are used, and characters at positions 61-64 can be discarded. HK is divided into 6 parts. For the 10 hexadecimal characters in each part, each character is converted to an integer from 0 to 15 and then summed. After normalization, the hash coefficients hk1, hk2, hk3, hk4, hk5, hk6 are obtained. The initial vector (p1, p2, ..., p6) input by the user is linearly mixed with the normalized hash values ​​to obtain the initial state of the six-dimensional system, i.e., the system key Key.

[0079] Calculate the SHA-256 hash of the above 128 bytes, take the first 60 characters, HK = "3D7A1C8E2F619C4D075BFAD0E114BA235F49C27092A3D1825670E7ADABCDF5E1", divide HK into 6 segments, each segment containing 10 hexadecimal characters, convert them to integers, sum them, and then normalize them:

[0080]

[0081] The hex2dec(·) function maps a single hexadecimal character to an integer between 0 and 15.

[0082] The normalized hash coefficients were calculated to be hk1 = 0.208, hk2 = 0.149, hk3 = 0.173, hk4 = 0.129, hk5 = 0.129, and hk6 = 0.212. The initial user input vector was set to (p1, p2, ..., p6) = (0.1, 0.5, 0.8, 1.2, 0.3, 0.7). This vector was linearly mixed with the normalized hash values ​​to obtain the system key as follows: (x 1,0 ,x 2,0 ,x 3,0 ,x 4,0 ,x 5,0 ,x 6,0= (0.308, 0.649, 0.973, 1.329, 0.429, 0.912).

[0083] Step 4: Using the system key Key as the initial value for the six-dimensional multi-scroll conservative hyperchaotic system, initialize the chaotic system and iteratively generate chaotic sequences X, Y, Z, U, V, and W. Quantize sequence X into integers from 0 to 127, and sort sequence X in ascending order to obtain the scrambled index sequence X1. The text block length is L = 128, and the value range of X1 is 0 to (L-1) = 0 to 127. Quantize sequences Y, Z, U, V, and W into integer sequences Y1, A1, U1, V1, and W1 from 0 to 255 for byte-level diffusion. Each sequence is represented as follows:

[0084]

[0085] Step 5: Flatten the text block into a 1×L byte sequence P, rearrange the byte order according to the scrambling index sequence X1 to obtain the scrambling result P1; perform Gray code conversion on each byte in the scrambling result P1 and then perform an XOR operation to reassemble it into a byte sequence P2;

[0086] Specifically, let the scrambled index sequence generated by the chaos be X1 = [3, 0, 7, 2, 4, ...], and the original plaintext byte sequence be: P = [0x48, 0x65, 0x6C, 0x6C, 0x6F, 0x20, 0x57, 0x6F, 0x72, 0x6C, 0x64, 0x21, ... padding]. After scrambling: P1[0] = P[X1[0]] = P[3] = 0x6C. Convert the byte 0x6C to binary as 01101100, and then perform Gray code conversion to obtain the Gray code byte 01011010. Then decompose the Gray code byte into 8 bits, which are respectively used as the i-th bit of the current byte in bit planes S1 to S8, where S1 to S8 = [0, 1, 0, 1, 1, 0, 1, 0]. Figure 9 As shown. S1 to S8 are respectively associated with chaotic sequences Y1, Z1, U1, V1, W1, and their combinations. XOR the bits to generate the diffused bit planes D1 to D8:

[0087]

[0088] Merge D1 to D8 bitwise to restore them to 8-bit binary bytes, and reassemble them into byte sequence P2:

[0089] P2(i)=Bin2Dec(D1(i),D2(i),…,D8(i))i=0,1,…,L-1.

[0090] Use the output of the previous round as the initial vector for the next round, and perform at least two rounds of the above-mentioned scrambling, Gray code bit-plane spread, and global XOR operations.

[0091] Step 6: Perform a byte-by-byte XOR operation on the byte sequence P2 and the chaotic sequence X1 to generate a temporary ciphertext stream; concatenate the temporary ciphertext streams of each group in their original order to form a complete ciphertext byte stream; output the ciphertext byte stream in a unified encoding format as the final encryption result. This operation not only introduces chaotic indexing into the ciphertext, but also achieves feedback diffusion through cumulative XOR with the previous position, enhancing the correlation between bits and the anti-attack performance.

[0092] Specifically, the obtained byte ciphertext is converted into Base64 encoding to obtain the final encryption result; when the input plaintext is "Hello World!", the final Base64 ciphertext form is C=SGVsbG8gV29ybGQh....

[0093] This invention ensures high security while also taking into account processing efficiency, and is suitable for data encryption and security protection in scenarios such as electronic archives, government information, and important documents.

[0094] Example 2:

[0095] This embodiment provides an archive encryption system based on a six-dimensional multi-scroll conservative hyperchaotic system, including:

[0096] The system establishes a module to construct a six-dimensional multi-scroll conservative hyperchaotic system;

[0097] The preprocessing module converts the archive text to be encrypted into a byte sequence and performs grouping processing.

[0098] The key generation module obtains the hash value of each text block after grouping, and linearly mixes the initial vector input by the user with the normalized hash value to generate the system key Key;

[0099] The quantization module uses the system key Key as the initial value of the six-dimensional multi-scroll conservative hyperchaotic system, initializes the chaotic system and iteratively generates chaotic sequences X, Y, Z, U, V, W, sorts sequence X in ascending order to obtain scrambled index sequence X1, and quantizes sequences Y, Z, U, V, W into integer sequences Y1, Z1, U1, V1, W1 for byte-level diffusion.

[0100] The scrambling module flattens the text block, rearranges the byte order according to the scrambling index sequence X1, and obtains the scrambling result P1. After Gray code conversion of each byte in the scrambling result P1, an XOR operation is performed to reassemble it into the byte sequence P2.

[0101] The encryption module performs a byte-by-byte XOR operation on the byte sequence P2 and the chaotic sequence X1 to generate a temporary ciphertext stream; it then concatenates the temporary ciphertext streams of each group in their original order to form a complete ciphertext byte stream; finally, it outputs the ciphertext byte stream in a unified encoding format as the final encryption result.

[0102] Example 3:

[0103] An electronic device includes a memory, a processor, and a computer program stored in the memory and running thereon. When the processor executes the program, it implements the aforementioned file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system, comprising:

[0104] Constructing a six-dimensional multi-scroll conservative hyperchaotic system;

[0105] The file text to be encrypted is converted into a byte sequence and then processed into groups;

[0106] Obtain the hash value of each text block after grouping, and linearly mix the initial vector input by the user with the normalized hash value to generate the system key Key;

[0107] The system key Key is used as the initial value of the six-dimensional multi-scroll conservative hyperchaotic system. The chaotic system is initialized and chaotic sequences X, Y, Z, U, V, W are generated iteratively. Sequence X is sorted in ascending order to obtain the scrambled index sequence X1. Sequences Y, Z, U, V, W are quantized into integer sequences Y1, Z1, U1, V1, W1 for byte-level diffusion.

[0108] Flatten the text block and rearrange the byte order according to the scrambling index sequence X1 to obtain the scrambling result P1; perform Gray code conversion on each byte in the scrambling result P1 and then perform an XOR operation to reassemble it into the byte sequence P2;

[0109] Perform a byte-by-byte XOR operation on the byte sequence P2 and the chaotic sequence X1 to generate a temporary ciphertext stream; concatenate the temporary ciphertext streams of each group in the original order to form a complete ciphertext byte stream; output the ciphertext byte stream in a unified encoding format as the final encryption result.

[0110] Example 4:

[0111] A computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the aforementioned file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system, comprising:

[0112] Constructing a six-dimensional multi-scroll conservative hyperchaotic system;

[0113] The file text to be encrypted is converted into a byte sequence and then processed into groups;

[0114] Obtain the hash value of each text block after grouping, and linearly mix the initial vector input by the user with the normalized hash value to generate the system key Key;

[0115] The system key Key is used as the initial value of the six-dimensional multi-scroll conservative hyperchaotic system. The chaotic system is initialized and chaotic sequences X, Y, Z, U, V, W are generated iteratively. Sequence X is sorted in ascending order to obtain the scrambled index sequence X1. Sequences Y, Z, U, V, W are quantized into integer sequences Y1, Z1, U1, V1, W1 for byte-level diffusion.

[0116] Flatten the text block and rearrange the byte order according to the scrambling index sequence X1 to obtain the scrambling result P1; perform Gray code conversion on each byte in the scrambling result P1 and then perform an XOR operation to reassemble it into the byte sequence P2;

[0117] Perform a byte-by-byte XOR operation on the byte sequence P2 and the chaotic sequence X1 to generate a temporary ciphertext stream; concatenate the temporary ciphertext streams of each group in the original order to form a complete ciphertext byte stream; output the ciphertext byte stream in a unified encoding format as the final encryption result.

[0118] Those skilled in the art will understand that the modules or steps described above can be implemented using general-purpose computer devices. Optionally, they can be implemented using computer-executable program code, which can then be stored in a storage device for execution by a computer device. Alternatively, they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. This disclosure is not limited to any particular combination of hardware and software.

[0119] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.

[0120] While the specific embodiments of this disclosure have been described above in conjunction with the accompanying drawings, this is not intended to limit the scope of protection of this disclosure. Those skilled in the art should understand that various modifications or variations that can be made by those skilled in the art without creative effort based on the technical solutions of this disclosure are still within the scope of protection of this disclosure.

Claims

1. A method for encrypting archives based on a six-dimensional multi-scroll conservative hyperchaotic system, characterized in that, Includes the following steps: Constructing a six-dimensional multi-scroll conservative hyperchaotic system; The file text to be encrypted is converted into a byte sequence and then processed into groups; Obtain the hash value of each text block after grouping, and linearly mix the initial vector input by the user with the normalized hash value to generate the system key Key; The system key Key is used as the initial value of the six-dimensional multi-scroll conservative hyperchaotic system. The chaotic system is initialized and chaotic sequences X, Y, Z, U, V, W are generated iteratively. Sequence X is sorted in ascending order to obtain the scrambled index sequence X1. Sequences Y, Z, U, V, W are quantized into integer sequences Y1, Z1, U1, V1, W1 for byte-level diffusion. Flatten the text block and rearrange the byte order according to the scrambling index sequence X1 to obtain the scrambling result P1; perform Gray code conversion on each byte in the scrambling result P1 and then perform an XOR operation to reassemble it into the byte sequence P2; Perform a byte-by-byte XOR operation on the byte sequence P2 and the chaotic sequence X1 to generate a temporary ciphertext stream; concatenate the temporary ciphertext streams of each group in the original order to form a complete ciphertext byte stream; output the ciphertext byte stream in a unified encoding format as the final encryption result.

2. The file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system according to claim 1, characterized in that, The mathematical model of the six-dimensional multi-scroll conservative hyperchaotic system is as follows: Where x i For system variables, Π i Let 'a' be a system parameter; introduce nonlinear terms into the x1 and x2 components of the gradient vector. l is a parameter that controls the number and position of the reels.

3. The file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system according to claim 1, characterized in that, The hash value normalization method is as follows: Where hex2dec(·) represents mapping a single hexadecimal character to an integer between 0 and 15, and the normalized result is hk. k Given the region ∈(0,1), let the initial vector input by the user be (p1,p2,…,p6). Linearly mix this vector with the normalized hash value to obtain the system key Key. x k,0 =p k +hk k ,k=1,2,…,6 Ultimately, with (x) 1,0 ,x 2,0 ,…,x 6,0 ) is used as the initial value for a six-dimensional multi-scroll conservative hyperchaotic system.

4. The file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system according to claim 1, characterized in that, The Gray code conversion method is as follows: Where B is the original byte and G is the converted Gray code byte; each Gray code byte G is decomposed into 8 bit planes, forming 8 binary sequences S1 to S8 of length L, specifically: Where G(i) is the Gray code value of the i-th byte, S k (i) represents the gray code of the 7th to 0th bit of the i-th byte, k=1 corresponds to the 7th bit, and k=8 corresponds to the 0th bit.

5. The file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system according to claim 4, characterized in that, The binary sequences S1 to S8 are bitwise XORed with the chaotic sequences and their combinations to generate the diffused bit planes D1 to D8, specifically: D1 = S1⊕Y1, D2=S2⊕Z1, D3=s3⊕U1, D4 = S4⊕V1, D5 = S5⊕W1, D6 = S6⊕(Y1⊕Z1), D7=S7⊕(Z1⊕U1), D8 = S8⊕(U1⊕V1⊕W1), Where ⊕ represents bitwise XOR, and all sequences have a length of L; Merge D1 to D8 bitwise to restore them to their byte values, and reassemble them into byte sequence P2: P2(i)=Bin2Dec(D1(i),D2(i),…,D8(i))i=0,1,…,L-1.

6. The file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system according to claim 1, characterized in that, Performing a byte-by-byte XOR operation between the byte sequence P2 and the chaotic sequence X1 yields the temporary ciphertext stream as follows: C0=P2(0)⊕X1(0), C j =P2(j)⊕X1(j)⊕C j-1 ,j=1,…,L-1。 7. The file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system according to claim 1, characterized in that, The ciphertext byte stream E is output in a uniform encoding format, including converting each ciphertext byte into its corresponding two-digit hexadecimal representation and concatenating them into a string, specifically: C = [hex(E(0)), hex(E(1)), ...] Alternatively, the ciphertext bytes can be encoded into a Base64 string, specifically: C = Base64Encode(e).

8. An archive encryption system based on a six-dimensional multi-scroll conservative hyperchaotic system, characterized in that, include: The system establishes a module to construct a six-dimensional multi-scroll conservative hyperchaotic system; The preprocessing module converts the archive text to be encrypted into a byte sequence and performs grouping processing. The key generation module obtains the hash value of each text block after grouping, and linearly mixes the initial vector input by the user with the normalized hash value to generate the system key Key; The quantization module uses the system key Key as the initial value of the six-dimensional multi-scroll conservative hyperchaotic system, initializes the chaotic system and iteratively generates chaotic sequences X, Y, Z, U, V, W, sorts sequence X in ascending order to obtain scrambled index sequence X1, and quantizes sequences Y, Z, U, V, W into integer sequences Y1, Z1, U1, V1, W1 for byte-level diffusion. The scrambling module flattens the text block, rearranges the byte order according to the scrambling index sequence X1, and obtains the scrambling result P1. After Gray code conversion of each byte in the scrambling result P1, an XOR operation is performed to reassemble it into the byte sequence P2. The encryption module performs a byte-by-byte XOR operation on the byte sequence P2 and the chaotic sequence X1 to generate a temporary ciphertext stream; it then concatenates the temporary ciphertext streams of each group in their original order to form a complete ciphertext byte stream; finally, it outputs the ciphertext byte stream in a unified encoding format as the final encryption result.

9. An electronic device, comprising a memory, a processor, and a computer program stored in the memory and running thereon, characterized in that, When the processor executes the program, it implements the file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system as described in any one of claims 1-7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the program implements the file encryption method based on a six-dimensional multi-scroll conservative hyperchaotic system as described in any one of claims 1-7.

Images