WO2023153717A1

WO2023153717A1 - Electronic device for performing high-dimensional polymorphic encryption for post-quantum encryption environment, and operating method thereof

Info

Publication number: WO2023153717A1
Application number: PCT/KR2023/001519
Authority: WO
Inventors: 안영택; 강유진; 염중배
Original assignee: (주)가온아이
Priority date: 2022-02-09
Filing date: 2023-02-02
Publication date: 2023-08-17
Also published as: KR20230120309A

Abstract

According to various embodiments, a first electronic device comprises: a memory for storing a plurality of encryption packages each including an encryption algorithm and/or a decryption algorithm; a processor functionally connected to the memory; and a communication circuit functionally connected to the processor, wherein the processor may be configured to generate a first random number on the basis of a first counter, select a first encryption package from among the plurality of encryption packages on the basis of the first random number, generate first ciphertext on the basis of applying a first key and first plain text to an encryption algorithm of the first encryption package, and control the communication circuit to transmit information including the first ciphertext and the first counter to a second electronic device.

Description

Electronic device performing high-dimensional polymorphic encryption for a post-quantum cryptographic environment and its operating method

Various embodiments relate to an electronic device that performs high-dimensional polymorphic encryption for a post-quantum cryptography environment and an operating method thereof, and more particularly, to an electronic device using a synchronized key and/or cryptographic package and an operating method thereof. .

In recent years, technology for quantum computing has been developing. Quantum computing may mean a technique of performing calculations based on quantum mechanical concepts such as superposition or entanglement. Compared to conventional legacy computing that performs calculations in units of bits, quantum computing can perform calculations based on qubits (or quantum bits). A bit in legacy computing can be represented by 0 and 1, but a qubit can be represented by a linear combination of a state (or vector, or ket) corresponding to 0 and a state corresponding to 1. Accordingly, even for one qubit, various states exceeding two states may be expressed.

Accordingly, the calculation speed of quantum computing may be overwhelmingly greater than that of legacy computing, and there is a concern that existing cryptography and algorithms may be incapacitated by quantum computing. In response to this, various encryption algorithms (e.g., multivariate-based encryption algorithms, code-based encryption algorithms, lattice-based encryption algorithms, isogeny-based encryption algorithms, and hash-based encryption algorithms) applicable in the post-quantum cryptography environment have been disclosed. .

Although various encryption algorithms applicable in the post-quantum cryptography environment have been disclosed, most encryption algorithms focus on improving existing encryption algorithms, and thus, the performance of existing encryption algorithms has not been dramatically increased. Accordingly, there is a demand for the development of an electronic device and an operating method thereof capable of dramatically increasing stability even in a quantum computing environment.

An electronic device and an operating method thereof according to various embodiments may perform encryption on plain text using a dynamically changing encryption package based on a dynamically changing key. An electronic device and an operating method thereof according to various embodiments may perform decryption of ciphertext using a dynamically changing encryption package based on a dynamically changing key.

According to various embodiments, a first electronic device may include a memory for storing a plurality of encryption packages each including an encryption algorithm and/or a decryption algorithm, a processor functionally connected to the memory, and a processor functionally connected to the processor. A communication circuit, wherein the processor generates a first random number based on a first counter, selects a first encryption package from among the plurality of encryption packages based on the first random number, and generates a first key and the communication circuitry to generate a first ciphertext based on applying the first plaintext to an encryption algorithm of the first encryption package, and transmit information including the first ciphertext and the first counter to a second electronic device. can be set to control

According to various embodiments, the second electronic device includes a memory for storing a plurality of encryption packages, each of which includes an encryption algorithm and/or a decryption algorithm, a processor functionally connected to the memory, and a processor functionally connected to the processor. and a communication circuit, wherein the processor receives information including a first counter and a first ciphertext through the communication circuit, generates a first random number based on the first counter, and generates a first random number based on the first counter. Based on selecting a first encryption package from among the plurality of encryption packages and applying a first key and the first ciphertext to a decryption algorithm of the first encryption package, a first encryption package corresponding to the first ciphertext Can be set to generate plaintext.

According to various embodiments, a method of operating a first electronic device storing a plurality of encryption packages, each of which includes an encryption algorithm and/or a decryption algorithm, includes generating a first random number based on a first counter; Selecting a first encryption package from among the plurality of encryption packages based on a first random number, and generating a first ciphertext based on applying a first key and a first plaintext to an encryption algorithm of the first encryption package. and transmitting information including the first cipher text and the first counter to a second electronic device.

According to various embodiments, a method of operating a second electronic device storing a plurality of encryption packages, each of which includes an encryption algorithm and/or a decryption algorithm, includes, from a first electronic device, a first counter and a first cipher text. Receiving information, generating a first random number based on the first counter, selecting a first encryption package among the plurality of encryption packages based on the first random number, and using a first key and generating a first plaintext corresponding to the first ciphertext based on applying the first ciphertext to a decryption algorithm of the first encryption package.

According to various embodiments, an electronic device capable of encrypting plaintext using a dynamically changed encryption package based on a dynamically changed key and an operating method thereof may be provided. According to various embodiments, an electronic device capable of decrypting ciphertext using a dynamically changed encryption package based on a dynamically changed key and an operating method thereof may be provided.

1 is a flowchart illustrating an operating method of a first electronic device performing encryption and a second electronic device performing decryption according to a comparative example for comparison with various embodiments.

2 is a diagram for explaining processes of generating ciphertext, transmitting ciphertext, and generating plaintext based on ciphertext according to various embodiments.

3 shows a block diagram of electronic devices according to various embodiments.

4 is a flowchart illustrating a method of operating electronic devices according to various embodiments.

5 is a flowchart illustrating a method of operating electronic devices according to various embodiments.

6 is a flowchart illustrating a method of operating electronic devices according to various embodiments.

7 is a flowchart illustrating a method of operating electronic devices according to various embodiments.

8 is a flowchart illustrating a method of operating electronic devices according to various embodiments.

9 is a flowchart illustrating a method of operating electronic devices according to various embodiments.

10 is a flowchart illustrating a code generation method according to various embodiments of the present disclosure.

11 is a flowchart illustrating a code generation method according to various embodiments of the present disclosure.

12 is a flowchart illustrating an offset determination process according to various embodiments of the present disclosure.

13 shows a flowchart of a character set determination method according to various embodiments of the present invention.

14 shows a flowchart of a character set determination method according to various embodiments of the present invention.

Hereinafter, exemplary embodiments according to the present invention will be described in detail with reference to the contents described in the accompanying drawings. However, the present invention is not limited or limited by exemplary embodiments. The same reference numerals presented in each figure indicate members performing substantially the same function.

1 is a flowchart illustrating an operating method of a first electronic device performing encryption and a second electronic device performing decryption according to a comparative example for comparison with various embodiments. Meanwhile, those skilled in the art know that at least some of the operations performed by the first electronic device 101 and/or the second electronic device 102 according to the comparative example may also be performed by the electronic device according to various embodiments. will understand The encryption according to the comparative example of FIG. 1 may be referred to as dynamic encryption.

According to the comparative example, the first electronic device 101 may generate cipher text by performing encryption on plain text, and may be referred to as a transmitting device in other words. The second electronic device 102 may generate plain text by performing decryption on the cipher text, and may be referred to as a receiving side device in other words. The first electronic device 101 and the second electronic device 102 may share the secret key K in operation 111 . The first electronic device 101 may select an encryption function E and a decryption function D, which are one of a plurality of encryption systems. For example, the first electronic device 101 may randomly select one of a plurality of encryption systems. In operation 115, the first electronic device 101 may construct an algorithm Ω based on the selected encryption function E and/or decryption function D. In operation 117, the first electronic device 101 may obtain an executable code X by compiling an algorithm Ω to be built. In operation 119, the first electronic device 101 may transmit the code X to the second electronic device 102 as a receiving device.

