Quantum image encryption method based on MQIR

By using the Z-axis to represent the image color position in a three-dimensional coordinate system and combining quantum entanglement and rotating door encryption techniques, the problem of insufficient security and efficiency of existing quantum image encryption methods is solved, and high-security and high-efficiency quantum image encryption is achieved.

CN118984394APending Publication Date: 2024-11-19CHONGQING NORMAL UNIVERSITY
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202410761849.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-06-13
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

Existing quantum image encryption methods fail to fully utilize the advantages of quantum computing, cannot effectively improve the security and confidentiality of image information, and have insufficient efficiency and speed in image processing, making it difficult to meet the challenges of higher-performance computers and more advanced image processing technologies.

Method used

The MQIR quantum image representation method is adopted, in which the Z-axis is used to represent the color position of the image in a three-dimensional coordinate system. Quantum entanglement is used to realize the correlation between pixel color depth and physical position. A key is generated by combining a quantum chaos model and a 3D chaotic system. Quantum CNOT gate is used to realize quantum entanglement. Quantum rotation gate is used to change the Bloch angle of the color-related qubits of the quantum color image for encryption.

Benefits of technology

It improves the security and confidentiality of image information, enhances key security, increases the efficiency and speed of image processing, is difficult to crack using quantum computing methods, has a huge key space, and has strong resistance to attacks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118984394A_ABST
    Figure CN118984394A_ABST
Patent Text Reader

Abstract

The invention belongs to the technical field of image encryption, and particularly relates to a quantum image encryption method based on MQIR. Comprising the following steps: preparing a quantum color image by using an MQIR quantum image representation method, representing the color position of the image by using a Z axis in a three-dimensional coordinate system, and realizing quantum entanglement of color depth and a color channel by using a quantum CNOT gate; two chaotic sequences are respectively generated by using a quantum chaotic model and a 3D chaotic system, and quantum entanglement of the two chaotic sequences is realized by using a quantum CNOT gate to obtain a quantum key; a quantum secret key is input into a quantum revolving door, and the quantum revolving door is used for changing the Bloch angle of color-related quantum bits of a quantum color image to realize encryption of the quantum image. According to the technical scheme, the security and confidentiality of image information can be improved, and meanwhile, the image processing efficiency and speed are improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of image encryption, and in particular is a quantum image encryption method based on MQIR. Background Art

[0002] With the rapid development of information technology, image encryption technology, as an important part of the field of information security, has become increasingly important. Especially in today's era of rapid development of big data, cloud computing, large models and quantum computing, the transmission and processing of image data face unprecedented security challenges. Although traditional image encryption methods can protect the security of image information to a certain extent, their security and reliability cannot meet actual needs in the face of increasingly complex and changeable information attack methods and image parsing capabilities. For example, quantum computing uses the unique parallel operation of quantum bits to retrieve image information more quickly, and then parse out some key information of the encrypted image. The large model based on deep learning has achieved extraordinary achievements in the field of image processing. Many models have been developed and used for the parsing of fuzzy information and the reconstruction of key information. Therefore, exploring new image encryption technologies, especially image encryption algorithms that can resist higher-performance computers and stronger image processing technologies, has become a research hotspot in the current field of information security.

[0003] As an emerging computing method, quantum computing, with its unique parallelism and superposition characteristics, has brought new research directions to the fields of image processing and image information security. Many quantum computing methods have been used in both the field of image processing and the field of information encryption. In order to prepare for the arrival of the quantum computing era, many quantum image representation methods based on quantum computing principles and classical image display schemes have been proposed. On the one hand, these methods refer to the basic principles of computer image display of classical image representation methods, and on the other hand, they use some characteristics of quantum computing to optimize the image representation scheme, so that fewer quantum bits can be used to complete the display task of quantum images. With the continuous development of quantum computing technology, quantum image representation methods and quantum information encryption schemes will also face more practical application scenarios and needs. For example, in the fields of medicine, military secrets, financial transactions, etc., where image security and reliability are extremely high.

[0004] However, most of the existing quantum image encryption methods are based on classical computer implementations and have not yet fully utilized the advantages of quantum computing to improve the security and confidentiality of image information. In addition, a new key generation method is needed to cope with larger-scale application scenarios and needs, while ensuring security while improving the efficiency and speed of image processing. Summary of the invention

[0005] The purpose of the present invention is to propose a quantum image encryption method based on MQIR, which can improve the security and confidentiality of image information while improving the efficiency and speed of image processing.

[0006] To achieve the above-mentioned purpose, the embodiment of the present disclosure provides a quantum image encryption method based on MQIR, including: using the MQIR quantum image representation method to prepare a quantum color image, using the Z axis to represent the color position of the image in a three-dimensional coordinate system, and realizing the quantum entanglement of the pixel color depth and the physical position; using a quantum chaos model and a 3D chaos system to respectively generate two chaotic sequences, and using a quantum CNOT gate to realize the quantum entanglement of the two chaotic sequences to obtain a quantum key; using the quantum key to input a quantum rotation gate, and changing the Bloch angle of the color-related quantum bit of the quantum color image through the quantum rotation gate to realize the encryption of the quantum image.

