Random number generation method, system and device based on quantum

Through the quantum-based random number generation method, the cooperation between clients, quantum key distribution networks and distributed nodes is solved, and the problem of easy cracking of random numbers and high hardware encryption in the existing lottery system is achieved, making it more secure and Economic random number generation.

CN118944875AActive Publication Date: 2024-11-12CHINA MOBILE SHANGHAI ICT CO LTD +2
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202411083411.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-08
Publication Date
2024-11-12
Estimated Expiration
2044-08-08

AI Technical Summary

Technical Problem

The existing lottery system faces challenges in terms of fairness and security. Random numbers at the software level are easily cracked, while hardware physical encryption machines at the hardware level are costly.

Method used

Using quantum-based random number generation method, random numbers that do not rely on a single computing source are generated through the collaboration between the client, the quantum key distribution network and the distributed nodes, and encrypted communication between the quantum key distribution network and the distributed nodes is used. , ensure the security of random numbers.

Benefits of technology

It improves the security of random numbers, avoids the dependence of a single computing source, reduces the cost of encryption, and enhances the fairness and security of lottery results.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118944875A_ABST
    Figure CN118944875A_ABST
Patent Text Reader

Abstract

The invention relates to a quantum-based random number generation method, system and device, and the system comprises a client which is used for transmitting a random number generation request to a target distributed node, and transmitting a key obtaining request to a quantum key distribution network; the target distributed node is used for receiving a random number generation request sent by the client and sending the random number generation request to other distributed nodes in the system; the quantum key distribution network is used for acquiring a key acquisition request sent by a client and sending a target key to each distributed node in the system; the target distributed node is also used for receiving a target key sent by the quantum key distribution network and sending a target random number to the client; and the client is also used for receiving the target random number sent by the target distributed node. The generated target random number does not depend on a single calculation source, and the finally generated lottery result depends on the random number generated by each distributed node in the system, so that the finally generated random number is safer.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of quantum security technology, and in particular to a quantum-based random number generation method, system, and device. Background Art

[0002] At present, the lottery system has many application scenarios, such as lottery for house selection, lottery for license plate indicators, or lottery for on-site events, etc. However, with the breakthrough and evolution of technology, the fairness and security of the lottery system are facing increasingly severe challenges.

[0003] Relevant technologies usually include two lottery methods: software level and hardware level. The software level lottery method uses the random number generated at the software level as the key seed for the lottery result. Since the random number generated at the software level is pseudo-random in nature and can be easily cracked, security issues will arise. The hardware level lottery method requires a hardware physical encryption machine to generate highly secure random numbers, but there is a problem of high cost. Summary of the invention

[0004] The present disclosure provides a quantum-based random number generation method, system and device.

[0005] According to a first aspect of the present disclosure, there is provided a quantum-based random number generation system, the system comprising: a client, a quantum key distribution network, and a plurality of distributed nodes;

[0006] The client is used to send a random number generation request to a target distributed node among the multiple distributed nodes, and send a key acquisition request to the quantum key distribution network; wherein the random number generation request and the key acquisition request respectively carry identification information of the client;

[0007] The target distributed node is used to receive the random number generation request sent by the client, and send the random number generation request to other distributed nodes in the system;

[0008] The quantum key distribution network is used to obtain a key acquisition request sent by the client, and send a target key generated based on the identification information to each distributed node in the system;

[0009] The target distributed node is further used to receive the target key sent by the quantum key distribution network, generate a target random number based on the target key, a locally generated random number and random numbers sent by other distributed nodes, and send the target random number to the client;

[0010] The client is also used to receive the target random number sent by the target distributed node.

[0011] According to a second aspect of the present disclosure, a quantum-based random number generation method is provided, which is applied to a distributed node, and the method includes:

[0012] Receiving a random number generation request sent by a client, wherein the random number generation request carries identification information of the client;

[0013] Receiving a target key sent by the quantum key distribution network based on the identification information;

[0014] Obtaining a random number generated locally by a distributed node and random numbers generated by other distributed nodes, and generating a target random number based on the target key and the random numbers;

[0015] The target random number is sent to the client.

[0016] According to a third aspect of the present disclosure, there is provided a quantum-based random number generation device, which is applied to a distributed node, and the device comprises:

[0017] A request receiving module, used to receive a random number generation request sent by a client, wherein the random number generation request carries identification information of the client;

[0018] A request sending module, used for sending a key acquisition request containing the identification information to the quantum key distribution network;

[0019] A key receiving module, used to receive a target key sent by the quantum key distribution network based on the identification information;

[0020] A random number acquisition module, used to acquire the random number generated locally by the distributed node and the random numbers generated by other distributed nodes, and generate a target random number based on the target key and the random numbers;

[0021] A random number sending module is used to send the target random number to the client.

[0022] According to a fourth aspect of the present disclosure, an electronic device is provided, which includes a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the program, the method described above is implemented.

[0023] According to a fifth aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored, and when the program is executed by a processor, the above method of the present disclosure is implemented.

[0024] According to a sixth aspect of the present disclosure, a computer program product is provided, comprising a computer program, wherein the computer program implements the above method of the present disclosure when executed by a processor.

[0025] The quantum-based random number generation method, system and device provided in the embodiments of the present disclosure receive a random number generation request sent by a client, send a key acquisition request containing identification information to a quantum key distribution network, and receive a target key sent by the quantum key distribution network based on the identification information. The target random number is generated by obtaining the random number generated locally by the target distributed node and the random number generated by other distributed nodes, and a target random number is generated based on the target key and each random number, and the target random number is sent to the client. Since the target random number generated in the embodiment does not rely on a single computing source, the final lottery result relies on the random number generated by each distributed node in the system, making the final random number more secure and not easy to be cracked; and the generation of random numbers does not rely on hardware physical encryption machines, so that the encryption cost is low. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Further details, features and advantages of the present disclosure are disclosed in the following description of exemplary embodiments in conjunction with the accompanying drawings, in which:

[0027] Figure 1 A schematic diagram of a quantum-based random number generation system provided for an exemplary embodiment of the present disclosure;

[0028] Figure 2 A flowchart of a quantum-based random number generation method provided for an exemplary embodiment of the present disclosure;

[0029] Figure 3 A schematic block diagram of functional modules of a quantum-based random number generation device provided for an exemplary embodiment of the present disclosure;

[0030] Figure 4 A structural block diagram of an electronic device provided for an exemplary embodiment of the present disclosure;

[0031] Figure 5 A structural block diagram of a computer system provided for an exemplary embodiment of the present disclosure. DETAILED DESCRIPTION

[0032] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0033] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0034] The term "including" and its variations used in this document are open inclusions, that is, "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one other embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions of other terms will be given in the description below. It should be noted that the concepts of "first", "second", etc. mentioned in this disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0035] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0036] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0037] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, scope of use, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0038] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested to be performed will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, application, server, or storage medium that performs the operation of the technical solution of the present disclosure according to the prompt message.

[0039] As an optional but non-limiting implementation, in response to receiving an active request from the user, the method of sending a prompt message to the user may be, for example, a pop-up window, in which the prompt message may be presented in text. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device. It is understandable that the above notification and the process of obtaining user authorization are only illustrative and do not constitute a limitation on the implementation of the present disclosure. Other methods that meet relevant laws and regulations may also be applied to the implementation of the present disclosure.

[0040] In an embodiment provided by the present disclosure, a quantum-based random number generation system is provided, which may include a client, a quantum key distribution network, and a plurality of distributed nodes. Figure 1 As shown, the distributed nodes in the quantum-based random number generation system can be multiple, for example, at least two. In the embodiment, the quantum-based random number generation system includes four distributed nodes as an example for description, specifically including distributed node 1, distributed node 2, distributed node 3 and distributed node 4. Among them:

[0041] The client is used to send a random number generation request to a target distributed node among multiple distributed nodes, and send a key acquisition request to the quantum key distribution network. The random number generation request and the key acquisition request respectively carry the identification information of the client.

[0042] In the embodiment, when a user needs to draw lots, he can initiate a lottery application through the client, and the lottery range can be a set R{R1, R2...RN}, the identification information of the client is KEYID, and R'{r1, r2...rN} is generated according to R. KEYID and R' are sent to any distributed node 1 of the system.

