JP2011082680A - Encrypting communication terminal device, encrypting communication system, encrypting communication method, and computer program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an encrypting communication terminal device and an encrypting communication system which improve confidentiality for decryption of encrypted information to prevent interception on a way of a route in a receiver side. <P>SOLUTION: At transmission, Step S1 assigns numbers (natural numbers beginning from 1) to all information which can be transmitted (here, "A", "B", "C"). Step S2 extracts a predetermined number of digits (here, it is 7) excluding a first digit from a multiplied product (here, D30×D31×D32×D33) of all terminal identification prime numbers which can not be all gathered in any communication route. Step S3 obtains a remainder (here, it is 1) of a result obtained by dividing the predetermined number of digits by a number (here, it is 3) of the information. Step S4 selects a prime factor for information which is shown by a number (namely, 3) which is a sum of the remainder and the number (namely, 2) of information (here, it is "B") to be transmitted. Upon receiving, the system decodes by a reverse algorithm from the above method. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to an encrypted communication terminal device, an encrypted communication system, an encrypted communication method, and a computer program. In particular, in preparation for interception on the receiver side, the confidentiality of decrypting encrypted information is improved. The present invention relates to an encrypted communication terminal device, an encrypted communication system, an encrypted communication method, and a computer program.

In recent years, in the field of encrypted communication terminal devices, when used in an ad hoc network, a communication terminal device other than the original counterpart (receiving side terminal device) relays transmission data from the transmitting side terminal device and relays communication data. Since data is exchanged, leakage of transmission data is a problem.
Under such circumstances, a data encryption technique using an encryption key as disclosed in Patent Document 1 has already been widely used.
However, in the technical method described in Patent Document 1, information leakage occurs when the encryption key is decrypted. As a countermeasure, a method that does not use the encryption key has been proposed.

  That is, in the method that does not use the encryption key, the terminal information serving as the information path and the information (number, etc.) of the receiver (terminal device) are converted into corresponding prime numbers, and the transmitted information (data) also corresponds to the prime numbers. There is disclosed a method of sending a product obtained by converting to a product and multiplying them as an information packet from a transmitter to a receiver using a plurality of paths. In the case of this method, it is difficult to factorize multiple large prime products for information concealment, but numbers with common factors can be easily factorized by methods such as Euclidean algorithm. Is used.

JP 2004-241865 A

However, in the conventional encrypted communication terminal apparatus described in the above background art, for example, in the case of the technical method described in Patent Document 1, if the encryption key is decrypted as described above, There was a problem that information leakage could not be avoided.
In addition, in the case of the above-described method that does not use the encryption key proposed as a countermeasure, there is still a possibility that information is leaked if the decryption is performed by squeezing from the prime group for information. Hereinafter, this problem will be described in detail.

FIG. 6 is a configuration diagram showing a system configuration of a communication network in a method not using an encryption key.
In the figure, a terminal device identified by the terminal identification prime D10 and an intercepting terminal device identified by the terminal identification prime D20 are arranged on the route 1 which is a route between the transmitter 100 and the receiver 101, A terminal device identified by the terminal identification prime D11 and a terminal device identified by the terminal identification prime D21 are arranged on the path 2, and a terminal device identified by the terminal identification prime D12 on the path 3, and a terminal A terminal device identified by the identification prime D22 is arranged, and a terminal device identified by the terminal identification prime D13 and a terminal device identified by the terminal identification prime D23 are arranged on the path 4. The whole terminal identification prime numbers identified by the receiver 101 are D30, D31, D32, and D33.
6 indicate a prime group U, an information prime group V, and a random number prime group R indicating the order of information in this order.

