JP4554851B2 - Security-enhanced communication system using a magic sequence - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a security enhancement method and a security system capable of preventing damages such as communication interception and inappropriate viewing in the information / communication field.
[0002]
[Prior art]
Encryption is performed to convert information that you want to keep confidential into information that cannot normally be decrypted. At this time, the original information is called plaintext, the encrypted information is called ciphertext, and the conversion for restoring the plaintext from the ciphertext is called decryption.
[0003]
A key is required for encryption and decryption, and the strength of encryption is generally proportional to the size of the key. When a third party who does not know the key obtains plaintext from the ciphertext, it is called decryption. The cipher that takes time to decrypt is stronger.
[0004]
Conventionally, cryptographic coding methods using exponential functions, fractions, and random numbers have been used, but these methods have been unable to avoid the reduction of numerical ranges and degeneration. The binary number of the random number sequence is practically 128 bits or less, and there is a concern that even if it is encrypted, it can be decoded by a computer.
[0005]
[Problems to be solved by the invention]
An object of the present invention is to propose an encryption technique that is easy to handle and difficult to decipher.
[0006]
[Means for Solving the Problems]
One feature of the present invention is that the first information, the step of converting the first information into a binary number, the step of selecting a magic square number sequence, and the step of binarizing the selected magic square number sequence The exclusive information of the binary numbered first information and the binary numbered magic square number sequence is exclusive ORed to generate the second information which is binarized and coded for shortening the communication time. And a step of supplying key information relating to the second information and the magic square number sequence to a regular user.
[0007]
The present invention is based on the fact that the total number of normalized magic squares generated by cross permutation and extended cross permutation of higher-order magic squares in algebraic number theory is theoretically enormous. The magic square is a series of numbers arranged in a square so that the sum of vertical, horizontal, and diagonal numbers is the same. For example, the type of the normal form 10 magic square is 10 to the power of 300 (10 ³⁰⁰ ).
[0008]
The number sequences formed from these magic squares are not only enormous, but they are generated based on cross replacement and extended cross replacement, so they are easy to manage, and various random numbers tables and physical random numbers can be mixed and included. Easy. In the present invention, the key relating to the magic square sequence used for encryption is issued only by a legitimate sender and transmitted to the receiver. Usually, the same key is not reissued. Currently, there are more than 50 types of extended cross replacement procedures, but the number of key types can be further increased to increase confidentiality.
[0009]
The present invention can be easily integrated into an IC. In addition, in order to ensure non-decipherability, some normal-type ten magic squares are ROMized. The complement arithmetic procedure and the extended cross replacement procedure are implemented in ROM. It is possible to realize an IC and a microprocessor including a RAM for the operation buffer area.
[0010]
The present invention uses a higher-order magic square sequence to help prevent unjustified interception that hinders or obstructs the development of the IT era.
[0011]
The present invention is a foundation that supports the development of industries in the IT era, including appliances, information, communication, electricity, electronics, and other media related to the Internet industry, and various media such as HDDs, FDs, CDs, and DVDs.
[0012]
The present invention belongs to a communication system that uses an ANK code table, a non-Kanji code table, and a Kanji code table for Japanese. In the present invention, a shift is applied when a code table is used or when hexadecimal binary conversion is performed.
[0013]
Only legitimate senders and receivers with the program can decrypt and decipher this shift. For example, the ANK code table is shifted by (1100) 16 in hexadecimal. The arrangement of the code table is shifted for each hexadecimal number (1111) 16 in the non-kanji code table and the kanji code table, and the difference from (9FFF) 16 is calculated as a complement and shifted. The hexadecimal binary conversion table is shifted by 8. Such a shift is applied so that the original text cannot be read as it is.
[0014]
In the present invention, information is cryptographically encoded using a binary number sequence based on a magic square. That is, the present invention is based on the finding that a higher-order magic square, such as a Toma square, can algebraically produce a huge number of normal-shaped magic squares as descendants.
[0015]
The estimated total number of Toma squares is about 10 ³⁰⁰ It is. Therefore, in the present invention, a short “Irohaniho 7-digit sequence” that is easy to manage is used. In the present invention, every time transmission is performed, a random number generation method is used to automatically calculate from among a number of normal magic squares exceeding 66 billion to the sender, and “Iroiro 35 is 6 to 26 to 17 to 21 and 8”. To give.
[0016]
The recipient who owns the program of the present invention obtains “the contents of seven two-digit sequences of characters” from the sender via a secure communication means such as a telephone line, and uses it as a key in advance. The original information can be obtained by decoding according to the operation of the program that has been obtained.
[0017]
FIG. 1 is a block diagram illustrating an embodiment of the present invention. On the transmission side, the plaintext to be transmitted is converted into a binary number by using the binary digitizing means 2. On the other hand, the number sequence of the selected magic square 4 is binarized using the binarizing means 6 as described later. These binary numbers are given to the input sides A and B of the exclusive OR means 8 and are subjected to an exclusive OR operation.
[0018]
In the exclusive OR operation, the output is 1 only when one of the inputs is 1 and the other input is 0. That is, an operation that outputs 1 is performed only when the plaintext is 1 and the magic square sequence is 0, or when the plaintext is 0 and the magic square sequence is 1. In this way, the plain text is encrypted, converted into a binary number sequence, and then transmitted via the transmission means 10.
[0019]
The magic square 4 uses, for example, a ten magic square. This magic square 4 has numerical values from 1 to 100 arranged in a grid of 10 rows and 10 columns so that the sum of the row direction, the column direction, and the diagonal direction is the same 505. The magic square 4 can be deformed by a cross replacement and an extended cross replacement operation as described later, and the final magic square can be easily specified.
[0020]
In other words, if the information about the set reference magic square and the replacement operation is supplied as a key to the authorized receiver or the authorized user, the authorized receiver and the authorized user can obtain the original from the binary number transmitted using the key. The plaintext of can be restored.
[0021]
For example, when the plaintext is 1 and the magic square number 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 encrypted plaintext in this way can easily convert the encrypted plaintext to the original plaintext using the key. FIG. 2 shows an example of encryption and decryption when the plaintext is the number “13”.
[0022]
It is impossible to obtain the original plaintext even if an encrypted binary sequence is obtained by anyone other than authorized users and authorized recipients who cannot obtain the key. For example, there are more than 60 billion magic squares, and it is impossible to specify which magic square is used.
[0023]
A program for encrypting plaintext or a program for decrypting plaintext from encrypted information may be given in advance to authorized receivers and authorized users, or may be included in transmission information. When transmitting, plain text is input, and a magic square serving as a reference and a replacement operation procedure for the magic square are selected with, for example, Iroha Niho, and it is only necessary to inform a regular user as a key. Moreover, the transmission side can easily change the reference magic square and replacement operation. The user can reproduce the original plaintext simply by inputting the obtained key information into the program.
[0024]
Next, an embodiment of the present invention will be described using a flowchart of a transmission / reception method using a code signal to which security enhancement measures for communication transmission / reception shown in FIG. 3 are used. It is assumed that the sender and the receiver own a dedicated program group with a calculation function described in detail in FIG.
[0025]
The receiver may initially handle a key (indirect key type key) consisting of a numerical sequence of, for example, two digits and seven generations (meaning that the reference magic square is cross-replaced 7 times or extended cross-replacement operation).
[0026]
From then on, the dedicated program will be responsible for automatic calculation processing such as non-repetitive codes over the entire length of the same length as the original and intervening shifting (addition and subtraction at a constant value), so the receiver can easily and quickly The original information can be reproduced to achieve the purpose.
[0027]
On the other hand, even if a non-regular user who does not own a dedicated program group using a computer intercepts and obtains signal information of binary numbers, hexadecimal numbers, 32-digit numbers, 64-hexadecimal numbers, and 128-digit sequence codes, the transmission contents are not obtained. Decoding is impossible because it is performed in a non-repetitive manner with a different code each time.
[0028]
In this method, “a part of an indirect key system that forms an n-th generation normal higher-order magic square with n 2-digit number sequences”, “a part that forms a binary number by applying some shift to a hexadecimal number”, It has “a part that processes the selected normal form higher order magic square to form a binary number”, “a part that forms a communication and communicates”, and “a part that receives and decodes”.
[0029]
Here, the magic square is used as the non-repeating sequence. For example, if the value of the magic square element is 100, the number (64) 16 packed in hexadecimal number is converted to binary number (01100100) 2 and used as 8-bit information. In the case of the Toma square, the binary sequence of (01100100) 2 appears only once in 100 number sequences of 800 bits.
[0030]
Normalized magic squares, complemented magic squares, and the numbers 1 and 93 of the contents obtained by tracing the elements of each magic square with the front and back rotated in order of the matrix, once every 10 magic squares. Unlike other random number sequences, it does not exhibit duplication or degeneration.
[0031]
Binary digitized drawings and photo transmission, processing of media contents such as FD / CD and DVD, and online transmission of music and video are also shifted by 4 digits in hexadecimal numbers, for example, (84A3) 16. Even if they are the same binary value, they are slightly dispersed and blurred to make them difficult to understand. Furthermore, an exclusive OR (EXOR) operation with a non-repeated binary value is performed to convert the binary value into a hexadecimal or 32 digit number. , 64-hexadecimal and 128-ary code A program that forms a characterized sentence and uses it as a transmission / reception code.
[0032]
Since this method is a method that can form a new regular type 10 magic square as will be described in detail with reference to FIG. 3 and subsequent figures, the original sentence to be transmitted may be a long sentence of one or more characters. Long sentences and long sentences converted into binary values are grouped as programs that are easily stored in a medium such as an FD prepared for transmission and reception by dividing them into 256 characters.
[0033]
In this method, the program further has “an effective time period for such a two-digit sequence key”. For example, when a reception waiting time limit of 15 minutes elapses, the dedicated program is restarted for both transmission and reception. In addition, as a countermeasure against theft, a “program expiration date” is set and displayed in the program, so that it is not possible to use an expired program.
[0034]
A new program is used to maintain the legal order of opening communication files only with contractors. As a maintenance method at that time, exchange of magic squares as directory contents, change of the procedure order of extended cross replacement, update of RAM / ROM accompanying them are performed.
[0035]
Although the case where information is transmitted has been described above, the present invention can also be applied when a recording medium on which information is recorded, such as a DVD or a CD-ROM, is used. In this case, the information is recorded on the recording medium by the method described above, transmitted to the other party, and the authorized user who has obtained the key must restore the original information using the program. Can do.
[0036]
FIG. 4 is a matrix showing an example of a solution of a ten magic square, which is a magic square applicable to the present invention, and is similar to a two-digit random number table. Hereinafter, this matrix will be described as an example. 10 columns x 10 rows, integers 1 ... 100 are arranged in a total of 100 grids, and natural numbers from 1 to 100 are used only once, and the sum of 10 rows and 10 columns each , The sum of one main diagonal and the sum of one sub-diagonal are all 505.
[0037]
A solution can be obtained by a set operation composed of indefinite equations with 22 simultaneous equations for 100 elements, but it is very difficult to obtain one numerical solution even if a large number of trials and calculations are performed. In general, higher-order magic squares of 6th order or higher are even difficult to form with computer programs.
[0038]
The solution of the Toma square obtained by enormous trials is called one system. The left side of the two-digit subscript represents a row, and the right side represents a column. Replacement within the own row or column is referred to as expansion, and replacement over another row or column is referred to as cross replacement. Those having an integer value 1 in the range (R1) of the upper left area of the second quadrant surrounded by the main diagonal and the vertical center line are called normal forms and are classified according to the location of the integer value 1.
[0039]
That is, an integer value 1 in the first row and first column is set to A type, and the first row and second column, first row and third column, first row and fourth column, and integer value in the first row and fifth column in order. Those in which “1” is arranged are B, C, D, and E types, respectively. An integer value 1 placed in the third row, third column, third row, fourth column, and third row, fifth column is assumed to be F, G, and H types, respectively.
[0040]
An integer value “1” placed in the fifth row and fifth column is of type I, the second row and second column, the second row and third column, the second row and fourth column, and the second row and fifth column are integer values. Each of which “1” is arranged is an acde type. In addition, an element in which the integer value “1” is arranged in the fourth row, fourth column, and the fourth row, fifth column is assumed to be an fh type. The b-type and g-type formed by cross replacement rotate and move to the same position as the B-type and G-type.
[0041]
In this case, for the A, a, F, f, and I types in which the integer value “1” is on the main diagonal line, a square in which the integer value “1” is in the upper left position is considered, the numerical value at the lower left corner <the numerical value at the upper right corner And In the B type and the G type, a rectangle in which the integer value “1” is located in the upper left is considered, and the numerical value of the lower left corner <the numerical value of 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.
[0042]
The squares and rectangles mentioned here are all subject to the center line. Other types need only have an integer value of “1”. The normal form is roughly classified by the type as described above, and the medium is classified by the numerical value of each corner of a square or rectangle. In general, the Toma square can be subdivided by numerical values in a specific row close to the horizontal center line.
[0043]
The total number of toma squares is estimated to be 10300, a power of several hundred. The number of magic squares is fixed in the low-dimension three, four, and five magic squares, eight for the three magic squares, 7040 for the four magic squares, and 1,539,216,040 for the five magic squares. (The total number that is rotated 90 degrees on the front and back sides and geometrically multiplied by 8). Although the total number of six magic squares is estimated to be about 18 to the power of 1018, it is currently impossible to determine the total number of six or more high-dimensional magic squares.
[0044]
A four-dimensional or higher magic square can be converted into a type by converting the four adjacent elements (pointing to the numerical values constituting the magic square), and B type can be converted into b type. The conversion by the extended cross replacement with the cross replacement of four elements and the addition of vertical and horizontal replacements is applied to magic squares of five dimensions or more. In the Toma square, the center cross-point object and the center-line object can be performed at one, four, nine, sixteen, or twenty-five locations at the same time if the extended cross between four adjacent elements is replaced. .
[0045]
Furthermore, if conversion is performed by changing the extended cross between four distant elements, it can be performed simultaneously at one, two, three, four, five, and 25 locations. Even if the extended cross replacement is performed so as not to cross the other replacement areas, more than 30 new normal-shaped ten magic squares (children) can be formed.
[0046]
FIG. 5 is an example of expansion and cross replacement within each quadrant. In the following, the replacement will be indicated by ⇔. In the second quadrant, the four outer side a11 ⇔ a22, a12 ⇔ a21, a31 ⇔ a42, a32 ⇔ a41 and four inner side a13 ⇔ a24, a14 ⇔ a23, a33 ⇔ a44, a34 ⇔ a43 Perform cross-over.
[0047]
Further, the expansions a15 to a25, a35 to a45, a51 to a52, and a53 to a54 are performed. In the other quadrants, expansion and cross replacement are performed so that the sum of the matrix and the diagonal line becomes 505 in the same manner.
[0048]
FIG. 6 is an example of extended cross replacement over another quadrant. In the second quadrant, on the diagonal line over the fourth quadrant, the upper left and lower right on the outer side are cross-changed a11⇔a00, and the upper left and lower-right cross change a44⇔a77 are performed on the inner side. Furthermore, the extended replacement of the first row, the tenth row, the fourth row, the seventh row, the first column, the tenth column, and the fourth column, the seventh column is performed so that each sum of the matrix and the diagonal line becomes 505.
[0049]
FIG. 7 is a calculation example of extended cross replacement x1 × 2 conversion (irreversible). FIG. 4 shows an example of conversion using FIG. 5 as x1 and FIG. 6 as x2. It shows that a new magic square with a different content from any of the previous ones could be generated. If, for example, conversion as shown in FIG. 5 is performed as x3 in FIG. 7, a new higher-order magic square having a different content from any one of a11 and a99 replaced can be generated.
[0050]
The inventor indicates that the magic square exhibits a backward operation that returns to the original when the same extended cross replacement is continued, and an irreversible forward operation that generates a new magic square when the different extended cross replacement is continued. discovered.
[0051]
One of the extended cross replacement techniques exceeding 35 types is set to x1, for example, and the other is set to x2. Multiple operations x1x1 and x1x2x2x1 are examples of operations that can be restored, but x1, x2, x1x2, x2x1, or x1x2x1, x1x2x1x2, etc. are irreversible operations and new normal-type ten magic squares (for grandchildren and great-grandchildren) Equivalent).
[0052]
When 35 types of extended cross replacements are applied to, for example, 24 types of systems, the total number of normal form ten magic squares (including children, grandchildren, great-grandchild children, grandchildren, great-grandchildren) is obtained by multiplying the overlapping combination and the permutation. 24 × 35H6 × 6! = 24 × 40C6 × 6! = 24 x 35 x 36 x 37 x 38 x 39 x 40/6! × 6! = 66,327,206,400 kinds of regular-shaped ten magic squares can be formed.
[0053]
FIG. 8 shows an example of complement calculation of a higher-order magic square. The number of elements in the high-order magic square matrix of dimension n is 1, 2,..., N2, as shown in FIG. In the Toma square, n = 10 and n2 = 100. Matrix operations hold as additions and subtractions for each element in the magic square matrix. In general, anything can be chosen as a complement.
[0054]
When not raising the bottom here, n2 + 1 is selected as a complement. The Toma square uses n2 + 1 = 101, and each element in the matrix is 1. . Set to 100. Furthermore, rotation processing is performed so that it becomes a regular magic square. A method in which a part is made such as n2 + 1 + d (for example, raised base d = 1, sum of matrix diagonals = 505 + 10d) can be formed and used as a program.
[0055]
FIG. 9 shows an example in which rotation is performed about the vertical center line in FIG. When the number sequence is read from the left first column to the right tenth column, FIG. 9 can calculate a number sequence different from FIG.
[0056]
FIG. 10 shows an example in which rotation is performed with the diagonal line as an axis in FIG. When the number sequence is read from the left first column to the right tenth column, FIG. 10 can calculate a number sequence different from FIG.
[0057]
Each normal form 10 magic square can calculate 16 types of 10 magic squares simply by rotating itself and two normal form 10 magic squares formed by performing complement transformation. By simply tracing each of these lines in the horizontal direction, “1.100 is used”, “non-repetitive”, “consisting of 1600”, and “decimal sequence” can be calculated.
[0058]
These decimal sequences can be converted into hexadecimal numbers, packed into 8 bits (1 byte), and further transformed into 0 and 1 “non-repetitive” “consisting of 12800” binary sequences. In addition, children, grandchildren and great-grandchildren can be organized in an orderly manner. In this way, a binary sequence key “non-repetitive”, “consisting of multiples of 12800”, “matched to the length of a binary communication message” can be easily configured.
[0059]
The binary sequence key structure obtained in this way is 19.9 for 39.9% and 0 for 60.1%, which is suitable for the binary sequence key for EXOR processing required for encrypted communication. In a ciphertext in which a Japanese or English communication text including an ANK character 8-unit code table and a kanji code table, including katakana, hiragana, kanji and alphanumeric characters, is binary-sequenced and EXOR-processed with the binary sequence key, 1 The composition ratio falls within the range of 60% to 40%.
[0060]
In addition, 1. . If 256 is evolved to 16 and packed into 8 bits and 1 byte, the composition ratio of binary sequence key is theoretically 50% for 1 and 50% for 0, but even parity system is adopted in the communication line, etc. There is little need for it.
[0061]
FIG. 11 shows an example in which another number sequence C is included in a Q shape in the array of higher magic squares and 25 are replaced. Can be replaced independently of matrix operations. The sum of each row and each column and the sum of the diagonal lines are values outside 505. Separately, if the magic square calculation program is used, the original 25 numerical values as shown in FIG. 4 and the 25 numerical values of the other sequence C can be calculated. This can be applied to one of the numerical concealment techniques.
[0062]
FIG. 12 shows an example of a binary encryption code when the method of the present invention shown in FIG. 3 is applied to half-width characters in the ANK code table.
[0063]
FIG. 13 shows an example of a binary encryption code when the method of the present invention shown in FIG. 3 is applied to double-byte characters in the Kanji code table.
[0064]
FIG. 14 is a flowchart for explaining the code generation order when transmitting / receiving, taking the half-width character “1” as an example. In step 2, the number “1” is converted into an ANK code and converted into (31) 16. If this code is shifted by adding (1100) 16 in step 3, (1131) 16 is obtained.
[0065]
In step 4, the code (1131) is converted into binary code (0001) 2, (0001) 2, (0011) 2, and (0001) 2, respectively. In step 5 to this code (1000) each ₂ Is added to perform binary code (1001) 2, (1001) 2, (1011) 2, and (1001) 2.
[0066]
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 transmission side. As already described, this magic square is an integer from 1 to 100, such as 1,93, arranged in a square so that the sum of its rows, columns, and diagonal directions is 505. When the magic square elements 1 and 93 are converted into hexadecimal numbers, they become (01) 16 and (5D) 16, respectively.
[0067]
In step 8, this code is converted into a binary number and converted into (0000) 2, (0001) 2, (0101) 2, and (1101) 2, respectively. In step 9, the two binary sequences generated in steps 5 and 8 are subjected to an exclusive OR operation to obtain (1001) 2, (1000) 2, (1110) 2, (0100) 2. This code may be transmitted as it is. However, in order to shorten the communication time, the binary number of 4 bits, 5 bits, 6 bits, 7 bits, and 8 bits are once combined into one of the ANK code table and the shift JIS code table. Use the part to replace with half-width characters and kanji. Since ANK code characters and symbols can be transmitted in one byte, the ANK code is more effective. Step 10 listed the binary numbers converted into alphanumeric expressions (98E4) 16 used in hexadecimal numbers by collecting 4 bits. Further, in step 11, it is converted into a binary number and transmitted to the receiving side. Other characters are similarly converted.
[0068]
On the other hand, the receiving side selects (1) 10 and (93) 10 which are the magic squares based on the key obtained in advance from the transmitting side.
[0069]
When this number sequence is converted into a hexadecimal number in step 13, (01) 16 and (5D) 16 are obtained, respectively. In step 14, the hexadecimal code is binarized to obtain a code of (0000) 2, (0001) 2, (0101) 2, (1101) 2.
[0070]
In step 15, an exclusive OR operation is performed on the binary number obtained in step 11 and the binary number obtained in step 14 to obtain a binary sequence (1011) 2, (1001) 2, (1011) 2, (1001). ) Create 2.
[0071]
In step 16, (0001) 2, (0001), (0011) 2, and (0001) 2 are obtained by subtracting the binary number sequence (1000) 2 to give a shift to this binary number sequence. When this code is expressed as a 16-evolution code, (1131) 16 is obtained.
[0072]
Further, when (1100) 16 is subtracted from this code in order to shift in step 18, (31) 16 is obtained. When this code is converted to ANK code half-width character display, “1” is obtained. This is the number “1” which is the transmitted original information. Other characters are also converted and transmitted / received in the same manner as described above.
[0073]
Here, ANK code shift example (1100) 16 is shown. It is also possible to apply the same shift 8 every 4 binary digits.
[0074]
A different shift (8645) 16 shifts may be applied to each digit. In the (10) communication character string column of FIG. 14, the binary numbers are grouped by 4 bits and replaced with, for example, the hexadecimal encryption code (98E4) 16 (BFB7) 16 to shorten the communication line usage time. it can. Further, as shown in FIG. 3, it is possible to manage the divided communication sentences by adding numbers to the beginning and the end of the character string.
[0075]
FIG. 15 illustrates the encryption method according to the embodiment of the present invention, and is a flowchart illustrating the code generation order at the time of transmission / reception with the full-width character “Kan” in FIG. 13 as an example. In step 2, the Chinese character “Seki” is converted into a shift JIS code (8AD6) 16.
[0076]
In step 3, this code is converted into a JIS hexadecimal code (3458) 16. In step 4, the code 3458 is converted into binary code (0011) 2, (0100) 2, (0101) 2, and (1000) 2, respectively. In step 5, 1000 is added to each of these codes and shifted.
[0077]
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 transmission side. As already described, this magic square is an integer from 1 to 100, such as 1,93, arranged in a square such that the sum of rows, columns, and diagonal directions is 505. When the magic square elements 1 and 93 are converted into hexadecimal numbers, they become (01) 16 and (5D) 16, respectively.
[0078]
In step 8, this code is converted into a binary number and converted into (0000) 2, (0001) 2, (0101) 2, and (1101) 2, respectively. In step 9, the two binary sequences created in steps 5 and 8 are subjected to an exclusive logical operation to obtain (1011) 2, (1101) 2, (1000) 2, (1101) 2. In step 10, this binary number is converted into a sum (BD8D) 16 of 4 bits each and transmitted to the receiving side. Other characters are similarly converted.
[0079]
On the other hand, the receiving side receives this code and converts it into a binary number in step 11. Therefore, the result is (1011) 2, (1101) 2, (1000) 2, (1101) 2 which is the same as the result of Step 9. On the other hand, the receiving side selects (1) 10 and (93) 10 which are the magic squares based on the key obtained in advance from the transmitting side.
[0080]
When this number sequence is converted into a hexadecimal number in step 13, (01) 16 and (5D) 16 are obtained, respectively. In step 14, the hexadecimal code is binarized to obtain a code of (0000) 2, (0001) 2, (0101) 2, (1101) 2.
[0081]
In step 15, an exclusive OR operation is performed on the binary number obtained in step 11 and the binary number obtained in step 14 to obtain a binary sequence (1011) 2, (1100) 2, (1101) 2, (0000). ) Create 2.
[0082]
In step 16, (0011) 2, (0100), (0101) 2, and (1000) 2 are obtained by adding the binary number sequence (1000) 2 to give a shift to this binary number sequence. When this code is expressed by a 16-evolution code, (3458) 16 is obtained.
[0083]
Further, when this code is converted into a shift JIS code at step 18, it becomes (8AD6) 16, which is the kanji character "Seki" which is the transmitted original information. Other characters are also converted and transmitted / received in the same manner as described above.
[0084]
Here, a shift by (1000) 2 that is the same in 4 digits (shift by 8) is illustrated, but it is also possible to shift by (8645) 16 that is different for each digit.
[0085]
FIG. 15 shows an example of performing kanji coding shift as shown in FIG. The Chinese character “Seki” is (8AD6) 16 in the shift JIS code. This is (3458) 16 in JIS hexadecimal code. Here, the subscript 16 represents a hexadecimal number. If this code is shifted by + (1111) 16, it will be replaced with (4569) 16 and become the Chinese character “悼”.
[0086]
Further, when an operation of subtracting the code (9FFF) 16 from the arbitrarily selected shift JIS code (9FFF) 16 is executed ((9FFF) 16- (4569) 16), it changes to “晉” (5A96) 16. If this operation is performed in the opposite direction, it can be restored by “晉” → “悼” → “Seki”.
[0087]
In step 10 of FIG. 15, the communication character string 4 bits are combined into one character and replaced with a hexadecimal encryption code (BD8D) 16. If alphanumeric characters and katakana symbols in the ANK code table are used, 128 half-width characters (1 byte each) can be obtained. Furthermore, it is assumed that the communication character string is shortened by collecting 5 bits, 6 bits, and 7 bits. When combining 8 bits or more, hiragana and part of kanji in the shift JIS code are added to the summary table. By replacing in this way, the communication line usage time can be shortened.
[0088]
Also, as shown in FIG. 3, the entire communication text can be managed by adding a division number to the beginning or end of the character string. In FIGS. 13 to 15, an example of a half-width character and an example of a full-width character have been described. However, a program suitable for Japanese in which half-width characters and full-width characters are mixed during transmission and reception can be provided.
[0089]
In the above description, transmission / reception has been described. However, the indirect key method of the present invention is applicable not only to the communication field, but also to fields such as video and music that are sold in the information recording medium through scramble processing. Yes.
[0090]
In addition, the above description mainly describes the Toma square that is rich in extended cross replacement, but even if you use a 6th or higher order magic square that has not yet been finalized even if you use computer equipment. It is possible to implement the present invention.
[Brief description of the drawings]
FIG. 1 is a block diagram illustrating an embodiment of the present invention.
FIG. 2 is a diagram illustrating an example of encryption and decryption.
FIG. 3 is a flowchart for explaining security used in FIG. 1;
FIG. 4 is a diagram for explaining a higher-order magic square used in the present invention and showing a tenth-order magic square.
5 is a diagram showing an example in which the magic square shown in FIG. 4 is expanded and expanded crossed in the same quadrant.
6 is a diagram showing an example in which an extended cross change is applied to the magic square shown in FIG. 4 over another quadrant.
7 is a diagram showing an example in which the magic square shown in FIG. 4 is subjected to the expansion and expansion cross change X1 shown in FIG. 5 and the cross change X2 shown in FIG.
FIG. 8 is a diagram illustrating an example in which a complement operation 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.
FIG. 11 is a diagram illustrating an example in which another number sequence C is included in a Q-shape in an array of higher-order magic squares and 25 are replaced.
FIG. 12 is a diagram illustrating an example of a binary code.
FIG. 13 is a diagram illustrating an example of plain text and an example of binary coding of the plain text.
14 is a diagram illustrating a code generation order when transmitting / receiving the half-width character “1” in FIG. 12. FIG.
15 is a diagram for explaining a code generation order when transmitting / receiving the full-width character “Kan” in FIG. 13; FIG.
[Explanation of symbols]
2 ... binary digitizing means, 4 ... magic square, 6 ... binary digitizing means, 8 ... exclusive OR means.

