WO2017119668A1 - Data transmission apparatus and method enabling non-repudiation for transmission message - Google Patents

Abstract

Disclosed are a data transmission apparatus and method enabling non-repudiation for a transmission message. According to one embodiment of the present invention, the data transmission apparatus and method enabling the non-repudiation for the transmission message: generate predetermined random strings; store hash values, which are generated by performing a chain hash value calculation process for the random strings, in a key storage unit; additionally perform the chain hash value calculation process for the random strings, so as to generate a verification key; transmit the verification key to a data reception device; perform an electronic signature for the message to be transmitted to the data reception device, on the basis of the hash values stored in the key storage unit; and transmit the message having the electronic signature to the data reception device so as to induce the data reception device to verify an electronic signature value on the basis of the verification key, thereby providing a non-repudiation function for the transmission message.

Description

Data transmission device and method capable of non repudiation of transmission message

The present invention relates to a security technique for providing a non-repudiation function for a transmission message transmitted by a data transmission device to a data reception device in a network system.

Recently, with the development of Internet technology, an environment capable of transmitting and receiving data between various Internet-enabled terminals has been established. Due to the development of the Internet technology, IoT technology or smart grid related technologies are emerging.

When a message is exchanged between terminals in a network system, a security environment such as verifying the integrity of the message or encrypting the message needs to be established. In particular, a security service for checking whether a message delivered from a specific user is delivered by a true user is called a non-repudiation service.

In general, non-repudiation services introduced in general online banking services or network systems are mainly digital signature systems using public key cryptography.

In the digital signature system of the public key encryption method, the message forwarding party encrypts the hash value of the message with its own private key, and then transmits the message and the value encrypted with the private key to the message receiving party. A receiver decrypts the encrypted value with a public key corresponding to the private key, calculates a hash value for the message received from a message transmitter, and compares the decrypted value with the public key to a hash value for the message. If it is determined that the two values are equal to each other, it is proved that the encrypted value received from the message transmission side is really encrypted by the private key of the message transmission side, so that the message is transmitted from the true message transmission side. It is a system to confirm that.

Such public key cryptography digital signature system can be used very easily to implement non repudiation of the message sender. However, since it requires a large amount of computation, public key encryption can be used in an environment where there is very little hardware or software resources available for computation. There is a drawback to not using the method.

In particular, in recent years, not only devices such as general computers, but also Internet of Things (IoT) system or a network-based power system smart grid system is being introduced, but most terminal devices used in such an environment In view of the lack of computing resources, it is expected that it will be difficult to use non-repudiation based on public key encryption.

Therefore, there is a need for a system that can provide a non-repudiation function through a new form of non-repudiation function based on existing public key encryption.

An apparatus and method for non-repudiation of a transmission message according to an embodiment of the present invention generate predetermined random strings and perform a chain hash value operation process on the random strings. The generated hash values are stored in a key storage unit, and the chain hash value calculation process is additionally performed on the random strings, thereby generating a verification key and transmitting the verification key to a data receiving apparatus. By sending a message to be transmitted to the data receiving device by digitally signing the message to be transmitted based on the hash values stored in the key storage unit, by inducing the data receiving device to verify the digital signature value based on the verification key, It is possible to provide a non-repudiation function for the transmission message.

A data transmission apparatus capable of non repudiation of a transmission message according to an embodiment of the present invention generates t (t is a natural number) random strings and then the t random strings for each of the t random strings A random string generator for allocating sequence information indicating each of the two information sequences; and a chain hash value calculation process based on a predetermined first hash function for each of the t random strings, wherein k is a natural number. Storing the hash values generated in the k chain hash value calculation processes and the number of chain hash value calculations performed to generate the hash values so as to correspond to each other on the key storage unit. In the storage unit, k hash values for each of the t random strings and a chain hash value operation number corresponding to each of the k hash values are stored. A hash value storage unit configured to generate a message hash value by inputting a message to be transmitted to the data receiving device as an input to the selected second hash function, and n data (n is a natural number) of the message hash values. A data converter for generating n numbers by dividing the data contained in the groups into i (i is a natural number) digits, and each of the n numbers among the t random strings; N is selected from the key storage unit with reference to n predetermined operation numbers that are preset to select n random strings to which the same sequence information is assigned and to extract one hash value for each of the n random strings. A concatenation hash value corresponding to a predetermined number of operations corresponding to each random string among the n predetermined numbers of operations A hash value extractor for extracting a total of n hash values by extracting one hash value corresponding to the number of operations and a data transmitter for transmitting the message and the n hash values to the data receiving apparatus; do.

Further, according to an embodiment of the present invention, a non-repudiable data transmission method for generating a transmission message generates t (t is a natural number) random strings and then, for each of the t random strings, the t random strings Allocating sequence information indicating each of the plurality of random strings, and performing k (k is a natural number) times of a chain hash value calculation process based on a selected first hash function for each of the t random strings; The t random strings are stored on the key storage unit by storing the hash values generated in the operation process and the number of consecutive hash value operations performed to generate the hash values so as to correspond to each other on the key storage unit. Storing k hash values for each and the number of concatenation hash value operations corresponding to each of the k hash values, to the data receiving apparatus Generating a message hash value by applying a message to be transmitted as an input to the selected second hash function, dividing the message hash value into n data groups (n is a natural number), and storing the data contained in each group. generating n numbers by converting i (i is a natural number) to a number, selecting n random strings to which the same sequence information as each of the n numbers is allocated among the t random strings, and For each of the n random strings, the n random strings are selected from the key storage unit with reference to the n predetermined number of operations that are set in advance to extract one hash value for each of the n random strings. By extracting one hash value in which a chain hash value corresponding to a predetermined number of operations corresponding to a random string is stored Extracting a total of n hash values and transmitting the message and the n hash values to the data receiving apparatus.