FIG. 7 is an explanatory diagram showing terminal ROM information and a random number generator used in an encrypted communication terminal device using a method that does not use an encryption key.
In the figure, terminal ROM information includes, for example, a terminal identification prime number (Dn1, Dn2,...) And an order prime group U (U1, U2, U3, U4,...) Indicating the order of information to be transmitted. Information prime group V (“A” = V1, V11, V12, V4, V7, etc., “B” = V2, V21, V22, V5, V8, etc., “C” = V3, V31, V32, V6, etc. ..., And a random number prime group R (Ra, Rb, Rc,...) And the like. A random number required for encryption is generated by a random number generator.

FIG. 8 is a flowchart showing the procedure of the information transmission method that does not use the encryption key.
Hereinafter, the procedure of the information transmission method that does not use the encryption key will be described using the flowchart shown in FIG. 8 with reference to FIGS.
First, in step C1, a plurality of route information to the receiving terminal device and terminal identification prime number information of the route are acquired by an existing method.
Next, in step C2, a prime for order is extracted from a prime group U indicating the order of information corresponding to the number of paths.
Next, in step C3, random numbers are generated, and information primes are extracted from an appropriate information prime group V from information to be transmitted.
Next, in Step C4, a random number is generated, and an appropriate prime number is extracted from the random number prime group R.

Next, in step C5, terminal identification prime numbers of different receiving terminal apparatuses are assigned to each path.
Next, in step C6, for each route, the product of the terminal identification primes of all the terminal devices that pass through the corresponding order primes (elements of prime group U) and information primes (elements of information prime group V). And the product of the synchronous prime number (the element of the prime group R for random numbers) is sent to each of the corresponding paths.
Finally, in step C7, it is verified whether or not all the information (information calculated in step C6) has been sent to the route. If the sending of all the information has not been completed, the process returns to step A1. . On the other hand, when the sending of all information is completed, the process is terminated.

FIG. 9 is a flowchart showing the procedure of the information receiving method of the method not using the encryption key. This receiving method is also applied to a terminal device located at a passing point of a route.
Hereinafter, the procedure of the information receiving method that does not use the encryption key will be described using the flowchart shown in FIG. 9 with reference to FIGS.
First, in step D1, it is verified whether or not it is divisible by any terminal identification prime number possessed by the received information, and if divisible, the process proceeds to step D2. On the other hand, if it is not divisible, the received information is discarded (then, step D1 is repeated to verify the remaining received information).
In step D2, a quotient obtained by dividing the received information by the terminal identification prime number is calculated.
Next, in step D3, it is detected whether there is other synchronized reception information. If there is synchronized reception information, the process returns to step B1. On the other hand, if there is no synchronized reception information, the process proceeds to step D4.

In step D4, it is verified whether or not there are two or more pieces of received information. If there are two or more pieces of received information, the process proceeds to step D5. On the other hand, if there is only one reception information, the data is transmitted to all neighboring terminal devices other than the receiving terminal device, and the process is terminated.
In step D5, two pieces of received information are selected from two or more pieces of received information, and it is verified whether or not the greatest common divisor can be obtained by the Euclidean mutual assistance method, and the largest common divisor is obtained using the two received information. If there is something to be done, the process proceeds to step D6. On the other hand, if the maximum common divisor cannot be obtained for any two pieces of received information, data is transmitted to all neighboring terminal devices other than the receiving terminal device, and the process is terminated.

In step D6, the greatest common divisor is calculated, and a quotient obtained by dividing each quotient calculated in step D2 by the greatest common divisor is obtained.
Next, in step D7, the obtained quotient is further divided in order by each of the known order primes.
Next, in step D8, the result of the remainder (that is, divisible) in the above division is the above-described information prime corresponding to the decoded information of the received information (ie, the quotient). The information is restored using the quotient as an information prime. Further, since the divided prime for order is the above-mentioned prime for order corresponding to the order of the information, the order of information corresponding to the prime for order is calculated.

Here, as a problem of the method that does not use the encryption key described above, it is difficult to conceal if the information prime number group originally prepared for the intercepted information is thoroughly examined.
That is, in FIG. 6, for example, when a terminal device having the terminal identification D22 is intercepted, the intercepted information U3 × V3 × Ra × D22 × D32 is divided into all prime numbers belonging to the information prime group V. . If it is divisible, the divided prime number is V3, and it is understood that the transmitted information is information corresponding to the prime number V3, that is, “C”.
In the method that does not use the encryption key, in order to prevent this as much as possible, a plurality of prime groups are assigned to each information to make it redundant. However, the prime groups that can be prepared in the terminal device are limited, so that sufficient concealment can be achieved. Is not guaranteed.

  The present invention has been made in view of the above-described conventional problems, and by preparing the information prime group and the terminal identification prime number on the transmission side, in particular, in preparation for interception on the receiver side in the middle of the path. Thus, an object of the present invention is to provide an encrypted communication terminal device, an encrypted communication system, and an encrypted communication method that can improve the confidentiality of encrypted information.

  In order to solve the above-described problem, the encrypted communication terminal device according to the present invention corresponds to a terminal identification prime number corresponding to each terminal device on the communication path, a prime number indicating the order of information to be transmitted, and information to be transmitted. An encrypted communication terminal apparatus that uses a product obtained by multiplying all the prime numbers for information and the random number prime numbers corresponding to the random numbers for encrypting the transmission information as transmission / reception information, and calculates the product at the time of transmission The original information prime number corresponding to the information to be transmitted to the receiving side terminal device as the information prime number to be the first multiplier of the multiplication is determined in advance between the transmitting side and the receiving side. Information prime number encryption means using information encrypted by a predetermined algorithm using information that cannot be obtained by the terminal device, and upon reception, the encrypted information prime number is determined and the encrypted information for Several, characterized by comprising a decoding means of the information for the prime of calculating the prime for the original information by using the inverse algorithm of said algorithm.

  Moreover, the encryption communication system which contains the said encryption communication terminal device in a component as an encryption communication system which concerns on this invention is provided.

  The encrypted communication terminal method according to the present invention includes a terminal identification prime number corresponding to each terminal device on the communication path, a prime number indicating the order of information to be transmitted, an information prime number corresponding to the information to be transmitted, An encrypted communication method using transmission / reception information as a product obtained by multiplying all random number primes corresponding to random numbers for encrypting transmission information, and at the time of transmission, a multiplication multiplier for calculating the product, As the information prime number, the information prime number corresponding to the information to be transmitted to the receiving side terminal device is determined in advance between the transmitting side and the receiving side, and information that cannot be acquired by the terminal device in the middle of the path A step of encrypting information primes using the one encrypted by the predetermined algorithm used, and determining the encrypted information primes upon reception, and from the encrypted information primes, the algorithm It characterized by having a a decoding step of information for primes for calculating the prime for the original information by using the inverse algorithm of rhythm.

  Furthermore, the computer program according to the present invention includes a terminal identification prime number corresponding to each terminal device on the communication path, a prime number indicating the order of information to be transmitted, an information prime number corresponding to the information to be transmitted, and transmission information. A computer program for controlling an encrypted communication terminal device having transmission / reception information with a product obtained by multiplying all prime numbers for random numbers corresponding to random numbers for encryption, and calculating the product at the time of transmission A terminal device in the middle of the path, where the original information prime number corresponding to the information transmitted to the receiving side terminal device is determined in advance between the transmitting side and the receiving side as the information prime number that is the first multiplier Encrypting information primes using information encrypted by a predetermined algorithm using information that cannot be obtained, and determining the encrypted information primes upon reception Together, the prime for dark Goka information, characterized by having a a decoding step of information for primes for calculating the prime for the original information by using the inverse algorithm of said algorithm.

  As described above, according to the encrypted communication terminal device of the present invention, the original information prime number corresponding to the information to be transmitted is acquired by the terminal device in the middle of the route as the information prime number constituting the information to be transmitted. Information that cannot be encrypted (for example, a terminal identification prime number corresponding to another terminal device outside the route) is encrypted using a predetermined algorithm, so that the confidentiality of information in preparation for interception by the receiver side along the route There is an effect that it is possible to provide an encrypted communication terminal device with improved performance.

It is a block diagram which shows the system configuration | structure as an example of the encryption communication system which concerns on embodiment of this invention. It is explanatory drawing which shows the terminal ROM information and random number generator which are used with the encryption communication terminal device which concerns on embodiment of this invention. It is a flowchart figure which shows the process sequence at the time of the transmission of the information in the encryption communication terminal device which concerns on embodiment of this invention. It is a flowchart figure which shows the process sequence at the time of reception of the information in the encryption communication terminal device which concerns on embodiment of this invention. In the encrypted communication terminal device according to the embodiment of the present invention, the information prime number encryption method (processing method) when information is transmitted and the information prime number decryption method procedure when information is received are: FIG. 5A shows the procedure of the information prime number encryption method, and FIG. 5B shows the procedure of the information prime number decryption method. It is a block diagram which shows the system configuration | structure of the communication network of the method which does not use an encryption key. It is explanatory drawing which shows the terminal ROM information and random number generator which are used with the encryption communication terminal device of the method which does not use an encryption key. It is a flowchart figure which shows the procedure of the transmission method of the information of the method which does not use an encryption key. It is a flowchart figure which shows the procedure of the receiving method of the method which does not use an encryption key.

The present invention uses information (for example, terminal identification primes corresponding to the terminal devices of all routes) that cannot be acquired by the terminal device in the middle of the route at the time of transmission of information. It is essential to improve confidentiality against unauthorized decryption by processing (encrypting).
DESCRIPTION OF EMBODIMENTS Hereinafter, embodiments of an encrypted communication terminal device, an encrypted communication system, and an encrypted communication method of the present invention will be described in detail with reference to the drawings.
In the description of each embodiment, the encrypted communication device according to the present invention will be described in detail. However, the encrypted communication terminal method and the computer program according to the present invention will be applied to the encrypted communication device. Since it is a communication terminal device and a program, the description regarding the said encryption communication terminal method and program is contained in the following description.

FIG. 1 is a block diagram showing a system configuration as an example of an encrypted communication system according to an embodiment of the present invention. In the same figure, the same reference numerals are given to the same parts as in FIG.
In the figure, a terminal device identified by the terminal identification prime D10 and an intercepting terminal device identified by the terminal identification prime D20 are arranged on the route 1 which is a route between the transmitter 100 and the receiver 101, A terminal device identified by the terminal identification prime D11 and a terminal device identified by the terminal identification prime D21 are arranged on the path 2, and a terminal device identified by the terminal identification prime D12 on the path 3, and a terminal A terminal device identified by the identification prime D22 is arranged, and further, a terminal device identified by the terminal identification prime D13 and a terminal device identified by the terminal identification prime D23 are arranged on the path 4, Among these terminal devices, at least the transmitter 100 and the receiver 101 are encrypted communication terminal devices according to the embodiment of the present invention.

FIG. 2 is an explanatory diagram showing terminal ROM information and a random number generator used in the encrypted communication terminal device according to the embodiment of the present invention.
In the figure, terminal ROM information includes, for example, a terminal identification prime number (Dn1, Dn2,...) And an order prime group U (U1, U2, U3, U4,...) Indicating the order of information to be transmitted. Information prime group V (“A” = V1, V11, V12, V4, V7, etc., “B” = V2, V21, V22, V5, V8, etc., “C” = V3, V31, V32, V6, etc. ..., And a random number prime group R (Ra, Rb, Rc,...) And the like. A random number required for encryption is generated by a random number generator.
Hereinafter, the operation at the time of transmission / reception by the encrypted communication terminal device according to the embodiment of the present invention will be described.
First, the operation at the time of transmission by the encrypted communication terminal apparatus according to the embodiment of the present invention will be described.

FIG. 3 is a flowchart showing a processing procedure when transmitting information in the encrypted communication terminal apparatus according to the embodiment of the present invention.
Hereinafter, a processing procedure at the time of transmission of information in the encrypted communication terminal device according to the present embodiment will be described with reference to FIGS.
(Step A1)
First, in step A1, a plurality of route information to the receiving terminal device and terminal identification prime number information of the route are acquired by an existing method.

In the case of the communication network shown in FIG. 1, the terminal identification prime number corresponding to the acquired route-corresponding terminal device is:
Path 1: D1 → D20 → D30
Path 2: D11 → D21 → D30
Path 1: D12 → D22 → D30
Path 1: D13 → D23 → D30
It is.

(Step A2)
Next, in step A2, a prime for order is extracted from a prime group U indicating the order of information corresponding to the number of paths.
The extracted order primes correspond to the order of the information transmitted to the terminal device in the entire information string. In the case of the communication network shown in FIG. 1, the order prime used is the order prime U (1 to 8).
(Step A3)
Next, in step A3, random numbers are generated, and information primes are extracted from an appropriate information prime group V from information to be transmitted.

In the case of the communication network shown in FIG. 1, information prime numbers V (1 to 8) are used to express “A, B, C, A, B, C, A, B”.
However, the information prime numbers V1 (1 to 8) here are processed (ie encrypted) by a predetermined method instead of using a simple correspondence with the correspondence table as in the existing system. Shall be used. This processing (that is, encryption) method will be described later.
(Step A4)
Next, in step A4, a random number is generated, and an appropriate prime number is extracted from the random number prime group R.

In the case of the communication network shown in FIG. 1, the random number prime Ra is used for the first time, and the random number Rb is used for the second time.
(Step A5)
Next, in step A5, terminal identification prime numbers of different receiving terminal apparatuses are assigned to each path.
In the case of the communication network shown in FIG. 1, a terminal identification prime D30 is provided for path 1, a terminal identification prime D31 is provided for path 2, a terminal identification prime D32 is provided for path 3, and a terminal identification prime D33 is provided for path 4. assign.
(Step A6)
Next, in step A6, the order primes (elements of prime group U) and information primes (elements of information prime group V) corresponding to the products of the terminal identification primes of all the terminal devices that pass through are obtained for each route. And the product of the synchronous prime number (the element of the prime group R for random numbers) is sent to each of the corresponding paths.

In the case of the communication network shown in FIG.
To route 1, U1 × V1 × Ra × D10 × D20 × D30,
To route 2, U2 x V2 x Ra x D11 x D21 x D31,
To path 3, U3 × V3 × Ra × D12 × D22 × D32,
To route 4, U4xV4xRaxD13xD23xD33,
Send each one.
However, the information prime numbers V1 (1 to 4) here are not simply used in correspondence with the correspondence table as in the existing system, as described above, but are processed by a predetermined method (that is, encryption). )) Shall be used. This processing (that is, encryption) method will be described later.

