Mobile phone encryption communication method of integrated optical quantum random number generator

Abstract

The application discloses a mobile phone encryption communication method of an integrated optical quantum random number generator and particularly relates to the technical field of communication encryption. The application divides image data into regions, distinguishes sensitive regions from remaining regions, adopts a processing mode of non-uniform block division and pixel value dynamic transformation based on a differential formula of the parity of random numbers for the remaining regions, and implements secondary encryption through random palette filling for the sensitive regions, so that a differential encryption strategy is realized for data to be transmitted by a user, high-strength protection is realized, and while ensuring the security of sensitive information, redundant calculation of the remaining regions is reduced and encryption efficiency is improved.

Description

Technical Field

[0001] This invention relates to the field of communication encryption technology, and more specifically, to a mobile phone encrypted communication method using an integrated optical quantum random number generator. Background Technology

[0002] With the rapid development of information technology, the importance of communication security has become increasingly prominent. Quantum random number generators generate randomness through quantum physical processes. Compared with traditional random number generators, they have higher security and unpredictability, which can effectively prevent hackers and unauthorized users from obtaining sensitive information and ensure the confidentiality and integrity of data.

[0003] However, the application of quantum random number generators in mobile communication still has the following shortcomings:

[0004] In mobile communications, data transmission covers a variety of data types, including images, audio, and video. Existing technologies often use encryption with a uniform processing method, which cannot adopt targeted encryption methods according to the specific data types of communication, resulting in a lack of specificity and security in encryption.

[0005] Furthermore, the system cannot distinguish between sensitive and non-sensitive areas and perform targeted encryption processing for the specific data that users need to transmit. For example, for images, there is a lack of differentiated encryption strategies for sensitive and non-sensitive areas, resulting in either insufficient protection of sensitive information or redundant encryption of non-sensitive areas, leading to a low level of intelligence.

[0006] To address this, a mobile phone encryption communication method integrating an optical quantum random number generator has been developed. Summary of the Invention

[0007] To overcome the above-mentioned deficiencies of the prior art, embodiments of the present invention provide a mobile phone encrypted communication method integrating an optical quantum random number generator.

[0008] To achieve the above objectives, the present invention provides the following technical solution:

[0009] A mobile phone encrypted communication method integrating an optical quantum random number generator includes:

[0010] Communication encryption: Obtain random numbers generated by the optical quantum random number generator module, process the obtained random numbers according to the data type of the communication process using the encryption logic algorithm corresponding to different data types, and add them to the communication data stream for encryption; the data types include images, audio and video;

[0011] Decryption output: After receiving the communication data stream, the receiving mobile phone decodes the encrypted data and outputs the decrypted data to complete the presentation of the communication content.

[0012] Specifically, the process involves using encryption logic algorithms corresponding to different data types. The process for encrypting images is as follows:

[0013] If the data type of the current communication process is an image, then the sensitive region pre-divided by the sender in the image is extracted. After the sensitive region is extracted from the image, two sets of random numbers are requested from the optical quantum random number generator for the remaining region, including the block random number set and the pixel transformation random number set.

[0014] Randomly select 64-bit numbers from the block random number set and perform non-uniform block division on the image;

[0015] After non-uniform block division, for each pixel in each block, an 8-bit binary random number is randomly selected from the set of random numbers for pixel transformation, and its least significant bit is taken as the encryption number, denoted by X. Based on the parity determination result of X, it is substituted into different set formulas to calculate the encrypted pixel value F corresponding to each pixel in each block, and then transformed.

[0016] Represented as Where Y is the original pixel value;

[0017] M is a random offset, which is obtained by calculating the average of the remaining 7 binary random numbers when X is odd, and by taking the highest value among the 7 binary random numbers when X is even.

[0018] This represents the random coefficient. When X is odd, it is obtained by taking the highest value of a 7-bit binary random number, dividing it by an integer two, and then rounding it. When X is even, it is obtained by taking the lowest value of a 7-bit binary random number, dividing it by an integer two, and then rounding it.

[0019] Each block after pixel value transformation is scrambled as a whole, and the encrypted pixel value G is dynamically transformed for all three RGB channels of the image.