An apparatus and method for non-repudiation of a transmission message according to an embodiment of the present invention generate predetermined random strings and perform a chain hash value operation process on the random strings. The generated hash values are stored in a key storage unit, and the chain hash value calculation process is additionally performed on the random strings, thereby generating a verification key and transmitting the verification key to a data receiving apparatus. By sending a message to be transmitted to the data receiving device by digitally signing the message to be transmitted based on the hash values stored in the key storage unit, by inducing the data receiving device to verify the digital signature value based on the verification key, The non-repudiation function for the transmitted message can be provided.

1 is a diagram illustrating a structure of a data transmission apparatus capable of non-repudiation of a transmission message according to an embodiment of the present invention.

2 is a flowchart illustrating a data transmission method capable of non repudiation of a transmission message according to an embodiment of the present invention.

As the invention allows for various changes and numerous embodiments, particular embodiments will be illustrated in the drawings and described in detail in the written description. However, this is not intended to limit the present invention to specific embodiments, it should be understood to include all modifications, equivalents, and substitutes included in the spirit and scope of the present invention. In describing the drawings, similar reference numerals are used for similar elements.

When a component is referred to as being "connected" or "connected" to another component, it may be directly connected to or connected to that other component, but it may be understood that other components may be present in between. Should be. On the other hand, when a component is said to be "directly connected" or "directly connected" to another component, it should be understood that there is no other component in between.

The terminology used herein is for the purpose of describing particular example embodiments only and is not intended to be limiting of the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In this application, the terms "comprise" or "have" are intended to indicate that there is a feature, number, step, operation, component, part, or combination thereof described in the specification, and one or more other features. It is to be understood that the present invention does not exclude the possibility of the presence or the addition of numbers, steps, operations, components, components, or a combination thereof.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art. Terms such as those defined in the commonly used dictionaries should be construed as having meanings consistent with the meanings in the context of the related art and shall not be construed in ideal or excessively formal meanings unless expressly defined in this application. Do not.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating a structure of a data transmission apparatus capable of non-repudiation of a transmission message according to an embodiment of the present invention.

1, a non-repudiable data transmission apparatus 110 for a transmission message according to an embodiment of the present invention may include a random string generator 111, a hash value storage 112, and a message hash value. A generator 114, a data converter 115, a hash value extractor 116, and a data transmitter 117 are included.

The random string generator 111 generates t (t is a natural number) random strings and allocates sequence information indicating each of the t random strings to each of the t random strings.

The hash value storage unit 112 performs k (k is a natural number) times of a chain hash value calculation process based on a predetermined first hash function for each of the t random strings, and performs k times. By storing the respective hash values generated in the chain hash value calculation process and the number of chain hash value calculations performed to generate the respective hash values on the key storage unit 113, the key storage unit 113 is stored. K hash values for each of the t random strings and a number of concatenation hash value operations corresponding to each of the k hash values are stored.

At this time, according to an embodiment of the present invention, the hash value storage unit 112 applies the t random strings to each of the t random strings as input to the selected first hash function to supply a hash value. And performing the k-threshold hash value calculation process of calculating the additional hash value by applying the calculated hash value to the selected first hash function again as an input.

The message hash value generator 114 generates a message hash value by applying a message to be transmitted to the data receiving apparatus 120 as an input to the selected second hash function.

The data converter 115 divides the message hash value into n data groups (n is a natural number), converts the data contained in each group into a number of i (i is a natural number) digits, and converts the number to n numbers. Create them.

The hash value extractor 116 selects n random strings to which the same order information is allocated among the n numbers among the t random strings, and extracts one hash value for each of the n random strings. For each of the n random strings, the predetermined number of operations corresponding to each random string among the n predetermined operation numbers is determined from the key storage unit 113 with reference to the n predetermined operation numbers that are set in advance. A total of n hash values are extracted by extracting one hash value corresponding to the number of matching chain hash value operations.

The data transmitter 117 transmits the message and the n hash values to the data receiver 120.

At this time, according to an embodiment of the present invention, the data transmission apparatus 110 capable of non repudiation of a transmission message may further include a verification key generator 118 and a verification key transmitter 119.

The verification key generator 118 performs k + 1 concatenation hash values on each of the t random strings and computes a k + 1 th concatenation hash value, respectively, for each of the t random strings. The computed k + 1 th concatenation hash value is determined as a verification key for each of the t random strings, and is assigned to each of the t random strings for a verification key for each of the t random strings. Assign the same sequence information as the sequence information.

The verification key transmitter 119 transmits a verification key for each of the t random strings to the data receiving apparatus 120.

At this time, according to an embodiment of the present invention, the data receiving device 120 is the predetermined first hash function, the predetermined second hash function, the n predetermined number of operations and the t random number on the memory When the message and the n hash values are received from the data transmission apparatus 110 capable of storing non-repudiation of the transmission message, the message is stored in the selected second hash function. Generates the message hash value by applying the input, divides the message hash value into n data groups, converts the data contained in each group into the number of the binary number, and generates n verification numbers, After selecting n verification keys to which the same order information as each of the n verification numbers is assigned among the verification keys for each of the t random strings A chain hash value operation count for each of the n hash values is determined by referring to the n predetermined operation counts, and the k + 1 th chain hash is performed based on the chain hash value operation count for each of the n hash values. Compute the k + 1 th concatenation hash value for each of the n hash values by performing the concatenation hash value calculation process based on the selected first hash function for each of the n hash values until a value is calculated. Then, if it is confirmed that the k + 1 th chain hash value for each of the n hash values matches all of the n verification keys, authentication for the message may be completed.

Hereinafter, an operation of the data transmission apparatus 110 capable of non repudiation of a transmission message according to the present invention will be described in detail.

