KR950013125B1 - Method of des operation management using the match of spaee coordvate - Google Patents

Abstract

No content.

Description

Operation method of D.S. using coincidence of spatial coordinate system

1 is a schematic configuration diagram of hardware to which the present invention is applied.

2 is a schematic diagram of the software according to the present invention.

3 is a flowchart illustrating a method of generating a cipher text for each character according to the present invention.

4 is a flowchart illustrating a cryptographic key generation method according to the present invention.

5 is a flowchart illustrating a method of changing a level for each group according to the present invention.

6 is a flowchart illustrating a method of generating a decoded sentence for each character according to the present invention.

7A is a flowchart illustrating a method for generating a cipher text for each block corresponding to the number of key components according to the present invention.

7B to 7E are exemplary views showing actual examples for each process of FIG. 7A.

8A is a flowchart for generating a decrypted sentence for each block corresponding to the number of key components according to the present invention.

8B to 8E are exemplary views showing actual examples for each process of FIG. 8A.

* Explanation of symbols for main parts of the drawings

11: central processing unit 12: main memory unit

13: auxiliary memory device

The present invention relates to a method of operating the DES (Data Encryption Standard) using the matching of a spatial coordinate system capable of encrypting and decrypting the entire contents of all kinds of files used in all kinds of computers and input / output devices. will be.

In general, cryptosystems can be broadly classified into block cryptosystems and public key cryptosystems. In addition, the Data Encryption Standard (DES), which was adopted as a result of public recruitment to select a standard encryption algorithm in the United States, is the most widely known encryption algorithm, which represents a block encryption system. A block cipher system is an encryption system that performs encryption and decryption by an encryption algorithm that transforms an input block of fixed size into an output block of a fixed size. Each bit of the output block is determined by the influence of all the bits of the input block and the key, and the size of the block is determined by the degree of encryption of the cryptographic system. Block ciphers and algorithms include Feistel, Lucifer, DES, and Fast Data Encihpermer Algorithm (FEAL), and we will introduce Facetel algorithms that are used as basic concepts such as Lucifer, DES, and FEAL. The Pastel algorithm has an even block size.

For example, if the block size is 2n, the plaintext m is divided into two blocks of size n and m = (m ₀ , m ₁ ) and encrypted as follows.

Round 1: U ₀ = (m ₀ , m ₁ ) → U ₁ = (m ₁ , m ₂ )

Round i: U _i-1 = (m _i-1 , m _i ) → U _i = (m _i , m _{i + 1} )

Round h: U _h-1 = (m _h-1 , m _h ) → U _h = (m _h , m _{h + 1} )

Where m _{i + 1} = m _i-1 f _ki (m ₁ ). K = (k ₁ ,…, k _h ) is called key. And the function f _ki is chosen arbitrarily. The decoding process of this algorithm is m _i-1 f _ki (m ₁ )

Round 1: U _h = (m _{h + 1} , m _h ) → U _h-1 = (m _h , m _h-1 )

Round h + 1 + i: U _i = (m _i-1 , m _i ) → U _i-1 = (m _i , m _{i + 1} )

Round h: U ₁ = (m ₂ , m ₁ ) → U ₀ = (m ₁ , m ₀ )

The Facetel algorithm performs encryption and decryption on arbitrary functions f _ki . In particular, f _ki does not require any properties. As such, the existing block cipher system uses random functions and goes through several rounds using the same key or different keys for each round, thus making the ciphertext completely different from the plaintext, and making the ciphertext into the plaintext through the reverse process. do. Therefore, there is a problem that the ciphertext is made in the first round and has a complicated step of passing through the 16th round, and there is a problem that the file piracy and the privacy cannot be solved.

Accordingly, the present invention devised to solve the above problems is possible to encrypt all kinds of files including all computer image data, and the ciphertext can be encrypted at the same time as the size of the key, that is, the number of keys, depending on the size of the key. The creation process is fast and the size of the key can be easily adjusted by software to adjust the size of the key to be used for encryption or to increase the degree of security. The purpose is to provide a method of operating DS.

