Image processing method and device, equipment, medium and product

Abstract

The invention discloses an image processing method and device, equipment, a medium and a product, and relates to the technical field of image processing. The image processing method comprises the steps of obtaining a first image; performing quantum Beck mapping on the first image to obtain a first quantum image; generating a first encryption key according to the first image and the two-dimensional logic mapping; and performing unitary operation on the first quantum image according to the first encryption key to obtain a second quantum image. According to the scheme disclosed by the invention, the security of the image can be improved.

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of image processing, and particularly relates to an image processing method, device, equipment, medium and product. BACKGROUND

[0002] Image encryption is to change the position or value of pixels (or frequency domain coefficients) in the spatial domain (or frequency domain) of an image according to a reversible transformation rule, so as to convert an image containing effective information and being recognizable into an unrecognizable random noise image.

[0003] In the related art, the key for encrypting an image is vulnerable to a chosen-plaintext attack, resulting in poor image security. SUMMARY

[0004] Embodiments of the present application provide an image processing method, device, equipment, medium and product, which can solve the problem of poor image security.

[0005] In a first aspect, an image processing method is provided, comprising: obtaining a first image; performing quantum Baker mapping on the first image to obtain a first quantum image; generating a first encryption key according to the first image and a two-dimensional logical mapping; performing unitary operation on the first quantum image according to the first encryption key to obtain a second quantum image.

[0006] In a second aspect, an image processing device is provided, comprising: an obtaining module configured to obtain a first image; a mapping module configured to perform quantum Baker mapping on the first image to obtain a first quantum image; a key generation module configured to generate a first encryption key according to the first image and a two-dimensional logical mapping; an encryption module configured to perform unitary operation on the first quantum image according to the first encryption key to obtain a second quantum image.

[0007] In a third aspect, an electronic device is provided, comprising a processor and a memory storing computer program instructions; the processor implements the image processing method provided by the embodiments of the present application when executing the computer program instructions.

[0008] In a fourth aspect, a computer readable storage medium is provided, storing computer program instructions; the computer program instructions are executed by a processor to implement the image processing method provided by the embodiments of the present application.

[0009] In a fifth aspect, an embodiment of the present application provides a computer program product. Instructions in the computer program product, when executed by a processor of an electronic device, cause the electronic device to perform the image processing method provided by an embodiment of the present application.

[0010] In an embodiment of the present application, a first image is acquired; quantum Beker mapping is performed on the first image to obtain a first quantum image; a first encryption key is generated according to the first image and a two-dimensional logical mapping; and a second quantum image is obtained by performing unitary operation on the first quantum image according to the first encryption key. In this way, the performance of resisting plaintext attacks can be improved, and the image security can be improved. BRIEF DESCRIPTION OF DRAWINGS

[0011] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required to be used in the embodiments of the present application will be briefly introduced. For those skilled in the art, other drawings can also be obtained without creative labor on the premise of these drawings.

[0012] Figure 1 is a flowchart of an image processing method provided by some embodiments of the present application; Figure 2 is a schematic diagram of discrete Beker mapping provided by some embodiments of the present application; Figure 3 is a quantum circuit schematic diagram of quantum Beker mapping provided by some embodiments of the present application; Figure 4 is a schematic diagram of determining row pixel offset provided by some embodiments of the present application; Figure 5 is a quantum circuit schematic diagram of image encryption provided by some embodiments of the present application; Figure 6 is a schematic diagram of an image before encryption provided by some embodiments of the present application; Figure 7 is a schematic diagram of an image after encryption provided by some embodiments of the present application; Figure 8 is a quantum circuit schematic diagram of image decryption provided by some embodiments of the present application; Figure 9 is a structural schematic diagram of an image processing apparatus provided by some embodiments of the present application; Figure 10 is a structural schematic diagram of an electronic device provided by some embodiments of the present application. DETAILED DESCRIPTION

[0013] The features and exemplary embodiments of the various aspects of the present application will be described in detail below with reference to the drawings. For the purpose of clarity, the description is divided into the following sections: technical scheme, technical solutions, and advantages. The following description is further divided into subsections. The specific embodiments described herein are intended to be illustrative only and are not intended to limit the scope of the present application. The present application can be practiced without these specific details. The following description is presented to provide a better understanding of the present application.