First, the random string generator 111 may generate t (t is a natural number) random strings and then allocate sequence information indicating each of the t random strings to each of the t random strings. Assuming that t is 1024, the random string generator 111 may generate 1024 random strings “s ₁ , s ₂ ,..., S ₁₀₂₄ ”, and the 1024 random strings may be generated. The order information "1" through "1024" can be allocated, respectively.

In addition, the hash value storage unit 112 applies the 1024 random strings to each of the 1024 random strings as an input to “f (x)”, which is a selected first hash function, for the 1024 random strings. It is possible to generate hash values "f ¹ (s ₁ ), f ¹ (s ₂ ), ..., f ¹ (s ₁₀₂₄ )" for each.

Then, the hash value storage unit 112 returns the hash values " f ¹ (s ₁ ), f ¹ (s ₂ ), ..., f ¹ (s ₁₀₂₄ ) " The second hash values "f ² (s ₁ ), f ² (s ₂ ), ..., f ² (s ₁₀₂₄ )" may be generated as an input to "f (x)". In this manner, the hash value storage unit 112 performs k (k is a natural number) times of a chain hash value calculation process based on the selected first hash function, for each of the 1024 random strings, and performs the k chain hashes. Each hash value generated in a value calculation process may be generated. Assuming k is “8”, the hash value storage unit 112 may select the selected first hash for each of the 1024 random strings. The key storage unit 113 stores the hash values generated in the eight chain hash value calculation processes by performing the chain hash value calculation process based on a function eight times and the number of chain hash value calculations performed to generate the respective hash values. The images may be stored to correspond to each other.

In this regard, information may be stored on the key storage 113 as shown in Table 1 below.

Random strings	1 time calculate Hash value	Episode 2 calculate Hash value	3rd time calculate Hash value	4 times calculate Hash value	5th calculate Hash value	6th calculate Hash value	7th calculate Hash value	8th calculate Hash value
s 1	f 1 (s 1 )	f 2 (s 1 )	f 3 (s 1 )	f 4 (s 1 )	f 5 (s 1 )	f 6 (s 1 )	f 7 (s 1 )	f 8 (s 1 )
s 2	f 1 (s 2 )	f 2 (s 2 )	f 3 (s 2 )	f 4 (s 2 )	f 5 (s 2 )	f 6 (s 2 )	f 7 (s 2 )	f 8 (s 2 )
...	...	...	...	...	...	...	...	...
s 1024	f 1 (s 1024 )	f 2 (s 1024 )	f 3 (s 1024 )	f 4 (s 1024 )	f 5 (s 1024 )	f 6 (s 1024 )	f 7 (s 1024 )	f 8 (s 1024 )

In Table 1, the number indicated by the superscript of the hash value indicates the number of consecutive hash value calculations, and the number indicated by the subscript of the random string indicates sequence information indicating each random string.

For example, “f ³ (s ₂ )” means a hash value generated by performing a 3 ′ chain hash value operation on the second random string.

In this manner, the hash value storage unit 112 performs a total hash value calculation process based on the selected first hash function for each of the 1024 random strings a total of eight times, thereby generating hash values generated in each operation process. The number of concatenation hash value calculations for each hash value may be stored on the key storage 113.

In this case, the verification key generation unit 118 performs the concatenation hash value calculation process nine times on each of the 1024 random strings, calculates a ninth concatenation hash value, and calculates the concatenation of the 1024 random strings. The ninth concatenation hash value is determined as a verification key for each of the 1024 random strings, and at the same time, the same sequence number information is allocated to each of the 1024 random strings for the verification key for each of the 1024 random strings. Order information can be assigned.

That is, the verification key generation unit 118 performs the concatenation hash value calculation process nine times on each of the 1024 random strings, as shown in Table 2 below, and performs a ninth concatenation hash on each of the 1024 random strings. You can generate a value.

Random strings	Hash value computed 9 times
s 1	f 9 (s 1 )
s 2	f 9 (s 2 )
...	...
s 1024	f 9 (s 1024 )

Thereafter, the verification key generation unit 118 determines the ninth concatenation hash value calculated for each of the 1024 random strings as a verification key for each of the 1024 random strings, and at the same time, the 1024 random strings. For each verification key, the same sequence information as the sequence information allocated to each of the 1024 random strings may be allocated.

That is, since the ninth chain hash value for the random string "s ₁ " is "f ⁹ (s ₁ )", the verification key generation unit 118 performs the random string "s ₁ for" f ⁹ (s ₁ ) "". Order information, which is the same order information as "", may be allocated.

As such, when generation of the verification key for each of the 1024 random strings is completed in the verification key generation unit 118, the verification key transmission unit 119 determines that "f ⁹ is a verification key for each of the 1024 random strings. (s ₁ ), f ⁹ (s ₂ ), ..., f ⁹ (s ₁₀₂₄ ) "may be transmitted to the data receiving device 120.

In this case, the data receiving apparatus 120 receives “f ⁹ (s ₁ ), f ⁹ (s ₂ ), ..., f ⁹ (s ₁₀₂₄ ),” which are verification keys for each of the 1024 random strings. Can be stored in memory.

Thus, when generation of the hash values for each of the 1024 random strings as shown in Table 1 and the verification key for each of the 1024 random strings as shown in Table 2 is completed, it is shown in Table 1 above. Hash values for each of the 1024 random strings as shown in FIG. 2 are utilized as key values for generating the digital signature value for the message to be transmitted to the data receiving apparatus 110 by the data transmitting apparatus 110, as shown in Table 2 above. As described above, a verification key for each of the 1024 random strings is used as a verification key value for the data receiving apparatus 120 to verify the digital signature value.