(Step A7)
Finally, in step A7, it is verified whether or not all the information (information calculated in step A6) has been sent to the route. If the sending of all the information has not been completed, the process returns to step A1. . On the other hand, when the sending of all information is completed, the process is terminated.
Next, an operation at the time of reception by the encrypted communication terminal device according to the embodiment of the present invention will be described.

FIG. 4 is a flowchart showing a processing procedure when receiving information in the encrypted communication terminal apparatus according to the embodiment of the present invention.
Hereinafter, a processing procedure at the time of receiving information in the encrypted communication terminal apparatus according to the present embodiment will be described with reference to FIGS.
First, in step B1, it is verified whether or not it is divisible by any terminal identification prime number possessed by the received information, and if divisible, the process proceeds to step B2. On the other hand, if it is not divisible, the received information is discarded (then, step B1 is repeated to verify the remaining received information).
In step B2, a quotient obtained by dividing the received information by the terminal identification prime number is calculated.
Next, in step B3, it is detected whether there is other synchronized reception information. If there is synchronized reception information, the process returns to step B1. On the other hand, if there is no synchronized reception information, the process proceeds to step B4.

In Step B4, it is verified whether or not there are two or more pieces of received information. If there are two or more pieces of received information, the process proceeds to Step B5. On the other hand, if there is only one reception information, the data is transmitted to all neighboring terminal devices other than the receiving terminal device, and the process is terminated.
In step B5, two pieces of reception information are selected from two or more pieces of reception information, and it is verified whether or not the greatest common divisor can be obtained by the Euclidean mutual assistance method, and the greatest common divisor is obtained using the two pieces of reception information. If there is something to be done, the process proceeds to step B6. On the other hand, if the maximum common divisor cannot be obtained for any two pieces of received information, data is transmitted to all neighboring terminal devices other than the receiving terminal device, and the process is terminated.
In step B6, the greatest common divisor is calculated, and a quotient obtained by dividing each quotient calculated in step B2 by the greatest common divisor is obtained.
Next, in step B7, the obtained quotient is further divided in order by each of the known order primes.

  Next, in step B8, the result of the remainder of the division (that is, the result of being divided) is the information prime number corresponding to the decoded information of the information received by the result of the division (that is, the quotient) (where Therefore, the quotient is used as an encrypted prime number for information, and the original information is restored by a procedure described later. Further, since the divided prime for order is the above-mentioned prime for order corresponding to the order of the information, the order of information corresponding to the prime for order is calculated.

FIG. 5 shows an encryption method (processing method) for information primes when information is transmitted and a decryption method for information primes when information is received in the encrypted communication terminal device according to the embodiment of the present invention. FIG. 5A shows a procedure of the information prime number encryption method, and FIG. 5B shows a procedure of the information prime number decryption method.
Hereinafter, with reference to FIGS. 1 to 4, using the flowchart shown in FIG. 5, the encryption method (processing method) of the prime number for information when transmitting information in the encrypted communication terminal device according to the present embodiment. And the procedure of the decoding method of the prime number for information in the case of receiving information is demonstrated.

First, an information prime number encryption method (processing method) when information is transmitted will be described with reference to a flowchart shown in FIG.
However, here, in order to simplify the description, the following example will be used.
In this example, it is assumed that the information “B” is sent on the path 3 shown in FIG. 1, and the product of the terminal identification prime numbers received by the receiver, that is, the number in the lower second digit of D30 × D31 × D32 × D33 is “ It is assumed that it is 7 "(the first digit can only be an odd number, so it is not used to increase confidentiality).
Further, in order to simplify the description, it is assumed here that all information is composed of “A”, “B”, and “C” (therefore, the number N of information in this case is N = 3). Is).