Claims (4)

A device that encrypts original information to be transmitted and transmits a ciphertext, and the ciphertext using a key transmitted by a communication means that receives the ciphertext and is transmitted / received from a transmission / reception network through which the ciphertext is transmitted / received In a communication system comprising an apparatus for decrypting a sentence,
The sending device is
Binary conversion means for converting the original information into binary numbers;
From the row direction, the column direction and diagonal sum all six have the same order-ten-order criteria magic square, away or adjacent expansion and phase to replace the elements of the own row or in its own column (b) By performing extended cross replacement combined with cross replacement for every four elements, or (b) expansion cross replacement with expansion for replacing elements in its own row or in its own column and cross replacement for every four adjacent elements Means for selecting a magic square number sequence that is a non-repetitive number sequence by performing the conversion of the element by irreversible extended cross replacement for performing cross replacement for every four elements separated after being performed ;
Transmitting-side binary digitizing means for converting the magic square number sequence into a binary number;
A transmission-side exclusive OR means for taking an exclusive OR of the binary information of the plaintext and the binary magic square number sequence;
Means for creating communication information using the exclusive OR as a code culture for reducing communication time;
A transmission means for transmitting the communication information to the information receiving device via the transmission / reception network,
Receiving means for receiving the communication information;
Based on a key for selecting the magic square number sequence obtained from the sender in advance through a transmission means different from the communication network, the extended cross replacement or the irreversible extended cross replacement performed on the transmission side. Means for identifying the magic square number sequence by performing the same element transformation in the reference magic square on the receiving side ,
Receiving-side binary digitizing means for binarizing the magic square sequence;
Receiving-side exclusive OR means for taking the exclusive OR of the received communication information and the binarized magic square number sequence, and creating binary reception information;
Enhanced security communication system using magic side team sequence, characterized in that a decoding means for restoring the original information from the received information. The security-enhanced communication system according to claim 1,
The transmission side device includes means for ANK encoding or shift JIS encoding of original information to be transmitted, means for converting the shift JIS encoding information to JIS hexadecimal encoding, and the ANK encoding information and JIS hexadecimal encoding. Means for binarizing the coded information, and means for shifting by adding a predetermined binary number to the binary information,
The transmission side exclusive OR means takes an exclusive OR of the binary shift information and the binary magic square number sequence, and the reception exclusive OR means includes the binary information and the binary number information. Take exclusive OR with binary digitized magic square sequence,
The receiving apparatus includes means for shifting by adding a predetermined binary number to the exclusive OR information, means for converting the shift information to hexadecimal, and converting the hexadecimal information to shift JIS encoding. or means for ANK coding, the shift JIS encoded information or security enhancement communication system using the magic side team sequence, characterized in that it comprises a means for obtaining the information to be received from ANK coded information. The computer uses a key transmitted by means of encrypting the original information to be transmitted and transmitting the ciphertext, and a key transmitted by a communication means that receives the ciphertext and is different from a transmission / reception network through which the ciphertext is transmitted and received In a computer-readable recording medium that records a program for causing the ciphertext to function as a means for decrypting,
The recording medium on the sending side is
Binary conversion means for converting the original information into binary numbers;
From the row direction, the column direction and diagonal sum all six have the same order-ten-order criteria magic square, away or adjacent expansion and phase to replace the elements of the own row or in its own column (b) By performing extended cross replacement combined with cross replacement for every four elements, or (b) expansion cross replacement with expansion for replacing elements in its own row or in its own column and cross replacement for every four adjacent elements Means for selecting a magic square number sequence that is a non-repetitive number sequence by performing the conversion of the elements by irreversible extended cross replacement for performing cross replacement for every four elements separated after being performed ;
A transmission-side binary digitizing means for converting the magic square number sequence into a binary number;
A transmission-side exclusive OR means for taking an exclusive OR between the binary information of the plaintext and the binary magic square number sequence;
A program for causing a computer to function as a transmission means for transmitting communication information to the information receiving device via the transmission / reception network, and a means for generating communication information using the exclusive OR as a communication time shortening code culture Record readable,
The recording medium on the receiving side is
Receiving means for receiving the communication information;
Based on a key for selecting the magic square number sequence obtained from the sender in advance through a transmission means different from the communication network, the extended cross replacement or the irreversible extended cross replacement performed on the transmission side. Means for identifying the magic square number sequence by performing the same element transformation in the reference magic square on the receiving side ,
A receiving-side binary digitizing means for binarizing the magic square sequence;
A receiving side exclusive OR means for taking the exclusive OR of the received communication information and the binary magic square number sequence to create a binary reception information; and A recording medium having recorded thereon a computer-readable program for causing the computer to function as decoding means for restoring information. The recording medium according to claim 1,
The recording medium on the transmission side is a means for converting the original information to be transmitted to a computer into ANK encoding or shift JIS encoding, means for converting the shift JIS encoding information into JIS hexadecimal encoding, the ANK encoding information, A program for causing a computer to function as a means for binarizing JIS hexadecimal coded information and a means for shifting by adding a predetermined binary number to the binary digitized information is recorded in a computer-readable manner,
The transmission side exclusive OR means takes an exclusive OR of the binary shift information and the binary magic square number sequence, and the reception exclusive OR means includes the binary information and the binary number information. Take exclusive OR with binary digitized magic square sequence,
The recording medium on the receiving side performs a shift by adding a predetermined binary number to the exclusive OR information, a means for converting the shift information into a hexadecimal number, a shift JIS encoding of the hexadecimal information, or A recording medium having recorded thereon an ANK encoding means and a program that causes the computer to function as means for obtaining information to be received from the shift JIS encoding information or the ANK encoding information.

Images