In relation to this, when the data transmission device 110 transmits the message "m" to the data reception device 120, the message hash value generator 114 transmits the message "m" to a predetermined second hash function "h". (x) "as an input to generate the message hash value" h (m) ".

Then, the data converter 115 divides the message hash value " h (m) " into n data groups (n is a natural number) and divides data contained in each group by i (i is a natural number). You can generate n numbers by converting them to decimal numbers.

In relation to this, when n is "8" and the i-number is "decimal", the data converter 115 divides the message hash value "h (m)" into eight data groups, A total of eight numbers may be generated by converting data included in each of the eight data groups into a decimal number.

For example, when the message hash value "h (m)" is data having a size of 8 bytes, the data converter 115 may convert the message hash value "h (m)" into 8 data groups by 1 byte. After dividing by, converting one-byte data included in each data group into a decimal number, a total of eight numbers can be generated.

Thereafter, the hash value extractor 116 may select eight random strings to which the same order information is allocated among the eight numbers among the 1024 random strings.

Relatedly, assuming that the eight numbers generated by the data converter 115 are " 32, 592, 164, 7, 985, 223, 327, 814, " Eight random strings assigned the sequence "32, 592, 164, 7, 985, 223, 327, 814" among the random strings "s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , s ₈₁₄ "can be selected.

Then, the hash value extractor 116 performs one hash value for each of the eight random strings "s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , s ₈₁₄ ". For each of the eight random strings, the predetermined operation corresponding to each of the eight predetermined strings from the key storage unit 113 by referring to the eight selected predetermined number of operations to extract the A total of eight hash values can be extracted by extracting one hash value that corresponds to the number of consecutive hash value calculations corresponding to the number of times.

In this regard, the eight predetermined number of operations that are preset to extract one hash value for each of the eight random strings are " 8 times, 7 times, 6 times, 5 times, 4 times, 3 times, 2 times. Times, once ".

In this case, the hash value extractor 116 may be configured with respect to “s ₃₂ ” among the eight random strings s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , and s _814. Eight hash values generated from the key storage 113 storing the information shown in Table 1 corresponding to the random string "s ₃₂ " are "f ¹ (s ₃₂ ), f ² (s ₃₂ ), and f ^3. (s ₃₂ ), f ⁴ (s ₃₂ ), f ⁵ (s ₃₂ ), f ⁶ (s ₃₂ ), f ⁷ (s ₃₂ ), f ⁸ (s ₃₂ ) ""F ⁸ (s ₃₂ )" corresponding to "8 times", which is the number of consecutive hash value calculations corresponding to, may be extracted.

Then, the hash value extracting unit 116, which are the eight random string _{"s 32, s 592, s} 164, s 7, s 985, s 223, s 327, s 814" of said for "s _592" of Eight hash values "f ¹ (s ₅₉₂ ), f ² (s ₅₉₂ ), and f ³ generated from the key storage unit 113 that store the information shown in Table 1 corresponding to the random string" s ₅₉₂ "are stored. (s ₅₉₂ ), f ⁴ (s ₅₉₂ ), f ⁵ (s ₅₉₂ ), f ⁶ (s ₅₉₂ ), f ⁷ (s ₅₉₂ ), f ⁸ (s ₅₉₂ ) ""F ⁷ (s ₅₉₂ )" corresponding to "7 times", which is the number of consecutive hash value calculations corresponding to, may be extracted.

In addition, the hash value extractor 116 may select “s ₁₆₄ ” among the eight random strings “s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , and s ₈₁₄ ”. Eight hash values "f ¹ (s ₁₆₄ ), f ² (s ₁₆₄ ), and f ³ generated from the key storage unit 113 having the information shown in Table 1 corresponding to the random string" s ₁₆₄ "are stored. (s ₁₆₄ ), f ⁴ (s ₁₆₄ ), f ⁵ (s ₁₆₄ ), f ⁶ (s ₁₆₄ ), f ⁷ (s ₁₆₄ ), f ⁸ (s ₁₆₄ ) ""F ⁶ (s ₁₆₄ )" corresponding to "6 times", which is the number of consecutive hash value calculations corresponding to, may be extracted.

In addition, the hash value extractor 116 may be configured with respect to “s ₇ ” among the eight random strings “s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , and s ₈₁₄ ”. Eight hash values "f ¹ (s ₇ ), f ² (s ₇ ), and f ³ generated from the key storage unit 113 storing the information shown in Table 1 corresponding to the random string" s ₇ ""5times" of the number of operations selected from (s ₇ ), f ⁴ (s ₇ ), f ⁵ (s ₇ ), f ⁶ (s ₇ ), f ⁷ (s ₇ ), f ⁸ (s ₇ ) ""F ⁵ (s ₇ )" corresponding to "5 times", which is the number of consecutive hash value calculations corresponding to, may be extracted.

In addition, the hash value extractor 116 may be configured with respect to “s ₉₈₅ ” among the eight random strings s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , and s _814. Eight hash values "f ¹ (s ₉₈₅ ), f ² (s ₉₈₅ ), and f ³ generated from the key storage unit 113 storing the information shown in Table 1 corresponding to the random string" s ₉₈₅ " (s ₉₈₅ ), f ⁴ (s ₉₈₅ ), f ⁵ (s ₉₈₅ ), f ⁶ (s ₉₈₅ ), f ⁷ (s ₉₈₅ ), f ⁸ (s ₉₈₅ ) ""F ⁴ (s ₉₈₅ )" corresponding to "4 times", which is the number of consecutive hash value calculations corresponding to, may be extracted.

In addition, the hash value extractor 116 may be configured with respect to “s ₂₂₃ ” among the eight random strings “s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , and s ₈₁₄ ”. Eight hash values "f ¹ (s ₂₂₃ ), f ² (s ₂₂₃ ), and f ³ generated from the key storage unit 113 that store the information shown in Table 1 corresponding to the random string" s ₂₂₃ "are stored. (s ₂₂₃ ), f ⁴ (s ₂₂₃ ), f ⁵ (s ₂₂₃ ), f ⁶ (s ₂₂₃ ), f ⁷ (s ₂₂₃ ), f ⁸ (s ₂₂₃ ) ""F ³ (s ₂₂₃ )" corresponding to "three times" of the number of chain hash value calculations corresponding to and may be extracted.

In addition, the hash value extractor 116 may select “s ₃₂₇ ” among the eight random strings “s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , and s ₈₁₄ ”. Eight hash values "f ¹ (s ₃₂₇ ), f ² (s ₃₂₇ ), and f ³ generated from the key storage unit 113 storing the information shown in Table 1 corresponding to the random string" s ₃₂₇ " (s ₃₂₇ ), f ⁴ (s ₃₂₇ ), f ⁵ (s ₃₂₇ ), f ⁶ (s ₃₂₇ ), f ⁷ (s ₃₂₇ ), f ⁸ (s ₃₂₇ ) ""F ² (s ₃₂₇ )" corresponding to "twice", which is the number of consecutive hash value calculations corresponding to, may be extracted.

Finally, the hash value extracting unit 116 is for the "s _814" of the _{"s 32, s 592, s} 164, s 7, s 985, s 223, s 327, s 814" which includes the eight random string Eight hash values "f ¹ (s ₈₁₄ ), f ² (s ₈₁₄ ), f generated from the key storage unit 113 storing the information shown in Table 1 corresponding to the random string" s ₈₁₄ ", f ³ (s ₈₁₄ ), f ⁴ (s ₈₁₄ ), f ⁵ (s ₈₁₄ ), f ⁶ (s ₈₁₄ ), f ⁷ (s ₈₁₄ ), f ⁸ (s ₈₁₄ ) ""F ¹ ( _s814 )" corresponding to the number of consecutive hash value calculations corresponding to the number of times may be extracted.

In this way, the hash value extractor 116 eventually ends with " f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), f from the key store 113. 8 hash values " ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), and f ¹ (s ₈₁₄ )" may be extracted.

Then, the data transmitter 117 transmits the message “m” to the data receiving apparatus 120, and the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), and f ⁶ ( s ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) ". Can be sent as a digital signature value.

