JP2003076273A - Security enhancing method using magic square sequence - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a security system which is easy to manage and difficult to decipher. SOLUTION: A plaintext in binary representation and a magic square sequence in binary representation are exclusively ORed and the result is sent; and a reception side exclusively ORs the received binary signal and a square magic sequence obtained from the reception side to obtain the plaintext in binary representation and then deciphers the plaintext according to it.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a security strengthening method and a security system capable of preventing damages such as communication interception and unauthorized viewing in the information / communication field.

[0002]

2. Description of the Related Art Encryption is performed in order to convert information which is desired to be kept confidential into information which cannot be normally decrypted. At this time, the original information is called plaintext, the encrypted information is called ciphertext, and the conversion for restoring plaintext from ciphertext is called decryption.

A key is required for encryption and decryption, and the strength of encryption is generally proportional to the size of this key. A third party who does not know this key obtains the plaintext from the ciphertext is called decryption, and the stronger the encryption, the longer the decryption takes.

Conventionally, cryptographic coding methods using exponential functions, fractions, and random numbers have been used, but these methods are
We could not avoid the reduction of numerical range and degeneration. Practically, a binary sequence of a random number sequence is 128 bits or less, and there is a concern that even if it is encrypted, it may be decrypted by a computer.

[0005]

SUMMARY OF THE INVENTION An object of the present invention is to propose an encryption technique that is easy to handle and difficult to decipher.

[0006]

One of the features of the present invention is the first
Information, the step of converting the first information into a binary number, the step of selecting a magic square sequence, the step of converting the selected magic square sequence into a binary number, and the binary first number. Of the above information and the above-mentioned binary digitized magic square number sequence, and creating the second information that has been digitized and has been code-cultured for shortening the communication time, and the second information. And a step of supplying key information regarding the magic square number sequence to a regular user.

The present invention is based on the fact that the total number of normalized magic squares generated by cross interchange and extended cross interchange of higher-order magic squares in algebraic number theory is theoretically enormous. A magic square is a series of numbers arranged in a rectangle so that the sum of vertical, horizontal, and diagonal numbers is the same. For example, the type of the regular form 10 magic square is 10 to the power of 300 (10 ³⁰⁰ ). Reach

The number sequence formed from these magic squares is not only enormous in type, but is generated based on cross replacement and extended cross replacement, so that it is easy to manage and mixed with various random number tables and physical random numbers. -It is easy to include. In the present invention, the key related to the magic square sequence used for encryption is issued only by the legitimate sender and is transmitted to the recipient.
Normally, the same key is not reissued. Currently, there are more than 50 types of procedures for extended cross replacement, but it is possible to further increase the number of types of keys and increase the secrecy.

The present invention can be easily integrated into an IC. In order to further ensure non-decipherability, some normal form 10 magic squares are RO
Convert to M. ROMize the complement operation procedure and the extended cross replacement procedure. It is possible to realize an IC and a microprocessor including a RAM for the calculation buffer area.

The present invention is useful for preventing unwarranted interception which hinders the development of the IT era or obstructs it by using a higher-order magic square sequence.

The present invention relates to appliances such as home appliances, information, communication, electricity, electronics, and HDDs related to the Internet industry.
It will be the basis for supporting the industrial development in the IT era, including various media such as FD / CD / DVD.

The present invention belongs to a communication system that uses an ANK code table for Japanese, a non-Kanji code table, and a Kanji code table. The present invention shifts when using a code table or when performing hexadecimal binary conversion.

Only legitimate senders and receivers with the program can return and decipher this shift. For example, ANK
Shift the code table in hexadecimal (1100) 16. The non-Kanji code table and the Kanji code table are shifted for each hexadecimal number (1111) 16, and the difference from (9FFF) 16 or the like is calculated as a complement and shifted. The hexadecimal binary conversion table is shifted by 8. Such a shift is performed so that the original text cannot be read as it is.

In the present invention, information is cryptographically coded using a binary number sequence whose root is a magic square. That is,
The present invention is based on the finding that a higher-order magic square such as the ten magic square can algebraically produce a vast number of normal form magic squares as its descendants.

The estimated total number of ten magic squares is about 10 ³⁰⁰ .
Therefore, in the present invention, an easy-to-manage and short “Ironohanihoto 7 two-digit sequence” is used. In the present invention, each time transmission is performed, the sender is automatically calculated by a random number generation method from a large number of normal form magic squares exceeding 66 billion.
Filter 35 gives 6 to 26 to 17 and 21 and 8 ".