[0014] It should be noted that the terms such as first and second, etc., are merely used to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "contain" or any other variants 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 inherent to such a process, method, article or device. Without more limitations, the elements defined by the statement "include" do not exclude the presence of other identical elements in the process, method, article or device that includes the elements.

[0015] The terms used in the embodiments of the present application are only used to explain the specific embodiments of the present application, and are not intended to limit the present application. The terms related to the embodiments of the present application are explained below.

[0016] Quantum Baker's Map (QBM) is an important model in quantum chaos, which describes the corresponding relationship between quantum systems and classical chaos.

[0017] Discrete Baker's Map (DBM) is the implementation of classical Baker's Map (BM) in discrete phase space (such as finite grid or quantum system).

[0018] Two-dimensional Logistic Map is a generalization of classical Logistic Map in two-dimensional space, which is used to study the chaotic behavior of coupled nonlinear systems.

[0019] Novel Enhanced Quantum Representation (NEQR) is a digital image representation method based on quantum computing.

[0020] The image processing method, device, equipment, medium and product provided by the embodiments of the present application will be described in detail in combination with the drawings, specific embodiments and application scenarios.

[0021] It should be noted that the image processing method provided by the embodiments of the present application can be executed by an electronic device. In some embodiments of the present application, the image processing method is executed by an electronic device as an execution subject.

[0022] The image processing method provided by the embodiments of the present application can be applied to a scenario of encrypting an image, or a scenario of decrypting an image.

[0023] The image processing method, device, equipment, medium and product provided by the embodiments of the present application will be described in detail in combination with the drawings, specific embodiments and application scenarios.

[0024] Figure 1 is a flowchart of the image processing method provided by the embodiments of the present application. As shown in Figure 1 , the image processing method can include: Step 101: obtaining a first image; Step 102: performing quantum Baker mapping on the first image to obtain a first quantum image; Exemplarily, for an image I of 2 n ×2 n , the first quantum image obtained by performing quantum Baker mapping on the image I is denoted as |I'>, and the first quantum image |I'> can be expressed by NEQR as: wherein, is a discrete pixel value of the first quantum image, and are a column coordinate component and a row coordinate component of a pixel point in the first quantum image, respectively.

[0025] Step 103: generating a first encryption key according to the first image and a two-dimensional logical mapping; In some embodiments of the present application, step 103 can include: performing discrete Baker mapping on the first image to obtain a second image; determining an offset corresponding to the kth row of pixels in the second image; wherein the kth row of pixels is any row of pixels in the second image; and generating the first encryption key according to the offset and the two-dimensional logical mapping.

[0026] In some embodiments of the present application, Baker mapping is a block scrambling method. The continuous Baker mapping is shown in the following formula (1): (1) wherein, in formula (1), y ∈ [0, 1]. The Baker mapping is to map the left half-matrix [0, 1 / 2) x [0, 1) of the square to [0, 1) x [0, 1 / 2), and map the right half-matrix [1 / 2, 1) x [0, 1) to [0, 1) x [1 / 2, 1). Since the image is composed of discrete pixel points, when the Baker mapping acts on the image, the Baker mapping needs to be discretized. Let N / ni (i = 1, …, k) be an integer, and at the same time, n1+…+nk=N, N being a positive integer. The discrete Baker mapping process is as follows: The first image B of N rows and N columns is divided into N blocks, and the N block images are B N×N , …, B 1-1 , …, B 1-n1 , …, B k-1 , …, B k-nk ; wherein, B i-j represents an N / ni row ni matrix, i = 1, …, k, j = 1, …, ni. Then, the matrix straightening operation is performed on B i-j to obtain an image B1 N×N of N rows and N columns. The image B1 N×N may be as shown in the following formula (2): (2) wherein, in formula (2), B1 ij represents a 1 row N column matrix.

[0027] Exemplarily, taking a 4 x 4 image as an example, the process of the discrete Baker mapping on the image is as shown in Figure 2 . Figure 2 is a schematic diagram of the discrete Baker mapping provided by some embodiments of the present application.

[0028] Corresponding to the example in which N is 4 in Figure 2 , the quantum circuit of the quantum Baker mapping is as shown in Figure 3 . Figure 3 is a quantum circuit schematic diagram of the quantum Baker mapping provided by some embodiments of the present application.