In this case, the data receiving apparatus 120 transmits the message “m” and the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), from the data transmission apparatus 110. f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) "are received from the data transmission apparatus 110 in advance and The eight hash values "f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ) and f ⁶ (s) based on the verification key for each of the 1024 random strings shown in Table 2 already stored in memory. ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) ", thereby performing the message" m " This truly checks whether or not the message transmitted from the data transmission device 110 is correct.

In relation to this, the memory of the data receiving apparatus 120 includes not only a verification key for each of the 1024 random strings shown in Table 2, but also the selected first hash function " f (x) " In the hash function "h (x)" and the hash value extractor 116, the eight random strings "s ₃₂ , s ₅₉₂ , s ₁₆₄ , s ₇ , s ₉₈₅ , s ₂₂₃ , s ₃₂₇ , and ₈₁₄ " respectively. The eight selected operations "8 times, 7 times, 6 times, 5 times, 4 times, 3 times, 2 times, 1 times" which were used to extract the hash value for are stored in advance.

In this situation, the data receiving apparatus 120 may transmit the message “m” and the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), and f ⁵ (s ₇ ). , f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) ”, the message“ m ”is converted into the selected second hash function“ h ( x) "to generate the message hash value" h (m) ".

Then, the data receiving apparatus 120 divides the message hash value "h (m)" into eight data groups and converts the data contained in each group into a decimal number to convert the eight verification numbers. Can be generated.

Assuming that the message "m" has not been forged or tampered with, the eight verification digits are the same as the "32, 592, 164, 7, 985, 223, 327," 814 ".

At this time, the data receiving apparatus 120 and the eight verification numbers "32, 592, 164, 7, 985, 223, 327, 814" out of the verification keys for each of the 1024 random strings shown in Table 2 Eight verification keys assigned with the same sequence number may be selected.

In this regard, the data receiving apparatus 120 may select “f ⁹ (s ₃₂ ), f ⁹ (s ₅₉₂ ), f ⁹ as the eight verification keys from among the verification keys for each of the 1024 random strings shown in Table 2 above. ₁₆₄ , f ⁹ (s ₇ ), f ⁹ (s ₉₈₅ ), f ⁹ (s ₂₂₃ ), f ⁹ (s ₃₂₇ ), f ⁹ (s ₈₁₄ ) ”can be selected.

Then, the data receiving device 120 refers to the eight hashes by referring to the eight predetermined operations "8 times, 7 times, 6 times, 5 times, 4 times, 3 times, 2 times, 1 times". Values "f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ) , f ¹ (s ₈₁₄ ) ", and the number of chain hash value operations for each of the eight hash values" f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ ( s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) "The 9th concatenation hash value is calculated based on the number of concatenation hash value operations for each. The eight hash values "f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ) , f ² (s ₃₂₇ ) and f ¹ (s ₈₁₄ ) "for each of the eight hash values" f ⁸ "by performing a chain hash value calculation process based on the selected first hash function" f (x) ". (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) "can be calculated for the 9th concatenation hash value.

In relation to this, the data receiving device 120 may generate the eight hash values because the eight predetermined number of operations are "eight times, seven times, six times, five times, four times, three times, two times, one time." f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) "may be performed to perform a chain hash value calculation process corresponding to" eight times, seven times, six times, five times, four times, three times, two times, and one time ", respectively.