The receiver who owns the program of the present invention obtains "the contents of the 7-digit sequence of 7 digits in Irohanihoto" from the sender via a secure transmission means, such as a telephone line, and uses it as a key. The original information can be obtained by using the program and decoding it according to the operation of the program obtained in advance.

DETAILED DESCRIPTION OF THE INVENTION FIG. 1 is a block diagram illustrating one embodiment of the present invention. On the transmitting side, the plain text to be transmitted is converted into a binary number using the binary number conversion means 2. On the other hand, as will be described later, the sequence of the selected magic square 4 is converted into binary numbers using the binary number conversion means 6. These binary numbers are given to the input sides A and B of the exclusive OR means 8 and subjected to exclusive OR operation.

In the exclusive OR operation, the output becomes 1 only when one of the inputs is 1 and the other input is 0. That is, when the plaintext is 1 and the magic square number sequence is 0, or when the plaintext is 0 and the magic square number sequence is 1, the output is 1. In this way, the plaintext is encrypted, converted into a binary number sequence, and then transmitted through the transmission means 10.

As the magic square 4, for example, ten magic squares are used.
This magic square 4 has 1 to 10 grids in 10 rows and 10 columns.
A numerical value of 0 is arranged so that the sums in the row direction, the column direction, and the diagonal direction are all the same 505. The magic square 4 can be deformed by a cross swap operation and an extended cross swap operation as will be described later, and the final magic square can be easily specified.

That is, if the set reference magic square and the information about the exchange operation are used as keys to the regular receiver or the regular user, the regular receiver and the regular user can send the information using the key. The original plaintext can be restored from the base number.

For example, when the plaintext is 1 and the magic square sequence is 0, the result of the exclusive logical operation is 1 and 1 is transmitted. The receiving side performs an exclusive OR operation on the received signal 1 and the same magic square number sequence 0 obtained from the transmitting side to obtain 1. Similarly, when the plaintext is 0 and the magic square sequence is 1, the receiving side finally obtains the binary sequence 0. The authorized receiver and authorized user who have obtained the plaintext encrypted in this way can easily turn the encrypted plaintext into the original plaintext by using the key. FIG. 2 shows an example of encryption and decryption when the plaintext is the number “13”.

An authorized user who cannot obtain a key,
It is impossible for anyone other than the authorized recipient to obtain the original plaintext even if the encrypted binary number sequence is obtained. For example, there are more than 60 billion magic squares, and it is impossible to specify which magic square is used.

The program for encrypting plaintext, or the program for decrypting plaintext from encrypted information may be given to a legitimate receiver or a legitimate user in advance, or may be included in transmission information. To send it, you only need to enter the plain text and select the standard magic square and the replacement operation procedure for that magic square with, for example, Iroha nihoheto and inform it to the authorized user as a key. Moreover, the transmitting side can easily change the standard magic square and the replacement operation. The user can reproduce the original plaintext by simply inputting the obtained key information into the program.

Next, one embodiment of the present invention will be described with reference to the flow chart of the transmission / reception method using a code signal for which security measures for communication transmission / reception are used in FIG. It is assumed that the sender and the receiver have a dedicated program group with a calculation function, which will be described in detail with reference to FIG.

At first, the receiver handles a key (indirect key system key) consisting of a sequence of two digits, seven generations (meaning that the standard magic square is cross-exchanged seven times or an extended cross-exchange operation is performed). Good.

After that, the dedicated program set controls the automatic calculation processing such as the non-repetitive code over the entire length that is the same as the original and the intervening shift (addition / subtraction with a constant value) processing. You can easily reproduce the original information and achieve the purpose.

On the other hand, a non-regular user who does not have a dedicated program group even if he / she uses a computer, even if he / she intercepts and obtains signal information of a binary number, a hexadecimal number, a 32 digit number, a 64 digit number and a 128 digit sequence code. Decoding is impossible because the transmitted content is non-repetitive with a different code each time.

In this method, "a part of the indirect key system for forming a normal form higher-order magic square of the n-th generation with n 2-digit number sequences", "1.
"A part where a hexadecimal number is shifted to form a binary number", "a part where a selected normal form higher-order magic square is processed to form a binary number", "forms a communication and communicates" It has a "part" and a "part for receiving and decoding".

Here, a magic square is used as the non-repeating sequence. For example, if the numerical value of the magic square element is 100, the hexadecimal packed number (64) 16 is converted into a binary number (0110
0100) 2 and used as 8-bit information. If there are 10 magic squares, (01
The binary sequence 100100) 2 appears only once.