In operation 121, the first electronic device 101 may obtain ciphertext c by encrypting plaintext m using the encryption function E and the secret key K. In operation 123, the first electronic device 101 may transmit the encrypted text c to the second electronic device 102. The second electronic device 102 may execute code X in operation 125 . In operation 127, the second electronic device 102 may decrypt cipher text c using the execution key and secret key K of code X to obtain plain text m. The second electronic device 102 may store plain text m and delete code X. As described above, according to the dynamic encryption method according to the comparative example, transmission and reception of code X in operation 119 is essential. Accordingly, there is a problem in that transmission/reception of data between the

electronic devices

101 and 102 other than the transmission of the ciphertext c (operation 123) is required. This may result in a difficult problem of real-time data transmission and reception. In addition, there is a possibility of stealing the code X, and thus it is difficult to ensure safety.

According to various embodiments, the first electronic device 101 may be a transmitting device that generates cipher text using plain text, and the second electronic device 101 is a receiving device that generates plain text using received cipher text. can be Based on the dotted line shown in FIG. 2 , operations performed by the first electronic device 101 may be described on the left, and operations performed by the second electronic device 102 may be described on the right. An arrow passing through a dotted line may indicate transmission of encrypted text from the first electronic device 101 to the second electronic device 102 . In addition, the first round (Round #1) and the second round (Round #2) of FIG. 2 may be divided into units of generation and transmission of one cipher text, but there is no limitation.

According to various embodiments, the first electronic device 101 and the second electronic device 102 may store the encryption package set 200 in advance. The encryption package set 200 may include a plurality of

encryption packages

201 , 202 , and 203 . For example, at least some of the plurality of

encryption packages

201 , 202 , and 203 may be classified according to the type of encryption algorithm. For example, the plurality of

cryptographic packages

201, 202, and 203 include AES, DES, 3DES, LEA, RC2, RC5, RC6, Present, XTEA, TEA, mCrypton, Twofish, Idea, GOST, Katan, PRINTcipher, Blowfish, Khundra, It may be at least some of various encryption algorithms such as Skipjack, Misty1, Prince, Sea, CLEFIA, LED, KLEIN, SEA, NOEKEON, RECTANGLE, Piccolo, SMON, and SPECK. For example, each of at least some of the plurality of

encryption packages

201, 202, and 203 may be classified according to a key size. For example, the first encryption package 201 is AES with a key size of 128, and the second encryption package 202 may be implemented with AES with a key size of 192. For example, each of at least some of the plurality of

encryption packages

201, 202, and 203 may be classified according to a block size. For example, the first encryption package 201 is RC5 with a 32 block size, and the second encryption package 202 may be implemented with RC5 with a 64 block size. As described above, according to various embodiments, not only encryption packages are distinguished only by encryption algorithms, but also encryption packages may be classified according to key size and/or block size even if they are the same encryption algorithm. An encryption package may include an encryption algorithm and/or a decryption algorithm. For example, as the number of encryption packages increases, the possibility of hacking may decrease. In addition to existing post-quantum cryptographic algorithms, highly secure quantum cryptographic algorithms developed later may also be included (or updated) in the cryptographic package set 200.

According to various embodiments, the first electronic device 101 may generate a first cipher text C1 using the first plain text m1 in a first round (round #1). First of all, the first electronic device 101 may select a second encryption package 202 from among a plurality of

encryption packages

201 , 202 , and 203 . In one example, the first electronic device 101 may generate the second encryption package 202 among the plurality of

encryption packages

201 , 202 , and 203 based on the first random number R1 . The first electronic device 101 may store in advance a random number generation algorithm T that outputs the first random number R1 based on the first counter t1 (eg, time information). In one example, the first counter t1 may be time information of the current time, the random number generation algorithm T may be a one time password (OTP) algorithm, and the first random number R1 may be OTP However, those skilled in the art will understand that this is an example and there is no limitation on the method of generating the random number. The random number generation algorithm T may use, for example, a seed shared between the first electronic device 101 and the second electronic device 102 . The first electronic device 101 and the second electronic device 102 may store an algorithm (f) for selecting one of the encryption packages 201 , 202 , and 203 using a random number. When the first random number R1 is input to the algorithm (f), a first output value may be output. The first output value may be, for example, identification information of any one of the encryption packages 201, 202, and 203, but is not limited as long as it can indicate (or select) any one of the encryption packages 201, 202, and 203. According to the process described above, among the encryption packages 201 , 202 , and 203 , for example, the second encryption package 202 may be randomly selected.

According to various embodiments, the first electronic device 101 may input the first plain text m1 into the second encryption package 202 . The first electronic device 101 may input the first key K1 into the second encryption package 202 . The first key K1 may be, for example, a symmetric key, but is not limited thereto. The first electronic device 101 and the second electronic device 102 may store an algorithm g for generating the first key K1 using the first random number R1. For example, the format and/or size of a key required for each of the encryption packages 201, 202, and 203 may be different, and an algorithm (g) for generating a key may be selected according to the selected encryption package. For example, cryptographic packages and algorithms for key generation may be managed in pairs. Meanwhile, it is exemplary that the first key K1 is generated based on the algorithm g, and in another embodiment, the first electronic device 101 may use the first random number as a key for encryption. As the first plain text m1 and the first key K1 are input to the second encryption package 202, the first cipher text C1 can be output. For example, as the first plaintext m1 and the first key K1 are input to the encryption algorithm included in the second encryption package 202, the first ciphertext C1 may be output.

According to various embodiments, the first electronic device 101 may transmit the first counter t1 using the generated first encrypted text C1 to the second electronic device 102 as a receiving device. . If the first counter t1 is time information, the data area of the first cipher text C1 and the first counter ( An area (eg, a time stamp) corresponding to t1) may be included. The second electronic device 102 may receive the first ciphertext C1 and the first counter t1.

According to various embodiments, the second electronic device 102 may select one of the encryption packages 201 , 202 , and 203 to perform decryption. The second electronic device 102 may generate a first random number R1 using the received first counter t1. Since the second electronic device 102 and the first electronic device 101 share the same random number generation algorithm T, the first random number R1 can be generated based on the first counter t1. . The second electronic device 102 may select the second encryption package 202 using the first random number R1. For example, when a first random number R1 is input to the algorithm f, a first output value may be output. The first output value may be, for example, identification information of any one of the encryption packages 201, 202, and 203, but is not limited as long as it can indicate (or select) any one of the encryption packages 201, 202, and 203. According to the process described above, among the encryption packages 201 , 202 , and 203 , for example, the second encryption package 202 may be randomly selected.

According to various embodiments, the second electronic device 102 may generate the first key K1 using the first random number R1. For example, the second electronic device 102 may generate the first key K1 based on inputting the first random number R1 to the algorithm g. For example, the format and/or size of a key required for each of the encryption packages 201, 202, and 203 may be different, and an algorithm (g) for generating a key may be selected according to the selected encryption package. For example, cryptographic packages and algorithms for key generation may be managed in pairs. Meanwhile, it is exemplary that the first key K1 is generated based on the algorithm g, and in another embodiment, the first electronic device 101 may use the first random number as a key for encryption.

According to various embodiments, the second electronic device 102 may input the first key K1 and the first ciphertext C1 into the selected second encryption package 202 . As the first key K1 and the first cipher text C1 are input to the decryption algorithm of the second encryption package 202, the first plain text m1 can be output. Accordingly, the second electronic device 102 may obtain the first plain text m1. As described above, the first electronic device 101 and the second electronic device 102 may select the same encryption package (eg, the second encryption package 202) from among the plurality of

encryption packages

201, 202, and 203. there is. Accordingly, since the transmission process of the code according to the comparative example is not required, not only the amount of transmitted and received data is relatively small, but also security can be increased.

According to various embodiments, the first electronic device 101 may generate the second ciphertext C2 using the second plaintext m2 in the second round (round #2). First, the first electronic device 101 may select an Nth encryption package 203 from among a plurality of

encryption packages

201 , 202 , and 203 . In one example, the first electronic device 101 may generate the Nth encryption package 203 among the plurality of

encryption packages

201 , 202 , and 203 based on the second random number R2 . The first electronic device 101 may store in advance a random number generation algorithm T that outputs the second random number R2 based on the second counter t2 (eg, time information). In one example, the second counter t2 may be time information of the current time, the random number generation algorithm T may be an OTP algorithm, and the second random number R2 may be OTP, but this As an example, those skilled in the art will understand that there is no limitation on the method of generating the random number. When the second random number R2 is input to the algorithm (f), a second output value may be output. The second output value may be, for example, identification information of any one of the encryption packages 201, 202, and 203, but is not limited as long as it can indicate (or select) any one of the encryption packages 201, 202, and 203. According to the above process, among the encryption packages 201 , 202 , and 203 , for example, the Nth encryption package 203 may be randomly selected.

According to various embodiments, the first electronic device 101 may input the second plain text m2 into the Nth encryption package 203 . The first electronic device 101 may input the second key K2 into the Nth encryption package 203 . The second key K2 may be, for example, a symmetric key, but is not limited thereto. The first electronic device 101 and the second electronic device 102 may store an algorithm g for generating the first key K2 using the second random number R2. Meanwhile, in FIG. 2, the algorithm g used in the second round (round # 2) is shown as the same as the algorithm g used in the first round (round # 1), but this is exemplary, It will be understood by those skilled in the art that the key generation algorithm (g), as described above, may vary depending on the selected cryptographic package. Meanwhile, it is exemplary that the second key K2 is generated based on the algorithm (g), and in another embodiment, the first electronic device 101 may use the second random number as a key for encryption. As the second plain text m2 and the second key K2 are input to the Nth cryptographic package 203, the second cipher text C2 can be output. For example, as the second plaintext m2 and the second key K2 are input to the encryption algorithm included in the Nth encryption package 203, the second ciphertext C2 may be output.

According to various embodiments, the first electronic device 101 may transmit the generated second encrypted text C2 to the second electronic device 102, which is a receiving side device, together with the second counter t2 using the generated second password text C2. . If the second counter t2 is time information, the data area of the second cipher text C2 and the second counter ( An area (eg, a time stamp) corresponding to t2) may be included. The second electronic device 102 may receive the second ciphertext C2 and the second counter t2.

According to various embodiments, the second electronic device 102 may select one of the encryption packages 201 , 202 , and 203 to perform decryption. The second electronic device 102 may generate the second random number R2 using the received second counter t2. Since the second electronic device 102 and the first electronic device 101 share the same random number generation algorithm T, the second random number R2 can be generated based on the second counter t2. . The second electronic device 102 may select the Nth encryption package 203 using the second random number R2. For example, when the second random number R2 is input to the algorithm (f), the second output value may be output. The second output value may be, for example, identification information of any one of the encryption packages 201, 202, and 203, but is not limited as long as it can indicate (or select) any one of the encryption packages 201, 202, and 203. According to the above process, among the encryption packages 201 , 202 , and 203 , for example, the Nth encryption package 203 may be randomly selected.

According to various embodiments, the second electronic device 102 may generate the second key K2 using the second random number R2. For example, the second electronic device 102 may generate the second key K2 based on inputting the second random number R2 to the algorithm g. The second electronic device 102 may input the second key K2 and the second ciphertext C2 into the selected second encryption package 202 . As the second key K2 and the second cipher text C2 are input to the decryption algorithm of the second encryption package 202, the second plain text m2 can be output. Accordingly, the second electronic device 102 may obtain the second plain text m2.

As described above, in the first electronic device 101 and the second electronic device 102, an encryption package can be randomly selected for each plain text to be transmitted, and in particular, code transmission in the comparative example of FIG. 1 is not required. . As the cryptographic package is randomly changed, the above-described encryption and/or decryption may be referred to as high level polymorphic cryptography (HLPC). In particular, as the cryptographic package set is composed of cryptographic packages for the post-quantum cryptography environment, it can be robust against hacking.

3 shows a block diagram of electronic devices according to various embodiments.

According to various embodiments, the first electronic device 101 may include at least one of a processor 301 , a communication circuit 302 , and a memory 303 . According to various embodiments, the second electronic device 102 may include at least one of a processor 311 , a communication circuit 312 , and a memory 313 .

According to various embodiments, at least one of the processor 301 or the processor 311 stores a CPU, a ROM in which a control program for control is stored, and signals or data input from the outside, or the electronic device 101 It may include at least one of RAM (RAM) used as a storage area for work performed in . A CPU may include a single core, dual core, triple core, or quad core. The CPU, ROM and RAM may be interconnected through an internal bus. An operation performed by the first electronic device 101 according to various embodiments may be performed by, for example, the processor 301 or other hardware under the control of the processor 301 . Alternatively, performing a specific operation by the first electronic device 101 may mean that the specific operation is performed as an instruction stored in the memory 303 is executed. An operation performed by the second electronic device 102 according to various embodiments may be performed by, for example, the processor 311 or other hardware under the control of the processor 311 . Alternatively, performing a specific operation by the second electronic device 102 may mean that the specific operation is performed as an instruction stored in the memory 313 is executed.

According to various embodiments, at least one of the memory 303 or the memory 313 may include both ROM and RAM, and as described above, an algorithm for generating counters (eg, t1 and t2) ( Or, a clock providing time information), a plurality of encryption packages (201, 202, 203), an algorithm (T) for generating a random number, an algorithm (f) for selecting an encryption package, or an algorithm (g) for generating a key. At least one can be stored. At least one of the memory 303 and the memory 313 may be implemented as at least one of a volatile memory and a non-volatile memory, and the implementation form is not limited.

According to various embodiments, at least one of the communication circuit 302 or the communication circuit 312 may transmit and receive data through communication. There is no limitation on the manner of communication performed in the communication circuit 302 or the communication circuit 312 .

According to various embodiments, the processor 301 may randomly select any one of the encryption packages 201 , 202 , and 203 . The processor 301 may generate ciphertext based on plaintext using the selected ciphertext package. For example, the processor 301 may generate a random number, and may generate a key based on the random number, but the key generation method is not limited. According to various embodiments, processor 301 and/or processor 311 may, via communication circuitry 302 and/or communication circuitry 312, ciphertext (eg, C1 or C2) and a counter (eg, For example, t1 or t2) can be transmitted and received. The processor 311 may randomly select one of the encryption packages 201 , 202 , and 203 . The processor 311 may select the same encryption package as the encryption package used by the first electronic device 101 by selecting an encryption package based on the received counter, for example. The processor 311 may generate plaintext based on the ciphertext using the selected encryption package. For example, the processor 301 may generate a random number, and may generate a key based on the random number, but the key generation method is not limited.

According to various embodiments, the first electronic device 101 and the second electronic device 102 may share a first seed in operation 401 . The first seed may be exchanged between the first electronic device 101 and the second electronic device 102 based on, for example, an elliptic-curve Diffie-Hellman (ECDH) key exchange algorithm. It will be appreciated by those skilled in the art that there are no limitations on the manner.

According to various embodiments, in operation 403, the first electronic device 101 may generate a first random number corresponding to the first counter by using the first seed. As described with reference to FIG. 2 , the first electronic device 101 may store a random number generation algorithm using the first seed and the first counter as input values and the first random number as an output value. The random number generation algorithm may be shared with the second electronic device 102 in advance. In one example, the first counter may be first time information (or first time stamp), and the first random number may be OTP, but the type is not limited. In operation 405, the first electronic device 101 may select a first encryption package from among a plurality of encryption packages using a first random number. Identifiable information (or index) may be assigned to each of the encryption packages, and an encryption package of information (or index) corresponding to the first random number may be selected, but is not limited thereto.

According to various embodiments, in operation 407, the first electronic device 101 may generate a first key using a first random number. The first electronic device 101 may share a key generation algorithm with the second electronic device 102 in advance. The first electronic device 101 may generate the first key by inputting the first random number into the key generation algorithm, but the generation method is not limited. In operation 409, the first electronic device 101 may generate ciphertext by encrypting the plaintext using the first encryption package and the first key. The first electronic device 101 may obtain the ciphertext by inputting the first key and the plaintext into the encryption algorithm of the first encryption package. The first electronic device 101 may transmit information including the generated encrypted text and the first counter to the second electronic device 102 in operation 411 .

According to various embodiments, in operation 413, the second electronic device 102 may generate a first random number corresponding to the first counter using the first seed. The second electronic device 102 may obtain the first random number by inputting the first counter received in operation 411 and the first seed shared in advance to the random number generation algorithm. In one example, the first counter may be first time information (or first time stamp), and the first random number may be OTP, but the type is not limited. In operation 415, the second electronic device 102 may select a first encryption package from among a plurality of encryption packages by using the first random number. Identifiable information (or index) may be assigned to each of the encryption packages, and an encryption package of information (or index) corresponding to the first random number may be selected, but is not limited thereto.

According to various embodiments, in operation 417, the second electronic device 102 may generate a first key using the first random number. The second electronic device 102 may generate the first key by inputting the first random number into the key generation algorithm, but the generation method is not limited. In operation 419, the second electronic device 102 may decrypt the ciphertext using the first encryption package and the first key to generate plaintext. The second electronic device 102 may obtain plaintext by inputting the first key and the ciphertext to the decryption algorithm of the first encryption package.

According to various embodiments, the first electronic device 101 and the second electronic device 102 may share a first seed and a second seed in operation 501 . In operation 503, the first electronic device 101 generates a first random number corresponding to the first counter using the first seed, and generates a second random number corresponding to the first counter using the second seed. can create As described above, two random numbers may be generated by the first electronic device 501 . Alternatively, those skilled in the art will understand that, in another example, the first electronic device 101 may generate two different random numbers by inputting the same counter to two different random number generating algorithms. In operation 505, the first electronic device 101 may select a first encryption package from among a plurality of encryption packages using a first random number. According to various embodiments, in operation 507, the first electronic device 101 may generate a first key using the second random number. The first electronic device 101 may share a key generation algorithm with the second electronic device 102 in advance. The first electronic device 101 may generate the first key by inputting the second random number to the key generation algorithm, but the generation method is not limited. In operation 509, the first electronic device 101 may generate ciphertext by encrypting the plaintext using the first encryption package and the first key. The first electronic device 101 may obtain the ciphertext by inputting the first key and the plaintext into the encryption algorithm of the first encryption package. The first electronic device 101 may transmit information including the generated encrypted text and the first counter to the second electronic device 102 in operation 511 .

According to various embodiments, in operation 513, the second electronic device 102 may generate a first random number corresponding to the first counter using the first seed, and generate the first random number corresponding to the first counter using the second seed. A second random number corresponding to may be generated. The second electronic device 102 acquires the first random number and the second random number by inputting the first counter received in operation 511 and the first and second seeds shared in advance to a random number generating algorithm, respectively. can do. In one example, the first counter may be first time information (or first time stamp), and the first random number and the second random number may be OTPs, but there is no limitation in their types. In operation 415, the second electronic device 102 may select a first encryption package from among a plurality of encryption packages by using the first random number. In operation 517, the second electronic device 102 may generate a first key using the second random number. The second electronic device 102 may generate the first key by inputting the second random number into the key generation algorithm, but the generation method is not limited. In operation 519, the second electronic device 102 may decrypt the ciphertext using the first encryption package and the first key to generate plaintext. The second electronic device 102 may obtain plaintext by inputting the first key and the ciphertext to the decryption algorithm of the first encryption package.

According to various embodiments, the first electronic device 101 and the second electronic device 102 may share a first seed in operation 601 . According to various embodiments, in operation 603, the first electronic device 101 may generate a first random number corresponding to the first counter by using the first seed, and generate a second random number by using the first seed. A second random number corresponding to may be generated. The random number generation algorithm may be shared with the second electronic device 102 in advance. In one example, the first counter may be first time information (or a first time stamp), the second counter may be second time information (or a second time stamp), and a first random number and The second random number may be an OTP, but the type is not limited. In operation 605, the first electronic device 101 may select a first encryption package from among a plurality of encryption packages using a first random number. According to various embodiments, in operation 607, the first electronic device 101 may generate a first key using the second random number. The first electronic device 101 may share a key generation algorithm with the second electronic device 102 in advance. The first electronic device 101 may generate the first key by inputting the second random number to the key generation algorithm, but the generation method is not limited. In operation 609, the first electronic device 101 may generate ciphertext by encrypting the plaintext using the first encryption package and the first key. The first electronic device 101 may obtain the ciphertext by inputting the first key and the plaintext into the encryption algorithm of the first encryption package. In operation 611, the first electronic device 101 may transmit information including the generated encrypted text and the first counter and the second counter to the second electronic device 102.

According to various embodiments, in operation 613, the second electronic device 102 generates a first random number corresponding to the first counter using the first seed and corresponds to the second counter using the first seed. It is possible to generate a second random number that The second electronic device 102 may obtain the first random number by inputting the first counter received in operation 611 and the first seed shared in advance to the random number generation algorithm. In one example, the first counter may be first time information (or first time stamp), and the first random number may be OTP, but the type is not limited. In operation 615, the second electronic device 102 may select a first encryption package from among a plurality of encryption packages by using the first random number.

According to various embodiments, in operation 617, the second electronic device 102 may generate a first key using the second random number. The second electronic device 102 may generate the first key by inputting the second random number into the key generation algorithm, but the generation method is not limited. In operation 619, the second electronic device 102 may generate plaintext by decrypting the ciphertext using the first encryption package and the first key. The second electronic device 102 may obtain plaintext by inputting the first key and the ciphertext to the decryption algorithm of the first encryption package.

According to various embodiments, the first electronic device 101 and the second electronic device 102 may share a first seed and a second seed in operation 701 . In operation 703, the first electronic device 101 generates a first random number corresponding to the first counter using the first seed, and generates a second random number corresponding to the second counter using the second seed. can create In operation 705, the first electronic device 101 may select a first encryption package from among a plurality of encryption packages using a first random number. According to various embodiments, in operation 707, the first electronic device 101 may generate a first key using the second random number. The first electronic device 101 may share a key generation algorithm with the second electronic device 102 in advance. The first electronic device 101 may generate the first key by inputting the second random number to the key generation algorithm, but the generation method is not limited. In operation 709, the first electronic device 101 may generate ciphertext by encrypting the plaintext using the first encryption package and the first key. The first electronic device 101 may obtain the ciphertext by inputting the first key and the plaintext into the encryption algorithm of the first encryption package. In operation 711 , the first electronic device 101 may transmit information including the generated encrypted text and the first counter and the second counter to the second electronic device 102 .

According to various embodiments, in operation 713, the second electronic device 102 may generate a first random number corresponding to the first counter using the first seed, and generate a second random number corresponding to the first counter using the second seed. A second random number corresponding to may be generated. The second electronic device 102 inputs the first counter and the first counter received in operation 711 to the random number generating algorithm, and inputs the second counter and the second seed to the random number generating algorithm, thereby generating the first random number. and a second random number may be obtained. In one example, the first counter and the second counter may be first time information and second time information (or first time stamp and second time stamp), and the first random number and the second random number may be OTP. It can be, but the type is not limited. In operation 715, the second electronic device 102 may select a first encryption package from among a plurality of encryption packages by using the first random number. In operation 717, the second electronic device 102 may generate a first key using the second random number. The second electronic device 102 may generate the first key by inputting the second random number into the key generation algorithm, but the generation method is not limited. In operation 719, the second electronic device 102 may decrypt the ciphertext using the first encryption package and the first key to generate plaintext. The second electronic device 102 may obtain plaintext by inputting the first key and the ciphertext to the decryption algorithm of the first encryption package.

According to various embodiments, the first electronic device 101 and the second electronic device 102 may share a first seed in operation 801 . In operation 803, the first electronic device 101 may generate a first random number corresponding to the first counter by using the first seed. In operation 805, the second electronic device 101 may generate a first random number corresponding to the first counter using the first seed. For example, the first electronic device 101 and the second electronic device 102 may be counter-synchronized (eg, time-synchronized), thereby generating the same first counter. For example, the first electronic device 101 and the second electronic device 102 may store a random number generation algorithm that uses the first seed and the first counter as input values and uses the first random number as an output value. . The random number generation algorithm may be shared with the second electronic device 102 in advance. In one example, the first counter may be first time information (or first time stamp), and the first random number may be OTP, but the type is not limited. In operation 807, the first electronic device 101 may select a first encryption package from among a plurality of encryption packages using a first random number. In operation 809, the second electronic device 102 may select a first encryption package from among a plurality of encryption packages by using the first random number.

According to various embodiments, in operation 811, the first electronic device 101 may generate a first key using a first random number. In operation 813, the second electronic device 102 may generate a first key using the first random number. The first electronic device 101 may share a key generation algorithm with the second electronic device 102 in advance. The first electronic device 101 and the second electronic device 102 may generate the first key by inputting the first random number into the key generation algorithm, but the generation method is not limited. In operation 815, the first electronic device 101 may generate ciphertext by encrypting the plaintext using the first encryption package and the first key. The first electronic device 101 may obtain the ciphertext by inputting the first key and the plaintext into the encryption algorithm of the first encryption package. The first electronic device 101 may transmit the generated encrypted text to the second electronic device 102 in operation 817 . In operation 819, the second electronic device 102 may decrypt the ciphertext using the first encryption package and the first key to generate plaintext. The second electronic device 102 may obtain plaintext by inputting the first key and the ciphertext to the decryption algorithm of the first encryption package.

According to various embodiments, the first electronic device 101 and the second electronic device 102 may share a first seed and a first unique code in operation 901 . The first unique code may be, for example, a code uniquely assigned to the first electronic device 101 (or its user account) within the encryption system. The first seed and the first unique code may be exchanged between the first electronic device 101 and the second electronic device 102 based on, for example, an ECDH key exchange algorithm, but the exchange method is not limited. will understand

According to various embodiments, in operation 903, the first electronic device 101 may generate a first random number corresponding to the first counter by using the first seed. The first electronic device 101 may generate a first code using the first random number and the first unique code. A method of generating the first code will be described later in more detail. In operation 907, the first electronic device 101 may select a first encryption package from among a plurality of encryption packages by using the first code. Identifiable information (or index) may be assigned to each of the encryption packages, and an encryption package of information (or index) corresponding to the first code may be selected, but is not limited thereto.

According to various embodiments, in operation 909, the first electronic device 101 may generate a first key using the first code. The first electronic device 101 may share a key generation algorithm with the second electronic device 102 in advance. The first electronic device 101 may generate the first key by inputting the first code into the key generation algorithm, but the generation method is not limited. In operation 911, the first electronic device 101 may generate ciphertext by encrypting the plaintext using the first encryption package and the first key. The first electronic device 101 may obtain the ciphertext by inputting the first key and the plaintext into the encryption algorithm of the first encryption package. The first electronic device 101 may transmit information including the generated encrypted text and the first counter to the second electronic device 102 in operation 913 .

According to various embodiments, in operation 915, the second electronic device 102 may generate a first random number corresponding to the first counter using the first seed. In operation 917, the second electronic device 102 may generate a first code using the first random number and the first unique code. In operation 919, the second electronic device 102 may select a first encryption package from among a plurality of encryption packages by using the first code. Identifiable information (or index) may be assigned to each of the encryption packages, and an encryption package of information (or index) corresponding to the first code may be selected, but is not limited thereto. In operation 921, the second electronic device 102 may generate a first key using the first code. The second electronic device 102 may generate the first key by inputting the first code into the key generation algorithm, but the generation method is not limited. In operation 923, the second electronic device 102 may decrypt the ciphertext using the first encryption package and the first key to generate plaintext. The second electronic device 102 may obtain plaintext by inputting the first key and the ciphertext to the decryption algorithm of the first encryption package.

Meanwhile, in another embodiment, in operation 913, the first electronic device 101 may transmit not only the encrypted text and the first counter but also the first code to the second electronic device 102. The second electronic device 101 may compare the first code generated in operation 917 with the first code received in operation 913 . If the first code generated in operation 917 and the first code received in operation 913 are the same, the second electronic device 102 may confirm that the generated cipher text is valid. Alternatively, when the first code generated in operation 917 and the first code received in operation 913 are not identical, the second electronic device 102 may determine that the generated cipher text is invalid.

Hereinafter, a method of generating the above code will be described.

In operation 1010, the first electronic device 101 may acquire a first unique code and a first seed that is different for each user. The first seed may be given to the first user. Meanwhile, the first unique code is a character string based on an ASCII code, and may be a combination of alphabets, numbers, and special characters. The first unique code may be a code selected from elements of a preset character set. For example, the external device may generate a first unique code for the first user using an algorithm for generating a unique code from a character set and transmit the first unique code to the first electronic device 101 . The external device may generate a unique code for other users, and the unique code assigned to each user may be different.

In operation 1020, the first electronic device 101 may generate a first OTP, which is an example of a random number, using the first seed and the first time information. The first OTP may be composed of numbers, for example.

In operation 1030, the first electronic device 101 may generate a numeric code corresponding to the first unique code by mapping the first unique code to a preset character set.

For example, the first electronic device 101 sets {'0', '1', '2', . . . , '9', ,'A', 'B', … , 'Z' } is assumed. In addition, it is assumed that the first electronic device 101 acquires “AX83Z0” as the first unique code. In one embodiment, the first electronic device 101 may convert each digit of the first unique code into a numeric code by checking the index of each digit of the first unique code in the character set. . For example, the first electronic device 101 converts the unique code of "A" into a numeric code of "10" by confirming that "A", the first character of the first code, is the 11th index in the character set. can This may be due to the fact that the starting point of the numeric code is 0. In the same way, the first electronic device 101 can convert the unique code of "X" to "33" by confirming that "X" is the 34th index in the character set. The first electronic device 101 may convert the first unique code “AX83Z0” into a numeric code of {10,33,8,3,35,0}.

In operation 1040, the first electronic device 101 may sum the first OTP and the numeric code. For example, when the first OTP is "382901", each digit of the first OTP may be added to each digit of the converted numeric code. That is, the electronic device 100 may sum the number codes of {10,33,8,3,35,0} with the first OTP of {3,8,2,9,0,1}, and {13 ,41,10,12,35,1} can be obtained. Meanwhile, if the total number of character set elements in the summation result exceeds 36, for example, the first electronic device 101 performs a mod operation on the summation result to the total number of character set elements. can be replaced by one result. In this case, the first electronic device 101 may replace "41" with "5" which is a result of performing a mode operation of 36 on "41". Accordingly, the first electronic device 101 will be described later. The summation result of {13,5,10,12,35,1} can be obtained. In another embodiment of the present invention, an offset may be applied when generating a summation result.

In operation 1050, the first electronic device 101 may generate a first sub code by mapping the summation result to a character set. For example, the first electronic device 101 may interpret each number of {13, 5, 10, 12, 35, 1} as an index and obtain a character corresponding thereto from the character set. That is, the first electronic device 101 may acquire "D" corresponding to the index of '13' as the first character of the first sub code. The electronic device 100 may acquire "5" corresponding to the index of '5' as the second character of the first sub code. According to the above method, the first electronic device 101 may acquire the first sub code of "D5ACY1".

In operation 1060, the first electronic device 101 may generate a second sub-code by mapping the first OTP to a character set. For example, the first electronic device 101 interprets each digit of the first OTP of {3,8,2,9,0,1} as an index, and generates a second subcode corresponding to each digit. Each digit of the character of can be generated. For example, the first electronic device 101 may acquire the character '3' corresponding to the number '3', and obtain the character '8' corresponding to the number '8'. Accordingly, the first electronic device 101 may acquire the second sub code of “382901”. In another embodiment of the present invention, the second sub code may be obtained by mapping a result of applying an offset to each digit of a number to a character set, which will be described in more detail later.

In operation 1070, the first electronic device 101 may generate a first code including a first sub code and a second sub code. The first electronic device 101 may concatenate the first sub-code and the second sub-code to generate a first code of “D5ACY1382901”, for example. As described above, "D5ACY1", which is the first sub-code of the first code, is set by adding the dynamic and randomly generated OTP and the unique code, and guarantees uniqueness by the unique code while dynamic and randomness is guaranteed. It can be. However, since a code having the same summation result may occur with a low probability, the first electronic device 101 according to various embodiments of the present disclosure may generate a first code, which is a unique code, by concatenating the second sub code.

In operation 1110, the first electronic device 101 may acquire a first unique code and a first seed that is different for each user. As described above, the first electronic device 101 may receive the first unique code and the first seed by receiving the first unique code and the first seed from an external device or by capturing a QR code displayed on another electronic device. can The first seed may be a seed for OTP generation given to the first user by the server.

In operation 1120, the first electronic device 101 may generate a first OTP using the first seed and first time information. In operation 1130, the first electronic device 101 may generate a numeric code corresponding to the first unique code by mapping the first unique code to a character set. For example, the first electronic device 101 may acquire the first unique code of “AX83Z0” and obtain “382901” by using the first time information corresponding to the first time point and the first seed. A first OTP of can be generated. The first electronic device 101 sets preset { '0', '1', '2', ... , '9', ,'A', 'B', … , 'Z' } to convert the first unique code "AX83Z0" into a numeric code of {10,33,8,3,35,0}.

In operation 1140, the first electronic device 101 may sum the first OTP and the numeric code. For example, when the first OTP is "382901", each digit of the first OTP may be added to each digit of the converted numeric code. That is, the electronic device 100 may sum the number codes of {10,33,8,3,35,0} with the first OTP of {3,8,2,9,0,1}, and {13 ,41,10,12,35,1} can be obtained. In operation 1150, the first electronic device 101 may apply an offset to the summation result. The first electronic device 101 may set the offset to 18, for example. The first electronic device 101 may add an offset of 18 to each digit of the summation result. In addition, similarly to FIG. 3 , the first electronic device may obtain a result of mode operation of the size of the character set on the offset-applied summation result. Accordingly, the first electronic device 101 may obtain {31, 23, 28, 30, 17, 19}, which is the summation result to which the offset is applied.

In operation 1160, the first electronic device 101 may generate a first sub-code by mapping the offset-applied summation result to a character set. The first electronic device 101 interprets '31', which is the result of summing with the offset applied, as an index in the character set, and obtains 'V', which is the 31st character. The first electronic device 101 may sequentially convert '23', '28', '30', '17', and '19' into characters, thereby generating a first subcode of "VNSUHJ". can do.

In operation 1170, the first electronic device 101 may apply an offset to the first OTP. Accordingly, the offset 18 is added to each number of the first OTP of {3,8,2,9,0,1} to generate the first OTP to which the offset of {21,26,20,27,18} is applied. can

In operation 1180, the first electronic device 101 may generate a second sub-code by mapping the offset-applied first OTP to a character set. That is, the first electronic device 101 may interpret each number of {21, 26, 20, 27, 18} of the first OTP to which the offset is applied as an index in the character set, and generate the second sub-code. For example, the first electronic device 101 may obtain 'L', which is the 21st character in the character set, based on '21', which is the first number of the first OTP to which the offset is applied. In the above-described manner, the first electronic device 101 may generate the second sub code of "LQKRIJ" from {21,26,20,27,18} of the first OTP to which the offset is applied.

In operation 1190, the first electronic device 101 may generate a first code including a first sub code and a second sub code. The first electronic device 101 may concatenate the first sub-code and the second sub-code to generate, for example, the first code of “D5ACY1LQKRIJ”. As described above, "D5ACY1", which is the first sub-code of the first code, is set by adding the dynamic and randomly generated OTP and the unique code, and guarantees uniqueness by the unique code while dynamic and randomness is guaranteed. It can be. However, since a code having the same summation result may occur with a low probability, the first electronic device 101 according to various embodiments of the present disclosure may generate a first code, which is a unique code, by concatenating the second sub code.

In the following, the above-described code generation process will be described through an algorithm.

- Justice

-C: Character set with different characters represented by ASCII code as elements

The given character set is called C, and C consists of different characters (uppercase and lowercase letters, special characters, and numbers) represented by ASCII codes. For example, if C consists only of numbers, then C = { '0', '1', '2', '3', '4', '5', '6', '7', '8', ' 9' }, and the same number does not overlap. Also, if it consists of numbers and uppercase letters, C = { ‘0’, … ,’9’, ‘A’, … 'Z' }. The character set C given in the same way can be configured in various forms. Also, the elements of C can be shuffled within the same set. For example, the character set C = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' ' } is shuffled, then C = { '8', '0', '7', '3', '1', '9', '6', '2', '4', '5' } and can be together

-S: the number of elements in the given character set C

-C(n) : nth element of C (0 <= n < number of characters in C)

The nth element of C is defined as C(n), where n is an integer such that 0 <= n < S. That is, n means the index of an element included in C. If there is a character set C = { '8', '0', '7', '3', '1', '9', '6', '2', '4', '5' } , 0 <= n < 10, and C(0) = '8' and C(9) = '5'.

-IndexOf(c) : the index in C of the given character c

Given a set of characters C = { '8', '0', '7', '3', '1', '9', '6', '2', '4', '5' } IndexOf( '8') = 0, IndexOf('5') = 9.

-U: A string representing a randomly generated unique user ID composed of characters included in C

Given a set of characters C = { '8', '0', '7', '3', '1', '9', '6', '2', '4', '5' } then U is It is expressed as '0382', '7192'.

-U(n): nth character of U (0 <= n < number of characters in U)

Given U = ‘0382’, n is an integer such that 0 <= n < 4, and U(2) = ‘8’ and U(3) = ‘2’.

-T : TOTP code

For example, a random 6-digit TOTP code would be ‘839023’, ‘659921’.

-T(n): nth position number in TOTP code (0 <= n < number of TOTP digits)

For example, when the generated TOTP code is ‘839023’, T(0) = 8 and T(5) = 3.

-N : length of random code ( N >= 1 )

-R : random code

-algorithm

It is described in a form similar to the programming language C++.

String generate_random_id ( C, U, N, T )

{

string preId;

string postId;

int offset = 18; // randomly assigned

for (n = 0; n < N; n++)

{

int d = numOf(T(n)); // T(n) Convert ASCII code to number, ‘3’ -> 3, ‘9’ -> 9

int x = IndexOf(U(n));

preId += C ( (d + x + offset) % S ); // Append to the character created in the previous step.

postId += C ( T(n) + offset);

}

return (preId + postId); // Append the two created characters to create the final R.

}

-simulation

if,

N = 6;

C = { '0', ... , ‘9’, ‘A’, … , 'Z'},

S = 10 + 26 = 36

U = ‘AX83Z0’ and

If T = ‘382901’,

0 <= n < 36, (0 ... 35)

IndexOf(U) = { 10, 33, 8, 3, 35, 0 },

numOf(T) = { 3, 8, 2, 9, 0, 1 },

If you perform an operation for each digit,

preId[0] = C ( ( 3 + 10 + 18 ) % 36 ) = C ( 31 % 36 ) = C ( 31 ) = 'V'

110preId[1] = C ( ( 8 + 33 + 18 ) % 36 ) = C ( 59 % 36 ) = C ( 23 ) = 'N'

preId[2] = C ( ( 2 + 8 + 18 ) % 36 ) = C ( 28 % 36 ) = C ( 28 ) = 'S'

preId[3] = C ( ( 9 + 3 + 18 ) % 36 ) = C ( 30 % 36 ) = C ( 30 ) = 'U'

preId[4] = C ( ( 0 + 35 + 18 ) % 36 ) = C ( 53 % 36 ) = C ( 17 ) = 'H'

preId[5] = C ( 1 + 0 + 18 ) % 36 ) = C ( 19 % 36 ) = C ( 19 ) = 'J'

ego,

postId[0] = C ( ( 3 + 18 ) % 36 ) = C ( 21 ) = 'L'

postId[1] = C ( ( 8 + 18 ) % 36 ) = C ( 26 ) = 'Q'

postId[2] = C ( ( 2 + 18 ) % 36 ) = C ( 20 ) = 'K'

postId[3] = C ( ( 9 + 18 ) % 36 ) = C ( 27 ) = 'R'

postId[4] = C ( ( 0 + 18 ) % 36 ) = C ( 18 ) = 'I'

postId[5] = C ( ( 1 + 18 ) % 36 ) = C ( 19 ) = 'J'

become,

R = generate_random_id(C, U, N, T), and R = ‘VNSUHJ LQKRIJ’ comes out.

-Simulation 2 - In case of different IDs at the same time

Same as above, N = 6, C = { ‘0’, … , ‘9’, ‘A’, … , ‘Z’}, set S = 10 + 26 = 36.

Instead, U = ‘B05EFA’,

If T = ‘382901’ as above,

0 <= n < 36, (0 ... 35)

IndexOf(U) = { 11, 0, 6, 14, 15, 10 },

numOf(T) = { 3, 8, 2, 9, 0, 1 },

If you perform an operation for each digit,

preId[0] = C ( ( 3 + 11 + 18 ) % 36 ) = C ( 32 % 36 ) = C ( 31 ) = 'W'

133preId[1] = C ( ( 8 + 0 + 18 ) % 36 ) = C ( 26 % 36 ) = C ( 26 ) = 'Q'

preId[2] = C ( ( 2 + 6 + 18 ) % 36 ) = C ( 26 % 36 ) = C ( 26 ) = 'Q'

preId[3] = C ( ( 9 + 14 + 18 ) % 36 ) = C ( 41 % 36 ) = C ( 5 ) = '5'

preId[4] = C ( ( 0 + 15 + 18 ) % 36 ) = C ( 33 % 36 ) = C ( 33 ) = 'X'

preId[5] = C ( 1 + 10 + 18 ) % 36 ) = C ( 29 % 36 ) = C ( 29 ) = 'T'

ego,

postId[0] = C ( ( 3 + 18 ) % 36 ) = C ( 21 ) = 'L'

postId[1] = C ( ( 8 + 18 ) % 36 ) = C ( 26 ) = 'Q'

postId[2] = C ( ( 2 + 18 ) % 36 ) = C ( 20 ) = 'K'

postId[3] = C ( ( 9 + 18 ) % 36 ) = C ( 27 ) = 'R'

postId[4] = C ( ( 0 + 18 ) % 36 ) = C ( 18 ) = 'I'

postId[5] = C ( ( 1 + 18 ) % 36 ) = C ( 19 ) = 'J'

become,

R = generate_random_id(C, U, N, T), and R = ‘WQQ5XT LQKRIJ’.

Therefore, even if the same OTP comes out at the same time, different random codes have different results.

In operation 1210, the first electronic device 101 may obtain the same second seed for all users. Here, the second seed may be, for example, a seed value for generating a time-based one-time password, and may be different from the first seed. In operation 1220, the first electronic device 101 may generate a second OTP based on the second seed and the first time information, and may determine an offset using the second OTP in operation 1230. For example, the first electronic device 101 may set an offset generated using the second seed as a result value of a mode operation on the number of elements of a character set. The second seed may be the same for all users registered in the system as well as the first user, and accordingly, the offset generated at the first time point may be the same for all users, so that the uniqueness of the generated code can be continuously guaranteed. there is.

In operation 1310, the first electronic device 101 may obtain the same second seed for all users. Here, the second seed may be, for example, a seed value for generating a time-based one-time password, and may be different from the first seed.

In operation 1320, the first electronic device 101 may generate a second OTP using the second seed and the first time information. In operation 1330, the first electronic device 101 may determine a character set using the second OTP. For example, the first electronic device 101 may initially acquire a basic character set and determine a character set to be used for code generation by transforming the basic character set based on the second OTP.

In operation 1410, the first electronic device 101 may obtain a basic character set. For example, the first electronic device 101 {'0', '1', '2', . . . , '9' }. The number of elements of the basic character set may be 10.

In operation 1420, the first electronic device 101 may generate a second OTP using the second seed and the first time information. In various embodiments of the present disclosure, the first electronic device 101 may generate the second OTP using the hOTP algorithm. For example, it is assumed that the first electronic device 101 has generated the second OTP of 123456.

In operation 1430, the first electronic device 101 may obtain an operation result value by performing a mod operation on the second OTP and the size of the character set. In operation 1840, the first electronic device 101 may swap the positions of two characters in the basic character set by using the result of the operation. For example, the first electronic device 101 may obtain a mode operation result of 6 for 123456. The first electronic device 101 may interpret the operation result of 6 as an index of the character set and swap the 6th character of the character set with the 0th character.

In operation 1450, the first electronic device 101 may obtain a character set obtained by shuffling the basic character set by sequentially performing swapping on all characters. For example, with respect to the first character of the character set, the first electronic device 101 interprets OPT generation, mode operation, and operation result values as an index, and swaps the first character with a character corresponding to the index, The above-described process may be performed for all of the second to ninth characters.

In operation 1460, the first electronic device 101 may generate a first code using the shuffled character set.

As described above, the character set can be dynamically changed, and if only the seed is shared, the same character set can be generated for all users, so that uniqueness of the code generated as described above can be continuously guaranteed.

In the following, an algorithm of the above-described character set shuffling method will be described.

1. Let the basic character set C = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'} .

2. Set the global key and use it as the seed of OTP.

3. Create a random character set by repeating the following as many times as the size of the character set S.

1) To change the place of C(n), create one HOTP and calculate Mod with the set size.

