WO2020009265A1

WO2020009265A1 - Method and system for generating random numbers

Info

Publication number: WO2020009265A1
Application number: PCT/KR2018/008747
Authority: WO
Inventors: 문영오; 전성구
Original assignee: 주식회사 넘버스
Priority date: 2018-07-04
Filing date: 2018-08-01
Publication date: 2020-01-09

Abstract

A method and system for generating random numbers are disclosed. The system for generating random numbers comprises N hosts connected with one another through a network, in which N is a natural number equal to two or greater, wherein each of the N hosts may generate and encode a private random number and then transmit the encoded private random number to (N-1) hosts, and the N hosts may decode the encoded private random numbers received from the (N-1) hosts, and then generate a public random number by using, as factors, the private random number generated by itself and the private random numbers decoded after being received from the (N-1) hosts.

Description

Random Number Generation Method and System

The present application relates to a random number generation method and system, and more specifically, to a method for generating an unpredictable and fair public random number by encrypting, exchanging, verifying, and combining random numbers generated by individual hosts. It is all about the technology that records both the process and the procedure in the blockchain.

The most problematic problem in online games such as online casinos is the transparency of technology, and the main reason why transparency is a problem is in random number generation (RNG).

The conventional random number generation method is centralized and easy to operate, and thus there is a problem that the integrity and fairness of the game can be doubted.

There is a need in the art for a method for generating random numbers in a transparent and inoperable manner.

In order to solve the above problems, an embodiment of the present invention provides a random number generation method using a hash algorithm.

Random number generation method using a hash algorithm according to an embodiment of the present invention, N host to generate a random number (Random Number) Rn each; Generating Hn by encrypting individual random numbers Rn generated by the N hosts by a hash algorithm; Transmitting, by the N hosts, Hn to N-1 hosts except themselves; Transmitting, by the N hosts, Rn corresponding to the original hash value of Hn to N-1 hosts except themselves; Confirming the integrity of Rn by comparing the result values of hash algorithms using Hn and Rn received from N-1 hosts as factors, respectively; And generating, by the N hosts, a public random number using Rn generated by each of the N hosts and Rn generated by the N-1 hosts except themselves.

Another embodiment of the present invention provides a random number generation method using an encryption algorithm.

According to another embodiment of the present invention, a random number generation method using an encryption algorithm includes: generating, by N hosts, individual random numbers Rn; Generating En by encrypting each random number Rn generated by the N hosts by an encryption algorithm using an encryption key Kn; Transmitting, by the N hosts, N-1 hosts, except for N-1 hosts; Transmitting, by the N hosts, encryption keys Kn for decryption of the En to N-1 hosts except themselves; Acquiring Rn by decrypting each En received from N-1 hosts with an encryption key Kn; And generating, by the N hosts, a public random number using Rn generated by each of the N hosts and Rn generated by the N-1 hosts except themselves.

Yet another embodiment of the present invention provides a random number generation system.

The random number generation system according to another embodiment of the present invention includes N hosts connected to each other through a network, N is two or more natural numbers, and each of the N hosts is encrypted and then encrypted after generating and encrypting individual random numbers. The random number is transmitted to N-1 hosts, and each of the N hosts decrypts the encrypted individual random numbers received from the N-1 hosts, and then receives the individual random numbers generated by the host and the N-1 hosts. Shared random numbers can be generated using the decoded individual random numbers as arguments.

In addition, the solution of the said subject does not enumerate all the characteristics of this invention. Various features of the present invention and the advantages and effects thereof may be understood in more detail with reference to the following specific embodiments.

According to the embodiment of the present invention, since a plurality of hosts participate in random number generation, it becomes impossible to generate random numbers for one of them, or to manipulate random numbers for malicious purposes.

In addition, since all random number generation processes are recorded in the blockchain, it can be verified at any time.

1 is a block diagram of a random number generation system to which an embodiment of the present invention is applied.

2 is a flowchart of a random number generation method using a hash algorithm according to an embodiment of the present invention.

3 is a flowchart of a random number generation method using an encryption algorithm according to another embodiment of the present invention.