The sequence values 1 and 93 of the contents obtained by sequentially tracing the elements of the normalized magic square, the complemented magic square, and the magic squares whose front and back are rotated are 100 times for the ten magic square. It is used once every 1 time, and unlike other random number sequences, it does not exhibit duplicated use or degeneracy.

Transmission of binary digitized drawings and photographs, FD
-When processing the contents of media such as CDs and DVDs, and online transmission of music and video, 4 digits of hexadecimal numbers are differently shifted, for example, (84A3) 16 is applied and even the same binary values are slightly dispersed. Blurred to make it incomprehensible, and further subjected to exclusive OR (EXOR) operation processing with non-repeating binary values to form binary values and their hexadecimal, 32 hexadecimal, 64 hexadecimal and 128 binary code characters. It is used as a program for sending and receiving codes.

As will be described in detail with reference to FIG. 3 and subsequent figures, this method is a method capable of forming a new regular type ten magic square, and therefore the original sentence to be transmitted may be a long sentence having one or more characters. Long sentences or binary long digitized sentences are divided into within 256 characters and summarized as a program that can be easily stored in a medium such as an FD prepared for transmission and reception.

In this method, the program further has "the effective time limit of such a 2-digit sequence key". For example, if the reception waiting time limit of 15 minutes elapses, the dedicated program is restarted for both transmission and reception. In addition, as a measure against theft etc., a "program expiration date" is set and displayed in the program so that the expired item cannot be used.

A system is adopted in which a new program is exchanged and the legal order in which communication files are opened only with the contractor is maintained. As a maintenance method at that time,
Exchange the magic square system that is the contents of the directory, change the order of the procedures for replacing the extended cross, and the RAM associated with them.
The ROM is updated.

In the above description, the case of transmitting information has been described, but the present invention can also be applied when using a recording medium on which information is recorded, such as a DVD or a CD-ROM. In this case, the information should be recorded on the recording medium by the method described above, transmitted to the other party, and the authorized user who obtained the key should use the program to restore the original information. You can

FIG. 4 is a matrix showing an example of a solution of ten magic squares, which is a magic square applicable to the present invention, and is similar to a two-digit random number table. This matrix will be described below as an example. Arrangement of integers 1 ... 100 in a total of 100 grids of 10 columns × 10 rows, and all natural numbers from 1 to 100 are 1
It is used only once, and the sum of 10 in each row, the sum of 10 in each column, the sum of one main diagonal and the sum of one subdiagonal are all 5
The array that is 05 is called the ten magic square.

The number of simultaneous equations is 22 for 100 elements.
Although the solution is obtained by a set operation composed of indefinite formulas,
It is extremely difficult to obtain one numerical solution even if a large number of trials and calculations are performed. Generally, it is difficult to form a higher-order magic square of 6th order or higher even with a computer program.

The solution of the ten magic squares obtained by enormous trials is called one system. The left side of the two-digit subscript indicates a row, and the right side indicates a column. Swapping within your own row or column is called expansion,
The replacement over other rows and columns is called cross replacement. Area of the upper left of the second quadrant, which is surrounded by the main diagonal and the vertical centerline, is approximately 1 /
The one in which the integer value 1 is placed in the range (R1) of 8 is called the normal form, and is classified by the location of the integer value 1.

That is, it is assumed that the integer 1 is placed in the first row and the first column, and the type A is used, and the first row, the second column, the first row, the third column, the first row, the fourth column, and the first row, the fifth column. Those in which the integer value “1” is placed in are B, C, D, and E types, respectively. 3rd row, 3rd column,
It is assumed that the integer value 1 is placed in the third row, fourth column and the third row, fifth column as F, G, and H types, respectively.

The type in which the integer value "1" is arranged at the 5th row and the 5th column is the I type, the 2nd row and the 2nd column, the 2nd row and the 3rd column, and the 2nd row and the 4th.
The one in which the integer value "1" is arranged in the column and the second row and the fifth column is the acde type. Also, an integer value "1" arranged in the 4th row, 4th column and the 4th row, 5th column is of the fh type. The b-type and the g-type, which are formed by replacing the cloth, rotate and move to the same positions as the B-type and the G-type.

The integer value "1" is then on the main diagonal,
For A, a, F, f and I types, consider a square in which the integer value "1" is at the upper left position, and the numerical value of the lower left corner is smaller than the numerical value of the upper right corner. For the B and G types, consider a rectangle in which the integer value "1" is located in the upper left, and the numerical value in the lower left corner is smaller than the numerical value in the upper right corner.
The b type and the g type are rectangles in which the integer value “1” is located at the upper left, and the numerical value of the lower left corner> the numerical value of the upper right corner.