[0043] For example, if a user needs to randomly draw a ball of one color from 10 colors, the 10 colors of balls can be converted into 10 different fields or identifiers R', for example, the 10 different colors of balls can be converted into 10 corresponding different numbers, etc. The client can send its own client identification information KEYID and R' to any node in the system.

[0044] In addition, the client will also send a key acquisition request to the quantum key distribution network, and the key acquisition request will carry the client's identification information KEYID. Among them, the quantum key distribution network can specifically be (Quantum Key Distribution, QKD), and the embodiment is not limited thereto.

[0045] Among them, QKD uses the characteristics of quantum mechanics to ensure the security of communication. It enables both parties in communication to generate and share a random, secure key to encrypt and decrypt messages. One of the most important and unique properties of quantum key distribution is that if a third party attempts to eavesdrop on the password, the two parties in communication will notice it. This property is based on the basic principle of quantum mechanics: any measurement of a quantum system will interfere with the system. If a third party attempts to eavesdrop on the password, it must be measured in some way, and these measurements will cause perceptible anomalies. By transmitting information through quantum superposition or quantum entanglement, the communication system can detect whether there is eavesdropping. When the eavesdropping is below a certain standard, a secure key can be generated. The security of quantum key distribution is based on the basic principles of quantum mechanics, while traditional cryptography is based on the computational complexity of certain mathematical algorithms. Traditional cryptography cannot detect eavesdropping, and therefore cannot guarantee the security of the key. Quantum key distribution is only used to generate and distribute keys, and no substantial messages are transmitted. Keys can be used in certain encryption algorithms to encrypt messages, and encrypted messages can be transmitted in standard channels. The most common algorithm associated with quantum key distribution is the one-time pad, which is provably secure if a secret and random key is used. In practical applications, quantum key distribution is often used together with symmetric key encryption, such as the Advanced Encryption Standard.

[0046] The target distributed node is used to receive the random number generation request sent by the client and send the random number generation request to the remaining distributed nodes in the system. The target distributed node can be any one of the above-mentioned multiple distributed nodes, or a distributed node closest to the client, and the embodiment is not limited thereto.

[0047] In an embodiment, when a distributed node in the system receives a random number generation request sent by a client, the random number generation request may be synchronously forwarded to other distributed nodes.

[0048] The quantum key distribution network is used to obtain the key acquisition request sent by the client and send the target key generated based on the identification information to each distributed node in the system.

[0049] In the embodiment, when the quantum key distribution network receives a key acquisition request sent by a client, it will send a target key generated based on the identification information to each distributed node in the system. In the embodiment, a system including 4 distributed nodes is taken as an example. Figure 1 As shown, the quantum key distribution network will send the target key to distributed node 1, distributed node 2, distributed node 3 and distributed node 4 respectively.

[0050] It should be noted that, in the embodiment, the quantum key distribution network may pre-generate multiple keys, each of which may correspond to a client identification information. In this way, when the quantum key distribution network receives a key acquisition request sent by a client, it obtains a key that matches the identification information of the client from the multiple keys according to the identification information of the client carried in the key acquisition request.

[0051] In an embodiment, the quantum key distribution network can also generate a key corresponding to the representation information based on the identification information of the client carried in the key acquisition request when receiving the key acquisition request sent by the client, and send the key as the target key to each distributed node of the system.

[0052] The target distributed node is also used to receive the target key sent by the quantum key distribution network, generate a target random number based on the target key, the locally generated random number and the random numbers sent by the remaining distributed nodes, and send the target random number to the client.

[0053] In the embodiment, each distributed node can generate a random number by itself. When the distributed node generates a local random number, the random number can be generated at the software level or by hardware. The method of generating the local random number by each distributed node is not limited to this. In this way, after each distributed node generates its own random number locally, it will send the locally generated random number to the other distributed nodes in the system.

[0054] In order to improve the security of the system, when each distributed node sends a locally generated random number to other distributed nodes in the system, the random number sent can be encrypted by the target key sent by the quantum key distribution network, thereby improving the security of the communication process between distributed nodes.