4 is a diagram illustrating an example computing environment in which one or more embodiments disclosed herein may be implemented.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art may easily implement the present invention. However, in describing the preferred embodiment of the present invention in detail, if it is determined that the detailed description of the related known function or configuration may unnecessarily obscure the subject matter of the present invention, the detailed description thereof will be omitted. In addition, the same reference numerals are used throughout the drawings for parts having similar functions and functions.

In addition, throughout the specification, when a part is 'connected' to another part, it is not only 'directly connected' but also 'indirectly connected' with another element in between. Include. In addition, the term 'comprising' of an element means that the element may further include other elements, not to exclude other elements unless specifically stated otherwise.

Referring to FIG. 1, a random number generation system to which an embodiment of the present invention is applied may include N hosts (eg, a first host, a second host, and a third host) 100, 200, and 300. Here, the host may be a computing device connected to a network, and the number of hosts may be N (N> 1). In FIG. 1, for example, the number of hosts is three, but is not necessarily limited thereto.

Each

host

100, 200, 300 may be connected to each other through a network to exchange information necessary for generating a common random number.

Each

host

100, 200, 300 may generate an individual random number, encrypt the random number, and then transmit the encrypted individual random number to other hosts. Accordingly, each host (100, 200, 300) has a separate random number generated and encrypted in each host, respectively.

In addition, each

host

100, 200, 300 decrypts the encrypted individual random numbers received from the other host, and then seeds both the individual random numbers generated by itself and the individual random numbers received and decrypted from the other host. It can be used to generate a public random number.

In addition, each

host

100, 200, 300 may record each process performed for random number generation based on blockchain technology.

Hereinafter, the random number generation method according to an embodiment of the present invention will be described in more detail with reference to FIGS. 2 and 3.

2 is a flowchart of a random number generation method using a hash algorithm according to an embodiment of the present invention. In FIG. 2, for example, the number of hosts is three, but is not necessarily limited thereto.

Referring to FIG. 2, first, all N hosts 100, 200, and 300 generate individual random numbers Rn, respectively (S210).

Subsequently, all N hosts 100, 200, and 300 generate Hn by using the hash algorithm hash (Rn) of the respective random numbers Rn generated in operation S220. Here, the hash algorithm refers to an encryption technique that cannot be decrypted. However, in the present invention, a technique for encrypting an individual random number Rn is not necessarily limited thereto, and an individual random number Rn may be encrypted by applying various encryption techniques known to those skilled in the art.

Thereafter, all N hosts 100, 200, and 300 transmit Hn to the remaining N-1 hosts except themselves, and exchange Hn, which is an encrypted individual random number, with each other (S230). For example, the first host 100 transmits H1 to the second host 200 and the third host 300, and the second host 200 transmits the first host 100 and the third host 300. H2 is transmitted to the third host 300, and the third host 300 may transmit H3 to the first host 100 and the second host 200. Here, the individual random number Rn of the other party is encrypted and cannot be decrypted, and the individual random number Rn is no longer changeable.

Subsequently, although not shown in FIG. 2, all N hosts 100, 200, and 300 may check whether the remaining N-1 hosts except Hn receive Hn.

Thereafter, all

N hosts

100, 200, and 300 transmit Rn corresponding to the original hash value of Hn to N-1 hosts except themselves, and exchange Rn with each other (S240). For example, the first host 100 transmits R1 to the second host 200 and the third host 300, and the second host 200 transmits the first host 100 and the third host 300. R2 is transmitted to the third host 300, and the third host 300 may transmit R3 to the first host 100 and the second host 200.

Subsequently, although not shown in FIG. 2, all N hosts 100, 200, and 300 may check whether the remaining N-1 hosts except Rn receive Rn.

Thereafter, all N hosts 100, 200, and 300 check the integrity of Rn by comparing a result of a hash algorithm using Hn and Rn received from N−1 hosts as factors (S250). That is, the integrity of Rn can be checked by checking whether Hn = hash (Rn).

After that, all N hosts (100, 200, 300) call a common random number generation function that uses both Rn generated by itself and Rn generated by N-1 hosts except itself as a seed. A random random number is generated (S260).

The above-described steps S210 to S260 are all recorded in the blockchain (eg, Smart Contract), and anyone can verify it.