(Step S1)
First, in step S1, the transmitter 100 (see FIG. 1) assigns numbers 1, 2, 3,..., N to all configured information. In this example, numbers 1, 2, and 3 are assigned to “A”, “B”, and “C”, respectively (that is, “A” → 1, “B” → 2, and “C” → 3). . However, this allocation is notified to the receiver side in advance.
(Step S2)
Next, in step S2, the transmitter 100 calculates the product (= D30 × D31 × D32 × D33) for all terminal identification primes selected for transmission from the terminal identification primes for identifying the terminal device on the receiving side. ) The number AZ of the digits excluding the last one digit (a predetermined digit previously decided with the receiving side) is extracted. In this case, first, the last two-digit number SZ = 7 is extracted.

(Step S3)
Next, in step S3, the transmitter 100 divides the extracted number SZ by the number of information N and sets the remainder as AZ. That is, SZ mod (N) = AZ is calculated. Here, 7 mod (3) = 1, so AZ = 1.
(Step S4)
Finally, in step S4, the transmitter 100 transmits an FZ-th information prime number obtained by adding AZ to the number X of information to be sent. That is, since X + AZ = FZ and “B” => 2 here, 2 + 1 = 3, and for example, V3 is sent. However, when X + AZ> N, X + AZ−N = FZ.
Thereby, the prime number for information (here, V3) encrypted by the above procedure is transmitted according to the procedure shown in the flowchart of FIG.