[0029] In some embodiments of the present application, the dynamic equation of the two-dimensional logical mapping in the embodiments of the present application can be as shown in the following formula (3): (3) wherein, in formula (3), μ1, μ2, γ1 and γ2 are parameters, x1(0) and x2(0) are initial values of the two-dimensional logical mapping, x1(0) ∈ (0, 1), x2(0) ∈ (0, 1).

[0030] In some embodiments of this application, the value ranges of μ1, μ2, γ1, and γ2 can be set according to actual needs.

[0031] In some embodiments of this application, the value range of μ1 can be (2.75, 3.4], the value range of μ2 can be (2.75, 3.45], the value range of γ1 can be (0.15, 0.21], and the value range of γ2 can be (0.13, 0.15).

[0032] Take image B1 N×N Pixel B1 in row K K1 That is, B1 K1 =(b K1 ,···,b KN ), where b Ki ∈[0,255], i=1,···,N.

[0033] Each pixel b Ki Convert to binary (b Ki 2. (b) Ki )2=(e i1 , ···, e iL ) T , where e iL ∈[0,1], L=1, ..., 8. All (b Ki )2 form an 8×N binary matrix BM, and the expression for BM is BM = ((b K1 )2,···,(b KN 2).

[0034] Perform a bitwise binary XOR operation on each row of BM, i.e. We obtain E = (α1, ..., α8) where α L ∈{0,1}.

[0035] Convert E to decimal E 10 E 10 =α8×2 7 +···+α1×2 0 E 10 Let offset be the pixel offset of this row, where offset ∈ [0, 255].

[0036] For example, N is 8, and the row pixel offset is determined as follows: Figure 4 As shown, Figure 4 This is a schematic diagram illustrating the determination of row pixel offsets provided in some embodiments of this application.

[0037] In some embodiments of the present application, when the first encryption key is generated according to the offset and the two-dimensional logical mapping, the generating can include: converting the offset to obtain a second offset in the range of 0 to 1; correcting an initial value of the two-dimensional logical mapping according to the second offset to obtain a corrected initial value of the two-dimensional logical mapping; determining a first chaotic sequence and a second chaotic sequence according to the corrected initial value of the two-dimensional logical mapping; respectively mapping the first chaotic sequence and the second chaotic sequence to obtain a first mapped chaotic sequence and a second mapped chaotic sequence; and generating the first encryption key according to the first mapped chaotic sequence and the second mapped chaotic sequence.

[0038] In some embodiments of the present application, the offset can be converted by the following formula (4): δ offset =floor(10 S ×offset / 255)×10 -S (4) In formula (4), δ offset is the second offset, offset is the offset before conversion, S is a parameter, and floor(·) is a floor function; wherein S can be set according to actual requirements, for example, S is 4.

[0039] In some embodiments of the present application, when the initial value of the two-dimensional logical mapping is corrected according to the second offset, the initial value of the two-dimensional logical mapping can be corrected by the following formula (5): (5) In formula (5), x1(0) and x2(0) are the corrected initial values of the two-dimensional logical mapping, x1(0)' and x2(0)' are the initial values of the two-dimensional logical mapping before correction, and {x} represents the decimal part of x.

[0040] In some embodiments of the present application, when the first chaotic sequence and the second chaotic sequence are determined according to the corrected initial value of the two-dimensional logical mapping, the corrected initial values x1(0) and x2(0) of the two-dimensional logical mapping can be substituted into the above formula (3) for iteration N / 2 times to obtain two chaotic sequences x1 and x2 with a length of N / 2, which are the first chaotic sequence and the second chaotic sequence in the embodiments of the present application; wherein x1(m) ∈ (0, 1), x2(m) ∈ (0, 1), and m = 1, ···, N / 2.

[0041] In some embodiments of the present application, when the first chaotic sequence and the second chaotic sequence are mapped, the mapping can be performed by the following formula (6): g(u)=floor(255u)+1(6) wherein in the formula (6), u e {x1(m), x2(m)}, and floor(·) is a floor function.

[0042] The mapped x1(m) and x2(m) are taken as the key k, that is, k = (g(x1(m)), g(x2(m))), wherein m = 1, ···, N / 2, and k is simply denoted as k = (k1, ···, kN / 2). N )。

[0043] The k is converted from decimal to binary to obtain , and K is taken as the first encryption key.

[0044] Step 104: performing a unitary operation on the first quantum image according to the first encryption key to obtain a second quantum image.