[0020] Specifically, the process of encrypting sensitive areas in the image is as follows:

[0021] For sensitive areas, generate blank-filled images of the same size as the sensitive areas; request a new set of random numbers from the optical quantum random number generator as a secondary encryption set;

[0022] Construct a color palette containing 256 color groups, with each color group corresponding to a set range of random numbers. Randomly select three random numbers from the secondary encryption set, corresponding to the R, G, and B channels respectively. Match each random number in the secondary encryption set with the set range to determine the color palette color corresponding to each random number. After matching, write the result to the corresponding position in the blank-filled image to generate an encrypted image composed entirely of random color combinations.

[0023] Specifically, the process involves using encryption logic algorithms corresponding to different data types. The encryption process for audio is as follows:

[0024] If the data type of the current communication process is audio, set an energy threshold for the audio, extract audio segments that are higher than the energy threshold as high-energy segments, and use the remaining audio segments as ordinary-energy segments;

[0025] For the general energy range in audio, a set of random numbers is requested from the optical quantum random number generator as the general encryption set; the highest random number, the lowest random number, and the average of each set of random numbers are extracted from the general encryption set;

[0026] Calculate the average energy value of the general energy range, divide it by the preset adjustment value, and use the result as the adjustment factor k.

[0027] The highest random number, the lowest random number, and the mean of each group of random numbers are extracted and multiplied by the adjustment factor k to obtain the corrected encryption number one, encryption number two, and encryption number three, denoted by a1, a2, and a3. A triangle is constructed using a1, a2, and a3 as the three side lengths of the triangle, thereby determining the three interior angles of the triangle.

[0028] For audio sampling points in the general energy range, let them be set as a sequence. Grouping samples by area as integer multiples, and using the sine values ​​of the three interior angles as weighting coefficients for each group, a weighted permutation is applied to the sampling points in each group, where the j-th sampling point in the i-th group... Transform into ; These represent the sine values ​​of the three interior angles;

[0029] Using the greatest common divisor of a1, a2, and a3 as the overall offset, the calculation is performed on all transformed sampling points in the order of adding or subtracting the overall offset.

[0030] Specifically, the process of encrypting high-energy segments in the audio is as follows:

[0031] After encrypting the high-energy segment in the audio, the peak energy, duration, and frequency bandwidth are extracted from the high-energy segment and denoted as E1, E2, and E3.

[0032] E1, E2, and E3 are respectively based on the formula Perform calculations to determine the coordinates of the sphere's center. ; Request a set of random numbers within a set range from the optical quantum random number generator as optimization coefficients;

[0033] The average of the three sets of values ​​a1, a2, and a3 is divided by the optimization coefficient, and the result is rounded off to obtain the radius R of the sphere.

[0034] A cryptographic sphere representing the current high-energy band is constructed using the sphere's center coordinates and radius. The sampling point sequence of the high-energy band is then mapped onto the sphere's surface. The sampling point sequence of the high-energy band is represented as follows: N is the total number of sampling points;

[0035] For the i-th sampling point, define: polar angle azimuth ;

[0036] Based on the center of the ball Given the radius R of the sphere, calculate the coordinates of the sphere surface corresponding to the sampling point, which is expressed as follows: ;

[0037] Three sets of 16-bit random numbers are requested from the optical quantum random number generator. The three sets of random numbers are labeled as v1, v2 and v3 respectively, and the three sets of random numbers are converted into rotation angles around the x, y and z axes.

[0038] The conversion process is as follows: ;

[0039] For each sampling point, the sphere surface coordinates are rotated sequentially around the x, y, and z axes to obtain the encrypted coordinates.

[0040] Specifically, the process involves using encryption logic algorithms corresponding to different data types. The encryption process for video is as follows:

[0041] If the data type of the current communication process is video, then two sets of random numbers are requested from the optical quantum random number generator, denoted as the frame-level random number set and the offset random number set;

[0042] The original coordinate points are formed by adjacent random numbers in the frame-level random number set. The positions of each set of coordinate points in the Cartesian coordinate system are plotted, and adjacent coordinate points are connected to construct a frame-level polyline graph.