In order to achieve the above object, the present invention provides a hardware including a central processing unit, a main memory device including a DES (Data Encryption Standard; DES) system, and an auxiliary memory device; A first step of generating a key, a second step of generating a cipher text using the generated key after performing the first step, a third step of transmitting the generated cipher text through a transmission line after performing the second step, After performing the third step, it characterized in that the fourth step of generating the received cipher text as a decryption text.

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

1 is a schematic configuration diagram of hardware to which the present invention is applied.

In the figure, 11 denotes a central processing unit, 12 denotes a main memory device, and 13 denotes an auxiliary memory device.

As shown in the drawing, a configuration to which the DES system is applied includes an auxiliary memory device 12 in which plain text or a cipher text is input or stored through an input device, and the auxiliary memory device storing or outputting plain text and a cipher text to an output device ( 13) A main memory device including a RAM containing a program of a DES system for encryption and decryption of a plain text and a ciphertext stored in or inputted through an input device using key coordinates, a ciphertext generation, and a decryption using a spatial coordinate system. 12) and a central processing unit 11 for controlling the main memory device 12 and including a ROM.

By the way, the existing protocol can be utilized as it is without performing encryption for the control signal used in the existing protocol.

The ciphertext is generated by matching the coordinate axes in the three-dimensional coordinate space. The message is placed in the YZ space, the space of the encryption key is set in the XZ space, and the data in the ciphertext XY space is extracted by using the coincidence of the Z axis. . That is, the XY coordinate points of the Z-axis of the encryption key and the Z-axis of the message coincide with the Z-axis. For example, the value of message Y ₀ -Z space is (0, 0, 0, 1, 0, 0, 1, 1), and the Z value of encryption key XZ is (0, 1, 2, 3, 7, 6, 4, 5), the 3rd, 4th, 5th of the encryption key matches the Z value (3, 6, 7), which is '1' of the message, and the 3rd, 4th, 5th matched X of the ciphertext. The coordinates of the ciphertext XY ₀ are generated by (0, 0, 0, 1, 1, 1, 0, 0). The decryption process is a reverse process of encryption, which generates a plain text by inputting a cipher text. The detailed description is introduced in the encryption / decryption procedure by character and block by DES system using coincidence of spatial coordinates.

2 is a schematic software diagram of a DES system according to the present invention.

As shown in the drawing, the configuration of the DES system passes through the key generation process 21 after the process of generating the cipher text 22 at the transmitting end 22 and then transmits the received cipher text to the receiving end via the transmission line (23). It consists of a process 24 to generate.

The following explains the process in detail.

First, the secret key generation process for encrypting the entire contents of all kinds of files used in all computers such as DOS, UNIX, IBM, and Macintosh is based on the basic code system, that is, 8 bit or 16 bit. According to a code system such as 32-bit, a permutation is used to generate different numbers without overlapping. Currently, all code systems follow 8 bits, and the explanation here focuses on 8 bits, and encryption / decryption is possible in the same way even when Unicode, which is 16 bits in 1993, is opened.

If you generate eight keys, the key generation procedure creates a permutation of 0 to 7 by causing the system not to duplicate the numbers 0 through 7 once, and the user to duplicate the numbers between 0 and 7. There are two ways to define this.

Next, a process of generating a cipher text / decryption text will be described with reference to the drawings.

3 is a flowchart illustrating a character-based encryption method according to the present invention.

First, it reads 8 bits from the plain text input through the input device, S ₀ ,. , S ₇ is defined and stored in the auxiliary memory device 12 (31). (For example, the defined 8 bits are as follows.

The plain text read by 8 bits and the last irradiation is 12 if the last plaintext end and otherwise S _0, ... In operation 33, the subscripts of the bit having a value of '1' among the values of S ₇ are obtained (33), and an encryption key matching the obtained subscript is found (34).

Creates a ciphertext by using the subscript value of the matched cipher key as the subscript of the ciphertext, defining the position as '1', that is, the ciphertext sets the bit value of the subscript position of the matching cipher key to '1' otherwise. Is defined as "0". For example, the message value is (0, 0, 0, 1, 0, 0, 1, 1), and the encryption key is (0, 1, 2, 3, 7, 6, 4). , 5), the first, third, fourth, and fifth times (0, 0, 0, 1, 3) of the encryption key correspond to (3, 6, 7), which is "1" of the message. 1, 1, 0, 0) to generate the cipher text (35, 36).

The following figure shows an example.

