LSQb steganography method based on scrambling encryption

Abstract

The invention discloses an LSQb steganography method based on scrambling encryption, and the method comprises the steps: amplifying a secret image and an obtained image, and converting the obtained image and a cover image into a quantum image in an NEQR form; sequentially carrying out Arnodean scrambling and Fibonacci scrambling on the obtained secret image, and embedding information of the secret image into the cover image to obtain a steganographic image; extracting the lowest two bits of the gray value of each pixel of the image at a receiving end, and carrying out inverse Fibonacci scrambling and inverse Arnodel scrambling on the extracted NEQR image in sequence; and converting the NEQR image obtained in the previous step into a classic image, compressing the obtained image into the size of a secret graph, and restoring the secret image. According to the invention, the concealment of secret image transmission is improved.

Description

Technical Field

[0001] The present invention belongs to the field of quantum computing and image technology, and in particular relates to an LSQb steganography method based on scrambling encryption. Background Art

[0002] In the digital information age, with the rapid development of computer and information technology, images, as important carriers of information, have become a focus of attention for their security. The least significant bit (LSB) method is a steganographic method that replaces the last bit of the binary form of each pixel value of the cover image, which is an information transmission carrier, with secret information. Although it can achieve hidden embedding of information, its security is fragile in the face of professional analysis. In recent years, in order to directly encode each pixel of the quantum image, the new enhanced quantum representation (NEQR) method can be used to encode the image, and the least significant bit of the quantum sequence of the color or grayscale information of the cover image pixel represented by this method is encoded to hide the information, that is, the least significant quantum bit (LSQb) method.

[0003] In the existing technology, NEQR combined with LSQb method has been used to improve the security of image information. NEQR directly encodes image information through quantum states, while LSQb uses the least significant bit to hide information at the quantum level, which can theoretically provide a higher level of security than traditional methods. At the same time, Arnold scrambling technology, as a means of transforming the position of image pixels, is widely used in image encryption to enhance the image's ability to resist analysis.

[0004] However, although the combination of NEQR and LSQb can improve security, it consumes a lot of quantum resources and is costly to implement in the context of quantum computing not yet being popularized. At the same time, the randomness of the Arnold scrambling algorithm depends on the key. Once the key is leaked, the protection of the image will be greatly reduced. In addition, these methods have technical bottlenecks such as slow processing speed and high resource consumption in practical applications, especially in the processing of large-scale image data. Most existing protection systems are built at the application layer and rely on additional operations. They cannot fundamentally avoid the duplication and copying of data, thus posing security risks. These technical problems limit their widespread application in practical scenarios, and there is an urgent need for more efficient and secure image information protection solutions. Summary of the invention

[0005] The present invention aims to provide a LSQb steganography method based on scrambling encryption, which improves the confidentiality of image information during transmission.

[0006] In order to achieve the purpose of the present invention, the present invention provides a LSQb steganography method based on scrambled encryption, comprising the following steps:

[0007] Step 1, selecting an object: selecting a grayscale image of a certain size as a cover image and a secret image, wherein the cover image is larger than the secret image;

[0008] Step 2, obtaining a quantum image: enlarging the secret image, and converting the enlarged secret image and the cover image into a quantum secret image and a quantum cover image in NEQR form;

[0009] Step 3, obtaining a stego image: performing Arnold scrambling on the quantum secret image, and then performing Fibonacci scrambling on the quantum secret image, and then embedding it into the quantum cover image to obtain a stego image;

[0010] Step 4, processing the stego image: extracting the information of the stego image, first performing inverse Fibonacci scrambling and then inverse Arnold scrambling on the extracted NEQR stego image;

[0011] Step 5: Restore the secret image: Convert the processed steganographic image into a classical image and compress it to finally restore the secret image.

[0012] Furthermore, the grayscale image of a certain size in step 1 is 2 n ×2 n The cover image and 2 n-1 ×2 n-1 The secret image of , n is an integer.

[0013] Furthermore, the step 2 comprises the following steps:

[0014] 2-1. Enlarged image: the grayscale value of each pixel in the secret image is an 8-bit binary number c7c6c5c4c3c2c1c0; the binary number is divided into four parts: c7c6, c5c4, c3c2, c1c0, and the numbers with the same digits are combined into an image of the same size as the secret image according to their relative positions in the secret image. There are four images in total. The images are arranged in a certain order to form an enlarged secret image of the same size and shape as the cover image;