[0055] It should be noted that the communication data between distributed nodes is encrypted by the target key in the embodiment using quantum encryption communication. Quantum encryption communication is a communication encryption method that cannot be eavesdropped or deciphered, and is unconditionally secure. Quantum encryption communication is mainly divided into two steps: quantum key distribution through a quantum channel. The communicating parties obtain a pair of completely random quantum keys known only to the communicating parties through quantum key distribution. In this step, only keys are generated and distributed. Ciphertext is transmitted through traditional channels. Using the obtained quantum key, the sender encrypts the information into a ciphertext, and the receiver decrypts the received ciphertext, thereby achieving complete confidentiality of the communication. It can be seen that what quantum encryption protects is the "key" in traditional encrypted communication, which is the so-called quantum key distribution.

[0056] In this way, after receiving the random numbers sent by other distributed nodes, each distributed node of the system can generate the final target random number based on the locally generated random number, the random numbers sent by other nodes and the target key.

[0057] The client is also used to receive the target random number sent by the target distributed node.

[0058] When the client receives the target random number sent by the target distributed node, or when the client times out when sending the random number at the target distributed node, it sends a random number acquisition request to the remaining distributed nodes in the system. The client receives the target random number sent by the remaining distributed nodes in the system, and when the target random numbers sent by each distributed node are the same, it confirms that the target random number is valid.

[0059] The quantum-based random number generation system provided by the embodiment of the present disclosure receives a random number generation request sent by a client, sends a key acquisition request containing identification information to a quantum key distribution network, and receives a target key sent by the quantum key distribution network based on the identification information. The target random number is generated based on the target key and each random number by obtaining the random number generated locally by the target distributed node and the random number generated by other distributed nodes, and the target random number is generated based on the target key and each random number, and the target random number is sent to the client. Since the target random number generated in the embodiment does not rely on a single computing source, the final lottery result relies on the random number generated by each distributed node in the system, making the final random number more secure and not easy to be cracked; and the generation of random numbers does not rely on hardware physical encryption machines, making the encryption cost lower.

[0060] Based on the above embodiment, in another embodiment provided by the present disclosure, the target distributed node is further used to send a random number acquisition request to the remaining distributed nodes and receive the target random number sent by the remaining distributed nodes. And the distributed node is also used to send the target random number to the client when the locally generated target random number is the same as the target random number sent by the remaining distributed nodes.

[0061] Specifically, after each distributed node generates its own target random number, it will synchronously send the locally generated target random number to the remaining distributed nodes in the system, and receive the target random number sent by the remaining distributed nodes. When the locally generated target random number is the same as the random number sent by the remaining distributed nodes, it is determined that there is no problem with the target random number. Otherwise, if the target random number generated by a certain distributed node is different from the target random number generated by the remaining distributed nodes, the target random number needs to be regenerated. Through mutual confirmation between the distributed nodes, when the target random numbers generated by each distributed node are the same, the distributed node will send the generated target random number to the client. In this way, the security of the target random number generation can be improved by mutually verifying whether the target random numbers generated by each distributed node are the same, and avoiding the situation where the random numbers generated by each distributed node are inconsistent, and the security problem caused by sending the target random number to the client. Among them, the distributed node can be a target distributed node that receives a random number generation request sent by the client, and the embodiment is not limited to this.

[0062] In the embodiments provided by the present disclosure, when the target distributed node generates the target random number based on the target key, the locally generated random number and the random number sent by the remaining distributed nodes, the target distributed node obtains the locally generated random number and the random number sent by the remaining distributed nodes, so that the target distributed node can obtain the random number generated by each distributed node in the system. In this way, the node identification of each distributed node is obtained, and the node order of each distributed node is determined based on the node identification. In this way, the random numbers can be organized into a sequence array based on the node order, and the target operation is performed on the sequence array through the target key to obtain the target random number.

[0063] Specifically, for example, the target distributed node in the system can sort the random numbers generated locally and the random numbers sent by the remaining distributed nodes according to the node order. For example, the system includes 4 distributed nodes, namely: distributed node 1, distributed node 2, distributed node 3 and distributed node 4, and the random numbers generated by distributed nodes 1 to distributed nodes 4 are: S1, S2, S3 and S4. In this way, the node order is distributed node 1 to distributed node 4, and a sequence array is formed by the order of random numbers S1, S2, S3 and S4 generated by distributed nodes 1 to distributed nodes 4 respectively. Different operations are performed on the sequence array according to the binary sequence of the target key, for example, an XOR operation is performed when it is 1, and an XOR operation is performed when it is 0. Finally, the operation result is modulo N to obtain a random final result, that is, the target random number. It should be noted that the method of operating the sequence array through the binary sequence of the target key can be performed as needed, and the embodiment is not limited to this.