The squares and rectangles referred to here are both subject to the center line. In other types, the integer value "1" is sufficient. The normal form is roughly classified according to the above-mentioned type, and the middle numbers are classified according to the numerical values of each corner of the square or the rectangle. In general, the Toma square can be subdivided by the numerical values of a specific line near the horizontal centerline.

The total number of ten magic squares is 10 to the hundredth power 103.
It is estimated to be 00. The total number is fixed in the magic square,
It is a low-dimensional three, four, and five magic square, and three magic square is eight.
70, 40 magic squares, 1.53962 5 magic squares
It is 10,040 (rotate 90 degrees on the front and back sides and
Doubled total). The total number of six magic squares is estimated to be about 10 to the power of 1018, but at present, it is impossible to determine the total number of six or more high-dimensional magic squares.

A magic square of four dimensions or more can be converted into an a type and a b type by changing the crossing of four adjacent elements (indicating numerical values constituting the magic square).
The conversion by the expanded cross replacement, in which the cross replacement of four elements and the addition of the vertical and horizontal replacements is added, is applied to the magic square of five dimensions or more. In the Toma Square, if the expansion cross between four adjacent elements is changed to the center point or center line, it can be done at 1, 4, 9, 16 or 25 locations at the same time. .

Furthermore, if conversion is performed by replacing the extended four elements with the extended cross, the conversion can be performed at one place, two places, three places, four places, five places, and twenty-five places at the same time. Even if you only perform extended cross replacement so that it does not extend over other replacement areas,
You can form a new normal form of 10 magic squares (children).

FIG. 5 shows an example of expansion and cross replacement in each quadrant. The replacement is shown as ⇔ below. Speaking in the second quadrant, 4 on the outside side a11⇔a22,
a12 ⇔ a21, a31 ⇔ a42, a32 ⇔ a41 cross replacement and four inside side a13 ⇔ a24, a14 ⇔ a
23, a33 ⇔ a44, a34 ⇔ a43 are exchanged.

Further, expansions a15⇔a25, a35⇔a
45, a51 ⇔ a52, a53 ⇔ a54. Similarly for other quadrants, expansion and cross replacement are performed so that each sum of the matrix and the diagonal line becomes 505.

FIG. 6 shows an example of replacement of the extended cross over another quadrant. Speaking in the second quadrant, crossing the upper left and lower right of the outside team on the diagonal line across the fourth quadrant is a11⇔a0.
0 and a cross replacement a44 on the upper left and lower right of the inside side
⇔ a77 is performed. Furthermore, the sum of the matrix and the diagonal is 50
As shown in FIG. 5, expansion replacement of the 1st row, 10th row, 4th row, 7th row, 1st column, 10th column and 4th column, 7th column is performed.

FIG. 7 shows an operation example of the extended cross replacement x1x2 conversion (irreversible). In FIG. 4, x1 in FIG.
Is converted into x2 by using FIG. It shows that a new magic square with different contents from any of the above can be created. If a transformation such as that shown in FIG. 5 is further applied to FIG. 7 as x3, for example, a new higher-order magic square with different contents from both a11 and a99 can be generated.

The inventor presents a backward operation in which the magic square returns to the original when the same extended cross replacement is continued,
It was discovered that if a different extended cross replacement is continued, a new magic square is generated, which is an irreversible forward operation.

One of more than 35 types of extended cross replacement techniques is set as x1, and the other one is set as x2. The operations x1x1 and x1x2x2x1 performed a plurality of times are examples of operations that restore the original values, but x1 and x2, x1x2 and x2x1 or x1
x2x1 and x1x2x1x2 etc. are irreversible operations and can form a new normal form ten magic square (corresponding to grandchildren and great-grandchildren).

35 kinds of expansion cloth replacements, for example, 2
When applied to four types of systems, the total number of normal form ten magic squares (including children, grandchildren, great-grandchildren, grandchildren, and great-grandchildren) is calculated by the product of overlapping combinations and permutations, and 24 × 35H6 × 6! = 24 x 40
C6x6! = 24 x 35 x 36 x 37 x 38 x 39 x 4
0/6! X6! = 66,327,206,400 kinds of normal form ten magic squares can be formed.