Next, a method for decoding information primes when information is received will be described using the flowchart shown in FIG.
(Step S11)
First, in step S11, the receiver 101 decodes the entire received information according to the flowchart shown in FIG. As a result, the information prime V3 (encrypted) obtained in the path 3 and the terminal identification primes D30, D31, D32, and D33 of the receiver are acquired.
(Step S12)
Next, in step S12, the receiver 101 determines a predetermined number previously determined with the transmitter side from the number excluding the last digit of the product of the obtained terminal identification prime numbers (= D30 × D31 × D32 × D33). The digit number AZ is extracted (here, the lower two-digit number SZ = 7 is extracted).
(Step S13)

Next, in step S13, the receiver 101 divides the extracted SZ by the number of information N and sets the remainder as AZ. That is, SZmod (N) = AZ is calculated, and since 7mod (3) = 1 here, AZ = 1 is calculated.
(Step S14)
Finally, in step S14, the receiver 101 obtains the information number XZ from the obtained information prime V3 (encrypted), and calculates XZ-AZ (= X) from the above-mentioned remainder AZ. (However, if XZ−AZ ≦ 0, N + XZ−AZ = X). An information number is obtained from X. In this example, since the information number is 3-1 = 2, the information “B” to which 2 is assigned is decoded.

  In the above example, the transmitter side is the transmitter 100 and the receiver side is the receiver 101. However, in the present invention, for example, the terminal device of an arbitrary path shown in FIG. 1 is both a receiver and a transmitter. In addition, the above-described encryption and decryption procedures are also applied to the relay station that performs both tasks.

  According to this embodiment, since processing (encryption) is performed on the prime numbers for information as described above, the information on the illegal act of examining all the information prime numbers that are originally prepared for the intercepted information. There is an effect that can be concealed.

  For example, when transmission information from the transmitter 100 is intercepted synchronously in both the terminal device having the terminal identification prime number D21 and the terminal device having the terminal identification prime number D22, the information of the two information packets is obtained from the Euclidean mutual division method or the like. Thus, it is easy to factorize into U2 × V2 × D31 and U3 × V3 × D32, respectively, where the order primes U2 and U3 are easy to decipher, and V2 × D31 and V3 Assuming that × D32 is obtained, information on the prime numbers V2 and V3 for information can be obtained by dividing all values of the prime number group for information into this value. However, in order to perform the above decoding in the first place, a value of D30 × D31 × D32 × D33 is necessary to determine the true prime number for information, but all the information can be acquired by the receiver 101. However, since everything is not prepared on the intercepted route, information can be concealed.

  Moreover, even if the value of D30 × D31 × D32 × D33 is leaked, how to determine the true information prime number (that is, the method for decoding the information prime number) is kept secret. As long as there is, the information can be kept confidential.

  Note that at least part of the processing of each component of the encrypted communication terminal device according to the present invention is executed by computer control, and the above processing is performed according to the procedures shown in the flowcharts of FIGS. The program to be executed by the computer may be distributed after being stored in a computer-readable recording medium such as a semiconductor memory, a CD-ROM, or a magnetic tape. A computer including at least a microcomputer, a personal computer, and a general-purpose computer may read and execute the program from the recording medium.

  INDUSTRIAL APPLICABILITY The present invention is applicable to the construction of an encrypted communication terminal device and an encrypted communication system, and in particular, encrypted communication with enhanced secrecy for decryption of encrypted information in preparation for interception on the receiver side. It is suitable for construction of a terminal device and an encrypted communication system.