Based on this, the data receiving apparatus 120 may determine the eight hash values "f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s _985). ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) ", further performs a chain hash value calculation process based on the first hash function" f (x) "selected above. Whereby the eight hash values " f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), _{^{f 2 (s 327), f}} 1 (s 814) " can be calculated by the ninth hash value for each.

In this regard, the data receiving apparatus 120 may determine the eight hash values "f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s _{^{985), f 3 (s 223}} ), f 2 (s 327), f 1 (s 814) " of the" f ⁸ (s _32), "a total of" eight times "the chain hash value calculation process is performed to the generated hash by performing "f ⁸ (s _32)" the chain hash value calculation process once more for because it can determine that the value can be calculated by the ninth chain hash value of _{^{"f 9 (s 32)"}} .

In addition, the data receiving apparatus 120 may include the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s ₉₈₅ ). , f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), and f ¹ (s ₈₁₄ ) "are the" f ⁷ (s ₅₉₂ ) "hash values generated by performing a total of" seven times "chain hash value calculation processes. because it can not confirm the "f ⁷ (s _592)" by further performing the hash chain value calculation process 2 only once, it is possible to calculate a ninth chain hash value of _{^{"f 9 (s 592)"}} .

In addition, the data receiving apparatus 120 may include the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s ₉₈₅ ). , f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), and f ¹ (s ₈₁₄ ) "are the" f ⁶ (s ₁₆₄ ) "hash values generated by performing a total" six times "chain hash value calculation process. because be confirmed by "f ⁶ (s _164)" performed only three times more to the chain hash value calculation process for a can be calculated by the ninth chain hash value of _{^{"f 9 (s 164)"}} .

In addition, the data receiving apparatus 120 may include the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s ₉₈₅ ). , f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), and f ¹ (s ₈₁₄ ) "are the" f ⁵ (s ₇ ) "hash values generated by performing a total of" five times "chain hash value calculation processes. because it is confirmed by "f ⁵ (s _7)" performs the chain hash value calculation process four times more for a can be calculated by the ninth chain hash value of _{^{"f 9 (s 7)"}} .

In addition, the data receiving apparatus 120 may include the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s ₉₈₅ ). , "f ⁴ (s ₉₈₅ )" of f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ) and f ¹ (s ₈₁₄ ) "are hash values generated by performing a total of" four times "chain hash value calculation processes. because be confirmed by performing "f ⁴ (s _985)" to the hash chain value calculation process once more for 5, it is possible to calculate a ninth chain hash value of _{^{"f 9 (s 985)"}} .

In addition, the data receiving apparatus 120 may include the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s ₉₈₅ ). _{^{, f 3 (s 223),}} f 2 (s 327), f 1 (s 814) " of the" f ³ (s _223), "a total of" three times "chain hash value computation process is performed to the generated hash value that because be confirmed by performing "f ³ (s _223)" to the hash chain value calculation process once more for 6, it is possible to calculate a ninth chain hash value of _{^{"f 9 (s 223)"}} .

In addition, the data receiving apparatus 120 may include the eight hash values “f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s ₉₈₅ ). , f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), and f ¹ (s ₈₁₄ ) "are the" f ² (s ₃₂₇ ) "hash values generated by performing a total" two "chain hash value calculation process. because it can be calculated to check a ninth chain hash value of _{^{"f 2 (s 327)"}} , "f 9 (s 327)" by further performing the hash chain value calculation process only once for 7.

Finally, the data receiving device 120 is the eight hash values "f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ (s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), and f ¹ (s ₈₁₄ ), where "f ¹ (s ₈₁₄ )" is a "one time" chain hash value. Because it can be confirmed that the "f ¹ (s ₈₁₄ )" by performing the chain hash value calculation process only eight more times, it is possible to calculate the ninth chain hash value "f ⁹ (s ₈₁₄ )".

In this way, the data receiving device 120 eventually receives the eight hash values "f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), f ⁴ ( s ₉₈₅ ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) "as the ninth chained hash values for" f ⁹ (s ₃₂ ), f ⁹ (s ₅₉₂ ), f ⁹ ( ₁₆₄ ), f ⁹ (s ₇ ), f ⁹ (s ₉₈₅ ), f ⁹ (s ₂₂₃ ), f ⁹ (s ₃₂₇ ), f ⁹ (s ₈₁₄ ) ”.

Thereafter, the data receiving apparatus 120 may determine the eight hash values "f ⁸ (s ₃₂ ), f ⁷ (s ₅₉₂ ), f ⁶ (s ₁₆₄ ), f ⁵ (s ₇ ), and f ⁴ (s _985). ), f ³ (s ₂₂₃ ), f ² (s ₃₂₇ ), f ¹ (s ₈₁₄ ) "for the ninth chained hash values" f ⁹ (s ₃₂ ), f ⁹ (s ₅₉₂ ), f ⁹ ( ₁₆₄ ), f ⁹ (s ₇ ), f ⁹ (s ₉₈₅ ), f ⁹ (s ₂₂₃ ), f ⁹ (s ₃₂₇ ), f ⁹ (s ₈₁₄ ) "and the 1024 random numbers shown in Table 2 above. The eight verification keys selected from among the verification keys for each of the strings "f ⁹ (s ₃₂ ), f ⁹ (s ₅₉₂ ), f ⁹ ( ₁₆₄ ), f ⁹ (s ₇ ), f ⁹ (s ₉₈₅ ), When f ⁹ (s ₂₂₃ ), f ⁹ (s ₃₂₇ ), and f ⁹ (s ₈₁₄ ) are compared to each other and both values are found to be identical, the message “m” is stored in the data transmission apparatus 110. It can be confirmed that the digital signature is based on the hash values that are really stored on the key storage 113, and finally, the authentication for the message "m" can be completed.

