Information compression and encryption method based on water ripple model

Abstract

The invention relates to an information compression and encryption method based on a water ripple model. The method comprises the following steps: step 1, inputting a plaintext; 2, constructing a water ripple model encryption algorithm; step 3, using the water ripple model algorithm constructed in the step 2 to complete information encryption, and outputting a ciphertext; step 4, inputting a ciphertext; step 5, constructing a decryption algorithm; and step 6, completing information decryption by using the decryption algorithm constructed in the step 5. According to the method, the compression ratio is improved, the data storage and transmission overhead is reduced, the encryption strength is enhanced, and the information security is guaranteed.

Description

Technical Field

[0001] The present invention belongs to the field of information communication technology and relates to an information compression encryption method, in particular to an information compression encryption method based on a water ripple model. Background Art

[0002] With the rapid development of information technology, the amount of data has exploded, and the demand for information compression and encryption has become increasingly urgent. Traditional information compression and encryption algorithms have problems such as low compression rate and insufficient encryption strength, which makes it difficult to meet the growing application needs.

[0003] Therefore, there is an urgent need to develop an efficient and secure information compression and encryption method.

[0004] After searching, no public documents of the prior art identical or similar to the present invention were found. Summary of the invention

[0005] The purpose of the present invention is to overcome the shortcomings of the prior art and propose an information compression encryption method based on a water ripple model, which not only improves the compression rate and reduces data storage and transmission overhead, but also enhances the encryption strength and ensures information security.

[0006] The present invention solves the practical problem by adopting the following technical solutions:

[0007] An information compression encryption method based on a water ripple model comprises the following steps:

[0008] Step 1: Enter plain text;

[0009] Step 2: Construct water ripple model encryption algorithm

[0010] Step 3: Use the water ripple model algorithm constructed in step 2 to complete information encryption and output ciphertext;

[0011] Step 4: Enter the ciphertext;

[0012] Step 5: Construct a decryption algorithm;

[0013] Step 6: Use the decryption algorithm constructed in step 5 to complete the information decryption.

[0014] Moreover, the specific method of step 1 is:

[0015] Construct an 8×8 matrix, with all the matrix initially set to 0 to simulate a calm water surface; perform initial assignments at some positions in the matrix to simulate water drops dropping onto the calm water surface.

[0016] At this time, t = 0, and the initial value is the plain text;

[0017] The relevant parameters involved are: input coordinate A0, input coordinate B0, input initial values ​​A and B.

[0018] Moreover, the specific method of step 2 is:

[0019] In the 8×8 matrix, an algorithm is written to simulate the transmission of water ripples, and a water ripple model is constructed to simulate the fluctuation of the water surface after a water drop is dropped into the calm water surface. The algorithm logic is:

[0020] When t=0, there are multiple initial positions. Taking the initial positions A0 and B0 as examples, the value of the initial position A0 is calculated by +A (A is the initial value of the initial position A0) and then assigned to the position A0. The value of the initial position B0 is calculated by +B (B is the initial value of the initial position B0) and then assigned to the position B0. After the value assignment operations of each position are completed in sequence, the t count increases by 1, and the absolute values ​​of A and B decrease by d.

[0021] When t=1, in the matrix that has completed the assignment, take the value of position A1, perform +A calculation, and assign it to position A1. The distance between A1 and A0 is t*c (tolerance 0.5). Take the value of position B1, perform +B calculation, and assign it to position B1. The distance between B1 and B0 is t*c (tolerance 0.5). After completing the value assignment of other positions in turn, the t count increases by 1, and the absolute values ​​of A and B decrease by d. Repeat this process until t is greater than or equal to e and the assignment is completed.

[0022] The relevant parameters involved are: propagation time t, propagation distance c per t time, amplitude attenuation d per t time, maximum propagation time e, and input initial values ​​A and B. Parameters t, c, d, and e are keys, and different values ​​will result in different encryption results.

[0023] Moreover, the specific method of step 4 is:

[0024] The output of step 3 of the encryption process is the ciphertext, which serves as the initial input value of the decryption process.

[0025] Moreover, the specific method of step 5 is:

[0026] At this time, the key's propagation distance per time t c, the amplitude decay per time t d, the maximum propagation time e, and the ciphertext matrix m are known;

[0027] In the ciphertext matrix m, select the point with the largest amplitude value and the difference with the adjacent point d, simulate it according to the key parameters, compare the simulation result with the ciphertext matrix, and record the coordinates B0 and amplitude B of the selected point.

[0028] Moreover, the specific method of step 6 is:

[0029] Continue to judge and compare the initial decryption result according to the above operation until the result is an 8×8 zero matrix. At this time, the recorded input coordinates A0 and B0, and the input initial values ​​A and B are the decryption results.

[0030] Advantages and beneficial effects of the present invention:

[0031] 1. The present invention proposes an information compression and encryption method based on a water ripple model. By simulating the propagation characteristics of water ripples and constructing a fitting model, efficient information compression and encryption are achieved. The present invention not only improves the compression rate and reduces the data storage and transmission overhead, but also enhances the encryption strength and ensures information security. The present invention can be widely used in cloud storage, network communication, big data processing and other fields, and has good market application prospects.

[0032] 2. The present invention adopts a symmetric encryption algorithm based on fitting ideas, and has the functions of information data encryption and compression. The basic public encryption algorithm has variable parameters such as propagation time, speed, and amplitude decreasing trend as a public key. The input position and input amplitude are transmitted as plain text. Different parameter settings of propagation time, speed, input amplitude, and amplitude decreasing trend constitute different private keys to encrypt and decrypt the plain text. The algorithm simulates the transmission phenomenon of water ripples in nature and has certain practicality and scalability. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Figure 1 is a process flow chart of the present invention;

[0034] Figure 2 It is a schematic diagram of plain text input of the present invention;

[0035] Figure 3 It is a schematic diagram of the encryption of the water ripple model of the present invention;

[0036] Figure 4 This is a schematic diagram of the encrypted result of the water ripple model of the present invention;

[0037] Figure 5 This is the initial decryption result diagram of the present invention. DETAILED DESCRIPTION

[0038] The embodiments of the present invention are further described in detail below with reference to the accompanying drawings:

[0039] A method for information compression and encryption based on a water ripple model, such as Figure 1 As shown, the following steps are included:

[0040] Phase 1: Encryption process:

[0041] Step 1: Enter plain text

[0042] The specific method of step 1 is:

[0043] Construct an 8×8 matrix, with all the matrix initially set to 0 to simulate a calm water surface; perform initial assignments at some positions in the matrix to simulate water drops dropping onto the calm water surface.

[0044] At this time, t = 0, and the initial value is the plain text; Figure 2 shown.

[0045] The relevant parameters involved are: input coordinate A0, input coordinate B0, input initial values ​​A and B.

[0046] Step 2: Build a water ripple model algorithm

[0047] The specific method of step 2 is:

[0048] exist Figure 2 In the 8×8 matrix, an algorithm is written to simulate the transmission of water ripples, and a water ripple model is constructed to simulate the fluctuation of the water surface after a water drop is dropped into the calm water surface. The algorithm logic is:

[0049] When t=0, there are multiple initial positions. Taking the initial positions A0 and B0 as examples, the value of the initial position A0 is calculated by +A (A is the initial value of the initial position A0) and then assigned to the position A0. The value of the initial position B0 is calculated by +B (B is the initial value of the initial position B0) and then assigned to the position B0. After the value assignment operations of each position are completed in sequence, the t count increases by 1, and the absolute values ​​of A and B decrease by d.

[0050] When t=1, in the matrix that has completed the assignment, take the value of position A1, perform +A calculation, and assign it to position A1. The distance between A1 and A0 is t*c (tolerance 0.5). Take the value of position B1, perform +B calculation, and assign it to position B1. The distance between B1 and B0 is t*c (tolerance 0.5). After completing the value assignment of other positions in turn, the t count increases by 1, and the absolute values ​​of A and B decrease by d. Repeat this process until t is greater than or equal to e and the assignment is completed.

[0051] The relevant parameters involved are: propagation time t, propagation distance c per t time, amplitude attenuation d per t time, maximum propagation time e, and input initial values ​​A and B. Parameters t, c, d, and e are keys, and different values ​​will result in different encryption results.

[0052] In this embodiment, the key algorithm is:

[0053]

[0054]

[0055] Step 3: Use the water ripple model algorithm constructed in step 2 to complete information encryption and output ciphertext; Figure 4 shown.

[0056] Phase 2: Decryption process:

[0057] Step 4: Enter the ciphertext

[0058] The output of step 3 of the encryption process is the ciphertext, which serves as the initial input value of the decryption process.

[0059] Step 5: Build a decryption algorithm

[0060] The specific method of step 5 is:

[0061] At this time, the key's propagation distance per time t c, the amplitude decay per time t d, the maximum propagation time e, and the ciphertext matrix m are known;

[0062] In the ciphertext matrix m, select the point with the largest amplitude value and the difference between the adjacent points is d, simulate according to the key parameters, and compare the simulation results with the ciphertext matrix. The results are as follows Figure 5 As shown, the selected point coordinates B0 and amplitude B are recorded.

[0063] In this embodiment, the key algorithm is:

[0064]

[0065]

[0066] Step 6: Use the decryption algorithm constructed in step 5 to complete the information decryption.

[0067] The specific method of step 6 is:

[0068] Continue to judge and compare the initial decryption result according to the above operation until the result is an 8×8 zero matrix. At this time, the recorded input coordinates A0 and B0, and the input initial values ​​A and B are the decryption results.

[0069] The innovation of the present invention lies in:

[0070] The present invention is based on the water ripple propagation model and can effectively improve the information compression rate and encryption strength. The specific innovations are as follows:

[0071] High compression rate: By mapping information data to the wave source parameters of the water ripple model and encoding it using the ripple propagation characteristics, efficient information compression can be achieved. Compared with traditional compression algorithms, this method can further improve the compression rate.

[0072] Strong encryption: By utilizing the chaotic characteristics of the water ripple model and the sensitivity of initial parameters, the generated compression code also has strong encryption properties. It is difficult for unauthorized third parties to recover the original information from the code, thus ensuring information security.

[0073] Low computational overhead: Thanks to the simplicity of the water ripple model, the compression encryption algorithm has low computational complexity and is easy to implement in hardware. The encoding and decoding process is fast and efficient, meeting the needs of real-time applications.

[0074] Strong robustness: The coding based on the ripple propagation model is highly resistant to channel noise. Even if the encoded data is damaged to a certain extent, the original information can still be correctly restored, and the transmission quality is guaranteed.

[0075] Wide range of applications: This compression encryption algorithm can be widely used in various information forms such as text, images, audio and video, meeting the needs of data compression and secure transmission in different scenarios, and has broad application prospects.

[0076] To sum up, the information compression encryption algorithm based on the water ripple model proposed in the present invention can achieve efficient compression of information while ensuring information security. It has the advantages of high compression rate, high encryption strength, low computational overhead, and good robustness. It is of great significance to improving information transmission and storage efficiency, and has huge market application value.

[0077] It should be emphasized that the embodiments of the present invention are illustrative rather than restrictive. Therefore, the present invention includes but is not limited to the embodiments described in the specific implementation modes. Any other implementation modes derived by those skilled in the art based on the technical solutions of the present invention also fall within the scope of protection of the present invention.

Claims

1. An information compression and encryption method based on a water ripple model, characterized in that: The following steps are involved: Step 1: Enter plain text; Step 2: Construct water ripple model encryption algorithm Step 3: Use the water ripple model algorithm constructed in step 2 to complete information encryption and output ciphertext; Step 4: Enter the ciphertext; Step 5: Construct a decryption algorithm; Step 6: Use the decryption algorithm constructed in step 5 to complete the information decryption.

2. The information compression and encryption method based on the water ripple model according to claim 1 is characterized in that: The specific method of step 1 is: Construct an 8×8 matrix, with all the matrix initially set to 0 to simulate a calm water surface; assign initial values ​​to some positions in the matrix to simulate water drops dropping onto the calm water surface; At this time, t = 0, and the initial value is the plain text; The relevant parameters involved are: input coordinate A0, input coordinate B0, input initial values ​​A and B.

3. The information compression and encryption method based on the water ripple model according to claim 1 is characterized in that: The specific method of step 2 is: In the 8×8 matrix, an algorithm is written to simulate the transmission of water ripples, and a water ripple model is constructed to simulate the fluctuation of the water surface after a water drop is dropped into the calm water surface. The algorithm logic is: When t=0, there are multiple initial positions. Taking the initial positions A0 and B0 as examples, the value of the initial position A0 is calculated by +A (A is the initial value of the initial position A0) and then assigned to the position A0. The value of the initial position B0 is calculated by +B (B is the initial value of the initial position B0) and then assigned to the position B0. After the value assignment operations of each position are completed in sequence, the t count increases by 1, and the absolute values ​​of A and B decrease by d. When t=1, in the matrix that has completed the assignment, take the value of position A1, perform +A calculation, and assign it to position A1. The distance between A1 and A0 is t*c (tolerance 0.5). Take the value of position B1, perform +B calculation, and assign it to position B1. The distance between B1 and B0 is t*c (tolerance 0.5). After completing the assignment of values ​​at other positions in turn, the t count increases by 1, and the absolute values ​​of A and B decrease by d. Repeat this process until t is greater than or equal to e and the assignment ends; The relevant parameters involved are: propagation time t, propagation distance c per t time, amplitude attenuation d per t time, maximum propagation time e, and input initial values ​​A and B; parameters t, c, d, and e are keys, and different values ​​will have different encryption results.

4. The information compression and encryption method based on the water ripple model according to claim 1 is characterized in that: The specific method of step 4 is: The output of step 3 of the encryption process is the ciphertext, which serves as the initial input value of the decryption process.

5. The information compression and encryption method based on the water ripple model according to claim 1 is characterized in that: The specific method of step 5 is: At this time, the key's propagation distance per time t c, the amplitude decay per time t d, the maximum propagation time e, and the ciphertext matrix m are known; In the ciphertext matrix m, select the point with the largest amplitude value and the difference with the adjacent point d, simulate it according to the key parameters, compare the simulation result with the ciphertext matrix, and record the coordinates B0 and amplitude B of the selected point.

6. The information compression and encryption method based on the water ripple model according to claim 1 is characterized in that: The specific method of step 6 is: Continue to judge and compare the initial decryption result according to the above operation until the result is an 8×8 zero matrix. At this time, the recorded input coordinates A0 and B0, and the input initial values ​​A and B are the decryption results.

Images