Security authentication method and device based on quantum random number, and electronic equipment
By acquiring quantum noise through a quantum random number generator to generate a true random number sequence for security authentication, the problem of random number generation seeds being reverse-analyzed in existing technologies is solved, improving the randomness and unpredictability of security authentication and enhancing the security of mobile banking systems.
Patent Information
- Application Number
- CN202511723417.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-11-21
- Publication Date
- 2026-02-24
AI Technical Summary
In existing technologies, random number generation relies on deterministic algorithms, whose seeds can be reverse-engineered, posing a risk of security authentication being compromised.
Quantum noise, including photon polarization states and vacuum fluctuations, is obtained through a quantum random number generator. A true random number sequence is generated by analog-to-digital conversion, and a portion of the sequence is extracted for security authentication based on the type of security authentication request.
It significantly enhances the randomness and unpredictability of security authentication, reduces the possibility of attackers making predictions by analyzing random number seeds, and improves the security of mobile banking systems.
Smart Images

Figure CN121567326A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of privacy computing technology, and more specifically, to a secure authentication method, apparatus, computer-readable storage medium, and electronic device based on quantum random numbers. Background Technology
[0002] In the mobile internet era, with continuous technological advancements, the performance of traditional computers is constantly improving, especially with the development of quantum computers. This makes brute-force attacks on passwords and verification codes initiated over the internet increasingly faster, leading to a more severe cybersecurity situation. Mobile banking, as the primary channel for commercial banks to reach customers in the mobile internet era, faces immense pressure regarding both performance and security. Important transactions even require the use of multiple security authentication methods to enhance security.
[0003] In existing secure authentication processes, random number generation relies on deterministic algorithms, whose seeds can be reverse-engineered, posing a risk of attackers cracking CAPTCHAs and transaction passwords. For example, if an attacker obtains the random number seed through a side channel, they can predict the future random number sequence. Summary of the Invention
[0004] The main objective of this application is to provide a secure authentication method, device, computer-readable storage medium, and electronic device based on quantum random numbers, so as to at least solve the problem that in the prior art, random number generation depends on deterministic algorithms, and the seeds can be reverse-analyzed, which leads to the risk of security authentication being cracked.
[0005] To achieve the above objectives, according to one aspect of this application, a security authentication method based on quantum random numbers is provided, comprising: acquiring quantum noise through a quantum random number generator, the quantum noise including at least photon polarization states and vacuum fluctuations; performing analog-to-digital conversion on the quantum noise and generating a true random number sequence based on the converted quantum noise to obtain a first target sequence; upon receiving a security authentication request, truncating the first target sequence according to the type of the security authentication request to obtain a second target sequence; and sending the second target sequence to a target terminal to complete the security authentication.
[0006] Optionally, quantum noise is obtained through a quantum random number generator, including: controlling a single-photon detector to measure the polarization direction of a photon as it passes through a polarization beam splitter to obtain a first quantum noise of the photon polarization state; controlling a superconducting nanowire photon detector to measure quantum fluctuation noise in a vacuum state to obtain a second quantum noise of vacuum fluctuations; obtaining thermal noise of the semiconductor material and the original noise generated by quantum tunneling effect to obtain a third quantum noise; and determining one or more of the first quantum noise, the second quantum noise, and the third quantum noise as the quantum noise.
[0007] Optionally, the quantum noise is subjected to analog-to-digital conversion, and a true random number sequence is generated based on the converted quantum noise to obtain a first target sequence. This includes: converting the quantum noise into binary code using an ADC converter to obtain a first noise sequence; removing statistical bias in the first noise sequence using a von Neumann debiasing algorithm to obtain a second noise sequence; performing a hash operation on the second noise sequence using the SM3 algorithm to obtain the true random number sequence; determining the time consumed in generating the true random number sequence to obtain a target time; and determining the true random number sequence as the first target sequence if the target time is less than or equal to a first threshold.
[0008] Optionally, after performing analog-to-digital conversion on the quantum noise and generating a true random number sequence based on the converted quantum noise, the method further includes: encrypting the true random number sequence using the SM4 algorithm to obtain an encrypted random number sequence; and storing the encrypted random number sequence in a Redis cluster using an LRU caching algorithm.
[0009] Optionally, the process of performing analog-to-digital conversion on the quantum noise and generating a true random number sequence based on the converted quantum noise to obtain the first target sequence further includes: determining that the true random number sequence generation is abnormal when the target duration exceeds the first threshold; extracting random data from a hardware entropy pool when the true random number sequence generation is abnormal, the random data including CPU clock jitter, network traffic changes, keyboard key presses and mouse movements; obtaining the timestamp of the current moment and concatenating the timestamp and the random data to form a random number seed; generating a pseudo-random number sequence based on the random number seed using a stream cipher algorithm, and determining the pseudo-random number sequence as the first target sequence.
[0010] Optionally, the second target sequence is obtained by truncating the first target sequence according to the type of the security authentication request, including: when the security authentication request is SMS verification, truncating the first target sequence with a first preset step size to obtain the second target sequence; when the security authentication request is transaction password verification, truncating the first target sequence with a second preset step size to obtain the second target sequence; when the security authentication request is data encryption request, truncating the first target sequence with a third preset step size to obtain the second target sequence.
[0011] Optionally, upon receiving a security authentication request, after extracting a first target sequence according to the type of the security authentication request to obtain a second target sequence, the method further includes: if the security authentication request is the data encryption request, using the second target sequence and the data to be encrypted as input data and encrypting them using an encryption algorithm to obtain encrypted ciphertext; and sending the second target sequence and the encrypted ciphertext to the target terminal.
[0012] According to another aspect of this application, a security authentication device based on quantum random numbers is provided, comprising: an acquisition unit for acquiring quantum noise through a quantum random number generator, the quantum noise including at least photon polarization states and vacuum fluctuations; a first processing unit for performing analog-to-digital conversion on the quantum noise and generating a true random number sequence based on the converted quantum noise to obtain a first target sequence; a second processing unit for, upon receiving a security authentication request, truncating the first target sequence according to the type of the security authentication request to obtain a second target sequence; and a first sending unit for sending the second target sequence to a target terminal to complete the security authentication.
[0013] According to another aspect of this application, a computer-readable storage medium is provided, the computer-readable storage medium including a stored program, wherein, when the program is executed, it controls the device on which the computer-readable storage medium is located to perform any of the methods described.
[0014] According to another aspect of this application, an electronic device is provided, comprising: one or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including methods for performing any one of the methods described.
[0015] Applying the technical solution of this application, in the aforementioned quantum random number-based security authentication method, firstly, quantum noise is acquired through a quantum random number generator. This quantum noise includes at least photon polarization states and vacuum fluctuations. Then, the quantum noise is converted from analog to digital, and a true random number sequence is generated based on the converted quantum noise to obtain a first target sequence. Subsequently, upon receiving a security authentication request, the first target sequence is truncated according to the type of the security authentication request to obtain a second target sequence. Finally, the second target sequence is sent to the target terminal to complete the security authentication. This application introduces a hybrid quantum noise acquisition technology, including photon polarization states and vacuum fluctuations, to acquire quantum noise. By encoding the quantum noise to obtain a true random number sequence, and performing security authentication based on this true random number sequence, it eliminates the predictability defects of traditional pseudo-random numbers. This addresses the problem in existing technologies where random number generation relies on deterministic algorithms, and the seed can be reverse-analyzed, leading to the risk of security authentication being compromised. Attached Figure Description
[0016] Figure 1 A hardware structure block diagram of a mobile terminal for a quantum random number-based security authentication method provided in an embodiment of this application is shown.
[0017] Figure 2 A schematic flowchart of a quantum random number-based security authentication method according to an embodiment of this application is shown.
[0018] Figure 3 A structural block diagram of a quantum random number-based security authentication device provided according to an embodiment of this application is shown.
[0019] The above figures include the following reference numerals:
[0020] 102. Processor; 104. Memory; 106. Transmission device; 108. Input / output device. Detailed Implementation
[0021] It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other. This application will now be described in detail with reference to the accompanying drawings and embodiments.
[0022] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort should fall within the scope of protection of the present application.
[0023] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate for the embodiments of this application described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.
[0024] As described in the background section, the random number generation process in existing security authentication technologies relies on deterministic algorithms, whose seeds can be reverse-engineered, leading to the risk of attackers cracking CAPTCHAs, transaction passwords, etc. For example, if an attacker obtains the random number seed through a side channel, they can predict the future random number sequence. To address the problem that existing technologies rely on deterministic algorithms for random number generation, and whose seeds can be reverse-engineered, resulting in the risk of security authentication being compromised, embodiments of this application provide a security authentication method, apparatus, computer-readable storage medium, and electronic device based on quantum random numbers.
[0025] The technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
[0026] The methods and embodiments provided in this application can be executed on a mobile terminal, computer terminal, or similar computing device. Taking running on a mobile terminal as an example, Figure 1 This is a hardware structure block diagram of a mobile terminal using a quantum random number-based security authentication method according to an embodiment of the present invention. Figure 1 As shown, a mobile terminal may include one or more ( Figure 1 Only one is shown in the diagram. A processor 102 (which may include, but is not limited to, a microprocessor MCU or a programmable logic device FPGA, etc.) and a memory 104 for storing data are also shown. The mobile terminal may further include a transmission device 106 for communication functions and an input / output device 108. Those skilled in the art will understand that... Figure 1 The structure shown is for illustrative purposes only and does not limit the structure of the mobile terminal described above. For example, the mobile terminal may also include components that are more... Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown.
[0027] The memory 104 can be used to store computer programs, such as application software programs and modules, like the computer program corresponding to the quantum random number-based security authentication method in this embodiment of the invention. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, thereby implementing the above-described method. The memory 104 may include high-speed random access memory and non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory remotely located relative to the processor 102, and these remote memories can be connected to the mobile terminal via a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof. The transmission device 106 is used to receive or send data via a network. Specific examples of the aforementioned networks may include wireless networks provided by the mobile terminal's communication provider. In one example, the transmission device 106 includes a network interface controller (NIC), which can be connected to other network devices via a base station to communicate with the Internet. In one example, the transmission device 106 may be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.
[0028] This embodiment provides a quantum random number-based security authentication method that runs on a mobile terminal, computer terminal, or similar computing device. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Also, although the logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.
[0029] Figure 2 This is a flowchart of a quantum random number-based security authentication method according to an embodiment of this application. Figure 2 As shown, the method includes the following steps:
[0030] Step S201: Obtain quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations.
[0031] Understandably, the generation principle of quantum random numbers is based on the uncertainty principle in quantum mechanics, which states that at the quantum scale, the state of particles (such as the polarization direction of photons, vacuum fluctuations, etc.) is unpredictable. This provides the physical basis for generating truly random numbers. By collecting these unpredictable quantum phenomena, it is possible to generate irregular sequences of random numbers.
[0032] Specifically, a quantum random number generator is used to collect quantum noise, which includes at least two noise sources: photon polarization state and vacuum fluctuation.
[0033] Step S202: Perform analog-to-digital conversion on the quantum noise, and generate a true random number sequence based on the converted quantum noise to obtain the first target sequence;
[0034] Specifically, the collected quantum noise signal is first converted into a digital signal by an analog-to-digital converter (ADC) to obtain the first target sequence mentioned above.
[0035] In one embodiment, during photon polarization state acquisition, a single-photon detector is used to measure the photon polarization direction (horizontal or vertical) passing through a polarization beam splitter, and these directions are converted into binary bits, i.e., horizontal is 0 and vertical is 1.
[0036] In another embodiment, during vacuum fluctuation acquisition, quantum fluctuation noise in the vacuum state is measured by a superconducting nanowire single-photon detector and converted into a binary signal.
[0037] Step S203: Upon receiving a security authentication request, the first target sequence is extracted according to the type of the security authentication request to obtain the second target sequence;
[0038] Specifically, upon receiving a security authentication request, a portion of the first target sequence is extracted based on the request type (such as SMS verification code, transaction password, keypad, etc.) to obtain the second target sequence. For example, for an SMS verification code request, which is typically a 6-digit random verification code, the first 6 bytes of a true random number sequence are extracted to generate a 6-digit verification code.
[0039] Step S204: Send the second target sequence to the target terminal to complete security authentication.
[0040] Specifically, the second target sequence is sent to the target terminal (such as a mobile banking client). The user receives and inputs the sequence on the terminal. The system verifies whether the sequence input by the user is consistent with the sent sequence. If they are consistent, the authentication is successful; otherwise, the authentication fails.
[0041] For example, after receiving a verification code via SMS, the user enters it into the mobile banking app, and the system retrieves the original sequence from the session for comparison and verification.
[0042] Through the above embodiments, the generation of true random numbers based on quantum physics principles significantly enhances the randomness and unpredictability of security authentication, greatly reducing the possibility of attackers making predictions by analyzing random number seeds, and improving the security of mobile banking systems.
[0043] In this embodiment, firstly, quantum noise, including at least photon polarization states and vacuum fluctuations, is acquired using a quantum random number generator. Then, the quantum noise is converted from analog to digital, and a true random number sequence is generated based on the converted quantum noise to obtain a first target sequence. Subsequently, upon receiving a security authentication request, the first target sequence is truncated according to the type of the security authentication request to obtain a second target sequence. Finally, the second target sequence is sent to the target terminal to complete the security authentication. This application introduces a hybrid quantum noise acquisition technology, including photon polarization states and vacuum fluctuations, to acquire quantum noise. By encoding the quantum noise to obtain a true random number sequence, and performing security authentication based on the true random number sequence, it eliminates the predictability defects of traditional pseudo-random numbers. This addresses the problem in existing technologies where random number generation relies on deterministic algorithms, and the seeds can be reverse-analyzed, leading to the risk of security authentication being compromised.
[0044] In order to randomly generate quantum noise, in one optional implementation, step S201 above includes:
[0045] Step S2011: Control the single-photon detector to measure the polarization direction of the photon when it passes through the polarization beam splitter, and obtain the first quantum noise of the photon polarization state;
[0046] Specifically, a single-photon detector (such as a photomultiplier tube or a superconducting nanowire single-photon detector) is used to measure the polarization direction of photons passing through a polarization beamsplitter. When a photon passes through the polarization beamsplitter, its polarization direction will randomly be divided into two states: "horizontal" or "vertical," which is the first quantum noise mentioned above.
[0047] Step S2012: Control the superconducting nanowire photon detector to measure the quantum fluctuation noise in the vacuum state and obtain the second quantum noise of the vacuum fluctuation;
[0048] Specifically, a superconducting nanowire single-photon detector is used, which is extremely sensitive to photons or other particles and can detect minute changes in quantum states. The quantum fluctuation noise in the vacuum state, i.e., the tiny fluctuations caused by quantum uncertainty, is obtained as described above as the second quantum noise.
[0049] Step S2013: Obtain the thermal noise of the semiconductor material and the original noise generated by the quantum tunneling effect to obtain the third quantum noise;
[0050] Specifically, semiconductor materials generate thermal noise at room temperature, and the quantum tunneling effect also produces randomness. By using a semiconductor noise acquisition chip, the original noise signal generated by this thermal noise and quantum tunneling effect can be directly obtained, thus obtaining the aforementioned third quantum noise.
[0051] Step S2014: Determine one or more of the first quantum noise, the second quantum noise, and the third quantum noise as quantum noise.
[0052] Specifically, depending on the actual needs, the first, second, or third quantum noise can be used individually, or one or more of them can be combined to obtain the aforementioned quantum noise. It is understandable that combining different quantum noise sources can improve the quality and security of random numbers, as this increases data entropy and reduces the risk of being hacked. When combining, quantum noise from different sources can be synthesized through bit operations or data concatenation to ensure that the generated random number sequence is both long and complex.
[0053] Through the above embodiments, by collecting photon polarization states, vacuum fluctuation noise, semiconductor thermal noise, and quantum tunneling effects, this application can generate truly random number sequences with extremely high entropy values, significantly improving security compared to random numbers generated solely based on classical algorithms (such as pseudo-random number generators). Even with the increasing power of quantum computing, the random numbers generated by this scheme are difficult to predict and crack, greatly enhancing system security. Simultaneously collecting multiple types of quantum noise provides a more stable and reliable random number source. Even if one noise source fails, other noise sources can still guarantee random number generation, thereby reducing the risk of system failure. Multiple quantum noise sources can be flexibly combined, which not only improves the flexibility of random number generation but also provides the possibility of accessing and expanding to possible new quantum noise sources in the future.
[0054] In an optional implementation, to convert quantum noise into a random number sequence, step S202 above includes:
[0055] Step S2021: The quantum noise is converted into binary code using an ADC converter to obtain the first noise sequence;
[0056] Understandably, directly collected raw quantum data may contain statistical biases. Therefore, post-processing algorithms (such as the von Neumann debiasing algorithm) are needed to eliminate these biases and ensure a uniform distribution of the random number sequence. Finally, further processing of the debiased data using a hash function (such as the SM3 algorithm) yields high-quality true random numbers.
[0057] Specifically, the acquired quantum noise signal is converted into binary code by an ADC (analog-to-digital converter) to form the first noise sequence. For example, a continuous electrical signal acquired based on the photon polarization state is converted into a series of 0s and 1s by the ADC, where 0 may represent the "horizontal" polarization direction of the photon, and 1 represents the "vertical" polarization direction.
[0058] Step S2022: Remove the statistical bias in the first noise sequence using the von Neumann debiasing algorithm to obtain the second noise sequence;
[0059] Specifically, the von Neumann debiasing algorithm is used to process the first noise sequence to remove statistical bias, thus obtaining the second noise sequence.
[0060] Understandably, the von Neumann debiasing algorithm treats two consecutive noise bits as a group and determines whether to output a random bit based on their combination. For example, if a combination of "01" or "10" is detected, the first bit is output; if a combination of "00" or "11" is detected, it is ignored. This eliminates the correlation and bias in the noise sequence, resulting in a more uniformly distributed sequence.
[0061] Step S2023: The SM3 algorithm is used to perform a hash operation on the second noise sequence to obtain a true random number sequence;
[0062] Specifically, the SM3 algorithm is used to hash the second noise sequence to generate a truly random number sequence, i.e., the first target sequence. The SM3 algorithm is a secure hash function that can transform an input of arbitrary length into a fixed-length output while ensuring the randomness of the output. Through hashing, potential biases can be further eliminated, the entropy of the random sequence can be increased, and the quality of the random numbers can be ensured.
[0063] Step S2024: Determine the time required to generate the true random number sequence, obtain the target time, and determine the true random number sequence as the first target sequence if the target time is less than or equal to the first threshold.
[0064] Specifically, the time consumed in generating the true random number sequence is monitored to obtain the target duration. In one embodiment, the first threshold is monitored as 500ms. If the target duration is less than or equal to the first threshold, the generated true random number sequence is determined as the first target sequence for subsequent security authentication services.
[0065] Through the above embodiments, the generated true random number sequence, after analog-to-digital conversion, bias removal, and hashing, possesses extremely high randomness and unpredictability, significantly enhancing the strength of mobile banking security authentication. Even with enhanced quantum computing capabilities, it is difficult to predict future random number sequences by analyzing the random number generation mechanism, thus protecting user transaction security. The monitoring mechanism for the target duration and the first threshold effectively ensures that the generation speed of quantum random numbers is fast enough to meet the needs of high-concurrency mobile banking transaction scenarios, avoiding user experience issues or transaction delays caused by slow generation speed. The use of the SM3 algorithm also ensures that the generated random number sequence can resist various types of attacks, including traditional computational attacks and potential future quantum computing attacks.
[0066] To ensure the security of the true random number sequence seed, in one optional implementation, after performing analog-to-digital conversion on the quantum noise and generating a true random number sequence based on the converted quantum noise, the method further includes:
[0067] Step S301: Encrypt the true random number sequence using the SM4 algorithm to obtain an encrypted random number sequence;
[0068] Specifically, SM4 is a block cipher algorithm that uses a 128-bit key to encrypt 128-bit blocks of data. Its security is based on complex mathematical operations and key scheduling, effectively preventing unauthorized access and data leakage. After the quantum random number module generates a truly random number sequence, the SM4 algorithm is used to encrypt the sequence. The specific encryption process is as follows:
[0069] First, a 128-bit key is generated. This key can be another set of quantum random numbers generated by the quantum random number module, or a pre-set static key. Then, the true random number sequence (128 bits or longer) is divided into 128-bit segments. Each segment is encrypted using the SM4 algorithm to generate an encrypted random number sequence. Assuming the generated true random number sequence is 256 bits, it can be divided into two 128-bit segments. Both segments are then encrypted using the SM4 algorithm to obtain encrypted 256-bit sequences.
[0070] Step S302: Store the encrypted random number sequence to the Redis cluster using the LRU caching algorithm.
[0071] Specifically, LRU is a memory management strategy used to store the most recently accessed data items within a limited cache space. When the cache reaches its maximum capacity, the LRU algorithm removes the least recently accessed data item to make room for new data items, thereby improving the cache hit rate. The encrypted random number sequence is stored in the Redis cluster cache, managed using the LRU caching algorithm. Redis cluster is a high-performance key-value store system that provides high-speed data access capabilities, suitable for storing and managing large amounts of encrypted random number sequences. The LRU caching algorithm ensures that the least recently used data is replaced first, thus preserving the latest or most frequently used encrypted random number sequence.
[0072] Through the above embodiments, the security of quantum random numbers during storage and transmission is ensured by using the SM4 encryption algorithm. Even if the data is intercepted, a truly random number sequence cannot be obtained without decryption by a legitimate authorized party, effectively preventing data leakage and man-in-the-middle attacks. The LRU caching management strategy can quickly locate and provide the most recently or most frequently used encrypted random number sequence in the Redis cluster, reducing the computational cost of generating random numbers each time and speeding up system response. This caching strategy is particularly effective in scenarios with high-frequency transactions or dense security authentication requests. The Redis cluster, combined with the use of the LRU algorithm, achieves effective management and allocation of memory resources. Retaining the latest and most frequently used data in the cache can significantly reduce the probability of repeated calculations, save CPU and I / O resources, and improve the overall system efficiency. The Redis cluster provides distributed storage and high availability. Even if one server fails, other servers can continue to provide services, ensuring the continuity and stability of the quantum random number service. In addition, the introduction of the LRU caching algorithm also provides a flexible solution for possible future system expansion and optimization.
[0073] To complete security authentication in the event of a timeout in true random number generation, in an optional implementation, step S202 further includes:
[0074] Step S2025: If the target duration is greater than the first threshold, determine that the generation of the true random number sequence is abnormal;
[0075] Specifically, if the time taken to generate a true random number sequence is greater than a preset first threshold (e.g., 500ms), the system determines that the quantum random number generation is abnormal.
[0076] Step S2026: In the event of an anomaly in the generation of the true random number sequence, random data is extracted from the hardware entropy pool. The random data includes CPU clock jitter, network traffic changes, keyboard key presses and mouse movements.
[0077] Specifically, when a true random number generation anomaly occurs, the system extracts random data from the hardware entropy pool. This data includes, but is not limited to, information such as CPU clock jitter, network traffic changes, keyboard key presses, and mouse movements.
[0078] CPU clock jitter refers to the slight difference between the actual clock frequency and the ideal clock frequency of a CPU due to manufacturing variations, temperature changes, etc. Network traffic variation refers to the change in the interval between network data packet arrivals; this variation is usually unpredictable. User behavior data such as keyboard key presses and mouse movements also contain a degree of randomness and can be considered a source of entropy.
[0079] Step S2027: Obtain the timestamp of the current moment, and concatenate the timestamp and randomness data to form a random number seed;
[0080] Specifically, a high-precision timestamp (accurate to nanoseconds) is obtained for the current moment. This timestamp contains information about minute changes in time, increasing randomness. The timestamp is then concatenated with random data extracted from the hardware entropy pool to form a composite random number seed. For example, assuming the current time is 1682487335.123456789 nanoseconds, and the system detects entropy values X, Y, and Z for CPU clock jitter and network traffic changes, respectively, then the random number seed can be represented as: S = [1682487335123456789, X, Y, Z].
[0081] Step S2028: Generate a pseudo-random number sequence based on the random number seed using a stream cipher algorithm, and determine the pseudo-random number sequence as the first target sequence.
[0082] Specifically, stream cipher algorithms, such as ChaCha20 and AES-CTR, are used to generate a pseudo-random number sequence based on the aforementioned random number seed. This sequence serves as a substitute for the first target sequence. The principle of stream cipher algorithms is to generate a pseudo-random stream using a key and an initialization vector (IV), and then perform a bitwise XOR operation between this stream and the plaintext to obtain the ciphertext.
[0083] Understandably, when quantum random number generation encounters technical limitations (such as slow generation speed) or malfunctions, the system needs an emergency mechanism to maintain the continuity and security of random number supply. Among these, the pseudo-random number generator (PRNG), as a classic algorithm, can generate seemingly random sequences of numbers even without a truly random source. When quantum random number generation malfunctions, the system can generate a random number seed by combining its own hardware entropy sources (such as CPU clock jitter, network traffic changes, etc.), and then use a stream cipher algorithm to generate a pseudo-random number sequence as a temporary substitute.
[0084] Through the above embodiments, although the pseudo-random number sequence is not truly random, it possesses high entropy and unpredictability due to the use of a large amount of hardware entropy source information and the combination of high-precision timestamps. This effectively resists common prediction attacks and ensures system security in emergency situations. The pseudo-random number generation mechanism is activated as a fallback strategy in case of quantum random number generation anomalies. This mechanism ensures uninterrupted service until the quantum random number module recovers, achieving a smooth transition from quantum random numbers to pseudo-random numbers and reducing inconvenience caused to users by sudden failures.
[0085] In order to obtain a random number sequence for verification, in one optional implementation, step S203 above includes:
[0086] Step S2031: When the security authentication request is SMS verification, the first target sequence is intercepted with a first preset step size to obtain the second target sequence;
[0087] Specifically, when the security authentication request is SMS verification, the system extracts the first target sequence with a first preset step size (e.g., 6 digits, corresponding to 6 bytes) to obtain the second target sequence suitable for SMS verification code.
[0088] Step S2032: If the security authentication request is a transaction password verification, the first target sequence is truncated with a second preset step size to obtain the second target sequence;
[0089] Specifically, when the security authentication request is for transaction password verification, the system extracts the first target sequence with a second preset step size (e.g., 16 bytes) to obtain a second target sequence suitable for the transaction password.
[0090] Step S2033: If the security authentication request is a data encryption request, the first target sequence is truncated with a third preset step size to obtain the second target sequence.
[0091] Specifically, when the security authentication request is for data encryption, the system extracts the first target sequence with a third preset step size (e.g., 128 bits) to obtain a second target sequence suitable for data encryption.
[0092] Through the above embodiments, by truncating true random number sequences of appropriate lengths according to different security authentication request types, it is possible to meet the security requirements of different scenarios while ensuring the adaptability and flexibility of the system. A reasonable truncation strategy avoids resource waste, and the preset truncation step size matches the format requirements of existing security authentication systems, ensuring seamless integration of new technologies and traditional authentication methods, and improving the system's compatibility and ease of use.
[0093] To perform keyboard encryption using a true random number sequence, in one optional implementation, upon receiving a security authentication request, after truncating a first target sequence according to the type of the security authentication request to obtain a second target sequence, the method further includes:
[0094] Step S401: When the security authentication request is a data encryption request, the second target sequence and the data to be encrypted are used as input data and encrypted using an encryption algorithm to obtain encrypted ciphertext;
[0095] Specifically, when the security authentication request is a data encryption request, the second target sequence is used as the encryption key, combined with the data to be encrypted, and encrypted using the selected encryption algorithm. Any symmetric encryption algorithm (such as AES, SM4) or asymmetric encryption algorithm (such as RSA) can be used, but considering efficiency and security, symmetric encryption algorithms are usually preferred. The encryption algorithm takes the key and plaintext data as input and generates encrypted ciphertext through a series of complex mathematical operations. For example, the AES algorithm uses different parts of the key to perform XOR operations with the data in each iteration, and performs substitution and permutation operations to finally generate ciphertext.
[0096] Step S402: Send the second target sequence and encrypted ciphertext to the target terminal.
[0097] Specifically, after encryption is completed, the second target sequence (i.e., the encryption key) and the encrypted ciphertext are sent to the target terminal together.
[0098] Through the above embodiments, the encryption key generated based on quantum random numbers has high randomness and entropy value, making it difficult to predict or copy, thereby significantly enhancing the strength of data encryption and protecting user data from the threats of unauthorized access and data leakage.
[0099] To enable those skilled in the art to better understand the technical solution of this application, the implementation process of the quantum random number-based security authentication method of this application will be described in detail below with reference to specific embodiments.
[0100] It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although a logical order is shown in the flowchart, in some cases the steps shown or described may be executed in a different order than that shown here.
[0101] This application also provides a quantum random number-based security authentication device. It should be noted that this quantum random number-based security authentication device can be used to execute the quantum random number-based security authentication method provided in this application. This device is used to implement the above embodiments and preferred embodiments; details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that performs a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.
[0102] The following describes the quantum random number-based security authentication device provided in the embodiments of this application.
[0103] Figure 3This is a structural block diagram of a quantum random number-based security authentication device according to an embodiment of this application. Figure 3 As shown, the device includes:
[0104] The acquisition unit 10 is used to acquire quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations.
[0105] The first processing unit 20 is used to perform analog-to-digital conversion on the quantum noise and generate a true random number sequence based on the converted quantum noise to obtain the first target sequence;
[0106] The second processing unit 30 is used to, upon receiving a security authentication request, extract the first target sequence according to the type of the security authentication request to obtain the second target sequence;
[0107] The first sending unit 40 is used to send the second target sequence to the target terminal to complete security authentication.
[0108] In this embodiment, the acquisition unit acquires quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations. The first processing unit performs analog-to-digital conversion on the quantum noise and generates a true random number sequence based on the converted quantum noise to obtain a first target sequence. Upon receiving a security authentication request, the second processing unit extracts the first target sequence according to the type of the security authentication request to obtain a second target sequence. The first sending unit sends the second target sequence to the target terminal to complete the security authentication. This application introduces a hybrid quantum noise acquisition technology, including photon polarization states and vacuum fluctuations, to acquire quantum noise. By encoding the quantum noise, a true random number sequence is obtained. Security authentication is performed based on the true random number sequence, eliminating the predictability defects of traditional pseudo-random numbers. This addresses the problem in existing technologies where random number generation relies on deterministic algorithms, and the seeds can be reverse-analyzed, leading to the risk of security authentication being cracked.
[0109] In an optional implementation, to randomly generate quantum noise, the acquisition unit includes:
[0110] The first control module is used to control the single-photon detector to measure the polarization direction of a photon when it passes through the polarization beam splitter, and to obtain the first quantum noise of the photon polarization state.
[0111] The second control module is used to control the superconducting nanowire photon detector to measure the quantum fluctuation noise in the vacuum state and obtain the second quantum noise of the vacuum fluctuation.
[0112] The third control module is used to acquire the thermal noise of the semiconductor material and the original noise generated by the quantum tunneling effect to obtain the third quantum noise.
[0113] The first determining module is used to determine one or more of the first quantum noise, the second quantum noise, and the third quantum noise as quantum noise.
[0114] In order to convert quantum noise into a random number sequence, in one optional implementation, the first processing unit described above includes:
[0115] The first processing module is used to convert quantum noise into binary code through an ADC converter to obtain a first noise sequence;
[0116] The first calculation module is used to remove statistical bias from the first noise sequence using the von Neumann debiasing algorithm to obtain the second noise sequence;
[0117] The second calculation module is used to perform hash operations on the second noise sequence using the SM3 algorithm to obtain a true random number sequence.
[0118] The second determining module is used to determine the time consumed in generating the true random number sequence, obtain the target time, and determine the true random number sequence as the first target sequence if the target time is less than or equal to the first threshold.
[0119] To ensure the security of the true random number sequence seed, in one optional implementation, the above-mentioned device further includes:
[0120] The third processing unit is used to perform analog-to-digital conversion on the quantum noise, generate a true random number sequence based on the converted quantum noise, and then encrypt the true random number sequence using the SM4 algorithm to obtain an encrypted random number sequence.
[0121] Storage unit, used to store encrypted random number sequences to the Redis cluster using the LRU caching algorithm.
[0122] To complete security authentication in the event of a timeout in true random number generation, in one optional implementation, the first processing unit further includes:
[0123] The third determination module is used to determine an anomaly in the generation of the true random number sequence when the target duration exceeds the first threshold.
[0124] The first acquisition module is used to extract random data from the hardware entropy pool in the event of an anomaly in the generation of the true random number sequence. The random data includes CPU clock jitter, network traffic changes, keyboard key presses and mouse movements.
[0125] The second acquisition module is used to acquire the timestamp of the current moment and concatenate the timestamp and random data into a random number seed.
[0126] The third calculation module is used to generate a pseudo-random number sequence based on a random number seed using a stream cipher algorithm, and then determine the pseudo-random number sequence as the first target sequence.
[0127] In order to obtain a sequence of random numbers for verification, in one optional implementation, the second processing unit described above includes:
[0128] The fourth processing module is used to extract the first target sequence by a first preset step size to obtain the second target sequence when the security authentication request is SMS verification.
[0129] The fifth processing module is used to extract the first target sequence with a second preset step size to obtain the second target sequence when the security authentication request is a transaction password verification.
[0130] The sixth processing module is used to extract the first target sequence with a third preset step size to obtain the second target sequence when the security authentication request is a data encryption request.
[0131] In an optional implementation, to perform keyboard encryption using a truly random number sequence, the above-mentioned apparatus further includes:
[0132] The encryption unit is used to, upon receiving a security authentication request, extract a first target sequence according to the type of the security authentication request to obtain a second target sequence, and, if the security authentication request is a data encryption request, encrypt the second target sequence and the data to be encrypted using an encryption algorithm to obtain encrypted ciphertext.
[0133] The second sending unit is used to send the second target sequence and the encrypted ciphertext to the target terminal.
[0134] The aforementioned quantum random number-based security authentication device includes a processor and a memory. The acquisition unit, first processing unit, second processing unit, and first sending unit are all stored as program units in the memory. The processor executes these program units stored in the memory to achieve the corresponding functions. All of the above modules reside in the same processor; alternatively, the modules may be located in different processors in any combination.
[0135] The processor contains a kernel, which retrieves the corresponding program units from memory. One or more kernels can be configured, and the security of authentication can be improved by adjusting kernel parameters.
[0136] The memory may include non-permanent memory in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM, and the memory includes at least one memory chip.
[0137] This invention provides a computer-readable storage medium including a stored program, wherein, when the program is executed, it controls the device containing the computer-readable storage medium to perform the aforementioned quantum random number-based security authentication method.
[0138] Specifically, security authentication methods based on quantum random numbers include:
[0139] Step S201: Obtain quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations.
[0140] Step S202: Perform analog-to-digital conversion on the quantum noise, and generate a true random number sequence based on the converted quantum noise to obtain the first target sequence;
[0141] Step S203: Upon receiving a security authentication request, the first target sequence is extracted according to the type of the security authentication request to obtain the second target sequence;
[0142] Step S204: Send the second target sequence to the target terminal to complete security authentication.
[0143] This invention provides a processor for running a program, wherein the program executes the aforementioned quantum random number-based security authentication method.
[0144] Specifically, security authentication methods based on quantum random numbers include:
[0145] Step S201: Obtain quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations.
[0146] Step S202: Perform analog-to-digital conversion on the quantum noise, and generate a true random number sequence based on the converted quantum noise to obtain the first target sequence;
[0147] Step S203: Upon receiving a security authentication request, the first target sequence is extracted according to the type of the security authentication request to obtain the second target sequence;
[0148] Step S204: Send the second target sequence to the target terminal to complete security authentication.
[0149] This invention provides an electronic device, which includes a processor, a memory, and a program stored in the memory and executable on the processor. When the processor executes the program, it performs at least the following steps:
[0150] Step S201: Obtain quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations.
[0151] Step S202: Perform analog-to-digital conversion on the quantum noise, and generate a true random number sequence based on the converted quantum noise to obtain the first target sequence;
[0152] Step S203: Upon receiving a security authentication request, the first target sequence is extracted according to the type of the security authentication request to obtain the second target sequence;
[0153] Step S204: Send the second target sequence to the target terminal to complete security authentication.
[0154] This application also provides a computer program product, which, when executed on a data processing device, is suitable for executing an initialization program having at least the following method steps:
[0155] Step S201: Obtain quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations.
[0156] Step S202: Perform analog-to-digital conversion on the quantum noise, and generate a true random number sequence based on the converted quantum noise to obtain the first target sequence;
[0157] Step S203: Upon receiving a security authentication request, the first target sequence is extracted according to the type of the security authentication request to obtain the second target sequence;
[0158] Step S204: Send the second target sequence to the target terminal to complete security authentication.
[0159] It is obvious to those skilled in the art that the modules or steps of the present invention described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device or distributed across a network of multiple computing devices. They can be implemented using computer-executable program code, and thus can be stored in a storage device for execution by a computing device. In some cases, the steps shown or described can be performed in a different order than those described herein, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, the present invention is not limited to any particular combination of hardware and software.
[0160] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0161] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.
[0162] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.
[0163] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.
[0164] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0165] Memory may include non-persistent memory in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.
[0166] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information by any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic tape, disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.
[0167] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0168] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.
[0169] As can be seen from the above description, the embodiments of this application achieve the following technical effects:
[0170] 1) The quantum random number-based security authentication method of this application first obtains quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations. Then, the quantum noise is converted from analog to digital, and a true random number sequence is generated based on the converted quantum noise to obtain a first target sequence. Subsequently, upon receiving a security authentication request, the first target sequence is truncated according to the type of security authentication request to obtain a second target sequence. Finally, the second target sequence is sent to the target terminal to complete the security authentication. This application introduces a hybrid quantum noise acquisition technology, including photon polarization states and vacuum fluctuations, to obtain quantum noise. By encoding the quantum noise, a true random number sequence is obtained, and security authentication is performed based on the true random number sequence. This eliminates the predictability defect of traditional pseudo-random numbers, thus solving the problem that in existing technologies, random number generation relies on deterministic algorithms, and the seed can be reverse-analyzed, leading to the risk of security authentication being cracked.
[0171] 2) The quantum random number-based security authentication device of this application involves an acquisition unit that acquires quantum noise through a quantum random number generator. The quantum noise includes at least photon polarization states and vacuum fluctuations. A first processing unit performs analog-to-digital conversion on the quantum noise and generates a true random number sequence based on the converted quantum noise to obtain a first target sequence. Upon receiving a security authentication request, a second processing unit extracts the first target sequence according to the type of the security authentication request to obtain a second target sequence. A first sending unit sends the second target sequence to the target terminal to complete the security authentication. This application introduces a hybrid quantum noise acquisition technology, including photon polarization states and vacuum fluctuations, to acquire quantum noise. By encoding the quantum noise, a true random number sequence is obtained. Security authentication is performed based on this true random number sequence, eliminating the predictability defects of traditional pseudo-random numbers. This addresses the problem in existing technologies where random number generation relies on deterministic algorithms, and the seeds can be reverse-analyzed, leading to the risk of security authentication being compromised.
[0172] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.
Claims
1. A secure authentication method based on quantum random numbers, characterized in that, include: Quantum noise is obtained by a quantum random number generator, and the quantum noise includes at least photon polarization states and vacuum fluctuations. The quantum noise is converted from analog to digital, and a true random number sequence is generated based on the converted quantum noise to obtain the first target sequence; Upon receiving a security authentication request, the first target sequence is extracted according to the type of the security authentication request to obtain the second target sequence; The second target sequence is sent to the target terminal to complete security authentication.
2. The method according to claim 1, characterized in that, Quantum noise is obtained through a quantum random number generator, including: The polarization direction of a photon is measured when it passes through a polarization beam splitter by controlling a single-photon detector, and the first quantum noise of the photon polarization state is obtained. By controlling a superconducting nanowire photon detector to measure quantum fluctuation noise in a vacuum state, the second quantum noise of vacuum fluctuations is obtained. The third quantum noise is obtained by acquiring the thermal noise of semiconductor materials and the original noise generated by the quantum tunneling effect. One or more of the first quantum noise, the second quantum noise, and the third quantum noise are identified as the quantum noise.
3. The method according to claim 1, characterized in that, The quantum noise is subjected to analog-to-digital conversion, and a true random number sequence is generated based on the converted quantum noise to obtain the first target sequence, including: The quantum noise is converted into binary code using an ADC converter to obtain the first noise sequence; The statistical bias in the first noise sequence is removed by the von Neumann debiasing algorithm to obtain the second noise sequence; The second noise sequence is hashed using the SM3 algorithm to obtain the true random number sequence; The time required to generate the true random number sequence is determined to obtain the target time. If the target time is less than or equal to a first threshold, the true random number sequence is determined as the first target sequence.
4. The method according to claim 1, characterized in that, After performing analog-to-digital conversion on the quantum noise and generating a true random number sequence based on the converted quantum noise, the method further includes: The true random number sequence is encrypted using the SM4 algorithm to obtain an encrypted random number sequence; The encrypted random number sequence is stored in the Redis cluster using the LRU caching algorithm.
5. The method according to claim 3, characterized in that, The process further includes performing analog-to-digital conversion on the quantum noise and generating a true random number sequence based on the converted quantum noise to obtain the first target sequence, and also includes: If the target duration exceeds the first threshold, the generation of the true random number sequence is determined to be abnormal. In the event of an anomaly in the generation of the true random number sequence, random data is extracted from the hardware entropy pool. The random data includes CPU clock jitter, network traffic changes, keyboard key presses and mouse movements. Obtain the timestamp of the current moment, and concatenate the timestamp and the random data to form a random number seed; A pseudo-random number sequence is generated based on the random number seed using a stream cipher algorithm, and the pseudo-random number sequence is determined as the first target sequence.
6. The method according to claim 1, characterized in that, Based on the type of the security authentication request, a first target sequence is extracted to obtain a second target sequence, including: When the security authentication request is SMS verification, the first target sequence is truncated with a first preset step size to obtain the second target sequence; When the security authentication request is a transaction password verification, the first target sequence is truncated with a second preset step size to obtain the second target sequence; If the security authentication request is a data encryption request, the first target sequence is truncated with a third preset step size to obtain the second target sequence.
7. The method according to claim 6, characterized in that, Upon receiving a security authentication request, after extracting a first target sequence based on the type of the security authentication request to obtain a second target sequence, the method further includes: When the security authentication request is the data encryption request, the second target sequence and the data to be encrypted are used as input data and encrypted using an encryption algorithm to obtain encrypted ciphertext. The second target sequence and the encrypted ciphertext are sent to the target terminal.
8. A security authentication device based on quantum random numbers, characterized in that, The device includes: An acquisition unit is used to acquire quantum noise through a quantum random number generator, wherein the quantum noise includes at least photon polarization states and vacuum fluctuations; The first processing unit is used to perform analog-to-digital conversion on the quantum noise and generate a true random number sequence based on the converted quantum noise to obtain the first target sequence; The second processing unit is used to, upon receiving a security authentication request, extract a first target sequence according to the type of the security authentication request to obtain a second target sequence. The first sending unit is used to send the second target sequence to the target terminal to complete security authentication.
9. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored program, wherein, when the program is executed, it controls the device on which the computer-readable storage medium is located to perform the method according to any one of claims 1 to 7.
10. An electronic device, characterized in that, include: One or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising methods for performing any one of claims 1 to 7.