2) If HOTP is 123456, 6 is obtained by calculating Mod with 10, which is the size of the character set.

3) The obtained 6 means the index of C, and the number corresponding to C[6] is exchanged with the C[0]th character to be changed. i.e. swapping.

4) Repeat steps 1, 2, and 3 9 more times until C[9].

5) When the above calculation is completed, a set of shuffled characters comes out, and a random ID can be generated using this set.

Simulation - character set shuffling

Character set C = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, size of C = 10, 0 <= n < 10.

Let S be the HOTP generated at each step and O be the modular value.

O(0) = 1111 2222 % 10,

O(1) = 3333 4444 % 10,

O(2) = 5555 6666 % 10,

O(3) = 7777 8888 % 10,

O(4) = 9999 0000 % 10,

O(5) = 1111 2222 % 10,

O(6) = 3333 4444 % 10,

O(7) = 5555 6666 % 10,

O(8) = 7777 8888 % 10,

Assume that O(9) = 9999 0000 % 10.

1) C[0] = 0 shuffle

Since O[0] = 11112222 % 10 = 2, C[2] is sent to C[0] and C[0] is sent to C[2] to swap. Therefore, the character set is C = {2, 1, 0, 3, 4, 5, 6, 7, 8, 9}.

2) Shuffle C[1] = 1