[0007] Beneficial effects of the basic scheme: By using the Z axis in a three-dimensional coordinate system to represent the color position of an image, the color depth of different channels of a quantum image can be represented. On the one hand, space for storing color values ​​separately can be saved, and on the other hand, the position information of the quantum image can be associated with the color information through the entanglement effect of quantum bits, so that each pixel of the image is not just a simple color value, but is closely related to its physical position, forming an indivisible whole, which greatly improves the security and confidentiality of image information and realizes the normal display of different colors. This encryption method uses three-dimensional coordinates to represent quantum images, and the Z axis can be used independently, that is, compared with other quantum image representation methods, their use cases are limited, either they can only represent quantum grayscale images, or they can only represent quantum color images, or they can only represent quantum index images. Since it uses the Z axis alone to store colors, it provides users with more choices in color selection. Whether it is a quantum grayscale image or a color image, it can be quantum prepared by this encryption method.

[0008] By using quantum kicked top and classical 3D chaotic system to generate two chaotic sequences, and then using quantum CNOT gate to realize quantum entanglement of the two chaotic sequences, a highly random quantum key can be obtained. Using quantum entanglement to generate keys makes the key a whole. Each quantum bit of the key has a certain correlation. The part of the key obtained by the attacker is likely to be invalid during the parsing process, which further guarantees the security of the key. The entire key must be obtained to parse the key. In addition, due to the fragility of the quantum state, any illegal operation on the quantum image will immediately change its state, thereby destroying the integrity of the image information, making the quantum key extremely secure, because any observation or measurement of the key will destroy its quantum state, which will be discovered by the sender and receiver, making it impossible for attackers to obtain its content without destroying the image, further enhancing the security of the image information.

[0009] The quantum key is input into the quantum rotating gate, and the Bloch angle of the color-related quantum bit of the quantum color image is changed through the quantum rotating gate. The advantage of the quantum bit is fully utilized to process the image, that is, the channel bit and the Z-axis color position bit of the MQIR image are rotated by the quantum bit angle to change the information carried by the image, and the encryption of the quantum image can be realized. By using the quantum rotating gate operation, some color-related bits of the quantum image are placed in a quantum intermediate state, so that their values ​​cannot be surveyed, which increases the difficulty of image decryption. Even if the quantum computing method is used for brute force cracking, the actual content of the intermediate state quantum cannot be deciphered, ensuring the security of image encryption. At the same time, because quantum computing has the ability of parallel processing, multiple quantum bits can be operated at the same time. Therefore, the use of this encryption method to prepare and encrypt color images can significantly improve the efficiency of image processing.

[0010] As an implementable preferred solution, the MQIR quantum image representation method is used to prepare a quantum color image, and the Z axis is used to represent the color position of the image in a three-dimensional coordinate system, including the following contents:

[0011] Image size is 2 m ×2 n The quantum color image of is represented as follows:

[0012]

[0013] in, It represents the three channels of the quantum color image RGB. Indicates R, represents G, represents B, |ZYX> is the position bit of the quantum image, |Y>|X> is the position information of each pixel in the color image, and |Z> represents the position of the pixel color.

[0014] As an implementable preferred solution, it also includes using a quantum CNOT gate to realize quantum entanglement on the pixel position information of the image, so that each pixel point of the quantum color image of the MQIR representation method has its corresponding actual color.

[0015] As an implementable preferred solution, two chaotic sequences are generated respectively using a quantum chaos model and a 3D chaotic system, and a quantum CNOT gate is used to realize the quantum entanglement of the two chaotic sequences to obtain a quantum key, including the following contents:

[0016] The quantum kicked top chaos model and the classical 3D chaotic system are used to generate a 6×M×N / 2 chaotic sequence respectively. The generated chaotic sequences are:

[0017]

[0018] The two chaotic sequences are quantum entangled using a quantum circuit.

[0019] As an implementable preferred solution, a quantum circuit is used to quantum entangle the two chaotic sequences, including the following:

[0020] The two chaotic sequences are quantum prepared to convert classical bits into quantum bits, and the quantum bits are used as inputs of quantum circuits.

[0021] Input two qubits into the quantum CNOT gate, and let each qubit of the quantum kicked top chaotic model be the control bit, and each qubit of the classical 3D chaotic system be the controlled bit;

[0022] Entangling each bit of the random qubit sequence obtained by the quantum kicked top chaotic model with each bit of the random qubit sequence obtained by the classical 3D chaotic system;

[0023] A quantum CNOT gate is placed on each input line of the quantum kicked top chaos model in the quantum circuit, and the corresponding position bits of the quantum bits of the classical 3D chaotic system are associated with the quantum CNOT gates at the corresponding positions to obtain a quantum entangled chaotic sequence.

[0024] As an implementable preferred solution, the dynamic equation of the 3D chaotic system is as follows:

[0025]

[0026] Among them, δ, a, b, c, r, p, q, h are real parameters, and the range and definition of each parameter are δ>0, a>1, b>0, c∈R, r≠-δ, p=10, q=10, h=1;

[0027] The 3D chaotic system has two operation modes: in the first mode, -p, +q, +h are used, and in the second mode, +p, -q, -h are used, and the initial condition is x(0) = (1, 2, 4) T .

[0028] As an implementable optimal solution, the quantum chaos model adopts kicked top, and its dynamic equation is as follows:

[0029] set up When J→∞, the classical dynamic equation of a periodic quantum kicked top chaos model is obtained as:

[0030]

[0031] in:

[0032]

[0033] X, Y, and Z are J is the total angular momentum, k and α are variable parameters. When k ≥ 3, the chaotic phase space of kickedtop begins to become chaotic.

[0034] As an implementable preferred solution, a quantum key is used to input a quantum revolving gate, including the following:

[0035] The obtained quantum entangled chaotic sequence is set to A;

[0036] The quantum chaotic sequence A is measured to obtain a 6×M×N size sequence S with a certain value; each bit of the S sequence is added by 1 to obtain an updated S sequence;

[0037] Put the quantum bit into the quantum intermediate state and negate it, that is, multiply each bit of the updated S sequence by And π to get each bit input angle of the quantum rotation gate.

[0038] As an implementable preferred solution, the encryption of quantum images is achieved by changing the Bloch angle of the color-related quantum bits of the quantum color image through a quantum rotation gate, which includes the following contents:

[0039] The quantum rotating gate is defined as:

[0040]

[0041] remember Right now:

[0042]

[0043] Where Y and X are the position information in the quantum image display, and i represents the i-th quantum bit. What this means is to rotate the i-th color-related quantum bit at position (x, y), and the rotation angle is affected by the parameters provided by the S sequence.

[0044] The random rotation operator of the color-dependent qubit of a pixel P(Y,X) is defined as:

[0045]

[0046] The rotation operator of the entire image is composed of 2 m+n Operator R YX Composition, namely:

[0047]

[0048] As an implementable preferred solution, the method further includes obtaining a decrypted image of the MQIR encrypted color image, including the following contents:

[0049] Use the obtained quantum key to construct the following rotation matrix:

[0050]

[0051] According to |I> decryption =R|I> encryption , get the decrypted image;

[0052] in, express The conjugate transpose of . BRIEF DESCRIPTION OF THE DRAWINGS

[0053] Figure 1 A logic schematic diagram of a quantum image encryption method based on MQIR of the present invention;

[0054] Figure 2 It is a correlation entanglement quantum circuit diagram of a quantum bit sequence in an embodiment of a quantum image encryption method based on MQIR of the present invention;

[0055] Figure 3 This is a schematic diagram of the Bloch sphere model;

[0056] Figure 4 It is a quantum rotation encryption circuit diagram of an MQIR quantum color image in an embodiment of a quantum image encryption method based on MQIR of the present invention;

[0057] Figure 5 This is a demonstration diagram of the encryption and decryption effect of a quantum image encryption method based on MQIR of the present invention;

[0058] Figure 6A schematic diagram of the histogram analysis of the lake image before and after encryption by a quantum image encryption method based on MQIR of the present invention;

[0059] Figure 7 A schematic diagram of the histogram analysis of the color building image before and after encryption by a quantum image encryption method based on MQIR of the present invention;

[0060] Figure 8 A schematic diagram of the histogram analysis of the image before and after the encryption of the pigeon image by a quantum image encryption method based on MQIR of the present invention;

[0061] Fig. 9 A schematic diagram of the correlation analysis of adjacent pixels of a lake image before and after encryption using a quantum image encryption method based on MQIR according to the present invention;

[0062] Fig.10 A schematic diagram of the correlation analysis of adjacent pixels of a color building image before and after encryption using a quantum image encryption method based on MQIR according to the present invention;

[0063] Fig.11 A schematic diagram of the correlation analysis of adjacent pixels of a pigeon image before and after encryption using a quantum image encryption method based on MQIR according to the present invention;

[0064] Fig.12 Schematic diagram of the simulation of lake image noise test;

[0065] Fig.13 Schematic diagram of the simulation of pigeon image noise test;

[0066] Fig.14 Schematic diagram of the structure of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0067] In order to make the technical solution and advantages of the present application clearer, the technical solution of the present invention will be further described in detail below in conjunction with the accompanying drawings. It will be understood that the specific embodiments described herein are only partial embodiments of the present invention, which are only used to explain the present application, rather than to limit the present application. It should be noted that the technical features or combinations of technical features described in the following embodiments should not be considered isolated, and they can be combined with each other to achieve better technical effects. The same reference numerals appearing in the drawings of the following embodiments represent the same features or components, which can be applied to different embodiments.

[0068] In addition, unless otherwise defined, the technical terms or scientific terms used in the description of the present invention should have the common meanings understood by those skilled in the art in the art to which the present invention belongs.

[0069] The present invention is further described in detail below in conjunction with the accompanying drawings:

[0070] Explanation of reference numerals: electronic device 500 , processor 501 , communication interface 502 , memory 503 , bus 504 .

[0071] Reference Figure 1 , a quantum image encryption method based on MQIR, comprising:

[0072] Step S100, based on the MQIR (Multimode Quantum Image Representation) quantum image representation method, a quantum color image is prepared for the classical RGB image, and the image size is 2 m ×2 n The MQIR quantum image representation method is based on quantum image processing. Compared with the traditional two-dimensional image representation method, a Z axis is added to store the color information of the image. It uses a three-dimensional coordinate system to place the position of non-zero elements (i.e., the position of 1) in the pixel value color depth (classical image display generally uses 8 bits to represent different color depths) on the Z axis, thereby using fewer quantum bits than other quantum image representation methods to achieve quantum preparation and representation of images of any size and color.

[0073] Step S101, prepare m+n quantum bits |Y>|X> with an initial state of 0, and use three quantum bits to represent the three channels R, G, and B of the true color image, which are respectively The channel coefficients uniformly placed on the image are

[0074] Step S102, use the Z coordinate to represent the color position of the image, that is, |ZYX> can be expressed as |Z>|Y>|X>, where |Y>|X> represents the physical position of each pixel in the image, such as 00 represents the image pixel at the 0th row and 0th column, and |Z> represents the position of the pixel color, such as |Z>=001, indicating that the color depth is 1 (|Z> only represents the position of 1 in the color depth, and the undeclared position is 0).