[0043] The original coordinate points are formed by using adjacent random numbers in the offset random number set. The positions of each set of coordinate points in the Cartesian coordinate system are plotted, and adjacent coordinate points are connected to construct a random polyline graph.

[0044] Randomly select a starting point from the frame-level polyline graph, and randomly select two ending points from the random polyline graph. Construct a line segment between the starting point and the two ending points as a bounding line segment, and extract the polygon constructed by the two bounding line segments as a polygon encryption graph to encrypt the video.

[0045] Specifically, the above also includes:

[0046] Generating random numbers: An analog signal is generated by the quantum entropy source in the optical quantum random number generator, and the analog signal is converted into a random number output;

[0047] Communication transmission: Transmitting encrypted communication data streams to the recipient's mobile phone.

[0048] The technical effects and advantages of this invention are as follows:

[0049] (1) By dividing the image data into regions, sensitive regions and remaining regions are distinguished. The remaining regions are processed by non-uniform block division and dynamic pixel value transformation based on the differential formula of random number parity. The sensitive regions are encrypted by secondary encryption through random color palette filling. Thus, a differentiated encryption strategy is implemented for the data to be transmitted by the user, achieving high-strength protection. While ensuring the security of sensitive information, redundant calculations in the remaining regions are reduced, and encryption efficiency is improved.

[0050] (2) By dividing the high-energy segment and the ordinary energy segment based on the energy threshold, the ordinary energy segment adopts lightweight encryption with triangle mapping and offset adjustment, while the high-energy segment is upgraded to enhanced encryption with spherical space mapping and three-dimensional rotation transformation. This not only meets the high security requirements of core information, but also adapts to the computing power limitations of real-time communication on mobile devices.

[0051] (3) By dynamically adjusting the length of random numbers according to the frame complexity, and by merging frame-level polylines with random polylines to generate polygonal encrypted graphics, the encrypted graphics are neither fixed in pattern nor strongly correlated with the video content features, effectively resisting attacks based on data statistical patterns. Attached Figure Description

[0052] Figure 1 This is a flowchart of the mobile phone encrypted communication method integrating an optical quantum random number generator according to the present invention;

[0053] Figure 2 This is a schematic diagram illustrating the construction of the polygon encryption graph of the present invention. Detailed Implementation

[0054] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0055] Example

[0056] like Figure 1 As shown, a mobile phone encrypted communication method integrating an optical quantum random number generator includes:

[0057] Generating random numbers: The analog signal is generated by the quantum entropy source in the optical quantum random number generator, and then converted into random numbers by the quantum signal acquisition and extraction module.

[0058] Communication encryption: Obtain random numbers generated by the optical quantum random number generator module, process the obtained random numbers according to the data type of the communication process using the encryption logic algorithm corresponding to different data types, and add them to the communication data stream for encryption; the data types include images, audio and video;

[0059] Specifically:

[0060] If the data type of the current communication process is an image, then the sensitive region pre-divided by the sender in the image is extracted. After the sensitive region is extracted from the image, two sets of random numbers are requested from the optical quantum random number generator for the remaining region, including the block random number set and the pixel transformation random number set.

[0061] Block random number set (length 256 bits): used for block partitioning rules;

[0062] Pixel transformation random number set (length = total number of pixels in the image × number of channels): one 8-bit random number (range 0~255) per pixel / channel, used for pixel value transformation;

[0063] 64-bit numbers are randomly selected from the set of block random numbers and the image is divided into non-uniform blocks; the first 64 bits generate the block size (e.g., 8×8~32×32, the block size dynamically changes with the distribution of random numbers), and each block is assigned a unique identifier (generated by 16-bit quantum random numbers).

[0064] After non-uniform block division, for each pixel in each block, an 8-bit binary random number is randomly selected from the set of random numbers for pixel transformation, and its least significant bit is taken as the encryption number, denoted by X. Based on the parity determination result of X, it is substituted into different set formulas to calculate the encrypted pixel value F corresponding to each pixel in each block, and then transformed.

[0065] Represented as Where Y is the original pixel value;

[0066] M is a random offset, which is obtained by calculating the average of the remaining 7 binary random numbers when X is odd, and by taking the highest value among the 7 binary random numbers when X is even.