Since O[1] = 33334444 % 10 = 4, we send C[4] to C[1] and send C[1] to C[4] to swap. So the character set is C = {2, 4, 0, 3, 1, 5, 6, 7, 8, 9}.

3) C[2] = 0 shuffle

Since O[2] = 55556666 % 10 = 6, we send C[6] to C[2] and send C[2] to C[6] to swap. So the character set is C = {2, 4, 6, 3, 1, 5, 0, 7, 8, 9}.

4) Shuffle C[3] = 1

Since O[3] = 77778888 % 10 = 8, we send C[8] to C[3] and send C[3] to C[8] to swap. So the character set is C = {2, 4, 6, 8, 1, 5, 0, 7, 3, 9}.

5) C[4] = 4 shuffle

Since O[4] = 99990000 % 10 = 0, we send C[0] to C[4] and send C[4] to C[0] to swap. So the character set is C = {1, 4, 6, 8, 2, 5, 0, 7, 3, 9}.

6) C[5] = 5 shuffle

Since O[5] = 1111 2222 % 10 = 2, we send C[2] to C[5] and send C[5] to C[2] to swap. So the character set is C = {1, 4, 5, 8, 2, 6, 0, 7, 3, 9}.

7) Shuffle C[6] = 0

Since O[6] = 3333 4444 % 10 = 4, we send C[4] to C[6] and send C[6] to C[4] to swap. So the character set is C = {1, 4, 5, 8, 0, 6, 2, 7, 3, 9}.