[0075] Step S103, since the color depths of different channels in the color image are different, and the colors of each channel blend with each other to form more colors, a quantum CNOT gate (a two-qubit gate) is used to realize the quantum entanglement of color depth and color channel, so that a specific channel maintains its specific color; the quantum CNOT gate is also used to realize quantum entanglement of the pixel position information |Y>|X> of the image, so that each pixel point of the quantum color image of the MQIR representation method has its corresponding actual color.

[0076] The quantum color image is represented as follows:

[0077]

[0078] in, It represents the RGB channels of the quantum color image. Indicates R, represents G, Represents B, |ZYX> is the position bit of the quantum image, |Y>|X> is the position information of each pixel in the color image, |Z> represents the position of the pixel color, which uses the Z axis to record the position. Different positions store different color depths, and each color depth is associated with each corresponding color channel to represent different colors.

[0079] Step S200, using a quantum chaos model and a 3D chaotic system to generate two chaotic sequences respectively, and using a quantum CNOT gate to achieve quantum entanglement of the two chaotic sequences to obtain a quantum key.

[0080] The dynamic equation of the 3D chaotic system used in the embodiment of the present disclosure is as follows:

[0081]

[0082] Where δ, a, b, c, r, p, q, h are real parameters, and the range of values ​​of each parameter is defined as δ>0, a>1, b>0, c∈R, r≠-v, p=10, q=10, h=1, and the system has two operating modes. The operating mode of the system changes when the sign of the quadratic term changes from one mode to another. In the first mode, -p, +q, +h are used, while in the second mode, +p, -q, -h are used. The initial condition is x(0)=(1,2,4) T When δ=33, r=45.6, a=13, b=6, c=11, the system has complex chaotic behavior.

[0083] The quantum chaos model used in the embodiments of the present disclosure is a kicked top. In the classical limit, When J→∞, the dynamic equation of a periodic quantum kicked top chaos model is as follows:

[0084]

[0085] in:

[0086]

[0087] X, Y, and Z are The three components of the angular momentum are: J is the total angular momentum, k and α are variable parameters, and the spherical coordinates (θ, Φ) are set to a radius of 1, then X = sinθcosΦ, Y = sinθsinΦ, and Z = cosθ. According to the chaotic experiment, it can be obtained that when α is fixed to π / 2, when (θ, Φ) is in and When the system has a pitchfork bifurcation, the fixed point will become unstable. At the same time, in the case of this fixed point, when k ≥ 3, the chaotic phase space of the kicked top begins to become chaotic. When k ≥ 6, the chaotic behavior will fill the entire phase space of the system.

[0088] Step S200 specifically includes:

[0089] Step S201, set M=2 m ,N=2 n , the size of the prepared MQIR color image I is expressed as I = M × N. Using the quantum kicked top chaos model and the classical 3D chaotic system, a 6 × M × N / 2 chaotic sequence is generated respectively, and the generated chaotic sequences are:

[0090]

[0091] Step S202, using a quantum circuit to quantum entangle the two chaotic sequences to achieve the association between the two chaotic sequences, specifically includes:

[0092] Step S202-1, quantum preparation is performed on the two chaotic sequences, so that the classical bits are prepared into quantum bits, and the quantum bits are used as inputs of the quantum circuit.

[0093] Step S202-2, using the quantum CNOT gate to implement the entanglement operation of different quantum bits, input two quantum bits of the quantum CNOT gate, one of which will be used as a control bit and the other as a controlled bit, to associate the two quantum bits. In this embodiment, each bit of the quantum kicked top is used as a control bit, and each quantum bit of the classical 3D chaotic system is used as a controlled bit. When the control bit is 0, the value of the controlled bit does not change. When the control bit is 1, the controlled bit will reverse its state from 0 to 1, or from 1 to 0.

[0094] Step S202-3, entangle each bit of the random quantum bit sequence obtained by the quantum kicked top with each bit of the random quantum bit sequence obtained by the classical 3D chaotic system. Place a quantum CNOT gate on each input line of the quantum kicked top in the quantum circuit, and associate the corresponding position bit of the quantum bit of the classical 3D chaotic system with the quantum CNOT gate at the corresponding position, thereby realizing the association operation of the two chaotic sequences and obtaining a quantum entangled chaotic sequence, i.e., a quantum key.

[0095] Reference Figure 2, is a quantum circuit diagram of two chaotic sequences quantum entangled. When running on a quantum computer, even if the network is insecure and the attacker obtains part of the quantum key sequence, it may not be able to obtain the complete key sequence due to quantum entanglement. This is because once one quantum bit fails to be deciphered, it may actually lead to the failure of deciphering two quantum bits, and the failure rate will increase exponentially with the number of quantum bits that fail to be deciphered.

[0096] Step S300, using a quantum rotating gate to perform Bloch rotation on each color-related quantum bit, so that the original quantum bit information is hidden, referring to Figure 4 , the change of the Bloch angle of a quantum bit is actually to rotate the quantum bit around the x or y axis, that is, to change the angle θ to achieve the change of the quantum bit state. Specifically include:

[0097] Step S301, set the obtained quantum entangled chaotic sequence to A. Since each bit of the chaotic sequence has been prepared as a quantum state, the value of each bit of the chaotic sequence A should be 0 or 1.

