A cloud platform-based information security encryption method
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- SICHUAN WATER CONSERVANCY VOCATIONAL & TECH COLLEGE
- Filing Date
- 2026-04-14
- Publication Date
- 2026-06-23
Smart Images
Figure CN122027751B_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of information processing technology, and specifically relates to an information security encryption method based on a cloud platform. Background Technology
[0002] With the popularization of cloud computing technology, massive amounts of image data are stored, transmitted, and shared through cloud platforms, making the security and privacy protection of image information increasingly urgent. Image encryption, as a core technology to ensure the security of image data on cloud platforms, aims to obfuscate pixel values and diffusion feature distributions, making encrypted images unreadable by unauthorized individuals. Simultaneously, it ensures that legitimate users can decrypt the images without loss of quality using the key, and is suitable for practical application scenarios requiring batch processing, low computing power consumption, and high compatibility on cloud platforms.
[0003] Currently, existing image encryption technologies are mainly divided into three categories, but they all have obvious shortcomings in terms of security, cloud adaptability, or innovation, making it difficult to meet the high-level requirements of image encryption on cloud platforms:
[0004] 1. Traditional symmetric encryption technologies (such as AES and DES for image encryption): These technologies rely on manually set external seeds to generate keys, which poses a high risk of key reuse. Furthermore, the encryption process only performs global calculations on pixel values without considering the image's own visual features (brightness, texture, etc.), making it vulnerable to statistical and differential attacks. At the same time, the encryption computation is highly complex, which is not conducive to the computing power requirements of cloud platforms for batch processing of large numbers of images, resulting in low processing efficiency.
[0005] 2. Pixel scrambling-based encryption technology: Encryption is achieved by permuting pixel coordinates or binary bit order, but its scrambling rules are mostly global fixed patterns (such as fixed cyclic shift, random permutation matrix). The confusion and diffusion effect of a single scrambling operation is insufficient, the encryption strength is low, and attackers can restore the original image through pixel correlation analysis; moreover, the boundary pixel processing method is rough, which is prone to feature loss and affects the integrity of decryption.
[0006] 3. Cloud Platform Adapted Lightweight Encryption Technology: To adapt to the low computing power requirements of cloud platforms, this type of technology simplifies the encryption process. It often uses single-channel independent encryption and simple XOR operation to generate keys. However, it has two major problems: First, key generation depends on external parameters, and security depends on the confidentiality of the seed, which is prone to key leakage risk. Second, the channel independence is strong, and attackers can crack a single channel and reconstruct the image, resulting in weak security protection capabilities. Summary of the Invention
[0007] To address the above problems, this invention proposes an information security encryption method based on a cloud platform.
[0008] The technical solution of this invention is: an information security encryption method based on a cloud platform, comprising the following steps:
[0009] S1. Extract the channel values of the image to be encrypted and generate the final key for each channel for each pixel;
[0010] S2. Based on the final key of each channel of the pixel, perform permutation and obfuscation to obtain the value-level encrypted channel value of the pixel;
[0011] S3. Based on the value of the encryption channel of each pixel, perform iterative calculations to determine the joint key for each pixel;
[0012] S4. Based on the pixel's value-level encryption channel value and the joint key, perform cross-channel association to determine the pixel's secondary encryption channel value;
[0013] S5. Generate an RGB matrix based on the three secondary encryption channel values of the pixels to determine the encrypted image stored on the cloud platform.
[0014] The pixel values of the three channels are matched one-to-one according to their positions and combined into a three-dimensional matrix of M×N×3 (M is the number of rows in the image, N is the number of columns, and 3 represents the three RGB channels), forming a complete RGB pixel matrix. The RGB matrix is then encoded into an image format suitable for cloud storage.
[0015] Furthermore, S1 includes the following sub-steps:
[0016] S11. Mirror fill the edge pixels in the image to be encrypted and extract the 3×3 neighborhood of each pixel;
[0017] S12. Take the average value of each channel value in the 3×3 neighborhood of each pixel as the average value of each channel neighborhood, and take the standard deviation of each channel value in the 3×3 neighborhood of each pixel as the texture fluctuation value of each channel. The channel values include R channel value, G channel value and B channel value.
[0018] S13. Generate random numbers, and use the random numbers to map the mean value of each channel's neighborhood to the first key, and map the texture fluctuation value of each channel to the second key;
[0019] S14. Perform an XOR operation on the first key and the second key to generate the final key for each channel.
[0020] The beneficial effects of the above further scheme are as follows: In this invention, edge pixels are filled by mirroring. For example, the missing neighborhood of the top left pixel (1,1) is filled by mirroring (1,1), (1,2), and (2,1), ensuring that each pixel has a complete neighborhood. The neighborhood mean reflects the local brightness characteristics of the pixel's neighborhood, and the texture fluctuation value reflects the degree of texture fluctuation of the pixel's neighborhood. In S14, when performing XOR fusion, the computer's internal storage is an 8-bit binary number. Bitwise operations are performed, and the result is converted back to decimal. 0~255 corresponds exactly to the value range of 8-bit binary. Decimal 255 corresponds to binary 11111111, and decimal 0 corresponds to 00000000. The neighborhood features are mapped to subkeys, and random numbers are introduced to enhance nonlinearity. The two subkeys are XORed to generate the final pixel-level exclusive key.
[0021] Furthermore, in S13, pixels First key The expression is:
[0022] ;
[0023] in, Represents pixels The mean of the channel neighborhood, Represents the first random number. Represents the second random number. Rows representing pixels, Columns representing pixels;
[0024] In S13, pixels The second key The expression is:
[0025] ;
[0026] in, Represents pixels The channel texture fluctuation value, Represents the third random number. This represents the fourth random number.
[0027] The beneficial effect of the above further solution is that, in this invention, the result is compressed to 0-255, adapting to an 8-bit pixel range. Based on binary bit weights and the generation of random numbers, - For example, a prime number , , , This ensures that random numbers are driven by the image's own features, breaking the linear distribution of features and avoiding a skewed distribution of the key; prime coefficients enhance the nonlinearity and randomness of the mapping.
[0028] Furthermore, S2 includes the following sub-steps:
[0029] S21. Convert the final key and channel value of each pixel into binary;
[0030] S22. Take the lowest three bits of the final key for each channel and permutate the binary value of each channel;
[0031] S23. Convert the permutation result to decimal to obtain the bit-level encrypted channel value of the pixel;
[0032] S24. Based on the bit-level encryption channel value of the pixel, obfuscate the channel values of the pixel to obtain the value-level encryption channel value of the pixel.
[0033] The beneficial effect of the above further scheme is that, in this invention, in S21, the final key and the value of each channel should be converted into 8-bit binary. Assuming the final key... =142, binary 10001110, the lowest 3 bits are 110, so the permutation p=6. The red channel value of the pixel... Convert to 8-bit binary numbers b7, b6, ..., b0, where b7 is the most significant bit and b0 is the least significant bit.
[0034] The first round of encryption for a single channel employs a two-layer obfuscation system at both the bit and value levels. Bit-level scrambling disrupts the binary bit distribution characteristics of a pixel, making it impossible for attackers to reconstruct the data through bit statistical analysis. Value-level obfuscation makes changes in pixel values dependent on a dedicated key, achieving a one-pixel-one-key obfuscation effect.
[0035] Furthermore, in S21, the expression for permuting the binary values of each channel is as follows:
[0036] ;
[0037] in, This represents the highest bit after the permutation. This indicates the second highest digit after the permutation. This represents the least significant bit after the permutation. This represents the value of the lowest three bits corresponding to the final key.
[0038] The beneficial effect of the above further scheme is that, in this invention, p is the final key for each channel. The lowest 3 bits, ranging from 0 to 7, corresponding to the positions of the 8 bits, are used as offsets to cyclically shift the original bit sequence. This is to ensure that the calculated bit position is always between 0 and 7, and will not exceed the range of 8 bits, thus destroying the bit-level characteristics of the pixel.
[0039] Furthermore, S24 includes the following sub-steps:
[0040] S241. Multiply the bit-level encryption channel value of the pixel by the final key of each channel, and use it as the first non-linear operation factor;
[0041] S242, Use the difference between 255 and the final key of each channel of the pixel as the second non-linear operation factor;
[0042] S243. After adding the first nonlinear operation factor and the second nonlinear operation factor, perform a modulo operation with 256 to obtain the value-level encrypted channel value of the pixel.
[0043] The beneficial effects of the above-mentioned further solutions are: In this invention, nonlinear operations avoid the linear predictability of simple XOR, allowing pixel values to be deeply bound to the key, and changes in a single pixel will spread to the entire channel through nonlinear operations. Used to introduce a reverse offset, disrupting the pixel value distribution.
[0044] Furthermore, S3 includes the following sub-steps:
[0045] S31. Take the average of the three encrypted channel values of the pixel as the channel fusion average of the pixel;
[0046] S32. Take the standard deviation of the three-level encrypted channel values of the pixel and use it as the channel fusion texture value of the pixel.
[0047] S33. Extract the local entropy value of the pixel;
[0048] S34. Select an initial pixel, multiply the channel fusion mean, channel fusion texture fluctuation value and entropy value of the initial pixel, and then perform a modulo operation with 256 to obtain the initial iteration value.
[0049] S35. Based on the initial iteration value, iterate over the remaining pixels to determine the joint key for each pixel.
[0050] The beneficial effects of the above further solution are: In this invention, in S33, the local entropy value of the 3×3 neighborhood of the pixel is extracted. In S34, the top-left pixel (1,1) is selected as the initial pixel. Each pixel... Each pixel has its own fusion mean, fusion texture value, and fusion entropy value, so the joint key for each pixel is calculated independently.
[0051] The S34 modulo operation is used to compress the result to between 0 and 255, to meet the encryption requirements of 8-bit pixels.
[0052] Furthermore, in S34, the expression for iterating over the remaining pixels is:
[0053] ;
[0054] in, Indicates the first The joint key for each pixel Indicates the first The joint key for each pixel Represents the fifth random number. Represents the sixth random number. Represents the seventh random number. Indicates the first The channel fusion mean of each pixel Indicates the first The texture values of each pixel are fused together.
[0055] The beneficial effects of the above-mentioned further solutions are: In this invention, - For example, a prime number , , The formula "Previous key × prime coefficient + fusion feature × prime coefficient + offset + modulo operation" makes the joint key dependent on the local features of the three channels, increasing the key's resistance to attacks. The fusion features of the three channels after the first round of encryption are extracted to generate a cross-channel joint key stream. Adding 1 to the iterative formula ensures the joint key is odd; odd numbers are coprime to 256, guaranteeing the existence of the inverse of the modulo operation and ensuring decryption reversibility.
[0056] Furthermore, in S4, pixels The secondary encryption channel values include the secondary encryption R channel value, the secondary encryption G channel value, and the secondary encryption B channel value, and their expressions are as follows:
[0057]
[0058] in, Represents pixels Value-level encryption of R channel values, Represents pixels Value-level encryption of G-channel value, Represents pixels Value-level encryption of the B channel value, This represents the joint key for each pixel.
[0059] The beneficial effects of the above-mentioned further scheme are: in this invention, the pixel value of each channel depends on the pixel value of another channel, which destroys the independence of the channels; the pixel value is multiplied by the joint key, which enhances the correlation between the pixel value and the key.
[0060] The beneficial effects of this invention are:
[0061] (1) The key generated by this invention is generated entirely based on the neighborhood features of the image itself, without any external seed dependency. The neighborhood features of each pixel are unique, and the generated single-channel key and joint key are pixel-specific. Compared with the global key and external seed key of the prior art, the key of this scheme is deeply bound to the image features.
[0062] (2) The present invention adopts a three-layer encryption logic of bit-level permutation, value-level obfuscation and cross-channel association. Bit-level permutation destroys the binary bit distribution characteristics of pixels through dynamic bit order offset controlled by the key, and resists bit statistical attacks. Value-level obfuscation deeply binds pixel values with exclusive keys through nonlinear operations, and enhances the correlation of pixel values. Cross-channel secondary encryption realizes three-channel cyclic association, destroys channel independence, and avoids the risk of single-channel cracking. The three-layer operation forms a complete obfuscation and diffusion. Small changes in a single pixel can spread to the entire image, effectively resisting common attack methods such as statistical attacks, differential attacks and pixel correlation analysis. Attached Figure Description
[0063] Figure 1 This is a flowchart of an information security encryption method based on a cloud platform. Detailed Implementation
[0064] The embodiments of the present invention will be further described below with reference to the accompanying drawings.
[0065] like Figure 1 As shown, the present invention provides an information security encryption method based on a cloud platform, comprising the following steps:
[0066] S1. Extract the channel values of the image to be encrypted and generate the final key for each channel for each pixel;
[0067] S2. Based on the final key of each channel of the pixel, perform permutation and obfuscation to obtain the value-level encrypted channel value of the pixel;
[0068] S3. Based on the value of the encryption channel of each pixel, perform iterative calculations to determine the joint key for each pixel;
[0069] S4. Based on the pixel's value-level encryption channel value and the joint key, perform cross-channel association to determine the pixel's secondary encryption channel value;
[0070] S5. Generate an RGB matrix based on the three secondary encryption channel values of the pixels to determine the encrypted image stored on the cloud platform.
[0071] The pixel values of the three channels are matched one-to-one according to their positions and combined into a three-dimensional matrix of M×N×3 (M is the number of rows in the image, N is the number of columns, and 3 represents the three RGB channels), forming a complete RGB pixel matrix. The RGB matrix is then encoded into an image format suitable for cloud storage.
[0072] In this embodiment of the invention, S1 includes the following sub-steps:
[0073] S11. Mirror fill the edge pixels in the image to be encrypted and extract the 3×3 neighborhood of each pixel;
[0074] S12. Take the average value of each channel value in the 3×3 neighborhood of each pixel as the average value of each channel neighborhood, and take the standard deviation of each channel value in the 3×3 neighborhood of each pixel as the texture fluctuation value of each channel. The channel values include R channel value, G channel value and B channel value.
[0075] S13. Generate random numbers, and use the random numbers to map the mean value of each channel's neighborhood to the first key, and map the texture fluctuation value of each channel to the second key;
[0076] S14. Perform an XOR operation on the first key and the second key to generate the final key for each channel.
[0077] In this invention, edge pixels are filled using mirror images. For example, the missing neighborhood of the top-left pixel (1,1) is filled by mirror images of (1,1), (1,2), and (2,1), ensuring that each pixel has a complete neighborhood. The neighborhood mean reflects the local brightness characteristics of the pixel's neighborhood, and the texture fluctuation value reflects the degree of texture fluctuation in the pixel's neighborhood. In S14, when performing XOR fusion, the computer's internal storage is an 8-bit binary number. Bitwise operations are performed, and the result is converted back to decimal. 0 to 255 corresponds exactly to the value range of 8 bits of binary, with decimal 255 corresponding to binary 11111111 and decimal 0 corresponding to 00000000. The neighborhood features are mapped to subkeys, and random numbers are introduced to enhance nonlinearity. The two subkeys are XORed to generate the final pixel-level exclusive key.
[0078] In this embodiment of the invention, in S13, the pixel point First key The expression is:
[0079] ;
[0080] in, Represents pixels The mean of the channel neighborhood, Represents the first random number. Represents the second random number. Rows representing pixels, Columns representing pixels;
[0081] In S13, pixels The second key The expression is:
[0082] ;
[0083] in, Represents pixels The channel texture fluctuation value, Represents the third random number. This represents the fourth random number.
[0084] In this invention, the results are compressed to 0–255, adapting to an 8-bit pixel range. Based on binary bit weights and the generation of random numbers, - For example, a prime number , , , This ensures that random numbers are driven by the image's own features, breaking the linear distribution of features and avoiding a skewed distribution of the key; prime coefficients enhance the nonlinearity and randomness of the mapping.
[0085] In this embodiment of the invention, S2 includes the following sub-steps:
[0086] S21. Convert the final key and channel value of each pixel into binary;
[0087] S22. Take the lowest three bits of the final key for each channel and permutate the binary value of each channel;
[0088] S23. Convert the permutation result to decimal to obtain the bit-level encrypted channel value of the pixel;
[0089] S24. Based on the bit-level encryption channel value of the pixel, obfuscate the channel values of the pixel to obtain the value-level encryption channel value of the pixel.
[0090] In this invention, in step S21, the final key and the value of each channel should be converted into 8-bit binary. Assume the final key... =142, binary 10001110, the lowest 3 bits are 110, so the permutation p=6. The red channel value of the pixel... Convert to 8-bit binary numbers b7, b6, ..., b0, where b7 is the most significant bit and b0 is the least significant bit.
[0091] The first round of encryption for a single channel employs a two-layer obfuscation system at both the bit and value levels. Bit-level scrambling disrupts the binary bit distribution characteristics of a pixel, making it impossible for attackers to reconstruct the data through bit statistical analysis. Value-level obfuscation makes changes in pixel values dependent on a dedicated key, achieving a one-pixel-one-key obfuscation effect.
[0092] In this embodiment of the invention, in S21, the expression for permuting the binary values of each channel is:
[0093] ;
[0094] in, This represents the highest bit after the permutation. This indicates the second highest digit after the permutation. This represents the least significant bit after the permutation. This represents the value of the lowest three bits corresponding to the final key.
[0095] In this invention, p is the final key for each channel. The lowest 3 bits, ranging from 0 to 7, corresponding to the positions of the 8 bits, are used as offsets to cyclically shift the original bit sequence. This is to ensure that the calculated bit position is always between 0 and 7, and will not exceed the range of 8 bits, thus destroying the bit-level characteristics of the pixel.
[0096] In this embodiment of the invention, S24 includes the following sub-steps:
[0097] S241. Multiply the bit-level encryption channel value of the pixel by the final key of each channel, and use it as the first non-linear operation factor;
[0098] S242, Use the difference between 255 and the final key of each channel of the pixel as the second non-linear operation factor;
[0099] S243. After adding the first nonlinear operation factor and the second nonlinear operation factor, perform a modulo operation with 256 to obtain the value-level encrypted channel value of the pixel.
[0100] In this invention, nonlinear operations avoid the linear predictability of simple XOR, allowing pixel values to be deeply bound to the key, and changes in a single pixel will spread to the entire channel through nonlinear operations. Used to introduce a reverse offset, disrupting the pixel value distribution.
[0101] In this embodiment of the invention, S3 includes the following sub-steps:
[0102] S31. Take the average of the three encrypted channel values of the pixel as the channel fusion average of the pixel;
[0103] S32. Take the standard deviation of the three-level encrypted channel values of the pixel and use it as the channel fusion texture value of the pixel.
[0104] S33. Extract the local entropy value of the pixel;
[0105] S34. Select an initial pixel, multiply the channel fusion mean, channel fusion texture fluctuation value and entropy value of the initial pixel, and then perform a modulo operation with 256 to obtain the initial iteration value.
[0106] S35. Based on the initial iteration value, iterate over the remaining pixels to determine the joint key for each pixel.
[0107] In this invention, in step S33, the local entropy value of the 3×3 neighborhood of a pixel is extracted. In step S34, the top-left pixel (1,1) is selected as the initial pixel. Each pixel... Each pixel has its own fusion mean, fusion texture value, and fusion entropy value, so the joint key for each pixel is calculated independently.
[0108] The S34 modulo operation is used to compress the result to between 0 and 255, to meet the encryption requirements of 8-bit pixels.
[0109] In this embodiment of the invention, in S34, the expression for iterating over the remaining pixels is:
[0110] ;
[0111] in, Indicates the first The joint key for each pixel Indicates the first The joint key for each pixel Represents the fifth random number. Represents the sixth random number. Represents the seventh random number. Indicates the first The channel fusion mean of each pixel Indicates the first The texture values of each pixel are fused together.
[0112] In this invention, - For example, a prime number , , The formula "Previous key × prime coefficient + fusion feature × prime coefficient + offset + modulo operation" makes the joint key dependent on the local features of the three channels, increasing the key's resistance to attacks. The fusion features of the three channels after the first round of encryption are extracted to generate a cross-channel joint key stream. Adding 1 to the iterative formula ensures the joint key is odd; odd numbers are coprime to 256, guaranteeing the existence of the inverse of the modulo operation and ensuring decryption reversibility.
[0113] In this embodiment of the invention, in S4, the pixel point The secondary encryption channel values include the secondary encryption R channel value, the secondary encryption G channel value, and the secondary encryption B channel value, and their expressions are as follows:
[0114]
[0115] in, Represents pixels Value-level encryption of R channel values, Represents pixels Value-level encryption of G-channel value, Represents pixels Value-level encryption of the B channel value, This represents the joint key for each pixel.
[0116] In this invention, the pixel value of each channel depends on the pixel value of another channel, which destroys the independence of the channels; the pixel value is multiplied by the joint key, which enhances the association between the pixel value and the key.
[0117] Those skilled in the art will recognize that the embodiments described herein are intended to help the reader understand the principles of the invention, and should be understood that the scope of protection of the invention is not limited to such specific statements and embodiments. Those skilled in the art can make various other specific modifications and combinations based on the technical teachings disclosed in this invention without departing from the spirit of the invention, and these modifications and combinations are still within the scope of protection of this invention.
Claims
1. A cloud platform-based information security encryption method, characterized in that, Includes the following steps: S1. Extract the channel values of the image to be encrypted and generate the final key for each channel for each pixel; S2. Based on the final key of each channel of the pixel, perform permutation and obfuscation to obtain the value-level encrypted channel value of the pixel; S3. Based on the value of the encryption channel of each pixel, perform iterative calculations to determine the joint key for each pixel; S4. Based on the pixel's value-level encryption channel value and the joint key, perform cross-channel association to determine the pixel's secondary encryption channel value; S5. Generate an RGB matrix based on the three secondary encryption channel values of the pixels to determine the encrypted image stored on the cloud platform; S1 includes the following sub-steps: S11. Mirror fill the edge pixels in the image to be encrypted and extract the 3×3 neighborhood of each pixel; S12. Take the average value of each channel value in the 3×3 neighborhood of each pixel as the average value of each channel neighborhood, and take the standard deviation of each channel value in the 3×3 neighborhood of each pixel as the texture fluctuation value of each channel. The channel values include R channel value, G channel value and B channel value. S13. Generate random numbers, and use the random numbers to map the mean value of each channel's neighborhood to the first key, and map the texture fluctuation value of each channel to the second key; S14. Perform an XOR operation on the first key and the second key to generate the final key for each channel.
2. The information security encryption method based on a cloud platform according to claim 1, characterized in that, In S13, the pixel points First key The expression is: ； in, Represents pixels The mean of the channel neighborhood, Represents the first random number. Represents the second random number. Rows representing pixels, Columns representing pixels; In S13, the pixel points The second key The expression is: ； in, Represents pixels The channel texture fluctuation value, Represents the third random number. This represents the fourth random number.
3. The information security encryption method based on a cloud platform according to claim 1, characterized in that, S2 includes the following sub-steps: S21. Convert the final key and channel value of each pixel into binary; S22. Take the lowest three bits of the final key for each channel and permutate the binary value of each channel; S23. Convert the permutation result to decimal to obtain the bit-level encrypted channel value of the pixel; S24. Based on the bit-level encryption channel value of the pixel, obfuscate the channel values of the pixel to obtain the value-level encryption channel value of the pixel.
4. The information security encryption method based on a cloud platform according to claim 3, characterized in that, In step S21, the expression for permuting the binary values of each channel is as follows: ； in, This represents the highest bit after the permutation. This indicates the second highest digit after the permutation. This represents the least significant bit after the permutation. This represents the value of the lowest three bits corresponding to the final key.
5. The information security encryption method based on a cloud platform according to claim 3, characterized in that, S24 includes the following sub-steps: S241. Multiply the bit-level encryption channel value of the pixel by the final key of each channel, and use it as the first non-linear operation factor; S242, Use the difference between 255 and the final key of each channel of the pixel as the second non-linear operation factor; S243. After adding the first nonlinear operation factor and the second nonlinear operation factor, perform a modulo operation with 256 to obtain the value-level encrypted channel value of the pixel.
6. The information security encryption method based on a cloud platform according to claim 1, characterized in that, S3 includes the following sub-steps: S31. Take the average of the three encrypted channel values of the pixel as the channel fusion average of the pixel; S32. Take the standard deviation of the three-level encrypted channel values of the pixel and use it as the channel fusion texture value of the pixel. S33. Extract the local entropy value of the pixel; S34. Select an initial pixel, multiply the channel fusion mean, channel fusion texture fluctuation value and entropy value of the initial pixel, and then perform a modulo operation with 256 to obtain the initial iteration value. S35. Based on the initial iteration value, iterate over the remaining pixels to determine the joint key for each pixel.
7. The information security encryption method based on a cloud platform according to claim 6, characterized in that, In step S34, the expression for iterating over the remaining pixels is: ； in, Indicates the first The joint key for each pixel Indicates the first The joint key for each pixel Represents the fifth random number. Represents the sixth random number. Represents the seventh random number. Indicates the first The channel fusion mean of each pixel Indicates the first The texture values of each pixel are fused together.
8. The information security encryption method based on a cloud platform according to claim 6, characterized in that, In S4, the pixel points The secondary encryption channel values include the secondary encryption R channel value, the secondary encryption G channel value, and the secondary encryption B channel value, and their expressions are as follows: ； in, Represents pixels Value-level encryption of R channel values, Represents pixels The value-level encryption of the G-channel value, Represents pixels Value-level encryption of the B channel value, This represents the joint key for each pixel.