JP2002314530A - Data transfer method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a data transfer method that allows both a sender and a recipient can securely share data without the need for distributing an encryption key (secret key) to both the sender and the recipient in advance and makes wiretapping difficult. SOLUTION: In the data transfer method in a network system characterized in that data are transmitted/received between a 1st device and a 2nd device connected via a network, when the device acting like the transmitter in the 1st and 2nd devices transfers data to the device acting like a receiver, path information to designate a communication path is attached to the data of a transfer object and the data of the transfer object are transferred through the designated communication path. Furthermore, the method is also characterized in that at least one of a plurality of transfer object data is transferred while being attached with path information designating a different communication path from that of the other transfer object data.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data transfer method for safely sharing data between a transmitter and a receiver against eavesdropping.

[0002]

2. Description of the Related Art In a distributed system for use in a limited area such as in a company, for example, when confidential information is communicated between a server computer and a client computer, it is indispensable to protect it by encryption. .

[0003] In this encryption communication, it is necessary to share an encryption key required for encryption processing and decryption processing by both the transmitting side and the receiving side. In addition, this encryption key must be safely delivered to eavesdroppers and the like.

Conventional encryption communication methods are roughly classified into two types: (1) a secret key encryption communication method and (2) a public key encryption communication method.

[0005] The secret key cryptographic communication method is based on the premise that the transmitting device and the receiving device have a common key, and both decide an encryption key in advance and store it, or secure the security separately. There is a need for a means of delivering in a manner.

[0006] In other words, in the secret key cryptographic communication method, it is necessary to prepare another means for delivering and storing a secure cryptographic key in order to transmit and receive information safely. For example, as disclosed in Japanese Patent Application Laid-Open No. 2-203377, it is necessary to set a center for managing encryption keys in a network environment. Further, Japanese Unexamined Patent Publication No.
As disclosed in Japanese Patent Laid-Open No. 5 (1993), an IC card storing a secret key needs to be distributed to a transmitting side and a receiving side in advance.

[0007] On the other hand, the public key cryptographic communication method is to disclose one of complementary key information and use it for encrypted transmission, and to use the other for decryption on the receiving side. ,
It is based on the difficulty in solving mathematical problems of (a) a factorization problem and (b) a discrete logarithm problem.

All of these problems are security based on the empirical fact that it is only expected to be difficult and there is no report that an algorithm that solves fast has been found so far. That is, a person who eavesdrops on the encrypted data has all the information necessary for decryption. However, since it is used based on the expectation that the amount of calculation for decoding it should be enormous, an algorithm that can solve the above difficult problem at least partially even at high speed should be used If found, the method will need to be fundamentally reviewed.

[0009]

As described above, in the secret key cryptographic communication method, it is necessary to prepare another means for delivering and storing a secure cryptographic key in order to transmit and receive information safely. is there.

In addition, the public key cryptographic communication method has a problem that if the difficulty in solving a mathematical problem is solved by finding a high-speed algorithm for solving the mathematical problem or the like, data can be eavesdropped.

An object of the present invention is to provide a data transfer method in which both a sender and a receiver can safely share data without distributing an encryption key (private key) to the sender and the receiver in advance, and in which eavesdropping is difficult. It is in.

[0012]

SUMMARY OF THE INVENTION To achieve the above object, the present invention provides a data transfer in a network system for transferring data between a first device and a second device connected via a network. The method, wherein the first
When data is transferred from the transmitting device to the receiving device of the second device and the second device, path information for specifying a communication path is added to the data to be transferred, and the data to be transferred is It is characterized in that data is transferred via a specified communication path.

Further, at least one of the plurality of transfer target data is transferred by adding path information for specifying a communication path different from other transfer target data.

[0014] This makes it difficult for the eavesdropper to identify the transfer target data unless the eavesdropping is performed on all paths between the first device and the second device.

[0015]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described in detail based on embodiments shown in the drawings.

FIG. 1 is a system configuration diagram showing an embodiment of a network system to which the present invention is applied. This embodiment is, for example, in a company, a personnel information management server 5, a personnel time management server 6, a personnel time management server 6, which manages a personnel time information database 1, a work time management information database 2, an inventory management information database 3, and an accounting information database 4, respectively. A management server 7 and an accounting information management server 8 are arranged, and a number of client computers such as a personal computer (PC) 9 and a network computer (NC) 10 are arranged in each department, and these are connected by a network 11 such as a corporate LAN. By operating each client computer, each database 1, 2, 3, 4
FIG. 1 shows an example of a network system in which necessary information is acquired from the Internet and browsed.