[0067] This represents the random coefficient. When X is odd, it is obtained by taking the highest value of a 7-bit binary random number, dividing it by an integer two, and then rounding it. When X is even, it is obtained by taking the lowest value of a 7-bit binary random number, dividing it by an integer two, and then rounding it.

[0068] The entire block after pixel value transformation is scrambled, and the encrypted pixel value G is dynamically transformed for all three RGB channels of the image.

[0069] (The random numbers for each channel are independent and may have different parity.) For example, if a pixel in the R channel uses an odd number formula, the pixel in the same position in the G channel may use an even number formula, which will destroy the color correlation between channels.

[0070] The rules (such as parity judgment logic and coefficient generation method) are marked by a "key index" (composed of 16-bit quantum random numbers) and embedded in the image metadata area. The receiver can obtain the corresponding random number sequence and transformation rules from the pre-shared key pool through the index, without the need to transmit the complete random number (saving bandwidth).

[0071] For sensitive areas, a blank-filled image of the same size as the sensitive area is generated; each pixel position of the fill image is reserved with a mapping relationship with the original pixels of the sensitive area (marked by a 16-bit index) to ensure accurate reconstruction during decryption;

[0072] A new set of random numbers is requested from the optical quantum random number generator as a secondary encryption set; the length is "total number of pixels in the sensitive area × 3" (each of the three channels of each pixel corresponds to one random number), and each random number is 16 bits (range 0~65535), used to match the color range of the color palette;

[0073] Construct a color palette containing 256 color groups; covering the full RGB color gamut; each color in the color palette corresponds to a set range of random numbers;

[0074] Three random numbers are randomly selected from the secondary encryption set; each number is 16 bits long and corresponds to the R, G, and B channels respectively. Each random number in the secondary encryption set is matched with a set range to determine the color palette color corresponding to each random number. After matching, the color is written to the corresponding position in the blank-filled image to generate an encrypted image composed entirely of random color combinations.

[0075] For sensitive areas, after the first transformation, an additional "parity reversal" transformation is performed—if the odd formula is used in the first transformation, the second transformation forces the use of the even formula (based on newly generated random numbers to ensure parity reversal), thereby increasing the encryption strength of sensitive information;

[0076] By using "dynamic segmentation of the remaining area + parity transformation of pixel values ​​+ double encryption of sensitive areas + full-link drive of quantum random numbers", a three-layer security system of "spatial disorder - value transformation - feature masking" is constructed.

[0077] If the data type of the current communication process is audio, set the audio energy threshold according to the audio characteristics, extract audio segments that are higher than the energy threshold as high-energy segments, and use the remaining audio segments as ordinary-energy segments.

[0078] For the general energy range in audio, a set of random numbers is requested from the optical quantum random number generator as the general encryption set; the length is limited to 8-12 bits; the highest random number, the lowest random number, and the average of each set of random numbers are extracted from the general encryption set;

[0079] Calculate the average energy value of the general energy range, divide it by the preset adjustment value, and use the result as the adjustment factor k; the preset adjustment value is 100, which can be dynamically adjusted to ensure that k is between 1 and 5 and is positively correlated with the audio energy.

[0080] The highest random number, the lowest random number, and the mean of each group of random numbers are extracted and multiplied by the adjustment factor k to obtain the corrected encryption number one, encryption number two, and encryption number three, denoted by a1, a2, and a3. A triangle is constructed using a1, a2, and a3 as the three side lengths of the triangle, thereby determining the three interior angles of the triangle.

[0081] For audio sampling points in the general energy range, let them be set as a sequence. Grouping samples by area as integer multiples, and using the sine values ​​of the three interior angles as weighting coefficients for each group, a weighted permutation is applied to the sampling points in each group, where the j-th sampling point in the i-th group... Transform into ; Let each of the three interior angles represent its sine value; the values ​​are cycled to ensure reversibility.

[0082] Using the greatest common divisor of a1, a2, and a3 as the overall offset, the calculation is performed on all transformed sampling points according to the replacement order of adding and subtracting the overall offset; during decryption, the offset is reversed; thus completing the encryption of the general energy band;