And, create a new key value by exchanging the order of the defined keys, whereby by there can be generated the encrypted text to a new key for every 8 bits, and returns to repeat the encryption key _{(K 0, K 1, ...} , K 7) of two As a group, a new encryption key is generated (37).

4 is a flowchart illustrating a cryptographic key generation method according to the present invention.

The keys are grouped together to form groups A, B, C and D (41). Investigate whether the number of times to create a group is 16th (42), if it is not 16th, give a level for each group (44), exchange the keys of A, B, C, and D in that level period (45), and define them as new keys. Returning to step 42, the process is repeated for the next group (46). If the number of trials as a result of the survey 42 is 16th, the level of each group is changed and the process 45 or less is performed (43).

5 is a flowchart illustrating a level change for each group according to the present invention. First, the levels are grouped in two to form groups a and b (51). Investigate whether the number of group formations is the fourth (52) and whether it is the fourth or eighth trial (53), then give the level if it is not the eighth (54), and exchange the levels of a and b in the level period (54). 55) After defining the new level, the process ends (56).

If the number of group formations as a result of the survey 52 is the fourth, a is changed to b, b is changed to a (57) and the process 55 or less is performed, and if the number of group formations after the survey 53 is eighth After changing the members of groups a and b (58), the process 55 or below is performed.

6 is a flowchart illustrating a method of character-by-character decoding according to the present invention.

First, the ciphertext received through the input device is read by 8 bits and then C ₀ ,. , C ₇ is defined and stored in the auxiliary memory device 13 (61).

An example of defining an 8-bit value is shown below.

Investigate the last cipher text is read by 62 is the last, or end, and C _0, the read 8 bits ... In operation 63, the position of the bit having a value of '1' among the values of C ₇ is extracted (63), and the subscript defining the extracted subscript value as a subscript of the key is obtained (64).

Using the obtained subscript as the braille key of the encryption key, the decryption text is generated by defining the position of the encryption key value as '1' using the subscript of the decryption text (66). (I.e., the decryption text is generated by defining the bit at the position corresponding to the subscript encryption key as '1', otherwise as '0'). The process is shown below.

A new encryption key is generated and returned by the encryption key generation method and then repeated for the next encryption text (67). Here, the encryption key generation method is the same as the fourth and fifth.

7A is a process flow diagram for a block-by-block encryption method that matches the number of key components according to the present invention.

First, it reads 8 bits by 8 bits from plain text, and the M ₀ , .. , Stores M ₇ (71) (see also FIG. 7b).

Examines the plain text is stored in the last plaintext 72 is terminated and the end or along the Y-axis to convert the data structure of the horizontal axis (X-axis) that are stored vertically, M _'0, ... Generate M ' ₇ (see also FIG. 7C).