[0045] In some embodiments of the present application, step 104 can include: in a case where the discrete pixel value of the first quantum image is greater than or equal to a pre-generated random number, performing a unitary operation on the first quantum image according to the first encryption key to obtain the second quantum image; in a case where the discrete pixel value is less than the random number, performing a unitary operation on the first quantum image according to a second encryption key to obtain the second quantum image; wherein the second encryption key is generated according to the discrete pixel value.

[0046] In some embodiments of the present application, the second encryption key can be determined by the following formula (7): (7) wherein in the formula (7), A is the second encryption key, and floor(·) is a floor function.

[0047] In some embodiments of the present application, when C Y′X′ ≥ T, the quantum bit |0> a stores |1>; and when C Y′X′ < T, the quantum bit |0> a stores |0>; wherein T is a random number, and T e [0, 255].

[0048] When the quantum bit |0> a is |1>, the first quantum image |I'> is subjected to a unitary operation to obtain the second quantum image; and when the quantum bit |0> a is |0>, the first quantum image |I'> is subjected to a unitary operation to obtain the second quantum image. Wherein U is a unitary operation operator, K is the first encryption key, and A is the second encryption key.

[0049] In the embodiment of the present application, the first image is obtained, quantum baker mapping is performed on the first image to obtain a first quantum image, a first encryption key is generated according to the first image and a two-dimensional logical mapping, and a second quantum image is obtained by performing unitary operation on the first quantum image according to the first encryption key. In this way, the performance of resisting chosen-plaintext attack can be improved, and the image security can be improved.

[0050] In some embodiments of the present application, the image processing method provided by the embodiment of the present application can further include: performing fast Fourier transform on the second quantum image to obtain a third quantum image.

[0051] In the embodiment of the present application, the image frequency domain can be scrambled by Fourier transform, the image can be globally disturbed, and the image security is further enhanced.

[0052] In some embodiments of the present application, the image processing method provided by the embodiment of the present application can further include: performing quantum baker mapping on the i th quantum image to obtain an i+1 th quantum image, until i is equal to a preset threshold N, wherein i is a positive integer greater than or equal to 1 and less than or equal to N, and the first quantum image is the third quantum image.

[0053] Figure 5 is a quantum circuit schematic diagram of image encryption provided by some embodiments of the present application.

[0054] Exemplarily, as shown in Figure 6 and Figure 7 , the image before encryption is as shown in Figure 6 is a schematic diagram of an image after encryption provided by some embodiments of the present application. Figure 7 is a schematic diagram of an image after encryption provided by some embodiments of the present application.

[0055] In the embodiment of the present application, through multiple iterations, the original adjacent pixels will be distributed to the entire scrambled image, and the image security can be further improved.

[0056] In some embodiments of the present application, the image processing method provided by the embodiment of the present application can further include: performing inverse quantum baker mapping on the i+1 th quantum image to obtain the i th quantum image, until i is equal to 1; performing inverse fast Fourier transform on the first quantum image to obtain the second quantum image; performing control unitary operation on the second quantum image according to the first encryption key to obtain the first quantum image; and performing inverse quantum baker mapping on the first quantum image to obtain the first image.

[0057] It can be understood that the inverse quantum baker mapping is the inverse operation of the quantum baker mapping, and the inverse fast Fourier transform is the inverse operation of the fast Fourier transform.

[0058] Figure 8is a schematic diagram of a quantum circuit for image decryption provided by some embodiments of the present application.

[0059] Some embodiments of the present application also provide an image processing device, as shown in Figure 9 Figure 9 is a schematic diagram of an image processing device provided by some embodiments of the present application. The image processing device 900 can include: an acquisition module 901 configured to acquire a first image; a mapping module 902 configured to perform quantum Beck mapping on the first image to obtain a first quantum image; a key generation module 903 configured to generate a first encryption key according to the first image and a two-dimensional logical mapping; an encryption module 904 configured to perform unitary operation on the first quantum image according to the first encryption key to obtain a second quantum image.

[0060] In some embodiments of the present application, the mapping module 902 is specifically configured to: perform discrete Beck mapping on the first image to obtain a second image; determine an offset corresponding to the kth row of pixels in the second image; wherein the kth row of pixels is any row of pixels in the second image; generate the first encryption key according to the offset and the two-dimensional logical mapping.