8) C[7] = 7 shuffle

Since O[7] = 5555 6666% 10 = 6, we send C[6] to C[7] and send C[7] to C[6] to swap. Therefore, the character set is C = {1, 4, 5, 8, 0, 6, 7, 2, 3, 9}.

9) C[8] = 3 shuffle

Since O[8] = 7777 8888% 10 = 8, we send C[8] to C[8] and send C[8] to C[8] to swap. Therefore, the character set is C = {1, 4, 5, 8, 0, 6, 7, 2, 3, 9}.

10) C[9] = 9 shuffle

Since O[9] = 9999 0000 % 10 = 0, we send C[0] to C[9] and send C[9] to C[0] to swap. Therefore, the character set is C = {9, 4, 5, 8, 0, 6, 7, 2, 3, 1}.

So the shuffled character set is C = {'9', '4', '5', '8', '0', '6', '7', '2', '3', '1'} , and a random code is generated once using this shuffling character set.

It will be appreciated that the embodiments of the present invention can be realized in the form of hardware, software, or a combination of hardware and software. Any such software may include, for example, a volatile or non-volatile storage device such as a ROM, whether removable or rewritable, or a memory device such as a RAM, a memory chip, device, or integrated circuit. , or optically or magnetically recordable and machine-readable storage media, such as CDs, DVDs, magnetic disks, or magnetic tapes. The graphic screen updating method of the present invention can be implemented by a computer or portable terminal including a control unit and a memory, and the memory is a program including instructions for implementing the embodiments of the present invention or a machine suitable for storing the programs. It will be appreciated that this is an example of a readable storage medium. Accordingly, the present invention includes a program including code for implementing an apparatus or method described in any claim of this specification and a storage medium readable by a machine (such as a computer) storing such a program. In addition, such a program may be transmitted electronically through any medium, such as a communication signal transmitted through a wired or wireless connection, and the present invention appropriately includes equivalents thereto.