In this embodiment, a server 5 to 8 (sending device) for managing information of each database and a personal computer (PC) 9 and a network computer (NC) 10 (receiving device) as client computers. In order to perform encryption communication by generating an encryption key on both sides, preliminary communication is performed as a previous stage. At this time, the preliminary communication is performed via the plurality of servers by using the cooperation of the plurality of servers 5 to 8 connected to the network environment, and the data for generating the encryption key is transmitted from the transmitting side a plurality of times in the process of the preliminary communication. . In this case, the number of transmissions of the data for generating the encryption key is an arbitrary number of times until the transmitting side sends the preliminary communication end command.

When data for generating an encryption key is transmitted a plurality of times via a plurality of servers, information that can be known only by the transmitting side and the receiving side is the transmission order and the receiving order. In other words, the transmitting side does not transmit any information on the transmission order, but the transmitting side has a clear transmission order of the data for generating the encryption key, and one receiving side does not receive the information on the receiving order. Nevertheless, the information on the receiving order is obvious. On the other hand, the eavesdropper cannot know the information of the transmission order and the reception order unless the data for generating the encryption key is eavesdropped on all routes.

FIG. 2 is a diagram showing a situation in which a large number of data transmission paths exist when performing cryptographic communication between the server X (for example, the personnel information management server 5) and the client Y (for example, the personal computer 9). is there. In FIG. 2, there is a server that manages the subsystems A, B, C, D, E, and F between the sender and the receiver.
(1) Server X → A → B → Client Y (2)
Server X → C → D → A → E → Client Y
(3) Server X → A → D → F → Client Y
This indicates that there are multiple physical path options.

In the preliminary communication, the server X, which provides information, specifies a communication path with the client Y, who receives the information, by ordering a plurality of other server names.

FIG. 3A is a diagram showing an example of the structure of key generation data transmitted / received between the server X and the client Y in the preliminary communication, and includes a destination pointer 31, path data 32, an encryption key The path data 32 is composed of numerical data 33 for generation, and the path data 32 is constructed by arranging the names (or unique information such as network addresses) of a plurality of relay servers between the transmission source and the final destination in the order of relay.

The server in the middle of the communication path supports the preliminary communication by relaying the key generation data. The server at each relay point advances the destination pointer (arrow in the figure) pointing to the next relay server or the receiver in the key generation data. For example, when the key generation data shown in FIG. 3A is relayed by the server A, the destination pointer is advanced by one and changed to point to the server E.

The key generation data transmitted from the server X in the preliminary communication reaches the client Y on the receiving side via the relay servers C, D, A, and E on the way. The arriving key generation data is sent from the client Y to the server X via the reverse route in order to confirm that the data has arrived.

FIG. 3B is a diagram showing the structure of key generation data sent in reverse order.
The return route relay processing in A, D, and C is the same as the outward route.

The preliminary communication mainly consists of performing the round trip communication of the key generation data a plurality of times. The end user selects a certain client, and performs the preliminary communication with the server managing the information to be obtained. start.

FIG. 4 is a diagram showing a procedure of preliminary communication between the server X and the client Y.

Step S1 (Preliminary communication start request) First, a request to start preliminary communication is sent from the client Y to the server X.

Step S2 (transmission of key generation data 1) The server X generates numerical data 33 for key generation, selects an arbitrary number of relay servers, determines a transmission path, and
The first “encryption key generation data 1” having the configuration shown in FIG. 9A is created and transmitted to the client Y that has made the request.

Step S3 (Echo back of key generation data 1) The client Y that has received the "key generation data 1"
The numerical data 33 and the number of the received data are stored.

Next, the client Y returns to the server X “key generation data 1” in which the transmission route is reversed.

Step S4 (transmission of key generation data 2) The server X to which "key generation data 1" has been sent back creates "key generation data 2" on the second floor in the same manner as in step S2. And sends it to client Y.

In this case, it is desirable that the route data 32 and the numerical data 33 are different from the first time from the viewpoint of security.

Step S5 (Echo back of key generation data 2) The client Y that has received the "key generation data 2"
The numerical data 33 and the number of the received data are stored.

Next, the client Y returns to the server X “key generation data 2” in which the transmission route is reversed.

The above processing is repeated an arbitrary number of times K.

Step S6 (Preliminary communication end request) Finally, a preliminary communication end request is sent from the server X to the client Y.

Step S7 (preliminary communication end echo back) The client Y transmits an echo back indicating the end of the preliminary communication to the server X, and ends the preliminary communication.