As a result, the data transmission apparatus 110 capable of non repudiation of a transmission message according to an embodiment of the present invention generates predetermined random strings and performs a hash hash operation on the random strings to generate the hash. By storing the values in the key storage unit 113 and additionally performing the chain hash value calculation process on the random strings, a verification key is generated to transmit the verification key to the data receiving apparatus 120 and then the data. When a message to be transmitted to the reception device 120 is electronically signed based on the hash values stored in the key storage unit 113 and transmitted to the data reception device 120, the data reception device 120 based on the verification key. By inducing the digital signature value to be verified, a non-repudiation function for the transmitted message can be provided.

2 is a flowchart illustrating a data transmission method capable of non repudiation of a transmission message according to an embodiment of the present invention.

In step S210, after generating t (t is a natural number) random strings, sequence information indicating each of the t random strings is allocated to each of the t random strings.

In step S220, each of the t random strings is generated in the k chain hash value calculation process by performing a chain hash value calculation process based on the selected first hash function k times (k is a natural number). K hashes for each of the t random strings on the key storage unit by storing the hash values of and the number of concatenation hash value operations performed to generate the respective hash values corresponding to each other on the key storage unit. Store the values and the number of concatenation hash value operations corresponding to each of the k hash values.

In this case, according to an embodiment of the present invention, in step S220, a hash value is calculated by applying the t random strings to the selected first hash function for each of the t random strings, The k hash value calculation process of the method of calculating an additional hash value by applying the calculated hash value as an input back to the selected first hash function may be performed k times.

In operation S230, a message hash value is generated by applying a message to be transmitted to the data receiving device as an input to the selected second hash function.

In step S240, the message hash value is divided into n data groups (n is a natural number), and the data contained in each group is converted into a number of i (i is a natural number) digits to generate n numbers. do.

In step S250, n random strings to which the same order information is allocated among the n numbers among the t random strings are selected, and in advance to extract one hash value for each of the n random strings. A chain hash value corresponding to a predetermined number of operations corresponding to each random string among the n predetermined operations, for each of the n random strings from the key storage unit with reference to the set n predetermined operations; A total of n hash values are extracted by extracting one hash value corresponding to the number of operations.

In step S260, the message and the n hash values are transmitted to the data receiving device.

At this time, according to an embodiment of the present invention, the data transmission method capable of non repudiation of the transmission message includes k + 1 times the concatenation hash value calculation process for each of the t random strings before step S230. Calculate a k + 1 th concatenation hash value, determine the k + 1 th concatenation hash value calculated for each of the t random strings as a verification key for each of the t random strings, and at the same time, Allocating the same sequence information as the sequence information allocated to each of the t random strings with respect to the verify key for each of the plurality of random strings, and transmitting the verify key for each of the t random strings to the data receiving apparatus. The method may further include transmitting.

In this case, according to an embodiment of the present invention, the data receiving apparatus is configured to store the selected first hash function, the selected second hash function, the n predetermined number of operations and the t random strings on a memory. It may store a verification key for each.

In this case, when the message and the n hash values are received, the data receiving device generates the message hash value by applying the message as an input to the selected second hash function, and converts the message hash value into n data. After dividing the data into groups, the data contained in each group is converted into the number of i-numbers to generate n verification numbers, and each of the n verification numbers from among the verification keys for each of the t random strings. After selecting n verification keys to which the same sequence information is assigned, the number of concatenation hash value calculations for each of the n hash values is checked with reference to the n predetermined operation numbers, and concatenation for each of the n hash values is performed. For each of the n hash values until the k + 1 th chain hash value is computed based on the number of hash value operations Performing the concatenation hash value calculation process based on the selected first hash function to calculate the k + 1 th concatenation hash value for each of the n hash values, and then the k + 1 th for each of the n hash values If the chain hash value is found to match all of the n verification keys, authentication of the message may be completed.

In the above, a data transmission method capable of non repudiation of a transmission message according to an embodiment of the present invention has been described with reference to FIG. 2. Here, the non-repudiation data transmission method according to an embodiment of the present invention may correspond to the configuration of the operation of the non-repudiation data transmission apparatus 110 described above with reference to FIG. 1. Therefore, more detailed description thereof will be omitted.

The non-repudiable data transmission method according to an embodiment of the present invention may be implemented as a computer program stored in a storage medium for execution by combining with a computer.

In addition, a data transmission method capable of non repudiation of a transmission message according to an embodiment of the present invention may be implemented in the form of program instructions that can be executed by various computer means and recorded in a computer readable medium. The computer readable medium may include program instructions, data files, data structures, etc. alone or in combination. Program instructions recorded on the media may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks, such as floppy disks. Magneto-optical media, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like. The hardware device described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

In the present invention as described above has been described by the specific embodiments, such as specific components and limited embodiments and drawings, but this is provided to help a more general understanding of the present invention, the present invention is not limited to the above embodiments. For those skilled in the art, various modifications and variations are possible from these descriptions.

Therefore, the spirit of the present invention should not be limited to the described embodiments, and all the things that are equivalent to or equivalent to the claims as well as the following claims will belong to the scope of the present invention. .

Claims (10)

1. a random string generation unit generating t (t is a natural number) random strings and then assigning sequence information indicating each of the t random strings to each of the t random strings;

   For each of the t random strings, a chain hash value calculation process based on a predetermined first hash function is performed k times, where k is a natural number, and is generated in the k chain hash value calculation processes. By storing the respective hash values and the number of concatenation hash value operations performed to generate the respective hash values corresponding to each other on the key storage unit, k numbers for each of the t random strings on the key storage unit are stored. A hash value storage unit for storing hash values and the number of consecutive hash value operations corresponding to each of the k hash values;

   A message hash value generator for generating a message hash value by applying a message to be transmitted to the data receiving device as an input to the selected second hash function;

   A data converter for dividing the message hash value into n data groups (n is a natural number), and converting the data contained in each group into i (i is a natural number) digit to generate n numbers;

   N preset random strings are selected to select the same random information as the n number of t random strings, and extract one hash value for each of the n random strings. For each of the n random strings from the key storage unit with reference to a predetermined number of operations, a chain hash value operation number corresponding to a predetermined operation number corresponding to each random string among the n predetermined operation numbers is associated. A hash value extracting unit which extracts a total of n hash values by extracting one stored hash value; And

   A data transmitter for transmitting the message and the n hash values to the data receiving apparatus

   Data transmission device capable of non-repudiation of the transmission message comprising a.