[0064] In the embodiments provided in the present disclosure, the client is also used to send a random number acquisition request to the remaining distributed nodes in the system when the target distributed node times out. For example, a response time threshold can be set, and the response time threshold can be set according to actual needs, such as 2 seconds or 5 seconds, etc., and the embodiments are not limited to this. The timing starts when the client sends a random number generation request to the target distributed node. If the target random number sent by the target distributed node is not received after the response time threshold is exceeded, a random number acquisition request can be sent to the remaining distributed nodes in the system to avoid sending delays caused by reasons such as system downtime, thereby improving the transmission efficiency of the target random number.

[0065] In an embodiment, the client is also used to obtain the target random numbers sent by the remaining distributed nodes when receiving the target random number sent by the target distributed node, and determine that the obtained target random number is valid when the target random numbers are the same. In this way, the client obtains the target random numbers sent by each distributed node in the system, and performs relevant verification through the target random numbers sent by each distributed node. When the target random numbers sent by each distributed node are the same, it can be determined that the target random number received by the client is safe and valid. Otherwise, the system may be hijacked. In order to improve security, when the target random numbers sent by each distributed node are not exactly the same, the client can discard the target random number received this time and resend the random number acquisition request to the distributed nodes in the system to reacquire the target random number, which can greatly improve the security of the system.

[0066] The quantum-based random number generation system provided by the embodiment of the present disclosure includes a client, a quantum key distribution network and a distributed node. The client is used to send a random number generation request to a target distributed node among multiple distributed nodes, and send a key acquisition request to the quantum key distribution network; wherein the random number generation request and the key acquisition request respectively carry the identification information of the client. The target distributed node is used to receive the random number generation request sent by the client, and send the random number generation request to the remaining distributed nodes in the system. The quantum key distribution network is used to obtain the key acquisition request sent by the client, and send the target key generated based on the identification information to each distributed node in the system. The target distributed node is also used to receive the target key sent by the quantum key distribution network, and generate the target random number based on the target key, the locally generated random number and the random number sent by the remaining distributed nodes, and send the target random number to the client. The client is also used to receive the target random number sent by the target distributed node. Since the target random number generated in the embodiment does not rely on a single computing source, the final lottery result relies on the random number generated by each distributed node in the system, so that the final random number generated is more secure and not easy to be cracked.

[0067] In the embodiment, since the final result of random number generation does not completely rely on any single computing source, but relies on the sub-results of each distributed node of the distributed cluster, the algorithm logic between each sub-result and the key can ensure that the same computing result is generated between each distributed node. In the case of a timeout when the client receives the result, it can effectively confirm whether the timeout is caused by a delay or downtime of the distributed node, or a timeout caused by the hijacking of the distributed node.

[0068] In addition, the embodiment relies on the key security of the quantum key distribution network. For a random lottery application, each distributed node in the entire system obtains the same set of keys through the client's identification information. While relying on the keys for communication, the random sub-result array is calculated according to the binary sequence of the keys at each single node. The quantum network ensures the security of communication, and the keys also ensure that the consensus calculation results of the entire system are the same.

[0069] Based on the above embodiments, the present disclosure also provides a quantum-based random number generation method, which can be applied to the distributed nodes in the above embodiments, such as Figure 2 As shown, the method may include the following steps:

[0070] In step S210, a random number generation request sent by a client is received.

[0071] Wherein, the random number generation request carries the identification information of the client.

[0072] In an embodiment, when a user needs to draw a lottery, the user can send a random number generation request to a distributed node through a client. There can be multiple distributed nodes in the system, and the client can send a random number generation request to any distributed node, or to a specific distributed node such as the nearest distributed node, but the embodiment is not limited thereto.

[0073] In step S220, a target key sent by the quantum key distribution network based on the identification information is received.