FIG. 8 is an example of complement calculation of a higher-order magic square.
The number of each element in the matrix of the higher-order magic square having the dimension number n is 1, 22, ... N2 as shown in FIG. N = 1 in the ten magic square
0 and n2 = 100. Matrix operation is established as addition and subtraction for each element in the magic square matrix. Generally, any complement may be selected.

If the bottom is not raised, n2 + 1 is selected as the complement. In the ten magic square, n2 + 1 = 101 is used, and each element in the matrix is 1. ． Set to 100. In addition, rotation processing is performed so that it becomes a normal form magic square. Part of n2
A method of + 1 + d or the like (for example, raised bottom d = 1, sum of matrix diagonals = 505 + 10d) can also be formed and used as a program.

FIG. 9 shows an example in which the vertical center line is rotated as an axis in FIG. When the number sequence is read from the first column on the left side to the tenth column on the right side, FIG. 9 can calculate a number sequence different from that in FIG.

FIG. 10 shows an example in which FIG. 4 is rotated about a diagonal line. When the number sequence is read from the first column on the left side to the tenth column on the right side, the number sequence different from that in FIG. 4 can be calculated in FIG. 10.

Each normal form 10 magic square can calculate 16 kinds of 10 magic squares only by rotating itself and two normal form 10 magic squares formed by complement conversion. By simply tracing each of these lines in the left-right direction, "1..100 is used", "non-repeating", "consisting of 1600", and "decimal sequence" can be calculated.

These decimal numbers can be converted into hexadecimal numbers, packed into 8 bits (1 byte), and further converted into binary sequences of "non-repeating""consisting of 12800" of 0s and 1s. In addition, children, grandchildren, and great-grandchildren can be neatly incorporated.
In this way, a "non-repeating""consisting of multiples of 12800""matching the length of the binary-ized message" binary key can be easily constructed.

The configuration of the binary sequence key thus obtained is such that 1 is 39.9% and 0 is 60.1%, which is suitable for a binary sequence key for EXOR processing required for encrypted communication. There is. A
It is 1 in the ciphertext that was converted into binary digit sequence from Japanese or English communication sentences including katakana, hiragana, kanji and alphanumeric characters, which consisted of NK character 8 unit code table and kanji code table, and EXOR processed with the above binary sequence key. The composition ratio is within the range of 60% to 40%.

Incidentally, 1. ． If 256 is evolved into 16 and packed into an 8-bit 1-byte, the ratio of the binary sequence key will theoretically be 50% for 1 and 50% for 0, but the even-parity method will be adopted in the communication line. The need is small.

FIG. 11 shows an example in which another sequence C is included in the Q-shape in the array of higher-order magic squares and 25 pieces are replaced. It can be replaced independently of the matrix operation. The sum of each row and each column and the sum of the diagonal lines are values outside 505. Separately, if you use the magic square operation program, the original 2 as shown in Figure 4
It is possible to respectively calculate 5 numerical values and 25 numerical values of another sequence C. This can be applied to one of the numerical concealment techniques.

FIG. 12 shows the method of the present invention shown in FIG.
It is an example of a binary code when applied to the half-width characters of the NK code table.

FIG. 13 shows an example of a binary code when the method of the present invention shown in FIG. 3 is applied to double-byte characters in a Kanji code table.

FIG. 14 is a flow chart for explaining the code generation sequence when transmitting and receiving by taking the half-width character "1" as an example.
In step 2, the number "1" is converted into an ANK code, and (3
1) Convert to 16. This code in step 3 (11
When (00) 16 is added and shifted, it becomes (1131) 16.

In step 4, the code (1131) is converted into binary code (0001) 2, (0001) 2,
Convert to (0011) 2 and (0001) 2 respectively.
In step 5, (1000) ₂ is added to each of these codes to shift them, and the binary code (1001) 2,
(1001) 2, (1011) 2, and (1001) 2 are obtained.

Next, in step 6, for example, 1 and 93 are obtained from the magic square number sequence selected by using the key separately obtained from the transmitting side. As described above, this magic square is arranged such that the integers from 1 to 100, such as 1,93, are arranged in a square so that the sum in the row, column, and diagonal directions is 505. When the magic square elements 1 and 93 are converted into hexadecimal numbers, they are (01) 16 and (5D) 16, respectively.

In step 8, this code is converted into a binary number, and (0000) 2, (0001) 2, (01
01) 2, (1101) 2. In step 9, the two binary sequences generated in steps 5 and 8 are subjected to exclusive OR operation, and (1001) 2, (1000) 2,
(1110) 2 and (0100) 2 are obtained. This code may be sent as it is, but in order to shorten the communication time, the binary numbers of 4 bits, 5 bits, 6 bits, 7 bits and 8 bits are once put together into an ANK code table or shift JIS.
Replace part of the code table with half-width symbols and kanji. Characters and symbols of ANK code can be transmitted in 1 byte, so it is more effective to use ANK code. In step 10, the binary numbers are grouped by 4 bits and converted into the alphanumeric representation (98E4) 16 used in hexadecimal numbers. Further, in step 11, it is converted into a binary number and transmitted to the receiving side. The other characters are converted in the same manner.

On the other hand, on the receiving side, a series of magic squares (1) 10, (9) based on a key previously obtained from the transmitting side.
3) Select 10.