The Z-axis transform is performed using the formula (X (i) = M '(j), j = Key (i)) and the C' ₀ ,... , And it generates a C ₇ (74). (See Fig claim 7d) that is, to define a _i, i-th C a (key) with the center axis X, the value M in the i-th key. An example is shown below.

Next, the data stored vertically along the X axis is converted into the data structure of the horizontal (Y axis) axis, and the ciphertexts C ₀ ,. In addition, C ₇ is generated and transmitted to the auxiliary storage device 13 through the storage or output device (75) (see also FIG. 7e).

Then, a new encryption key is generated according to the character-based encryption key generation method, and returned to repeat the next plain text (76). Here, the encryption key generation method is the same as the fourth and sixth.

8A is a flowchart of a block-by-block decoding method according to the present invention.

First, it reads eight 8-bits from the ciphertext message, and starts C ₀ ,... Store C ₇ (81). (See also figure 8b)

Check if the received ciphertext is the last (82). If it is the last, terminate it. Otherwise, convert the stored horizontally along the X-axis into the data structure of the vertical (Y-axis) axis, and then convert C ' ₀ ,. Generate C ' ₇ (83). (See also 8c)

Converted around the X axis using the formula (Z (i) = C (j), j = key (i)), the M ' ₀ ,... , M ' ₇ is generated (84). In other words, determining the C (key) the value of the i-th key around the Z axis in the i-th M _'i. An example of encryption key generation is as follows, and an example thereof is shown in FIG. 8D.

M ' ₀ ,... , Converting M ' ₇ to the Y-axis data structure, the original plaintext M ₀ ,. , M ₇ is generated (85). (See also section 8e)

A new encryption key is generated by the encryption key generation method and returned to perform decryption of the next encryption text (86).

Here, the encryption key generation method is the same as FIG. 4 and FIG.

Therefore, the present invention as described above, due to the development of the DES system using the coincidence of the spatial coordinate system, encryption and decryption for all kinds of files (Text, video, executable files, etc.) in all computer environments (DOS, UNIX, IBM) By doing so, it is possible to solve the problem of illegal copying, to protect privacy information, and to decrypt the encryption key size (64 bits of key size) and 16 bits (16 bits of key size). There is.

Claims (13)

In the hardware comprising a central processing unit 11, a main memory device 12, including a DES (Data Encryption Standard; DES) system, and a secondary memory device 14; After performing the first step 21 and the first step 21 of generating a secret key by not overlapping different numbers according to the bit number code system using the coincidence of the spatial coordinate system, by character generated by using the generated secret key And generating a ciphertext by mapping the value of the extracted position among the character and block bit values input by 8 bits for each block, and transmitting the generated ciphertext after performing the second step 22. After performing the third step (23) and the third step (23) to transmit through the line, the extracted position of the character and block bit values inputted by the 8-bit bit by the received cipher text according to the character-by-character and block-by-block input And a fourth step (24) of generating a decryption sentence by defining a subscript of the value of the key as a value of the key. The method of claim 1, wherein the method for generating a cipher text for each character in the second step (22); Reads the plain text from the beginning to the last inputted by the input device by 8 bits and sets the specific bit value in each bit in order to obtain the subscript of the bit that is '1' and sets the value of the extracted position. After mapping the steps 31 to 34 and performing the steps 31 to 34, the location of the key where the mapping is performed is extracted and the extracted location bit is defined as '1' and the remaining bits are defined as '0'. Generating (35, 36), and generating (37) a new encryption key by returning and repeating after performing the steps (35, 36). S operation method. 3. The method of claim 2, wherein generating a new encryption key (37) comprises: generating an encryption key; Steps (41, 42) of checking the number of times that the input keys are formed by grouping two by two to form a group, and after performing the steps (41, 42), if one cycle is over, change the level of each group. If it is not one cycle, after giving the level for each group and exchanging the group key formed by the level cycle (43 to 45), after performing the steps (43 to 45), the process returns to the process of checking whether the number of times of group formation is one cycle The method of operating the DS using the coincidence of the spatial coordinate system, characterized in that it comprises the step (46) for the next group again. 4. The method as claimed in claim 3, wherein the level changing method for each group in the steps (43 to 45); Grouping the levels into two groups a and b to check whether the number of group formations is the first cycle for the first group (51, 52), and after performing the steps 51 and 52, if not one cycle for the first group Investigating whether the second group is 1 cycle, and if it is not 1 cycle for the second group, grants a level for each group, and if 1 cycle for the first group, changes a to b and b to a (53, 54, 58, 57), after performing the steps (53, 54, 58, 57), the step 55, 56 of exchanging the levels of a, b in a level cycle that is a multiple of 2, defining and ending a new level DCS operation method using coincidence of spatial coordinate system. The method of claim 1, wherein the method of generating a decoded sentence for each character in the fourth step (24); Set the bit value of the first to last ciphertext input through the input device in order according to the position of the bit value specific to each bit, and obtain the subscript of the bit that is '1' among the set bit values, and use the extracted subscript value. Defining the subscripts (61 to 64), and after performing the steps (61 to 64), by extracting the key value of the defined subscript extracted position bit '1' and the remaining bits are defined as '0' Decoding using the coincidence of the spatial coordinate system, characterized in that it comprises a step (65, 66) of generating a decryption statement, and a step (67) of generating a new encryption key by returning and repeating after performing the steps (65, 66). How it works. 6. The method of claim 5, wherein generating a new encryption key (67) comprises: generating an encryption key; Steps (41, 42) of checking the number of times that the input keys are formed by grouping two by two to form a group, and after performing the steps (41, 42), if one cycle is over, change the level of each group. If it is not one cycle, after giving the level for each group and exchanging the group key formed in the level cycle (43 to 45), after performing the steps (43 to 45), the process returns to the process of checking whether the number of times of group formation is one cycle The method of operating the DS using the coincidence of the spatial coordinate system, characterized in that it comprises the step (46) for the next group again. 7. The method of claim 6, wherein the level changing method for each group in the steps (43 to 45); Grouping the levels into two groups a and b to check whether the number of group formations is the first cycle for the first group (51, 52), and after performing the steps 51 and 52, if not one cycle for the first group Investigating whether the second group is 1 cycle, and if it is not 1 cycle for the second group, grants a level for each group, and if 1 cycle for the first group, changes a to b and b to a (53, 54, 58, 57), after performing the steps (53, 54, 58, 57), the step 55, 56 of exchanging the levels of a, b in a level cycle that is a multiple of 2, defining and ending a new level DCS operation method using coincidence of spatial coordinate system. The method of claim 1, wherein the block-by-block cipher text generation method in the second step (22); Arranging the plain text from the beginning to the end of reading 8 bits by 8 bits in a two-dimensional structure of the YZ axis to rearrange the newly stored along the Y axis about the Z axis (73), and after performing the step 73, XY A method using coincidence of the spatial coordinate system comprising the steps (74 to 76) of generating a ciphertext by rearranging the axes on the X axis and converting the data back to a data structure of the Y axis. S operation method. 9. The method of claim 8, wherein the generating of the new encryption key (74 to 76) comprises; Steps (41, 42) of checking the number of times that the input keys are formed by grouping two by two to form a group, and after performing the steps (41, 42), if one cycle is over, change the level of each group. If it is not one cycle, after giving the level for each group and exchanging the group key formed in the level cycle (43 to 45), after performing the steps (43 to 45), the process returns to the process of checking whether the number of times of group formation is one cycle The method of operating the DS using the coincidence of the spatial coordinate system, characterized in that it comprises the step (46) for the next group again. 10. The method according to claim 9, wherein the level changing method for each group in the steps 43 to 45 is performed. Grouping the levels into two groups a and b to check whether the number of group formations is the first cycle for the first group (51, 52), and after performing the steps 51 and 52, if not one cycle for the first group Investigating whether the second group is 1 cycle, and if it is not 1 cycle for the second group, grants a level for each group, and if 1 cycle for the first group, changes a to b and b to a (53, 54, 58, 57), after performing the steps (53, 54, 58, 57), the step 55, 56 of exchanging the levels of a, b in a level cycle that is a multiple of 2, defining and ending a new level DCS operation method using coincidence of spatial coordinate system. The method of claim 1, wherein the method for generating a decoded block for each block in the fourth step (24); Arranging the cipher text from the beginning to the end of reading 8 bits by 8 bits in a two-dimensional structure of the XY axis to rearrange newly stored along the Y axis about the X axis (83), and after performing the step (83), YZ A method using coincidence of the spatial coordinate system comprising the steps (84 to 86) of generating a cipher text by rearranging the axes around the Y axis and converting the data back to a data structure of the Y axis. S operation method. 12. The method of claim 11, wherein the generating of the new encryption key (84 to 86) comprises; Steps (41, 42) of checking the number of times that the input keys are formed by grouping two by two to form a group, and after performing the steps (41, 42), if one cycle is over, change the level of each group. If it is not one cycle, after giving the level for each group and exchanging the group key formed in the level cycle (43 to 45), after performing the steps (43 to 45), the process returns to the process of checking whether the number of times of group formation is one cycle The method of operating the DS using the coincidence of the spatial coordinate system, characterized in that it comprises the step (46) for the next group again. 13. The method of claim 12, wherein the level changing method for each group in the steps 43 to 45; Grouping the levels into two groups a and b to check whether the number of group formations is the first period for the first group (51, 22), and after performing the steps (51, 52), if not one period for the first group Investigating whether the second group is 1 cycle, and if it is not 1 cycle for the second group, grants a level for each group, and if 1 cycle for the first group, changes a to b and b to a (53, 54, 58, 57), after performing the steps (53, 54, 58, 57), the step 55, 56 of exchanging the levels of a, b in a level cycle that is a multiple of 2, defining and ending a new level DCS operation method using coincidence of spatial coordinate system.