[0074] Since the random number generation request carries the client's identification information, a key acquisition request containing the client's identification information can be sent to the key distribution network. In this way, the quantum key distribution network will send a target key that matches the client's identification information to the distributed node.

[0075] In step S230, the random number generated locally by the distributed node and the random numbers generated by other distributed nodes are obtained, and a target random number is generated based on the target key and the random numbers.

[0076] In the embodiment, each distributed node can generate a random number locally, and the random number generation method can be based on an existing software-level random number generation method or a hardware-level random number generation method, and the embodiment is not limited thereto. The distributed node will send the generated random number to the remaining distributed nodes in the system, and receive the random number sent by the remaining distributed nodes. In this way, the distributed node can generate the final target random number based on the locally generated random number, the random number sent by the remaining distributed nodes, and the target key according to the relevant algorithm logic.

[0077] In step S240, a target random number is sent to the client.

[0078] In the embodiment, since the generation method of the above-mentioned target random number depends on the random number and target key generated by each distributed node, the source data for generating the target key is the same, and the algorithm logic used by the target random number generated by each distributed node is the same, so that the target random numbers generated by each distributed node are theoretically exactly the same. Therefore, the distributed node can send the target random number generated by itself to the remaining distributed nodes, and receive the target random number sent by the remaining distributed nodes. By comparison, if the target random numbers generated by each distributed node are exactly the same, it can be confirmed that the target random number is valid, so that the security of random number generation can be guaranteed through verification.

[0079] In addition, when the client receives the target random number sent by the distributed node, or when the client times out when the distributed node sends the random number, it can send a random number acquisition request to the remaining distributed nodes in the system. The client receives the target random number sent by the remaining distributed nodes in the system, and confirms that the target random number is valid when the target random numbers sent by the received distributed nodes are the same. The security of data generation can be guaranteed by the secondary verification of the received target random number by the client.

[0080] The quantum-based random number generation method provided in the embodiment of the present disclosure receives a random number generation request sent by a client and receives a target key sent by a quantum key distribution network based on identification information. The random number generated locally by the distributed node and the random number generated by other distributed nodes are obtained, and a target random number is generated based on the target key and each random number, and the target random number is sent to the client. Since the target random number generated in the embodiment does not rely on a single computing source, the final lottery result relies on the random number generated by each distributed node in the system, making the final random number more secure and not easy to be cracked.

[0081] In the case of dividing each functional module according to each function, an embodiment of the present disclosure provides a quantum-based random number generation device, which can be a server, a terminal, or a chip applied to a server. Figure 3 A schematic block diagram of the functional modules of a quantum-based random number generator provided by an exemplary embodiment of the present disclosure. Figure 3 As shown, the quantum-based random number generation device includes:

[0082] The request receiving module 10 is used to receive a random number generation request sent by a client, wherein the random number generation request carries identification information of the client;

[0083] A key receiving module 20, configured to receive a target key sent by the quantum key distribution network based on the identification information;

[0084] A random number acquisition module 30, used to acquire a random number generated locally by a distributed node and random numbers generated by other distributed nodes, and generate a target random number based on the target key and the random numbers;

[0085] The random number sending module 40 is used to send the target random number to the client.

[0086] The quantum-based random number generation device provided in the embodiment of the present disclosure receives a random number generation request sent by a client, and receives a target key sent by a quantum key distribution network based on identification information. The random number generated locally by the distributed node and the random number generated by other distributed nodes are obtained, and a target random number is generated based on the target key and each random number, and the target random number is sent to the client. Since the target random number generated in the embodiment does not rely on a single computing source, the final lottery result relies on the random number generated by each distributed node in the system, making the final random number more secure and not easy to be cracked.

[0087] An embodiment of the present disclosure also provides an electronic device, comprising: at least one processor; and a memory for storing instructions executable by the at least one processor; wherein the at least one processor is configured to execute the instructions to implement the above method disclosed in the embodiment of the present disclosure.

[0088] Figure 4 The structure diagram of an electronic device provided by an exemplary embodiment of the present disclosure is shown in FIG. Figure 4 As shown, the electronic device 1800 includes at least one processor 1801 and a memory 1802 coupled to the processor 1801 , and the processor 1801 can execute corresponding steps in the above method disclosed in the embodiment of the present disclosure.