[0083] For example, if the first set of sampling points is added to the overall offset, then the second set of sampling points is subtracted from the overall offset, and so on.

[0084] After encrypting the high-energy segment in the audio, the peak energy, duration, and frequency bandwidth are extracted from the high-energy segment and denoted as E1, E2, and E3.

[0085] E1, E2, and E3 are respectively based on the formula Perform calculations to determine the coordinates of the sphere's center. The coordinate range is controlled within ±200 to ensure uniform distribution of sampling points for sphere mapping; a set of random numbers within a set range is requested from the optical quantum random number generator; the set range is 1-5, and the numbers are integers; these serve as optimization coefficients.

[0086] The average of the three sets of values ​​a1, a2, and a3 is divided by the optimization coefficient, and the result is rounded off to obtain the radius R of the sphere.

[0087] A cryptographic sphere representing the current high-energy band is constructed using the sphere's center coordinates and radius. The sampling point sequence of the high-energy band is then mapped onto the sphere's surface. The sampling point sequence of the high-energy band is represented as follows: N is the total number of sampling points;

[0088] For the i-th sampling point, define: polar angle ; 0-π, covering the upper and lower hemispheres of the sphere; azimuth angle ; 0-2π, combined with the characteristics of the sampled values ​​themselves to enhance randomness;

[0089] Based on the center of the ball Given the radius R of the sphere, calculate the coordinates of the sphere surface corresponding to the sampling point, which is expressed as follows: Ensure coordinates are within Within the range, and evenly distributed;

[0090] Three sets of 16-bit random numbers are requested from the optical quantum random number generator. The three sets of random numbers are labeled as v1, v2 and v3 respectively, and the three sets of random numbers are converted into rotation angles around the x, y and z axes.

[0091] The conversion process is as follows: ;

[0092] For each sampling point, the sphere surface coordinates are rotated sequentially around the x, y, and z axes to obtain the encrypted coordinates; thus completing the encryption of the high-energy segment.

[0093] For example, rotating around the x-axis The rotation matrices around the y-axis and z-axis are similar; after three rotations are superimposed, the positions of the sampling points on the surface of the sphere are completely disrupted.

[0094] The spatial coordinates of the sampling points are completely disrupted by rotating the sphere, which destroys the continuity of the temporal domain. When the sampling points are mapped onto the surface of the sphere, their coordinates are directly related to the sampled values. Subsequent rotations indirectly affect the encryption logic of the values, making the values ​​deeply coupled with the spatial coordinates. After rotation, the sampling points are sorted and reorganized according to radial distance, replacing the original temporal sequence. Attackers cannot deduce the rhythm or accent position of the original audio through the time sequence.

[0095] This three-dimensional encryption completely destroys the statistical characteristics of the high-energy band (such as amplitude distribution, correlation between adjacent sampling points, and frequency components), thus improving the security of the encryption.

[0096] If the data type of the current communication process is video, then two sets of random numbers are requested from the optical quantum random number generator, denoted as the frame-level random number set and the offset random number set. The lengths of the frame-level random number set and the offset random number set change with the complexity of the current video frame, such as the sum of motion vectors.

[0097] The original coordinate points are formed by adjacent random numbers in the frame-level random number set. The positions of each set of coordinate points in the Cartesian coordinate system are plotted, and adjacent coordinate points are connected to construct a frame-level polyline graph.

[0098] The original coordinate points are formed by using adjacent random numbers in the offset random number set. The positions of each set of coordinate points in the Cartesian coordinate system are plotted, and adjacent coordinate points are connected to construct a random polyline graph.

[0099] The coordinate range is limited to 0-511 to ensure that the polyline is evenly distributed in the plane;

[0100] Randomly select a starting point from a frame-level polyline graph, and randomly select two ending points from a random polyline graph; the two sets of ending points are not repeated; construct a line segment between the starting point and the two ending points as a bounding line segment, and extract the polygon constructed by the two bounding line segments as a polygon encryption graph to encrypt the video.