As a result, the common random number generated by all N hosts is an unpredictable fair random number. In addition, as described above, all the processes are decentralized and written on the blockchain, which is a transparent technology.

3 is a flowchart of a random number generation method using an encryption algorithm according to another embodiment of the present invention. In FIG. 3, for example, the number of hosts is three, but is not necessarily limited thereto.

Referring to FIG. 3, first, all N hosts 100, 200, and 300 generate individual random numbers Rn, respectively (S310).

Thereafter, all N hosts 100, 200, and 300 generate En by using the encryption algorithms Encrypt (Kn, Rn), respectively, for the individual random numbers Rn generated in S320. Here, Kn means an encryption key used for the encryption algorithm, and the encryption algorithm may be an encryption algorithm using the encryption key. However, in the present invention, a technique for encrypting an individual random number Rn is not necessarily limited thereto, and an individual random number Rn may be encrypted by applying various encryption techniques known to those skilled in the art.

Thereafter, all N hosts 100, 200, and 300 transmit En to the remaining N-1 hosts except themselves, and exchange the encrypted individual random numbers En with each other (S330). For example, the first host 100 transmits E1 to the second host 200 and the third host 300, and the second host 200 transmits the first host 100 and the third host 300. E2 is transmitted to the third host 300, and the third host 300 may transmit E3 to the first host 100 and the second host 200. Here, the individual random number Rn of the other party is encrypted and cannot be decrypted, and the individual random number Rn is no longer changeable.

Subsequently, although not shown in FIG. 3, all N hosts 100, 200, and 300 may check whether N-1 hosts other than themselves receive En.

Thereafter, all N hosts 100, 200, and 300 transmit encryption keys Kn for decryption of En to N-1 hosts except themselves, and exchange Kn with each other (S340). For example, the first host 100 transmits K1 to the second host 200 and the third host 300, and the second host 200 transmits the first host 100 and the third host 300. K2 is transmitted to the third host 300, and the third host 300 may transmit K3 to the first host 100 and the second host 200.

Subsequently, although not shown in FIG. 3, all N hosts 100, 200, and 300 may check whether the remaining N-1 hosts except Kn receive Kn.

Thereafter, all N hosts 100, 200, and 300 decrypt each En received from the N-1 hosts with an encryption key Kn to obtain Rn (S350). That is, Rn = Decrypt (En, Kn) holds.

After that, all N hosts (100, 200, 300) call a common random number generation function that uses both Rn generated by itself and Rn generated by other N-1 hosts except itself as a seed. A random random number is generated (S360).

The above-described steps S310 to S360 are all recorded in the blockchain (eg, Smart Contract), and anyone can verify it.

4 illustrates an example computing environment in which one or more embodiments disclosed herein may be implemented, illustrating an example of a system 1000 that includes a computing device 1100 configured to implement one or more embodiments described above. Shows. For example, the computing device 1100 may be a personal computer, server computer, handheld or laptop device, mobile device (mobile phone, PDA, media player, etc.), multiprocessor system, consumer electronics, mini computer, mainframe computer, Distributed computing environments, including, but not limited to, any of the systems or devices described above.

The computing device 1100 may include at least one processing unit 1110 and a memory 1120. The processing unit 1110 may include, for example, a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor, an application specific integrated circuit (ASIC), field programmable gate arrays (FPGA), and the like. It may have a plurality of cores. The memory 1120 may be volatile memory (eg, RAM, etc.), nonvolatile memory (eg, ROM, flash memory, etc.), or a combination thereof.

In addition, computing device 1100 may include additional storage 1130. Storage 1130 includes, but is not limited to, magnetic storage, optical storage, and the like. Storage 1130 may store computer readable instructions for implementing one or more embodiments disclosed herein, and other computer readable instructions for implementing operating systems, application programs, and the like. Computer readable instructions stored in storage 1130 may be loaded into memory 1120 for execution by processing unit 1110.