Also, the device may receive and store the program from a program providing device connected by wire or wirelessly. The program providing device includes a memory for storing a program including instructions for causing the graphic processing device to perform a preset content protection method, information necessary for the content protection method, and the like, and wired or wireless communication with the graphic processing device. It may include a communication unit for performing and a control unit for transmitting a corresponding program to the transmitting/receiving device at the request of the graphic processing device or automatically.

Claims

In the first electronic device,

a memory for storing a plurality of encryption packages, each of the plurality of encryption packages including an encryption algorithm and/or a decryption algorithm;

a processor operatively coupled to the memory; and

communication circuitry operatively coupled to the processor;

the processor,

generating a first random number based on the first counter;

Selecting a first encryption package from among the plurality of encryption packages based on the first random number;

Generating a first ciphertext based on applying a first key and a first plaintext to an encryption algorithm of the first encryption package;

A first electronic device configured to control the communication circuit to transmit information including the first encrypted text and the first counter to a second electronic device.
According to claim 1,

The processor, as at least part of an operation of generating the first random number based on the first counter,

The first electronic device configured to generate the first random number based on applying a first seed shared with the second electronic device in advance and the first counter to a random number generating algorithm.
According to claim 2,

The first counter is a first time point, and the first random number is a first OTP.
According to claim 1,