[0101] The encrypted graphic consists of a polygon constructed from a frame-level polyline starting point and two random polyline ending points: the starting point comes from the frame-level polyline, and the ending points come from random polylines. The randomness of the two originates independently and is unrelated. The shape of the polygon is determined by the relative positions of the three points, and the selection of the three points is completely random (randomly selected starting point + random selected two ending points). The combination space grows exponentially with the length of the random number, making it impossible for attackers to reconstruct the graphic through brute force enumeration.

[0102] The extraction of polygons further breaks the continuous correlation of the original polylines, making the encrypted graphics have neither a fixed shape nor a spatial distribution pattern.

[0103] Communication transmission: The encrypted communication data stream is transmitted to the receiving mobile phone using the mobile phone's modem;

[0104] Decryption output: After the receiving mobile phone receives the communication data stream through the MODEM, the decoder decodes the encrypted data and outputs the decrypted data to complete the presentation of the communication content;

[0105] The above formulas are all dimensionless calculations. Dimensionless calculations can be performed using various methods such as standardization, which will not be elaborated here. The formulas are derived from software simulations based on a large amount of collected data, and the preset parameters in the formulas can be set by those skilled in the art according to the actual situation.

[0106] The above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. The available medium can be a magnetic medium (e.g., floppy disk, ATA hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. The semiconductor medium can be a solid-state ATA hard disk.

[0107] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0108] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0109] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0110] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment, depending on actual needs.