[0015] 2-2. Conversion form: Measure the size of the image to be converted, determine the number of quantum bits 2n that describe the image size, and use the quantum register to convert the classical image into a quantum image in NEQR form. The conversion result is:

[0016]

[0017] in The pixel grayscale information of the q-bit quantum bit encoding pixel, |i>=|y n- 1y n-2 …y0>|x n-1 x n-2…x0> is the vertical and horizontal position information of the pixel encoded by n quantum bits respectively.

[0018] Furthermore, the step 3 comprises the following steps:

[0019] 3-1. Arnold scrambling: traverse each pixel in the quantum secret image and transform its coordinates as follows:

[0020]

[0021] Where i and j are the horizontal and vertical coordinates of the pixel before transformation, i′ and j′ are the horizontal and vertical coordinates of the pixel after transformation, N is the size of the image, and a and b are integers agreed upon by both parties;

[0022] 3-2. Fibonacci scrambling: traverse each pixel in the image containing the secret image information obtained in step 3-1, and transform its coordinates as follows:

[0023]

[0024] 3-3. Embedding information: Using a quantum comparator, compare the two lowest quantum bits of the grayscale value of the pixels of the quantum secret image with the two lowest quantum bits of the grayscale value of the pixels at the corresponding positions of the quantum cover image. If the comparison results are different, perform a unitary operation on the lowest quantum bits of the grayscale of the pixels of the quantum cover image to finally obtain a stego-image.

[0025] Further, the step 4 comprises the following steps:

[0026] 4-1. Extract information: extract the lowest two quantum bits of each pixel of the stego-image to obtain a stego-image of the same size in NEQR format;

[0027] 4-2. Inverse Fibonacci scrambling: traverse each pixel in the extracted stego image and transform its coordinates as follows:

[0028]

[0029] Where i and j are the horizontal and vertical coordinates of the pixel before transformation, i′ and j′ are the horizontal and vertical coordinates of the pixel after transformation, and N is the size of the image;

[0030] 4-3. Inverse Arnold scrambling: traverse each pixel in the stego image obtained in step 4-2, and transform its coordinates as follows:

[0031]

[0032] Where a and b are integers agreed upon by both parties.

[0033] Further, step 4 specifically includes the following steps:

[0034] 5-1. Conversion form: Convert the processed stego-image in NEQR form into an image in classical form, obtaining an image with pixels being two-bit binary numbers, i.e., c7C6, C5C4, c3c2, C1c0;

[0035] 5-2. Compress the image: Divide the image in classical form in a cross shape, and stack the four divided parts of the image according to the corresponding pixel bits of each part, obtaining an image with each pixel being an 8-bit binary number c7c6c5c4c3c2c1c0, that is, obtaining the restored secret image.

[0036] An electronic device includes a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, it implements the above-mentioned LSQb steganography method based on scrambling encryption.

[0037] A non-transitory computer-readable storage medium, characterized in that the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to cause the computer to execute the above-mentioned LSQb steganography method based on scrambling encryption.

[0038] A computer program product includes computer program instructions. When the computer program instructions run on a computer, the computer is caused to execute the above-mentioned LSQb steganography method based on scrambling encryption.

[0039] Compared with the prior art, the significant progress of the present invention lies in: (1) The present invention combines steganography with a scrambling method, increasing the cost and difficulty of third-party detection. In addition, it also improves the gray level of the embedded image, which can increase the richness of steganographic information while making full use of the space of the cover image; (2) The present invention uses a quantum computer to perform the embedding of the least significant bit, which not only does not affect the quality of the generated stego-image but also improves the calculation efficiency.

[0040] To more clearly illustrate the functional characteristics and structural parameters of the present invention, the following further explains in combination with the drawings and specific embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] The drawings described herein are used to provide a further understanding of the present invention and form a part of this application. The schematic embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation to the present invention. In the drawings:

[0042] Figure 1 is a flowchart of the steganography system designed by the present invention;

[0043] Figure 2 is the result diagram of the steganography policy of the present invention. DETAILED DESCRIPTION

[0044] The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments; based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0045] Combination Figure 1 The present invention provides a LSQb steganography method based on scrambled encryption, the method comprising the following steps:

[0046] Step 1. Select the object: Select the grayscale image as 2 n ×2 n The cover image and 2 n-1 × n-1 The secret image of , n is an integer;

[0047] Step 2, obtaining a quantum image: enlarging the secret image, and converting the enlarged secret image and the cover image into a quantum secret image and a quantum cover image in NEQR form;