In addition, computing device 1100 may include input device (s) 1140 and output device (s) 1150. Here, the input device (s) 1140 may include, for example, a keyboard, mouse, pen, voice input device, touch input device, infrared camera, video input device, or any other input device. Also, output device (s) 1150 may include, for example, one or more displays, speakers, printers, or any other output device. In addition, computing device 1100 may use an input device or output device included in another computing device as input device (s) 1140 or output device (s) 1150.

In addition, computing device 1100 may include communication connection (s) 1160 that enable computing device 1100 to communicate with another device (eg, computing device 1300). Here, the communication connection (s) 1160 may be a modem, a network interface card (NIC), an integrated network interface, a radio frequency transmitter / receiver, an infrared port, a USB connection, or other for connecting the computing device 1100 to another computing device. It may include an interface. In addition, communication connection (s) 1160 may include a wired connection or a wireless connection.

Each component of the computing device 1100 described above may be connected by various interconnections such as a bus (eg, peripheral component interconnect (PCI), USB, firmware (IEEE 1394), optical bus structure, etc.). And may be interconnected by the network 1200.

As used herein, terms such as "component", "module", "system", "interface", etc. generally refer to a computer-related entity that is hardware, a combination of hardware and software, software, or running software. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and / or a computer. For example, both an application running on a controller and the controller can be a component. One or more components may reside within a thread of process and / or execution, and the components may be localized on one computer and distributed between two or more computers.

The present invention is not limited by the above-described embodiment and the accompanying drawings. It will be apparent to those skilled in the art that the present invention may be substituted, modified, and changed in accordance with the present invention without departing from the spirit of the present invention.

Claims

Generating, by the N hosts, each random number Rn;

Generating Hn by encrypting individual random numbers Rn generated by the N hosts by a hash algorithm;

Transmitting, by the N hosts, Hn to N-1 hosts except themselves;

Transmitting, by the N hosts, Rn corresponding to the original hash value of Hn to N-1 hosts except themselves;

Confirming the integrity of Rn by comparing the result values of hash algorithms using Hn and Rn received from N-1 hosts as factors, respectively; And

Generating a public random number by the N hosts using Rn generated by each of the N hosts and Rn generated by N-1 hosts except themselves as parameters;

N is a random number generation method of two or more natural numbers.
The method of claim 1,

Each step is a random number generation method written to the blockchain.
Generating, by the N hosts, each random number Rn;

Generating En by encrypting each random number Rn generated by the N hosts by an encryption algorithm using an encryption key Kn;

Transmitting, by the N hosts, N-1 hosts, except for N-1 hosts;

Transmitting, by the N hosts, encryption keys Kn for decryption of the En to N-1 hosts except themselves;

Acquiring Rn by decrypting each En received from N-1 hosts with an encryption key Kn; And

Generating a public random number by the N hosts using Rn generated by each of the N hosts and Rn generated by N-1 hosts except themselves as parameters;

N is a random number generation method of two or more natural numbers.
The method of claim 3, wherein

Each step is a random number generation method written to the blockchain.
The host generating a first individual random number;

Receiving, by the host, from the other host a second individual random number generated and encrypted by a hash algorithm;

The host receiving the second individual random number from the other host;

Checking, by the host, the integrity of the second individual random number by comparing a result of a hash algorithm using the encrypted second individual random number and the second individual random number as a factor; And

And generating, by the host, a common random number using the first individual random number and the second individual random number as factors.
The host generating a first individual random number;

Receiving, by the host, from the other host a second individual random number generated and encrypted by an encryption algorithm;

Receiving, by the host, an encryption key for decrypting the encrypted second individual random number from the other host;

Decrypting, by the host, the encrypted second individual random number using the encryption key; And

And generating, by the host, a common random number using the first individual random number and the second individual random number as factors.
Contains N hosts connected to each other over a network, where N is a natural number of 2 or more,

Each of the N hosts generates and encrypts individual random numbers, and then transmits encrypted individual random numbers to N-1 hosts.

The N hosts decrypt the encrypted individual random numbers received from the N-1 hosts, respectively, and then use the random numbers generated by the N hosts and the individual random numbers received and decrypted from the N-1 hosts as factors. Random number generation system to generate.
The method of claim 7, wherein

The N host is a random number generation system for recording each process performed to generate the common random number based on blockchain technology.