[0061] In some embodiments of the present application, the encryption module 904 is specifically configured to: in a case where a discrete pixel value of the first quantum image is greater than or equal to a random number generated in advance, perform unitary operation on the first quantum image according to the first encryption key to obtain the second quantum image; in a case where the discrete pixel value is less than the random number, perform unitary operation on the first quantum image according to a second encryption key to obtain the second quantum image; wherein the second encryption key is generated according to the discrete pixel value.

[0062] In some embodiments of the present application, the image processing device 900 provided by the embodiments of the present application further includes: a transformation module configured to perform fast Fourier transform on the second quantum image to obtain a third quantum image.

[0063] In some embodiments of the present application, the image processing device 900 provided by the embodiments of the present application further includes: an iteration module configured to perform quantum Beck mapping on an i-th quantum image to obtain an i+1-th quantum image until i is equal to a preset threshold N, wherein i is a positive integer greater than or equal to 1 and less than or equal to N, and the 1st quantum image is the third quantum image.

[0064] ​In some embodiments of the present application, the image processing apparatus 900 provided by the embodiments of the present application further comprises: The decryption module is configured to perform inverse quantum Baker mapping on the (i+1)th quantum image to obtain the ith quantum image until i is equal to 1; perform inverse fast Fourier transform on the first quantum image to obtain a second quantum image; perform control unitary operation on the second quantum image according to the first encryption key to obtain a first quantum image; and perform inverse quantum Baker mapping on the first quantum image to obtain the first image.

[0065] Figure 10 FIG. 1 is a structural schematic diagram of an electronic device provided by an embodiment of the present application.

[0066] The electronic device 1000 can include a processor 1001 and a memory 1002 storing computer program instructions.

[0067] Specifically, the processor 1001 can include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement one or more embodiments of the present application.

[0068] The memory 1002 can include a mass storage for data or instructions. By way of example and not limitation, the memory 1002 can include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive or a combination of two or more of these. Where appropriate, the memory 1002 can include removable or non-removable (or fixed) media. Where appropriate, the memory 1002 can be internal or external to the electronic device. In some particular embodiments, the memory 1002 is a non-volatile solid-state memory.

[0069] In some particular embodiments, the memory can include read-only memory (ROM), random access memory (RAM), a magnetic disk storage media device, an optical storage media device, a flash memory device, an electrical, optical, or other physical / tangible memory storage device. Thus, in general, the memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software that, when executed (e.g., by one or more processors), is operable to perform operations described with reference to the image processing method according to the present application.

[0070] The processor 1001 implements the image processing method provided by the embodiments of the present application by reading and executing computer program instructions stored in the memory 1002.

[0071] In one example, the electronic device can further include a communication interface 1003 and a bus 1010. Wherein, as shown in the figure, the processor 1001, the memory 1002, the communication interface 1003 are connected through the bus 1010 and complete the communication between each other. Figure 10

[0072] The communication interface 1003 is mainly used to realize the communication between each module, device, unit and / or equipment in the embodiments of the present application.

[0073] The bus 1010 includes hardware, software or both, which couples the components of the electronic device to each other. By way of example and not limitation, the bus can include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hyper Transport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an InfiniBand interconnect, a Low Pin Count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local Bus (VLB) bus, or other suitable bus or combination of two or more of these. Where appropriate, the bus 1010 can include one or more buses. Although specific buses are described and illustrated in the embodiments of the present application, the present application contemplates any suitable bus or interconnect.

[0074] The electronic device can execute the image processing method provided by the embodiments of the present application, thereby realizing the corresponding technical effects of the image processing method provided by the embodiments of the present application.

[0075] ​In addition, in combination with the image processing method in the above embodiments, the embodiments of the present application further provide a computer readable storage medium for implementation. The computer readable storage medium has computer program instructions stored thereon; the computer program instructions are executed by a processor to implement the image processing method provided by the embodiments of the present application. Examples of the computer readable storage medium include non-transitory computer readable media, such as ROM, RAM, magnetic disk, or optical disk, etc.

[0076] The embodiments of the present application provide a computer program product, instructions in the computer program product are executed by a processor of an electronic device to make the electronic device execute the image processing method provided by the embodiments of the present application, and the same technical effects can be achieved. To avoid repetition, details are not repeated here.

[0077] It should be noted that the present application is not limited to the specific configurations and processes described above and shown in the drawings. For the sake of brevity, detailed descriptions of well-known methods are omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present application is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between steps, after understanding the spirit of the present application.