the processor,

The first electronic device further configured to generate the first key based on the first random number.
According to claim 1,

the processor,

The first electronic device further configured to generate the first key based on a second random number different from the first random number.
According to claim 5,

the processor,

The first electronic device further configured to generate the second random number using a seed different from a seed used to use the first random number and the first counter.
According to claim 5,

the processor,

further configured to generate the second random number using a seed used to use the first random number and a second counter different from the first counter;

The processor may, as at least part of the operation of controlling the communication circuitry to transmit the information to the second electronic device, transmit information comprising the second counter along with the first ciphertext and the first counter to the communication circuit. A first electronic device configured to control a circuit.
In the second electronic device,

a memory for storing a plurality of encryption packages, each of the plurality of encryption packages including an encryption algorithm and/or a decryption algorithm;

a processor operatively coupled to the memory; and

communication circuitry operatively coupled to the processor;

the processor,

Receiving information including a first counter and a first ciphertext from a first electronic device through the communication circuit;

generating a first random number based on the first counter;

Selecting a first encryption package from among the plurality of encryption packages based on the first random number;

A second electronic device configured to generate a first plaintext corresponding to the first ciphertext based on applying a first key and the first ciphertext to a decryption algorithm of the first encryption package.
According to claim 8,

The processor, as at least part of an operation of generating the first random number based on the first counter,

