An information compression and encryption method based on water ripple model

Abstract

This invention relates to an information compression and encryption method based on a water ripple model, comprising the following steps: Step 1, inputting plaintext; Step 2, constructing a water ripple model encryption algorithm; Step 3, using the water ripple model algorithm constructed in Step 2 to encrypt the information and output ciphertext; Step 4, inputting ciphertext; Step 5, constructing a decryption algorithm; Step 6, using the decryption algorithm constructed in Step 5 to decrypt the information. This invention not only improves the compression rate and reduces data storage and transmission overhead, but also enhances encryption strength and ensures information security.

Description

Technical Field

[0001] This invention belongs to the field of information and communication technology, and relates to an information compression and encryption method, particularly an information compression and encryption method based on a water ripple model. Background Technology

[0002] With the rapid development of information technology, the amount of data is growing explosively, making the demand for information compression and encryption increasingly urgent. Traditional information compression and encryption algorithms suffer from problems such as low compression rates and insufficient encryption strength, making 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] A search revealed no publicly available literature of the same or similar prior art as this invention. Summary of the Invention

[0005] The purpose of this invention is to overcome the shortcomings of the prior art and propose an information compression and 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 encryption strength and ensures information security.

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

[0007] A method for information compression and encryption based on a water ripple model includes the following steps:

[0008] Step 1: Input plaintext;

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

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

[0011] Step 4: Enter the ciphertext;

[0012] Step 5: Construct the decryption algorithm;

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

[0014] Furthermore, the specific method of step 1 is as follows:

[0015] Construct an 8×8 matrix, initially setting all values ​​to 0 to simulate a calm water surface; then assign initial values ​​to some positions within the matrix to simulate water droplets falling onto the calm water surface.

[0016] At this point, t = 0, and the initial value is the plaintext.

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

[0018] Furthermore, the specific method for step 2 is as follows:

[0019] In an 8×8 matrix, write an algorithm to simulate the propagation of water ripples, construct a water ripple model, and simulate the surface ripples after a water droplet is dropped onto a calm water surface. The algorithm logic is as follows:

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

[0021] When t=1, in the matrix that has already been assigned values, take the value at position A1, perform a +A calculation, and assign it to position A1. The distance between A1 and A0 is t*c (tolerance 0.5). Take the value at position B1, perform a +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 ​​for other positions in sequence, the t count is incremented by 1, and the absolute values ​​of A and B are decremented by d. This process is repeated until t is greater than or equal to e, at which point the assignment ends.

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

[0023] Furthermore, the specific method for step 4 is as follows:

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

[0025] Furthermore, the specific method for step 5 is as follows:

[0026] At this point, the propagation distance c per t time as the key, the amplitude decay d per t time, 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 between it and its adjacent points is d. Simulate the point according to the key parameters, compare the simulation results with the ciphertext matrix, and record the coordinates B0 and amplitude B of the selected point.

[0028] Furthermore, the specific method for step 6 is as follows:

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

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

[0031] 1. This invention proposes an information compression and encryption method based on a water ripple model. By simulating the propagation characteristics of water ripples, a fitting model is constructed to achieve efficient information compression and encryption. This invention not only improves the compression rate and reduces data storage and transmission overhead, but also enhances encryption strength and ensures information security. This invention can be widely applied in fields such as cloud storage, network communication, and big data processing, and has good market application prospects.

[0032] 2. This invention employs a symmetric encryption algorithm based on a fitting approach, which simultaneously possesses the functions of information data encryption and compression. The basic public encryption algorithm, as the public key, has variable parameters such as propagation time, speed, and amplitude decreasing trend. The input position and input amplitude are transmitted as plaintext. Different parameter settings for propagation time, speed, input amplitude, and amplitude decreasing trend form different private keys to encrypt and decrypt the plaintext. The algorithm simulates the propagation phenomenon of water ripples in nature and has certain practicality and scalability. Attached Figure Description

[0033] Figure 1 This is a flowchart of the processing of the present invention;

[0034] Figure 2 This is a schematic diagram of plaintext input for the present invention;

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

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

[0037] Figure 5 This is a diagram showing the initial decryption result of the present invention. Detailed Implementation

[0038] The embodiments of the present invention will be 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, it includes the following steps:

[0040] Phase 1: Encryption Process

[0041] Step 1: Input plaintext

[0042] The specific method for step 1 is as follows:

[0043] Construct an 8×8 matrix, initially setting all values ​​to 0 to simulate a calm water surface; then assign initial values ​​to some positions within the matrix to simulate water droplets falling onto the calm water surface.

[0044] At this point, t = 0, and the initial value is the plaintext; for example... Figure 2 As shown.

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

[0046] Step 2: Constructing the water ripple model algorithm