[0078] The functional blocks shown in the above structural block diagrams can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (ASIC), appropriate firmware, a plug-in, a functional card, etc. When implemented in software, the elements of the present application are program or code segments used to perform the required tasks. The program or code segments can be stored in a machine readable medium or transmitted through a data signal carried in a carrier wave over a transmission medium or communication link. The "machine readable medium" can include any medium capable of storing or transmitting information. Examples of the machine readable medium include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable read only memory (EROM), floppy disks, compact disc read only memory (CD-ROM), optical disks, hard disks, optical fiber media, radio frequency (RF) links, etc. The code segments can be downloaded via a computer network such as the Internet, an intranet, etc.

[0079] It is also need to be explained that the example embodiments mentioned in the present application describe some methods or systems based on a series of steps or devices. However, the present application is not limited to the order of the above steps, that is, the steps can be executed in the order mentioned in the embodiments, can be different from the order in the embodiments, or several steps are executed simultaneously.

[0080] The computer program instructions can also be loaded onto a computer, other programmable data processing apparatus, or other processing device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other processing device to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions / acts specified in the flowchart and / or block diagram block or blocks.

[0081] The above only specifically describes the embodiments of the present application. For the convenience and brevity of description, the specific working processes of the above-described system, module and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be described herein. It should be understood that the protection scope of the present application is not limited to this. Any person skilled in the art can easily think of various equivalent modifications or replacements within the technical range disclosed in the present application, and these modifications or replacements should be covered within the protection scope of the present application.

Claims

1. An image processing method, characterized in that, The method includes: Get the first image; Perform quantum Beck mapping on the first image to obtain the first quantum image; Based on the first image and the two-dimensional logical mapping, a first encryption key is generated; The first quantum image is obtained by performing unitary operations on the first quantum image using the first encryption key.

2. The method according to claim 1, characterized in that, The step of generating the first encryption key based on the first image and the two-dimensional logical mapping includes: The first image is subjected to discrete Beck mapping to obtain the second image; Determine the offset corresponding to the k-th row of pixels in the second image; wherein, the k-th row of pixels is any row of pixels in the second image; The first encryption key is generated based on the offset and the two-dimensional logical mapping.

3. The method according to claim 1, characterized in that, The step of performing unitary operations on the first quantum image based on the first encryption key to obtain the second quantum image includes: If the discrete pixel value of the first quantum image is greater than or equal to a pre-generated random number, the first quantum image is subjected to unitary operation according to the first encryption key to obtain the second quantum image. When the discrete pixel value is less than the random number, the first quantum image is subjected to unitary operation according to the second encryption key to obtain the second quantum image; wherein the second encryption key is generated based on the discrete pixel value.

4. The method according to any one of claims 1 to 3, characterized in that, The method further includes: The second quantum image is subjected to a fast Fourier transform to obtain the third quantum image.

5. The method according to claim 4, characterized in that, The method further includes: Perform quantum Beck mapping on the i-th quantum image to obtain the (i+1)-th quantum image, until i equals a preset threshold N, where i is a positive integer greater than or equal to 1 and less than or equal to N, and the first quantum image is the third quantum image.

6. The method according to claim 5, characterized in that, The method further includes: Perform inverse quantum Beck mapping on the (i+1)th quantum image to obtain the ith quantum image, until i equals 1; The second quantum image is obtained by performing a fast inverse Fourier transform on the first quantum image; The first quantum image is obtained by performing a controlled unitary operation on the second quantum image according to the first encryption key. The first quantum image is obtained by performing an inverse quantum Beck mapping on the first quantum image.

7. An image processing apparatus, characterized in that, The device includes: The acquisition module is used to acquire the first image; The mapping module is used to perform quantum Beck mapping on the first image to obtain the first quantum image; A key generation module is used to generate a first encryption key based on the first image and the two-dimensional logical mapping; An encryption module is used to perform unitary operations on the first quantum image according to the first encryption key to obtain a second quantum image.

8. An electronic device, characterized in that, The electronic device includes: a processor and a memory storing computer program instructions; The processor reads and executes the computer program instructions to implement the image processing method as described in any one of claims 1-6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer program instructions that, when executed by a processor, implement the image processing method as described in any one of claims 1-6.

10. A computer program product, characterized in that, When the instructions in the computer program product are executed by the processor of the electronic device, the electronic device performs the image processing method as described in any one of claims 1-6.

Images