[0098] Step S302, measure the quantum chaotic sequence A to obtain a 6×M×N size sequence of determined values, denoted as S, where S is a determined classical chaotic sequence, and each bit value is either 0 or 1. Then add 1 to each bit of S to obtain an updated S sequence, and each bit of the updated S sequence is either 1 or 2.

[0099] Step S303, placing the quantum bit into the quantum intermediate state and negating it, that is, multiplying each bit of the updated S sequence by And π to obtain each bit input angle of the quantum rotation gate.

[0100] Step S304, changing the Bloch angle of the color-related quantum bit of the quantum color image by a quantum rotating gate, and defining the quantum rotating gate as:

[0101]

[0102] remember Right now:

[0103]

[0104] Where Y and X are the position information in the quantum image display, and i represents the i-th quantum bit. What this means is to rotate the i-th color-related quantum bit at position (x, y), and the rotation angle is affected by the parameters provided by the S sequence.

[0105] The random rotation operator of the color-dependent qubit of a pixel P(Y,X) is defined as:

[0106]

[0107] The rotation operator of the entire image can be obtained by 2 m+n Operator R YX Composition, namely:

[0108]

[0109] Reference Figure 4 This is the quantum rotation encryption circuit diagram of the MQIR quantum color image.

[0110] Because a considerable number of color-related quantum bits are placed in the intermediate state of quantum bits when using quantum rotating gate encryption, the measurement of quantum bits in the intermediate state has confusion characteristics and cannot be determined as 0 or 1. Therefore, the MQIR quantum encrypted color image achieved through the above steps is very difficult to crack.

[0111] In addition, since quantum entanglement is used in each level of bits in the MQIR image representation method, the color information and position information of the image are actually quantum entangled. When the channel and color position are changed, the position information of the image pixels will also change to a certain extent, making the encryption effect even better.

[0112] Step S400, obtaining a decrypted image of the MQIR encrypted color image, specifically includes:

[0113] Step S401, construct the following rotation matrix using the obtained quantum key:

[0114]

[0115] Step S402, according to |I> decryption =R|I> encryption , get the decrypted image, where express The conjugate transpose of .

[0116] Step S500, performing simulation operation and analysis, specifically includes:

[0117] Step S501, refer to Figure 5 ,The simulation process selects three different JPG pictures for experiments, from left to right they are the original image, the encrypted image, ,and the decrypted image; from top to bottom they are the lake, the colored building, and the pigeon.

[0118] The encryption and decryption method proposed in this technical solution is used. It can be seen from the encrypted image that the image encryption effect is very good, and the original image cannot be recognized by the naked eye at all. Moreover, by observing the decrypted image, it can be seen that there is basically no difference between it and the original image. It can be seen that this method is suitable for encrypting color images.

[0119] Step S502, key space analysis is performed. The key space is a set of all possible keys used by the encryption algorithm, and is a range of encryption key sizes. The key space depends on the size of the key. If the key space is large, it is difficult for an attacker to estimate the same key. Only when the key space is large enough can the encryption system be secure and reliable.

[0120] According to a quantum image encryption method based on MQIR provided by an embodiment of the present disclosure, the key space is formed by multiplying the quantum kicked top model with the classical 3D chaotic system. The parameters of the quantum kicked top are {k, θ, Φ, α}. When using a 64-bit computer, its floating point number can reach 10 14 , so we can get the key space of quantum kicked top to generate random sequences is 10 56 Similarly, the key space of the classic 3D chaotic system used in this paper is 10 154 . The multiplication results in a key space of 10 210 , we can see that the size of the key space is much larger than 2 100 , the encrypted image cannot be cracked using brute force methods, so it has a good encryption effect.

[0121] Step S503, performing complexity analysis. For the quantum kicked top and the classical 3D chaotic system used, the generation of the chaotic sequence is actually the solution of the two chaotic systems. Without considering how to solve the two chaotic systems, the complexity of the MQIR-based quantum image encryption method provided by the embodiment of the present disclosure is actually only related to the entanglement of the two random sequences and the quantum rotating gate encryption.

[0122] Assuming that a quantum color image using N bits is to be encrypted, a total of two quantum random sequences of size N / 2 are required. For the quantum entanglement operation of these two quantum random sequences, it is actually only necessary to perform quantum CNOT gate operations on N / 2 quantum bits. Therefore, the time complexity of implementing quantum entanglement operations is O(N / 2). As a result, after the quantum entanglement operation obtains the key, the key is input into the quantum rotation gate. The time complexity of using the quantum rotation gate to rotate and encrypt each quantum bit of the image is only related to the size of the image, which is actually O(N). It can be seen that for the entire encryption system, the encryption time complexity is O(N)+O(N / 2). For encryption methods using various digital processing, the complexity of a quantum image encryption method based on MQIR provided in the embodiment of the present disclosure is quite small, which means that when implementing image encryption, this method can use fewer quantum computing resources and solve the image encryption task more efficiently.

[0123] Step S503: Perform a histogram analysis. The histogram analysis of an image shows the frequency of occurrence of each pixel value in an image, which can represent the color characteristics of an image. Figure 6 , Figure 7 and Figure 8 , perform histogram analysis on the RGB channels of the color image respectively, Figure 6 (a) Figure 7 (a) and Figure 8 (a) is the histogram analysis of the original image. Figure 6 (b) Figure 7 (b) and Figure 8 (b) is the histogram analysis of the encrypted image. The colors of the three channels of the image have very obvious changes before and after encryption. The color distribution of the image before encryption shows obvious aggregation and dispersion, while the color of the encrypted image is very uniform, which means that there is basically no valuable information in the image, and it is impossible to observe whether it carries relevant information. Through histogram analysis, it can be verified that this encryption method has a strong anti-decryption ability and has a good hiding effect on the pixel information of the original image.