[0089] The processor 1801 may also be referred to as a central processing unit (CPU), which may be an integrated circuit chip having signal processing capabilities. Each step in the method disclosed in the embodiment of the present disclosure may be completed by an integrated logic circuit of hardware in the processor 1801 or by instructions in the form of software. The processor 1801 may be a general-purpose processor, a digital signal processor (DSP), an ASIC (Application Specific Integrated Circuit), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. A general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present disclosure may be directly embodied as being executed by a hardware decoding processor, or may be executed by a combination of hardware and software modules in a decoding processor. The software module may be located in a memory 1802, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, or other mature storage media in the art. The processor 1801 reads the information in the memory 1802 and completes the steps of the method in combination with its hardware.

[0090] In addition, when various operations / processes according to the present disclosure are implemented by software and / or firmware, they can be transmitted from a storage medium or a network to a computer system having a dedicated hardware structure, such as Figure 5 The computer system 1900 shown is installed with the programs constituting the software. When the various programs are installed, the computer system can perform various functions, including the functions described above. Figure 5 A structural block diagram of a computer system provided for an exemplary embodiment of the present disclosure.

[0091] Computer system 1900 is intended to represent various forms of digital electronic computer devices, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. Electronic devices can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0092] like Figure 5As shown, the computer system 1900 includes a computing unit 1901, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 1902 or a computer program loaded from a storage unit 1908 to a random access memory (RAM) 1903. In the RAM 1903, various programs and data required for the operation of the computer system 1900 can also be stored. The computing unit 1901, the ROM 1902, and the RAM 1903 are connected to each other via a bus 1904. An input / output (I / O) interface 1905 is also connected to the bus 1904.

[0093] A plurality of components in the computer system 1900 are connected to the I / O interface 1905, including: an input unit 1906, an output unit 1907, a storage unit 1908, and a communication unit 1909. The input unit 1906 may be any type of device capable of inputting information to the computer system 1900, and the input unit 1906 may receive input digital or character information, and generate key signal inputs related to user settings and / or function control of the electronic device. The output unit 1907 may be any type of device capable of presenting information, and may include, but is not limited to, a display, a speaker, a video / audio output terminal, a vibrator, and / or a printer. The storage unit 1908 may include, but is not limited to, a disk, an optical disk. The communication unit 1909 allows the computer system 1900 to exchange information / data with other devices over a network such as the Internet, and may include, but is not limited to, a modem, a network card, an infrared communication device, a wireless communication transceiver, and / or a chipset, such as a Bluetooth™ device, a WiFi device, a WiMax device, a cellular communication device, and / or the like.

[0094] The computing unit 1901 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 1901 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 1901 performs the various methods and processes described above. For example, in some embodiments, the above methods disclosed in the embodiments of the present disclosure may be implemented as a computer software program, which is tangibly included in a machine-readable medium, such as a storage unit 1908. In some embodiments, part or all of the computer program may be loaded and / or installed on an electronic device via ROM 1902 and / or communication unit 1909. In some embodiments, the computing unit 1901 may be configured to perform the above methods disclosed in the embodiments of the present disclosure in any other appropriate manner (e.g., by means of firmware).

[0095] The embodiment of the present disclosure further provides a computer-readable storage medium, wherein when instructions in the computer-readable storage medium are executed by a processor of an electronic device, the electronic device is enabled to execute the above method disclosed in the embodiment of the present disclosure.

[0096] The computer-readable storage medium in the disclosed embodiments may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. The computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or equipment, or any suitable combination of the foregoing. More specifically, the computer-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0097] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0098] The embodiments of the present disclosure further provide a computer program product, including a computer program, wherein when the computer program is executed by a processor, the above method disclosed in the embodiments of the present disclosure is implemented.

[0099] In embodiments of the present disclosure, computer program codes for performing the operations of the present disclosure may be written in one or more programming languages ​​or combinations thereof, including but not limited to object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" language or similar programming languages. The program code may be executed entirely on a user's computer, partially on a user's computer, as an independent software package, partially on a user's computer, partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer.