2. The method of claim 1,

   The hash value storage unit

   For each of the t random strings, apply the t random strings to the selected first hash function as an input to calculate a hash value, and input the calculated hash value back to the selected first hash function. And a non-repudiation of the transmission message for performing the concatenation hash value calculation process k times by applying an additional hash value.
3. The method of claim 1,

   The k-first concatenation hash value is computed by performing k + 1 concatenation hash value calculation processes on each of the t random strings, and the k + 1-th concatenated operation is performed on each of the t random strings. The hash value is determined as a verification key for each of the t random strings, and at the same time, the same sequence information as the sequence information allocated to each of the t random strings is assigned to the verification key for each of the t random strings. A verification key generation unit; And

   A verification key transmitter for transmitting the verification keys for each of the t random strings to the data receiving apparatus

   Data transmission device capable of non-repudiation of the transmission message further comprising.
4. The method of claim 3,

   The data receiving device

   Storing a verification key for each of the predetermined first hash function, the predetermined second hash function, the n predetermined number of operations, and the t random strings in a memory;

   When the message and the n hash values are received, the message is applied as an input to the selected second hash function to generate the message hash value, and the message hash value is divided into n data groups. Converts the data contained in the group to the number of i-numbers to generate n verification numbers, and the same order information as each of the n verification numbers is assigned among the verification keys for each of the t random strings. After selecting n verification keys, the number of chained hash value calculations for each of the n hash values is determined by referring to the n predetermined number of operations, and based on the number of chained hash value operations for each of the n hash values. Based on the predetermined first hash function for each of the n hash values until the k + 1 th chain hash value is computed. The k + 1 th hash value for each of the n hash values is calculated after the k + 1 th hash value for each of the n hash values is performed by performing the chain hash value calculation process. And a non-repudiation of the transmission message which completes authentication for the message if it is confirmed that all of the keys match.
5. generating t (t is a natural number) random strings and assigning sequence information indicating each of the t random strings to each of the t random strings;

   For each of the t random strings, a chain hash value calculation process based on a predetermined first hash function is performed k times, where k is a natural number, and is generated in the k chain hash value calculation processes. By storing the respective hash values and the number of concatenation hash value operations performed to generate the respective hash values corresponding to each other on the key storage unit, k numbers for each of the t random strings on the key storage unit are stored. Storing hash values and the number of concatenation hash value operations corresponding to each of the k hash values;

   Generating a message hash value by applying a message to be transmitted to the data receiving device as an input to the selected second hash function;

   Dividing the message hash value into n data groups (n is a natural number), and converting the data contained in each group into a number of i (i is a natural number) digits to generate n numbers;

   N preset random strings are selected to select the same random information as the n number of t random strings, and extract one hash value for each of the n random strings. For each of the n random strings from the key storage unit with reference to a predetermined number of operations, a chain hash value operation number corresponding to a predetermined operation number corresponding to each random string among the n predetermined operation numbers is associated. Extracting a total of hash values by extracting one stored hash value; And

   Transmitting the message and the n hash values to the data receiving device.

   Data transmission method capable of non-repudiation of the transmission message comprising a.
6. The method of claim 5,

   The step of storing the chain hash value operation number is

   For each of the t random strings, apply the t random strings to the selected first hash function as an input to calculate a hash value, and input the calculated hash value back to the selected first hash function. And a non-repudiation of the transmission message for performing the concatenation hash value calculation process k times by applying an additional hash value.
7. The method of claim 5,

   The k-first concatenation hash value is computed by performing k + 1 concatenation hash value calculation processes on each of the t random strings, and the k + 1-th concatenated operation is performed on each of the t random strings. The hash value is determined as a verification key for each of the t random strings, and at the same time, the same sequence information as the sequence information allocated to each of the t random strings is assigned to the verification key for each of the t random strings. Doing; And

   Transmitting a verification key for each of the t random strings to the data receiving device

   Non-repudiation data transmission method further comprising a transmission message.
8. The method of claim 7, wherein

   The data receiving device

   Storing a verification key for each of the predetermined first hash function, the predetermined second hash function, the n predetermined number of operations, and the t random strings in a memory;

   When the message and the n hash values are received, the message is applied as an input to the selected second hash function to generate the message hash value, and the message hash value is divided into n data groups. Converts the data contained in the group to the number of i-numbers to generate n verification numbers, and the same order information as each of the n verification numbers is assigned among the verification keys for each of the t random strings. After selecting n verification keys, the number of chained hash value calculations for each of the n hash values is determined by referring to the n predetermined number of operations, and based on the number of chained hash value operations for each of the n hash values. Based on the predetermined first hash function for each of the n hash values until the k + 1 th chain hash value is computed. The k + 1 th hash value for each of the n hash values is calculated after the k + 1 th hash value for each of the n hash values is performed by performing the chain hash value calculation process. And a non-repudiation of the transmission message that completes authentication for the message if it is determined that all of the keys match.
9. A computer-readable recording medium having recorded thereon a program for performing the method of any one of claims 5 to 8.
10. A computer program stored in a storage medium for executing the method of any one of claims 5 to 8 in combination with a computer.

Images