[0124] Step S504, performing correlation coefficient analysis. Adjacent pixel correlation analysis refers to a method of analyzing and calculating the relationship between adjacent pixels in an image to understand the similarity and correlation of different regions in the image. The smaller the correlation between adjacent pixels in the image, the lower the possibility of obtaining image information by adjacent pixel analysis, that is, the smaller the correlation between adjacent pixels in the encrypted image, the higher the security of the encryption algorithm.

[0125] The correlation coefficient is defined as:

[0126]

[0127] Where E(x), E(y), D(y) and D(x) represent the expectation and variance of x and y respectively. Generally speaking, for an image with certain information, its adjacent pixels have certain correlation in all directions, and its value is generally close to 1.

[0128] In order to ensure that the encrypted image cannot be cracked by the attacker using adjacent pixel analysis, it is necessary to ensure that the adjacent pixels of the image encrypted using this encryption method are not correlated in all directions. Generally, the analysis of adjacent pixels of the image is performed in three directions: horizontally, vertically, and diagonally. Fig. 9 , Fig.10 , Fig.11 , is an analysis chart of the correlation between adjacent pixels of the image before and after encryption. This analysis chart compares the correlation between adjacent pixels randomly selected in the diagonal direction before and after encryption. Fig. 9 (a) Fig.10 (a) and Fig.11(a) is the analysis diagram of the correlation between adjacent pixels of the original image. Fig. 9 (b) Fig.10 (b) and Fig.11 (b) is an analysis diagram of the correlation between adjacent pixels of the encrypted image. It can be found that the correlation between adjacent pixels of the image before encryption is high, while the correlation between adjacent pixels of the encrypted image is very low, and it is basically impossible to confirm whether it carries information.

[0129] Step S505, performing plaintext sensitivity analysis. Image plaintext sensitivity analysis refers to identifying the plaintext content in the image and performing sensitivity analysis on the content to determine whether it carries sensitive information.

[0130] The sensitivity of plaintext is measured using two indicators: NPCR (Number of Pixels Change Rate) and UACI (Normalized Average Change Amplitude Universal Adaptive Cryptographic Index). NPCR reflects the change rate of the color depth of each pixel in the image channel. UACI reflects the average change amplitude of the pixel value of each channel. The calculation formulas of NPCR and UACI are as follows:

[0131]

[0132] Where M and N are the width and height of the image, C1 and C2 are the names of the encrypted images. C1(i, j) and C2(i, j) represent the pixel values ​​at the corresponding positions of the two images.

[0133] By comparing the pixel distribution of the encrypted image of two slightly different images, it is determined whether the sensitivity of the plaintext image encrypted by the key is high, which reflects the sensitivity of the key to different images with slight differences.

[0134] NPCR shows the overall difference between the two images. The larger its value, the greater the difference between the encrypted images. UACI shows the difference between the corresponding pixels of the encrypted images. The larger its value, the greater the difference between the images at the corresponding pixels.

[0135] If both values ​​reach a large enough value, it means that even slightly different images will show different encryption chaos effects after being encrypted by the algorithm key. Ensuring that these two values ​​are as close to the theoretical values ​​as possible will ensure that the image cannot be cracked by the attacker using exhaustive methods, reducing the possibility of the image being cracked by plaintext sensitive analysis.

[0136] Among them, the theoretical expected values ​​of NPCR and UACI are 99.6054% and 33.4635%.

[0137] In this embodiment, the Python 3.10 environment is used to run the code. The OpenCV library is used to read the image, the numpy library is used to process the image matrix, and the matplotlib library is used to display the result. The NPCR and UACI of the image are obtained, and the NPCR value and UACI value of the encryption method in other literature are compared. Specifically, the face lena image is encrypted using the encryption algorithm, but due to the copyright issue of the face image, only the encrypted result is represented, and the result is compared with the result obtained by other methods. The result is shown in Table 1.

[0138] Table 1

[0139]

[0140]

[0141] Among them, document 1 was published in the journal Inf.Sci. (Information Science) with volume number 546 in February 2021, pages 1063-1083, and the title of the document is: Cross-plane colour image encryption using a two-dimensional logistic tent modular map. Document 2 was published in the journal IEEE Access (published by the Institute of Electrical and Electronics Engineers (IEEE)) with volume number 10 in 2022, pages 67669-67685, and the title of the document is: Color image encryption using 2Dsine-cosine coupling map.

[0142] By comparison, we can see that the test results of this encryption method have advantages in NPCR and UACI, which means that this encryption method has a relatively stable performance on different images. It has good resistance to both known plaintext attacks and chosen plaintext attacks.

[0143] Step S506, perform information entropy analysis. Image encryption information entropy is an indicator used to measure the randomness of the encrypted image pixel values. Information entropy is an indicator to measure the uncertainty of the information source, which can represent the relationship between the uncertainty of probability distribution and the amount of information. In image encryption, the higher the information entropy, the higher the encryption strength of the image, and the more random the pixel value distribution.

[0144] The formula for information entropy evaluation method is as follows:

[0145]

[0146] Among them, αi represents a pixel point in the image, p(α i ) is the probability of the pixel appearing in the image, it can be deduced that: For color images, the three channels of RGB need to be calculated, and n=8 for each channel, so the theoretical value of information entropy is 8.

[0147] Refer to Table 2, which is a comparison of the information entropy of the image before and after using the encryption algorithm in this paper and the information entropy of the image after encryption by other methods.

[0148] Table 2

[0149]

[0150]

[0151] Among them, document 3 was published in the journal Nonlinear Dynamics, Vol. 105, No. 2, July 2021, with pages 1859-1876, and the title of the document is: Color image encryption based on cross2D hyperchaotic map using combined cycle shift scrambling and selecting diffusion. Document 4 was published in the journal Optik, April 2018, with volume 159, pages 348-367, and the title of the document is: A color image encryption technique using exclusive-OR with DNA complementary rules based on chaos theory and SHA-2.

[0152] The information entropy of the image encrypted by this encryption method is closer to 8 than that of the image encrypted by other methods, which means that this encryption method has higher randomness, stronger uncertainty, and is more secure, and has better resistance to various decryption methods such as brute force cracking.

[0153] Step S507, perform robustness analysis. Since the quantum image is easily affected by various external factors during the transmission process, the received image is easily affected by the noise that may exist in the quantum transmission channel and the noise of the measurement quantum itself, which makes the acquired image distorted or contaminated. In order to ensure that the received key and image can decrypt the quantum image, it is necessary to ensure that our algorithm has a certain degree of robustness and can resist the influence of noise.

[0154] Noise the image using Gaussian noise and salt and pepper noise:

[0155] gauss_img=gauss_noise(im,mean=0,var=0.0005)

[0156] salt_img=salt_and_pepper_noise(im,proportion=0.05)

[0157] Where im represents the original image to be processed, guass_noise and salt_and_pepper_noise represent the processing using Gaussian noise and salt and pepper noise, and var and proportion represent the input noise point values. After obtaining the noise image, the key is used to decrypt the image. Fig.12 and Fig.13 , Fig.12 (a) and Fig.13 (a) is the original image. Fig.12 (b) and Fig.13 (c) is the decrypted image after var=0.0005 Gaussian noise. Fig.12 (a) and Fig.13 (a) is the decrypted image after adding proportion = 0.05 salt and pepper noise.

[0158] Step S508, perform security analysis. The previous encryption methods have the problem of high key sensitivity requirements. The attacker may decipher the encrypted image when he has a certain key sequence. The disclosed embodiment also provides a quantum image encryption method based on MQIR based on quantum bits and quantum computing operations, using quantum entanglement operations and quantum rotating gate encryption processing, so that part of the key obtained by the attacker is invalid during the parsing process, and each quantum color bit is rotated and encrypted using a quantum rotating gate. The attacker cannot parse the encrypted image without obtaining the entire quantum key. This article is based on quantum bits from the display of the image, the integration of the key, and the encryption of each image pixel bit. In addition, the existence of quantum intermediate states makes it impossible to decipher the actual content of the intermediate state quantum even if brute force cracking is performed using quantum computing methods, thereby ensuring the security of image encryption.

[0159] The disclosed embodiment also provides a MQIR-based quantum image encryption system, which uses the above-mentioned MQIR-based quantum image encryption method.

[0160] The embodiment of the present disclosure also provides a storage medium, in which a computer program is stored. When the computer program is executed by a processor, all steps of the above-mentioned quantum image encryption method based on MQIR can be implemented.

[0161] A person of ordinary skill in the art can understand that the implementation of all or part of the process in a quantum image encryption method based on MQIR can be completed by instructing related hardware through a computer program, and the program can be stored in a non-volatile computer-readable storage medium. When the program is executed, it can include the process of each embodiment of a quantum image encryption method based on MQIR. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0162] The embodiment of the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above-mentioned quantum image encryption method based on MQIR when executing the program. In the embodiment of the present application, the processor is the control center of the computer system, which can be a processor of a physical machine or a processor of a virtual machine.

[0163] Reference Fig.14, the electronic device 500 includes: at least one processor 501, at least one communication interface 502, at least one memory 503 and at least one bus 504. The bus 504 is used to realize the connection and communication between these components, the communication interface 502 is used to communicate signaling or data with other node devices, and the memory 503 stores machine-readable instructions executable by the processor 501. When the electronic device 500 is running, the processor 501 communicates with the memory 503 through the bus 504, and when the machine-readable instructions are called by the processor 501, the steps of the above-mentioned quantum image encryption method based on MQIR are executed.

[0164] The above contents are only embodiments of the present invention. The common sense such as the known specific structures and characteristics in the scheme is not described in detail here. The ordinary technicians in the relevant field know all the common technical knowledge in the technical field to which the invention belongs before the application date or the priority date, can obtain all the existing technologies in the field, and have the ability to apply the conventional experimental means before that date. The ordinary technicians in the relevant field can improve and implement this scheme in combination with their own abilities under the enlightenment given by this application. Some typical known structures or known methods should not become obstacles for the ordinary technicians in the relevant field to implement this application. It should be pointed out that for the technicians in this field, without departing from the structure of the present invention, several deformations and improvements can be made, which should also be regarded as the protection scope of the present invention, which will not affect the effect of the implementation of the present invention and the practicality of the patent. The protection scope required by this application shall be based on the content of its claims, and the specific implementation methods and other records in the specification can be used to explain the content of the claims.