1-4 route (communication route)
100 Transmitter 101 Receiver D10-13, D20-23, D30-33 Terminal identification prime number (corresponding to terminal device)
U Prime group indicating the order of information (corresponding to the order of information to be transmitted)
V prime group for information (corresponding to information to be transmitted)
R prime group for random numbers (corresponding to random numbers for encryption)

Claims (9)

Corresponding to the terminal identification prime corresponding to each terminal device on the communication path, the prime corresponding to the order of the information to be transmitted, the information prime corresponding to the information to be transmitted, and the random number for encrypting the transmission information An encrypted communication terminal device that uses a product obtained by multiplying all prime numbers for random numbers as transmission / reception information,
At the time of transmission, the information prime number corresponding to the information to be transmitted to the receiving side terminal device is preliminarily set between the transmitting side and the receiving side as the information prime number that is the first multiplier of the multiplication for calculating the product. A means for encrypting information prime numbers using a predetermined algorithm using information that cannot be acquired by a terminal device in the middle of the route,
Means for decoding the information prime number for calculating the original information prime number from the encrypted information prime number by using an inverse algorithm of the algorithm from the encrypted information prime number upon reception; When,
An encrypted communication terminal device comprising:   2. The encrypted communication terminal apparatus according to claim 1, wherein the algorithm uses all terminal identification prime numbers that are not all arranged on individual communication paths connecting the transmission side terminal apparatus and the reception side terminal apparatus. .   3. The encryption according to claim 2, wherein the algorithm uses a product obtained by multiplying all of the terminal identification primes that are not all arranged in any of the communication paths connecting the transmitting terminal device and the transmitting terminal device. Communication terminal device.   The algorithm is a predetermined digit excluding the first digit of a product obtained by multiplying all of the terminal identification primes that are not all arranged in any of the communication paths connecting the transmitting terminal device and the transmitting terminal device. 4. The encrypted communication terminal apparatus according to claim 3, wherein a number is used.   The algorithm calculates a predetermined number of digits excluding the first digit of a product obtained by multiplying all of the terminal identification prime numbers that are not all in the communication path connecting the transmitting terminal device and the transmitting terminal device. 5. The encrypted communication terminal apparatus according to claim 4, wherein a remainder obtained by dividing the number of pieces of information to be transmitted is used.   The algorithm is a predetermined number of digits excluding the first digit of a product obtained by multiplying all terminal identification primes that are not all in the communication path connecting the transmission side terminal device and the transmission side terminal device. The information prime number corresponding to the number indicated by the sum of the result of adding the remainder of the result obtained by dividing the number by the total number of the terminal identification prime numbers and the number of the information to be transmitted is selected. The encrypted communication terminal device according to claim 5.   The encryption communication system which contains the encryption communication terminal device of any one of Claims 1 thru | or 6 in a component. A terminal identification prime number corresponding to each terminal device on the communication path, a prime number indicating the order of information to be transmitted, an information prime number corresponding to the information to be transmitted, and a random number corresponding to a random number for encrypting transmission information An encrypted communication method that uses a product obtained by multiplying all prime numbers by transmission / reception information,
At the time of transmission, the information prime number corresponding to the information to be transmitted to the receiving side terminal device is preliminarily set between the transmitting side and the receiving side as the information prime number that is the first multiplier of the multiplication for calculating the product. An agreed-upon prime number information encryption step using a predetermined algorithm using information that cannot be acquired by a terminal device in the middle of the route,
A step of decrypting the information prime number for calculating the original information prime number from the encrypted information prime number using the inverse algorithm of the algorithm while determining the encrypted information prime number upon reception; When,
An encrypted communication method characterized by comprising: A terminal identification prime number corresponding to each terminal device on the communication path, a prime number indicating the order of information to be transmitted, an information prime number corresponding to the information to be transmitted, and a random number corresponding to a random number for encrypting transmission information A computer program for controlling an encrypted communication terminal device using transmission / reception information as a product obtained by multiplying all prime numbers,
At the time of transmission, the information prime number corresponding to the information to be transmitted to the receiving side terminal device is preliminarily set between the transmitting side and the receiving side as the information prime number that is the first multiplier of the multiplication for calculating the product. An agreed-upon prime number information encryption step using a predetermined algorithm using information that cannot be acquired by a terminal device in the middle of the route,
A step of decrypting the information prime number for calculating the original information prime number from the encrypted information prime number using the inverse algorithm of the algorithm while determining the encrypted information prime number upon reception; When,
A computer program characterized by comprising:

Images