The second electronic device configured to generate the first random number based on applying a first seed shared with the first electronic device in advance and the first counter to a random number generating algorithm.
According to claim 9,

The first counter is a first time point, and the first random number is a first OTP.
According to claim 8,

the processor,

The second electronic device further configured to generate the first key based on the first random number.
According to claim 8,

the processor,

The second electronic device further configured to generate the first key based on a second random number different from the first random number.
According to claim 12,

the processor,

The second electronic device further configured to generate the second random number using a seed different from the seed used to generate the first random number and the first counter.
According to claim 12,

the processor,

Receiving a second counter different from the first counter through the communication circuit;

The second electronic device further configured to generate the second random number based on the seed used to generate the first random number and the second counter.
A method of operating a first electronic device that stores a plurality of encryption packages, wherein each of the plurality of encryption packages includes an encryption algorithm and/or a decryption algorithm,

generating a first random number based on the first counter;

selecting a first encryption package from among the plurality of encryption packages based on the first random number;

generating a first ciphertext based on applying a first key and a first plaintext to an encryption algorithm of the first encryption package; and

Transmitting information including the first ciphertext and the first counter to a second electronic device

A method of operating a first electronic device comprising a.
According to claim 15,

The operation of generating the first random number based on the first counter,

The operating method of the first electronic device generating the first random number based on applying the first seed and the first counter previously shared with the second electronic device to a random number generation algorithm.
17. The method of claim 16,

The first counter is a first time point, and the first random number is a first OTP.
According to claim 15,

Generating the first key based on the first random number

A method of operating a first electronic device further comprising a.
According to claim 15,

Generating the first key based on a second random number different from the first random number

A method of operating a first electronic device further comprising a.
According to claim 19,

An operation of generating the second random number using a seed different from the seed used to use the first random number and the first counter

A method of operating a first electronic device further comprising a.
According to claim 19,

The operation method of the first electronic device,

Generating the second random number using a seed used for using the first random number and a second counter different from the first counter,

The operation of transmitting the information to the second electronic device may include transmitting information including the second counter together with the first encrypted text and the first counter.
A method of operating a second electronic device for storing a plurality of encryption packages,

receiving information including a first counter and a first ciphertext from the first electronic device;

generating a first random number based on the first counter;

selecting a first encryption package from among the plurality of encryption packages based on the first random number; and

An operation of generating a first plaintext corresponding to the first ciphertext based on applying a first key and the first ciphertext to a decryption algorithm of the first encryption package.

A method of operating a second electronic device comprising a.
23. The method of claim 22,

The operation of generating the first random number based on the first counter,

A method of operating a second electronic device that generates the first random number based on applying a first seed previously shared with the first electronic device and the first counter to a random number generation algorithm.
24. The method of claim 23,

The first counter is a first time point, and the first random number is a first OTP.
23. The method of claim 22,

Generating the first key based on the first random number

A method of operating a second electronic device further comprising a.
23. The method of claim 22,

Generating the first key based on a second random number different from the first random number

A method of operating a second electronic device further comprising a.
27. The method of claim 26,

Generating the second random number using a seed different from the seed used to generate the first random number and the first counter

A method of operating a second electronic device further comprising a.
27. The method of claim 26,

The operation of receiving the information including the first counter and the first password text from the first electronic device further includes receiving a second counter different from the first counter;

The operation method of the second electronic device,

Generating the second random number based on the seed used to generate the first random number and the second counter

A method of operating a second electronic device further comprising a.