After the completion of the preliminary communication, any number of key generation data m [i] (i = 1, 2,..., K) ordered in both the server X and the client Y. Is in a known state.

From these numerical data, an encryption key can be generated by the following algorithm, for example.

(A) Sum of m [i] (b) All products of m [i]
(c) The sum of m [i] to the power of i (d) The difference between the product of m [i] arriving at the odd number and the product of m [i] arriving at the even number (e) The ith prime number is p When writing [i], the sum of m [i] raised to the power of p [i] (f)
For all the eavesdroppers of the quotient when divided by [i],
When eavesdropping on some routes, only some information of m [i] can be obtained, and firstly, information for calculating an encryption key cannot be physically collected. Although the possibility of mathematically estimating the encryption key from partial information remains, the eavesdropper can determine the order of each m [i] sent and received, , It is impossible to determine how many have been transmitted and received, making estimation almost impossible.

Here, for example, considering the case where the above algorithm is already known to an eavesdropper by disclosure or eavesdropping, in an algorithm that does not use the arrival order of m [i] such as (a) and (b), If there is a possibility to calculate the encryption key only if a method for efficiently estimating only the remaining information that cannot be eavesdropped is found, the arrival order information of m [i] such as (c) to (f) may be calculated. According to the algorithm used, each e
It is not clear from the contents of the preliminary communication how many [i] has arrived or how many are in total. For this reason, it is very difficult to estimate the encryption key. Further, by including the arrival order information in the encryption key generation algorithm, the key estimation calculation can be made almost impossible.

Therefore, in the present embodiment, an algorithm using the arrival order information of m [i] represented by (c) to (f) is adopted.

After the encryption key is generated by both the server X and the client Y, the secret key cryptographic communication is performed in the usual manner conventionally used. In this case, login to each information management server and access control to confidential data
Since the encrypted communication is performed after the start of the encrypted communication, for example, the account name and the like are transmitted in an encrypted form, security against eavesdroppers can be ensured.

As described above, according to the present embodiment, (1) it is not necessary to distribute an encryption key for encrypted communication to both the transmitting and receiving apparatuses in advance, and as a result, the user or the machine stores the key in advance. There is no need to provide any means for doing so.

(2) Since the network environment itself for distributing the encrypted data is used for generating the encryption key, a distribution means such as a special secure route is not required.

(3) The generated encryption key is physically difficult for an eavesdropper to calculate. Thus, finding a fast algorithm for solving a mathematical problem does not affect the difficulty of its calculation.

Therefore, for example, it is very effective when constructing a distributed network system in which many inexpensive clients (for example, network computers) are introduced in a company.

It should be noted that the present invention is not limited to the above-described embodiment, and it is needless to say that the present invention can be applied to all network configurations in which a plurality of communication paths can be selected.

[0049]

As is apparent from the above description, according to the present invention, there is no need to distribute an encryption key (private key) to both the sender and the receiver in advance, and both the sender and the receiver can safely share data. In addition, wiretapping can be made difficult.

Therefore, the present invention is extremely effective when constructing a distributed network system in which a large number of clients such as network computers are installed as inexpensively as possible in a company.

[Brief description of the drawings]

FIG. 1 is a system configuration diagram showing an embodiment of a network system to which an encryption key distribution method of the present invention is applied.

FIG. 2 is a diagram showing a situation in which a large number of data transmission paths exist when performing cryptographic communication between a server X and a client Y;

FIG. 3 is a diagram illustrating an example of a structure of key generation data transmitted and received between a server X and a client Y in preliminary communication.

FIG. 4 is a diagram illustrating a procedure of preliminary communication between a server X and a client Y.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 ... Personnel information database, 2 ... Work absence management information database, 3 ... Inventory management information database, 4 ... Accounting information database, 5 ... Personnel information management server, 6 ... Work absence management information server, 7 ... Inventory management server, 8 ... Accounting information management server, 9 personal computer (client), 1
0: Network computer (client).

 ──────────────────────────────────────────────────続 き The continuation of the front page F term (reference) 5J104 AA03 AA12 PA07 5K030 GA15 LB05

Claims (2)

[Claims] 1. A data transfer method in a network system for transferring data between a first device and a second device connected via a network, wherein the first device and the second device are connected to each other. When data is transferred from a device on the transmission side to a device on the reception side, path information for specifying a communication path is added to the data to be transferred, and the data to be transferred is transferred through the specified communication path. A data transfer method, characterized in that: 2. The data transfer method according to claim 1, wherein at least one of the plurality of transfer target data is transferred by adding path information specifying a communication path different from other transfer target data.