[0111] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0112] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable ATA hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0113] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A mobile phone encrypted communication method integrating an optical quantum random number generator, characterized in that, include: Communication encryption: Obtain random numbers generated by an optical quantum random number generator, process the obtained random numbers according to the data type of the communication process using encryption logic algorithms corresponding to different data types, and add them to the communication data stream for encryption; the data types include images, audio and video; The process of encrypting the image is as follows: If the data type of the current communication process is an image, then the sensitive region pre-divided by the sender in the image is extracted. After the sensitive region is extracted from the image, two sets of random numbers are requested from the optical quantum random number generator for the remaining region, including the block random number set and the pixel transformation random number set. The block random number set, with a length of 256 bits, is used for the block division rules; A set of random numbers for pixel transformation, with a length equal to the total number of pixels in the image multiplied by the number of channels: each pixel / channel corresponds to one 8-bit random number, ranging from 0 to 255, used for pixel value transformation; Randomly select 64-bit numbers from the block random number set and perform non-uniform block division on the image; After non-uniform block division, for each pixel in each block, an 8-bit binary random number is randomly selected from the set of random numbers for pixel transformation, and its least significant bit is taken as the encryption number, denoted by X. Based on the parity determination result of X, it is substituted into different set formulas to calculate the encrypted pixel value F corresponding to each pixel in each block, and then transformed. Represented as Where Y is the original pixel value; M is a random offset, which is obtained by calculating the average of the remaining 7 binary random numbers when X is odd, and by taking the highest value among the 7 binary random numbers when X is even. This represents the random coefficient. When X is odd, it is obtained by taking the highest value of a 7-bit binary random number, dividing it by an integer two, and then rounding it. When X is even, it is obtained by taking the lowest value of a 7-bit binary random number, dividing it by an integer two, and then rounding it. The entire block after pixel value transformation is scrambled, and the encrypted pixel value G is dynamically transformed for all three RGB channels of the image. For sensitive areas, generate a blank-filled image the same size as the sensitive area; request a new set of random numbers from the optical quantum random number generator as a secondary encryption set; the length is "total number of pixels in the sensitive area × 3", each of the three channels of each pixel corresponds to one random number, each random number is 16 bits, ranging from 0 to 65535, and is used to match the color range of the color palette; Construct a color palette containing 256 color groups, with each color group corresponding to a set range of random numbers. Randomly select three 16-bit random numbers from the secondary encryption set, corresponding to the R, G, and B channels respectively. Match each random number in the secondary encryption set with the set range to determine the color palette color corresponding to each random number. After matching, write the color to the corresponding position in the blank-filled image to generate an encrypted image composed entirely of random color combinations. The process of encrypting the audio is as follows: If the data type of the current communication process is audio, set an energy threshold for the audio, extract audio segments that are higher than the energy threshold as high-energy segments, and use the remaining audio segments as ordinary-energy segments; For the general energy range in audio, a set of random numbers is requested from the optical quantum random number generator as the general encryption set; the length of the general encryption set is limited to 8-12 bits; the highest random number, the lowest random number, and the average of each set of random numbers are extracted from the general encryption set; Calculate the average energy value of the general energy range, divide it by the preset adjustment value, and use the result as the adjustment factor k. The preset adjustment value is 100, which can be dynamically adjusted to ensure that k is between 1 and 5 and is positively correlated with audio energy. The highest random number, the lowest random number, and the mean of each group of random numbers are extracted and multiplied by the adjustment factor k to obtain the corrected encryption number one, encryption number two, and encryption number three, denoted by a1, a2, and a3. A triangle is constructed using a1, a2, and a3 as the three side lengths of the triangle, thereby determining the three interior angles of the triangle. For audio sampling points in the general energy range, let them be set as a sequence. Grouping samples by area as integer multiples, and using the sine values ​​of the three interior angles as weighting coefficients for each group, a weighted permutation is applied to the sampling points in each group, where the j-th sampling point in the i-th group... Transform into ; These represent the sine values ​​of the three interior angles; Using the greatest common divisor of a1, a2, and a3 as the overall offset, the calculation is performed on all transformed sampling points according to the replacement order of adding or subtracting the overall offset; After encrypting the high-energy segment in the audio, the peak energy, duration, and frequency bandwidth are extracted from the high-energy segment and denoted as E1, E2, and E3. E1, E2, and E3 are respectively based on the formula Perform calculations to determine the coordinates of the sphere's center. ; The coordinate range is controlled within ±200 to ensure that the sampling points of the sphere mapping are evenly distributed; a set of random numbers within the set range is requested from the optical quantum random number generator as optimization coefficients; The average of the three sets of values ​​a1, a2, and a3 is divided by the optimization coefficient, and the result is rounded off to obtain the radius R of the sphere. A cryptographic sphere representing the current high-energy band is constructed using the sphere's center coordinates and radius. The sampling point sequence of the high-energy band is then mapped onto the sphere's surface. The sampling point sequence of the high-energy band is represented as follows: N is the total number of sampling points; For the i-th sampling point, define: polar angle azimuth ; Based on the center of the ball Given the radius R of the sphere, calculate the coordinates of the sphere surface corresponding to the sampling point, which is expressed as follows: ; Coordinates on the surface of the sphere Within the range, and evenly distributed; Three sets of 16-bit random numbers are requested from the optical quantum random number generator. The three sets of random numbers are labeled as v1, v2 and v3 respectively, and the three sets of random numbers are converted into rotation angles around the x, y and z axes. The conversion process is as follows: ; For each sampling point, the sphere surface coordinates are rotated sequentially around the x, y, and z axes to obtain the encrypted coordinates; The process of encrypting the video is as follows: If the data type of the current communication process is video, then two sets of random numbers are requested from the optical quantum random number generator, denoted as the frame-level random number set and the offset random number set; The original coordinate points are formed by adjacent random numbers in the frame-level random number set. The positions of each set of coordinate points in the Cartesian coordinate system are plotted, and adjacent coordinate points are connected to construct a frame-level polyline graph. The original coordinate points are formed by using adjacent random numbers in the offset random number set. The positions of each set of coordinate points in the Cartesian coordinate system are plotted, and adjacent coordinate points are connected to construct a random polyline graph. The coordinate range is limited to 0-511 to ensure that the polyline is evenly distributed in the plane; Randomly select a starting point from the frame-level polyline graph, and randomly select two ending points from the random polyline graph. Construct a line segment between the starting point and the two ending points as a bounding line segment, and extract the polygon constructed by the two bounding line segments as a polygon encryption graphic to encrypt the video. Decryption output: After receiving the communication data stream, the receiving mobile phone decodes the encrypted data and outputs the decrypted data to complete the presentation of the communication content.

2. The mobile phone encrypted communication method using an integrated optical quantum random number generator according to claim 1, characterized in that, The description also includes: Generating random numbers: An analog signal is generated by the quantum entropy source in the optical quantum random number generator, and the analog signal is converted into a random number output; Communication transmission: Transmitting encrypted communication data streams to the recipient's mobile phone.

Images