[0047] The specific method for step 2 is as follows:

[0048] exist Figure 2 In an 8×8 matrix, write an algorithm to simulate the propagation of water ripples, construct a water ripple model, and simulate the surface ripples after a water droplet is dropped onto a calm water surface. The algorithm logic is as follows:

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

[0050] When t=1, in the matrix that has already been assigned values, take the value at position A1, perform a +A calculation, and assign it to position A1. The distance between A1 and A0 is t*c (tolerance 0.5). Take the value at position B1, perform a +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 ​​for other positions in sequence, the t count is incremented by 1, and the absolute values ​​of A and B are decremented by d. This process is repeated until t is greater than or equal to e, at which point the assignment ends.

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

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

[0053]

[0054]

[0055] Step 3: Using the water ripple model algorithm constructed in Step 2, complete the information encryption and output the ciphertext; for example... Figure 4 As shown.

[0056] Phase Two: Decryption Process

[0057] Step 4: Enter the ciphertext

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

[0059] Step 5: Construct the decryption algorithm

[0060] The specific method for step 5 is as follows:

[0061] At this point, the propagation distance c per t time as the key, the amplitude decay d per t time, 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 a difference of d between it and its adjacent values. Perform a simulation according to the key parameters, and compare the simulation result with the ciphertext matrix. The result is as follows: Figure 5 As shown, the coordinates B0 and amplitude B of the selected point 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 for step 6 is as follows:

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

[0069] The innovation of this invention lies in:

[0070] This invention, based on a water ripple propagation model, can effectively improve information compression rate and encryption strength. Specific innovations are as follows:

[0071] High compression ratio: By mapping information data to the wave source parameters of a 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 ratio.

[0072] Strong encryption: Utilizing the chaotic characteristics and initial parameter sensitivity of the water ripple model, the generated compressed code possesses strong encryption properties. It is extremely 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, this compression encryption algorithm has low computational complexity and is easy to implement in hardware. The encoding and decoding processes are fast and efficient, meeting the needs of real-time applications.

[0074] High robustness: The coding based on the ripple propagation model has a strong resistance to channel noise. Even if the coded data is damaged to some extent, the original information can still be correctly recovered, and the transmission quality is guaranteed.

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

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

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

Claims

1. An information compression and encryption method based on a water ripple model, characterized in that: Includes the following steps: Step 1: Input plaintext; Step 2: Construct a water ripple model encryption algorithm Step 3: Using the water ripple model algorithm constructed in Step 2, complete the information encryption and output the ciphertext; Step 4: Enter the ciphertext; Step 5: Construct the decryption algorithm; Step 6: Use the decryption algorithm constructed in Step 5 to complete the information decryption; The specific method for step 2 is as follows: In an 8×8 matrix, write an algorithm to simulate the propagation of water ripples, construct a water ripple model, and simulate the surface ripples after a water droplet is dropped onto a calm water surface. The algorithm logic is as follows: When t=0, there are multiple initial positions. Taking initial positions A0 and B0 as examples, the value of initial position A0 is taken and calculated by adding A (A is the initial value of initial position A0) and then assigned to position a0. The value of initial position B0 is taken and calculated by adding B (B is the initial value of initial position B0) and then assigned to position B0. After the value taking and assignment operations of each position are completed in sequence, the t count is increased by 1, and the absolute values ​​of A and B are decreased by d. When t=1, in the matrix that has been assigned values, take the value at position A1, perform a +A calculation, and assign it to position A1. The distance between A1 and A0 is t*c (tolerance 0.5). Take the value at position B1, perform a +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 sequence, the t count is incremented by 1, and the absolute values ​​of A and B are decremented by d. This process is repeated until t is greater than or equal to e, at which point the assignment ends. The relevant parameters are: propagation time t, propagation distance c per t, amplitude decay d per t, maximum propagation time e, and initial input values ​​A and B; parameters t, c, d, and e are the keys, and different values ​​will result in different encryption results.

2. The information compression and encryption method based on a water ripple model according to claim 1, characterized in that: The specific method for step 1 is as follows: Construct an 8×8 matrix, initially setting all values ​​to 0 to simulate a calm water surface; then assign initial values ​​to some positions in the matrix to simulate water droplets falling onto the calm water surface. At this point, t = 0, and the initial value is the plaintext. The relevant parameters are: input coordinates A0, input coordinates B0, and input initial values ​​A and B.

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

4. The information compression and encryption method based on a water ripple model according to claim 1, characterized in that: The specific method for step 5 is as follows: At this point, the propagation distance c per t as the key, the amplitude decay d per t, 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 between it and its adjacent points is d. Simulate the point according to the key parameters, compare the simulation results with the ciphertext matrix, and record the coordinates B0 and amplitude B of the selected point.

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

Images