[0048] 2-1. Enlarged image: the grayscale value of each pixel in the secret image is an 8-bit binary number c7c6c5c4c3c2c1c0; the binary number is divided into four parts: c7c6, c5c4, c3c2, c1c0, and the numbers with the same digits are combined into an image of the same size as the secret image according to their relative positions in the secret image. There are four images in total. The images are arranged in a certain order to form an enlarged secret image of the same size and shape as the cover image;

[0049] 2-2. Conversion form: Measure the size of the image to be converted, determine the number of quantum bits 2n that describe the image size, and use the quantum register to convert the classical image into a quantum image in NEQR form. The conversion result is:

[0050]

[0051] in The pixel grayscale information of the q-bit quantum bit encoding pixel, |i>=|y n-1 y n-2 …y0>|x n-1 x n-2 …x0> is the vertical and horizontal position information of the pixel encoded by n quantum bits respectively.

[0052] Step 3, obtaining a stego image: performing Arnold scrambling on the quantum secret image, and then performing Fibonacci scrambling on the quantum secret image, and then embedding it into the quantum cover image to obtain a stego image;

[0053] 3-1. Arnold scrambling: traverse each pixel in the quantum secret image and transform its coordinates as follows:

[0054]

[0055] Where i and j are the horizontal and vertical coordinates of the pixel before transformation, i′ and j′ are the horizontal and vertical coordinates of the pixel after transformation, N is the size of the image, and a and b are integers agreed upon by both parties;

[0056] 3-2. Fibonacci scrambling: traverse each pixel in the image containing the secret image information obtained in step 3-1, and transform its coordinates as follows:

[0057]

[0058] 3-3. Embedding information: Using a quantum comparator, compare the two lowest quantum bits of the grayscale value of the pixels of the quantum secret image with the two lowest quantum bits of the grayscale value of the pixels at the corresponding positions of the quantum cover image. If the comparison results are different, perform a unitary operation on the lowest quantum bits of the grayscale of the pixels of the quantum cover image to finally obtain a stego-image.

[0059] Step 4, processing the stego image: extracting the information of the stego image, first performing inverse Fibonacci scrambling and then inverse Arnold scrambling on the extracted NEQR stego image;

[0060] 4-1. Extract information: extract the lowest two quantum bits of each pixel of the stego-image to obtain a stego-image of the same size in NEQR format;

[0061] 4-2. Inverse Fibonacci scrambling: traverse each pixel in the extracted stego image and transform its coordinates as follows:

[0062]

[0063] Where i and j are the horizontal and vertical coordinates of the pixel before transformation, i′ and j′ are the horizontal and vertical coordinates of the pixel after transformation, and N is the size of the image;

[0064] 4-3. Inverse Arnold scrambling: traverse each pixel in the stego image obtained in step 4-2, and transform its coordinates as follows:

[0065]

[0066] Where a and b are integers agreed upon by both parties.

[0067] Step 5, Restore the secret image: Convert the processed stego image into an image in the classical form, compress it, and finally restore the secret image;

[0068] 5-1, Convert the form: Convert the processed stego image in the NEQR form into an image in the classical form to obtain an image with two-bit binary numbers for pixels, namely c7C6, C5C4, c3c2, C1c0;

[0069] 5-2, Compress the image: Divide the image in the classical form in a cross shape, and stack the four divided images according to the number of bits of the corresponding pixels in each part to obtain an image with eight-bit binary numbers c7C6c5C4C3C2c1c0 for each pixel, that is, obtain the restored secret image.

[0070] Embodiment

[0071] A specific embodiment of the present invention is described as follows. The simulation uses MATLAB programming, and the parameter setting does not affect generality. This embodiment verifies the effectiveness and convergence of the proposed steganography method. The scenario is:

[0072] The sender of the picture embeds Figure 2 "Secret image" in Figure 2 as the secret information into the cover image, that is, Figure 2 "Cover image" to form Figure 2 "Stego image" in

[0073] Compare Figure 2 "Stego image" and "Extracted image" in

[0074] It can be found that the secret image embedded in the cover image is well restored without error, proving the effectiveness of the steganography method.