Claims

1. A quantum image encryption method based on MQIR, characterized in that: include: The MQIR quantum image representation method is used to prepare quantum color images. The Z axis is used to represent the color position of the image in the three-dimensional coordinate system, and the quantum CNOT gate is used to realize the quantum entanglement of color depth and color channel. The quantum chaos model and the 3D chaotic system are used to generate two chaotic sequences respectively, and the quantum CNOT gate is used to realize the quantum entanglement of the two chaotic sequences to obtain the quantum key. The quantum key is input into the quantum rotation gate, and the Bloch angle of the color-related quantum bit of the quantum color image is changed through the quantum rotation gate to realize the encryption of the quantum image.

2. The MQIR-based quantum image encryption method according to claim 1, characterized in that: The MQIR quantum image representation method is used to prepare quantum color images. The Z axis is used to represent the color position of the image in the three-dimensional coordinate system, including the following: Image size is 2 m ×2 n The quantum color image of is shown as follows: in, It represents the three channels of the quantum color image RGB. Indicates R, represents G, represents B, |ZYX> is the position bit of the quantum image, |Y>|X> is the position information of each pixel in the color image, and |Z> represents the position of the pixel color.

3. The MQIR-based quantum image encryption method according to claim 2, characterized in that: It also includes using quantum CNOT gates to realize quantum entanglement on the pixel position information of the image, so that each pixel point of the quantum color image of the MQIR representation method has its corresponding actual color.

4. The MQIR-based quantum image encryption method according to claim 1, characterized in that: Two chaotic sequences are generated using the quantum chaos model and the 3D chaotic system respectively, and the quantum CNOT gate is used to realize the quantum entanglement of the two chaotic sequences to obtain the quantum key, including the following contents: The quantum kicked top chaos model and the classical 3D chaotic system are used to generate a 6×M×N / 2 chaotic sequence respectively. The generated chaotic sequences are: The two chaotic sequences are quantum entangled using a quantum circuit.

5. The MQIR-based quantum image encryption method according to claim 4, characterized in that: The two chaotic sequences are quantum entangled using a quantum circuit, including the following: The two chaotic sequences are quantum prepared to convert classical bits into quantum bits, and the quantum bits are used as inputs of quantum circuits. Input two qubits into the quantum CNOT gate, and let each qubit of the quantum kicked top chaotic model be the control bit, and each qubit of the classical 3D chaotic system be the controlled bit; Entangling each bit of the random qubit sequence obtained by the quantum kicked top chaotic model with each bit of the random qubit sequence obtained by the classical 3D chaotic system; A quantum CNOT gate is placed on each input line of the quantum kicked top chaos model in the quantum circuit, and the corresponding position bits of the quantum bits of the classical 3D chaotic system are associated with the quantum CNOT gates at the corresponding positions to obtain a quantum entangled chaotic sequence.

6. A quantum image encryption method based on MQIR according to claim 4 or 5, characterized in that: The dynamic equation of the 3D chaotic system is as follows: Among them, δ, a, v, c, r, p, q, h are real parameters, and the value range and definition of each parameter are δ>0, a>1, b>0, c∈R, r≠-δ, p=10, q=10, h=1; The 3D chaotic system has two operation modes: in the first mode, -p, +q, +h are used, and in the second mode, +p, -q, -h are used, and the initial condition is x(0) = (1, 2, 4) T .

7. A quantum image encryption method based on MQIR according to claim 4 or 5, characterized in that: The quantum chaos model uses kicked top, and its dynamic equation is as follows: set up When J→∞, the classical dynamic equation of a periodic quantum kicked top chaos model is obtained as: in: X, Y, and Z are J is the total angular momentum, k and α are variable parameters. When k ≥ 3, the chaotic phase space of kicked top begins to become chaotic.

8. The MQIR-based quantum image encryption method according to claim 1, characterized in that: Entering a quantum turnstile using a quantum key includes the following: The obtained quantum entangled chaotic sequence is set to A; The quantum chaotic sequence A is measured to obtain a 6×M×N size sequence S with a certain value; each bit of the S sequence is added by 1 to obtain an updated S sequence; Put the quantum bit into the quantum intermediate state and negate it, that is, multiply each bit of the updated S sequence by And π to get each bit input angle of the quantum rotation gate.

9. A quantum image encryption method based on MQIR according to any one of claims 1 or 8, characterized in that: The encryption of quantum images is achieved by changing the Bloch angle of the color-related quantum bits of the quantum color image through a quantum rotation gate, including the following: The quantum rotating gate is defined as: remember Right now: Among them, Y and X are the position information in the quantum image display, and i represents the i-th quantum bit; The expression means that the i-th color-related quantum bit at position (x, y) is rotated, and the rotation angle is affected by the parameters provided by the S sequence; The random rotation operator of the color-dependent qubit of a pixel P(Y,X) is defined as: The rotation operator of the entire image is composed of 2 m+n Operator R YX Composition, namely:

10. The MQIR-based quantum image encryption method according to claim 1, characterized in that: It also includes obtaining the decrypted image of the MQIR encrypted color image, including the following: Use the obtained quantum key to construct the following rotation matrix: According to |I> decryption =R|I> encryption , get the decrypted image; in, express The conjugate transpose of .

Citation Information

Cited By

  • Shared ophthalmic examination report image management system

    CN120089303A

  • Shared ophthalmology examination report image management system

    CN120089303B