[0100] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0101] The modules, components or units involved in the embodiments described in the present disclosure may be implemented by software or hardware, wherein the names of the modules, components or units do not, in some cases, limit the modules, components or units themselves.

[0102] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip (SOCs), complex programmable logic devices (CPLDs), and the like.

[0103] The above descriptions are only some embodiments of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, a technical solution formed by replacing the above features with the technical features with similar functions disclosed in the present disclosure (but not limited to).

[0104] Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present disclosure. It should be understood by those skilled in the art that the above embodiments may be modified without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.

Claims

1. A quantum-based random number generation system, characterized in that: The system comprises: a client, a quantum key distribution network and a plurality of distributed nodes; The client is used to send a random number generation request to a target distributed node among the multiple distributed nodes, and send a key acquisition request to the quantum key distribution network; wherein the random number generation request and the key acquisition request respectively carry identification information of the client; The target distributed node is used to receive the random number generation request sent by the client, and send the random number generation request to other distributed nodes in the system; The quantum key distribution network is used to obtain a key acquisition request sent by the client, and send a target key generated based on the identification information to each distributed node in the system; The target distributed node is further used to receive the target key sent by the quantum key distribution network, generate a target random number based on the target key, a locally generated random number and random numbers sent by other distributed nodes, and send the target random number to the client; The client is also used to receive the target random number sent by the target distributed node.

2. The system according to claim 1, characterized in that The random numbers sent by the remaining distributed nodes are encrypted based on the target key.

3. The system according to claim 1, characterized in that The generating a target random number based on the target key, a locally generated random number, and random numbers sent by other distributed nodes includes: Obtaining a node identifier of each distributed node, and determining a node order of each distributed node based on the node identifier; The random numbers are organized into a sequence array based on the node sequence, and a target operation is performed on the sequence array through the target key to obtain a target random number.

4. The system according to claim 1, characterized in that The distributed node is further used to send a random number acquisition request to the remaining distributed nodes, and receive a target random number sent by the remaining distributed nodes; The distributed node is further configured to send a target random number to the client when the locally generated target random number is the same as the target random number sent by the remaining distributed nodes.

5. The system according to claim 1, characterized in that The client is further configured to send a random number acquisition request to the remaining distributed nodes when the target distributed node times out in sending the random number.

6. The system according to claim 5, characterized in that The client is further configured to, when receiving the target random number sent by the target distributed node, obtain the target random numbers sent by the remaining distributed nodes, and determine that the obtained target random number is valid when the target random numbers are the same.

7. A quantum-based random number generation method, characterized in that: Applied to a distributed node, the method comprises: Receiving a random number generation request sent by a client, wherein the random number generation request carries identification information of the client; Receiving a target key sent by a quantum key distribution network based on the identification information; Obtaining a random number generated locally by a distributed node and random numbers generated by other distributed nodes, and generating a target random number based on the target key and the random numbers; The target random number is sent to the client.

8. A quantum-based random number generation device, characterized in that: Applied to a distributed node, the device comprises: A request receiving module, used to receive a random number generation request sent by a client, wherein the random number generation request carries identification information of the client; A key receiving module, used to receive a target key sent by a quantum key distribution network based on the identification information; A random number acquisition module, used to acquire the random number generated locally by the distributed node and the random numbers generated by other distributed nodes, and generate a target random number based on the target key and the random numbers; A random number sending module is used to send the target random number to the client.

9. An electronic device, characterized in that: include: at least one processor; a memory for storing the at least one processor-executable instruction; The at least one processor is configured to execute the instructions to implement the method as claimed in claim 7.

10. A computer-readable storage medium, characterized in that: When the instructions in the computer-readable storage medium are executed by a processor of an electronic device, the electronic device is enabled to perform the method as claimed in claim 7.

11. A computer program product, characterized in that The invention comprises a computer program, which implements the method of claim 7 when being executed by a processor.

Citation Information

Patent Citations

  • Cloud storage method and system

    CN106209739A

  • Random number generation method based on distributed consensus algorithm

    CN110430045A

  • Random number generation system, method and device and cloud server

    CN113296737A

  • Quantum security wireless ad hoc network system

    CN117354796A

  • Block chain key generation method and device, equipment, medium and product

    CN118316601A