[0075] It should be noted that in this article, terms such as "including", "comprising" or any other variant thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements not only includes those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0076] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A LSQb steganography method based on scrambled encryption, characterized in that: The following steps are involved: Step 1, selecting an object: selecting a grayscale image of a certain size as a cover image and a secret image, wherein the cover image is larger than the secret image; Step 2, obtaining a quantum image: enlarging the secret image, and converting the enlarged secret image and the cover image into a quantum secret image and a quantum cover image in NEQR form; Step 3, obtaining a stego image: performing Arnold scrambling on the quantum secret image, and then performing Fibonacci scrambling on the quantum secret image, and then embedding it into the quantum cover image to obtain a stego image; Step 4, processing the stego image: extracting the information of the stego image, first performing inverse Fibonacci scrambling and then inverse Arnold scrambling on the extracted NEQR stego image; Step 5: Restore the secret image: Convert the processed steganographic image into a classical image and compress it to finally restore the secret image.

2. The LSQb steganography method based on scrambled encryption according to claim 1 is characterized in that: The grayscale image of a certain size in step 1 is 2 n ×2 n The cover image and 2 n-1 × n-1 The secret image of , n is an integer.

3. The LSQb steganography method based on scrambled encryption according to claim 1 is characterized in that: The step 2 comprises the following steps: 2-1. Enlarged image: the gray value of each pixel in the secret image is an 8-bit binary number c7c6c5c4c3c2c1c0; the binary number is divided into four parts: c7c6, c5c4, c3c2, c1c0, and the numbers with the same digits are combined into an image of the same size as the secret image according to their relative positions in the secret image. There are four images in total. The images are arranged in a certain order to form an enlarged secret image of the same size and shape as the cover image; 2-2. Conversion form: Measure the size of the image to be converted, determine the number of quantum bits 2n that describe the image size, and use the quantum register to convert the classical image into a quantum image in NEQR form. The conversion result is: in The pixel grayscale information of the q-bit quantum bit encoding pixel, |i>=|y n- 1y n-2 …y0>|x n-1 x n-2 …x0> is the vertical and horizontal position information of the pixel encoded by n quantum bits respectively.

4. The LSQb steganography method based on scrambled encryption according to claim 1 is characterized in that: The step 3 comprises the following steps: 3-1. Arnold scrambling: traverse each pixel in the quantum secret image and transform its coordinates as follows: Where i and j are the horizontal and vertical coordinates of the pixel before transformation, i′ and j′ are the horizontal and vertical coordinates of the pixel after transformation, N is the size of the image, and a and b are integers agreed upon by both parties; 3-2. Fibonacci scrambling: traverse each pixel in the image containing the secret image information obtained in step 3-1, and transform its coordinates as follows: 3-3. Embedding information: Using a quantum comparator, compare the two lowest quantum bits of the grayscale value of the pixels of the quantum secret image with the two lowest quantum bits of the grayscale value of the pixels at the corresponding positions of the quantum cover image. If the comparison results are different, perform a unitary operation on the lowest quantum bits of the grayscale of the pixels of the quantum cover image to finally obtain a stego-image.

5. The LSQb steganography method based on scrambled encryption according to claim 1 is characterized in that: The step 4 comprises the following steps: 4-1. Extract information: extract the lowest two quantum bits of each pixel of the stego-image to obtain a stego-image of the same size in NEQR format; 4-2. Inverse Fibonacci scrambling: traverse each pixel in the extracted stego image and transform its coordinates as follows: Where i and j are the horizontal and vertical coordinates of the pixel before transformation, i′ and j′ are the horizontal and vertical coordinates of the pixel after transformation, and N is the size of the image; 4-3. Inverse Arnold scrambling: Traverse each pixel in the stego-image obtained in step 4-2, and perform the following transformation on its coordinates: where a and b are integers agreed upon by both parties.

6. The LSQb steganography method based on scrambled encryption according to claim 1 is characterized in that: Step 4 specifically includes the following steps: 5-1. Conversion form: Convert the processed stego-image in NEQR form into an image in classical form, obtaining an image with pixels being two-bit binary numbers, namely c7C6, C5C4, c3c2, C1c0; 5-2. Image compression: Divide the classical-form image in a cross shape, and stack the four divided image parts according to the number of bits of the corresponding pixels in each part, obtaining an image with each pixel being an 8-bit binary number c7C6c5C4C3C2c1c0, that is, obtaining the restored secret image.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, it implements the method according to any one of claims 1 to 6.

8. A non-transitory computer-readable storage medium, characterized in that: The non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to cause the computer to execute the method according to any one of claims 1 to 6.

9. A computer program product, including computer program instructions, when the computer program instructions run on a computer, cause the computer to execute the method according to any one of claims 1 to 6.

Images