When this sequence of numbers is converted into hexadecimal numbers in step 13, they become (01) 16 and (5D) 16, respectively. In step 14, this 16-evolution code is converted into a binary number, and (0000) 2, (0001) 2, (0101)
The code of 2, (1101) 2 is obtained.

In step 15, the binary number obtained in step 11 and the binary number obtained in step 14 are subjected to an exclusive OR operation, and the binary number sequence (1011) 2 (1001)
2, (1011) 2 and (1001) 2 are created.

In step 16, the binary sequence (1000) 2 is subtracted to give a shift to the binary sequence (0001) 2, (0001), (0011).
2, get (0001) 2. When this code is expressed by a 16-evolution code, it becomes (1131) 16.

Further, (1100) 16 is subtracted from this code in order to perform the shift in step 18, resulting in (31) 16. When this code is displayed in ANK code half-width characters, it becomes "1". This is the number "1" that is the transmitted original information. Other characters are converted and transmitted / received in the same manner as described above.

Here, the ANK code shift example (110
0) 16 was shown. It is also possible to apply the same shift 8 for every 4 digits of the binary number.

A different shift (8645) 16 shift may be performed for each digit. In the (10) communication character string column of FIG. 14, the binary numbers are grouped by 4 bits and can be replaced with, for example, the hexadecimal code (98E4) 16 (BFB7) 16 to shorten the communication line use time. it can. Further, as shown in FIG. 3, a number can be added to the beginning or the end of the character string to manage the divided communication text.

FIG. 15 illustrates an encryption method according to an embodiment of the present invention. In FIG. 13, the flow chart for explaining the code generation sequence during transmission / reception using the double-byte character “Seki” as an example. Is. In step 2, the Chinese character "Seki" is converted into shift JIS code (8AD6) 16.

In step 3, this code is converted into JIS hexadecimal code (3458) 16. In step 4, the code 3458 is changed to the binary code (0011) 2,
(0100) 2, (0101) 2, and (1000) 2, respectively. In step 5, 1000 is added to each of these codes to shift them.

Next, in step 6, for example, 1 and 93 are obtained from the magic square number sequence selected using the key separately obtained from the transmitting side. As described above, this magic square is arranged such that the integers from 1 to 100, such as 1,93, are arranged in a square so that the sum in the row, column, and diagonal directions is 505. This magic square element 1,93 16
When converted to a base number, they become (01) 16 and (5D) 16, respectively.

In step 8, this code is converted into a binary number, and (0000) 2, (0001) 2, (01
01) 2, (1101) 2. In step 9, the two binary sequences generated in steps 5 and 8 are subjected to exclusive logical operation, and (1011) 2, (1101) 2, (1
000) 2, (1101) 2 are obtained. In step 10, these binary numbers are grouped into 4 bits (BD8D) 1
Convert to 6 and send to the receiving side. The other characters are converted in the same manner.

On the other hand, the receiving side receives this code and converts it into a binary number in step 11. Therefore, the result is the same as the result of step 9 (1011) 2, (1101).
2, (1000) 2, (1101) 2. On the other hand, the receiving side selects (1) 10 and (93) 10 which are sequences of magic squares based on the key previously obtained from the transmitting side.

When this sequence of numbers is converted into hexadecimal numbers in step 13, they become (01) 16 and (5D) 16, respectively. In step 14, this 16-evolution code is converted into a binary number, and (0000) 2, (0001) 2, (0101)
The code of 2, (1101) 2 is obtained.

In step 15, the binary number obtained in step 11 and the binary number obtained in step 14 are subjected to an exclusive OR operation, and the binary number sequence (1011) 2, (1100)
2, (1101) 2 and (0000) 2 are created.

In step 16, the binary sequence (1000) 2 is added to give a shift to the binary sequence (0011) 2, (0100), (0101).
2, get (1000) 2. When this code is expressed by a 16-evolution code, it becomes (3458) 16.

Further, when this code is shift JIS coded in step 18, it becomes (8AD6) 16, which is the Chinese character "Seki" which is the original information transmitted. Other characters are converted and transmitted / received in the same manner as described above.

Here, it is the same as 4 digits (1000) 2
Although only the shift (shifted by the numeral 8) is illustrated, it is also possible to shift by (8645) 16 which is different for each digit.

FIG. 15 shows an example of shifting the Kanji code as shown in FIG. The kanji "Seki" is (8AD6) 16 when expressed by the shift JIS code. This is (3458) 16 when expressed in JIS hexadecimal code. Here, the subscript 16 represents a hexadecimal number. This code is + (1111) 1
If you shift 6 (4,569), it will be replaced with the Chinese character "Memorial".

Further, when an operation for subtracting this code (9FFF) 16 from the arbitrarily selected shift JIS code (9FFF) 16 is executed ((9FFF) 16- (456)
9) 16), changed to "Akira" (5A96) 16. If you perform this operation in the opposite direction, you can restore it by "Akira" → "Memorial" → "Seki".

In step 10 of FIG. 15, 4 bits of the communication character string are collected into one character and replaced with the hexadecimal code (BD8D) 16. 128 alphanumeric characters (1 byte each) can be obtained by using alphanumeric characters and katakana symbols in the ANK code table. 5 bits, 6 bits,
It is assumed that the communication character string is shortened by collecting 7 bits. 8
When collecting more than one bit, add part of the hiragana or kanji of the shift JIS code to the table. By replacing in this way, the communication line use time can be shortened.

Further, as shown in FIG. 3, a division number can be added to the beginning or the end of the character string to manage the entire communication text. 13 to 15, the example of half-width characters and the example of full-width characters have been described, but a program for Japanese language in which half-width characters and full-width characters are mixed during transmission and reception can be used.

In the above description, the description was made for transmission / reception, but the indirect key system of the present invention is not limited to the communication field, but also to the fields such as video / music sold by interposing scramble processing in the information recording medium. Can also be applied to.

In the above description, the ten magic squares, which are rich in expanded cross replacement, are mainly described, but the sixth and higher higher magic squares whose total number has not been fixed even if a computer is used are used. However, the present invention can be implemented.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention.

FIG. 2 is a diagram showing an example of encryption and decryption.

FIG. 3 is a flow chart for explaining security used in FIG.

FIG. 4 is a diagram illustrating a higher-order magic square used in the present invention,
Indicates the Tenth Magic Square.

5 is a diagram showing an example in which the magic square shown in FIG. 4 is expanded and expanded cross-changed in the same quadrant.

FIG. 6 is a diagram showing an example in which the magic square shown in FIG. 4 is subjected to extended cross replacement over another quadrant.

7 is a diagram showing an example in which the magic square shown in FIG. 4 is subjected to expansion and expansion cross replacement X1 shown in FIG. 5 and cross replacement X2 shown in FIG.

FIG. 8 is a diagram showing an example in which complement calculation is performed.

9 is a diagram showing an example in which the magic square shown in FIG. 4 is rotated about a vertical center line.

FIG. 10 is a diagram showing an example in which the magic square shown in FIG. 4 is rotated about a diagonal line.

FIG. 11 is a diagram showing an example in which another sequence C is included in a Q-shape in the array of higher-order magic squares and 25 pieces are replaced.

FIG. 12 is a diagram showing an example of a binary code.

FIG. 13 is a diagram showing a plaintext and an example in which it is binary coded.

FIG. 14 is a diagram illustrating a code generation order when the half-width character “1” in FIG. 12 is transmitted and received.

FIG. 15 is a diagram for explaining a code generation order when transmitting and receiving the double-byte character “Seki” in FIG. 13;

[Explanation of symbols]

2 ... Binary number converting means, 4 ... Magic square, 6 ... Binary number converting means, 8
… Exclusive OR means.

Claims (8)

[Claims] 1. The first information, a step of converting the first information into a binary number, a step of selecting a magic square number sequence, a step of converting the selected magic square number sequence into a binary number, A step of creating an exclusive OR of the binary-converted first information and the binary-converted magic square sequence, and creating the binary-converted second information that has been subjected to the communication time reduction code culture. And a step of supplying the second information and key information about the magic square number sequence to an authorized user, the security strengthening method using the magic square number sequence. 2. A step of converting the first information to be transmitted into a binary number, a step of selecting a magic square sequence, a step of converting the selected magic square sequence into a binary number, and a step of converting the binary number into a binary number. The first information and the binary digitized magic square number sequence are exclusive-ORed to create binary information and a second piece of information coded for shortening the communication time is created. An information transmitting method using a magic square number sequence, comprising the step of transmitting second information to a regular receiver via a communication means and providing key information regarding the magic square number sequence to the regular recipient. 3. A step of receiving via a communication means communication information in which the first information to be transmitted is converted into a binary number and the communication time shortening code culture is received, and a key is previously obtained from the transmitting side. A step of selecting a magic square number sequence to be used based on the obtained key, a step of converting the selected magic square number sequence into a binary number, the received communication information and the binary number A step of taking exclusive OR with a square number sequence to create reception information converted into a binary number, and an information receiving method of restoring the first information from the reception information converted into a binary number. 4. The first information to be transmitted, the step of converting the first information into a binary code, the step of selecting a magic square sequence, and the step of converting the selected magic square sequence into a binary number. , The binary first information and the binary information
A step of creating exclusive communication with the digitized magic square number sequence to create communication information that is binaryized and has a communication time reduction code culture; a step of transmitting the communication information; , A step of selecting a magic square to be used based on a key previously obtained from the transmitting side, a step of converting the selected magic square number sequence into a binary number, the received communication information and the magic square. An information transmission / reception method comprising: a step of exclusive ORing with a square number sequence to create binary-coded received information; and a step of restoring the first information from the binary-coded received information. 5. A step of encoding ANK code or shift JIS code of information to be transmitted, said shift J
A step of converting the IS coded information into a JIS hexadecimal code; a step of converting the ANK coded information or the JIS hexadecimal coded information into a binary number; and a step of performing a shift by adding a predetermined binary number to the binary numbered information. And a step of hexadecimalizing the selected magic square sequence,
A step of converting the hexadecimalized magic square sequence into a binary number;
An information transmission method for creating transmission information by taking the exclusive OR of the binary shift information and the binary magic square sequence. 6. A step of receiving communication information, a step of converting the received information into a binary number, a step of previously obtaining a key from a transmitting side, and a step of selecting a magic square to be used based on the key. , A step of converting the selected magic square sequence into a binary number, the binary information and the step 2
A step of taking an exclusive OR with the sequence of the magical squares
Shifting by adding a predetermined binary number to the exclusive OR information, converting the shift information into hexadecimal, and shifting the hexadecimalized information JI
An information transmitting / receiving method, comprising: S-coding or ANK-coding; and a step of obtaining information to be received from the shift JIS coded information or ANK coded information. 7. A step of converting the input first information to be transmitted into a binary code, a step of selecting a magic square based on an input instruction, and a binary conversion of the selected magic square sequence. And a step of creating an exclusive OR of the binary-coded information and the binary-coded magic square sequence to create communication information that is binary-coded and has a communication time reduction code culture. , The step of transmitting the communication information, the step of receiving the communication information, the step of selecting a magic square to be used based on a key obtained from the transmitting side in advance, and the selected magic square number sequence being converted into a binary number. And a step of taking an exclusive OR of the received information and the binary magic number sequence, and a step of restoring the first information from the binary information. Storage medium. 8. A step of converting the information to be transmitted into ANK coded information or shift JIS code, and said shift JI
S-coded information is converted into JIS hexadecimal code, ANK coded information or JIS hexadecimal coded information is converted into binary number, and shift is performed by adding a predetermined binary number to the binary-coded information. And a step of hexadecimalizing the selected magic square sequence,
A step of converting the hexadecimalized magic square sequence into a binary number;
Creating a transmission information by taking an exclusive OR of the binary digitized shift information and the binary digitized magic square number sequence;
Binary number sequence information to be transmitted is ANK code character or shift J
On the basis of the step of converting the IS code into characters and reducing the number of characters in the binary number sequence, the step of receiving the communication information, the step of converting the received information into a binary number, the step of previously obtaining a key from the transmitting side, A step of selecting a magic square to be used; a step of converting the selected magic square number sequence into a binary number; a step of taking an exclusive OR of the binary digitization information and the binary digitized magic square number sequence; Shifting by adding a predetermined binary number to the exclusive OR information; converting the shifting information into hexadecimal; shifting the hexadecimalized information into shift JIS code or ANK code; Shift JIS
A recording medium having a program recorded thereon for obtaining information to be received from coded information and ANK coded information.