KR20200053010A - An apparatus and a method for generating a one-way encycripted image - Google Patents

Abstract

Disclosed are an apparatus and method for generating an image in which information is encrypted in one direction. According to the present invention, an encrypted image processing apparatus comprises: a hash code generation unit which receives arbitrary information and generates a hash code encrypted with a fixed length by a predetermined hash function; a hash code division unit for dividing the input hash code into a plurality of character string blocks; and an image processing unit which converts the hash code into an encrypted image by determining a phenotype of a plurality of unit elements corresponding to each of the plurality of character string blocks.

Description

A device and method for generating a one-way encrypted image of information {AN APPARATUS AND A METHOD FOR GENERATING A ONE-WAY ENCYCRIPTED IMAGE}

The present invention relates to an apparatus and method for generating an image in which information is encrypted in one direction. More specifically, the present invention relates to an apparatus and method for generating an encrypted image by converting input information into a predetermined hash code, dividing the hash code into a plurality of blocks, and determining a phenotype corresponding to each block value. will be.

With the development of computing technology and data network technology, a lot of information is distributed through the data network. Information distributed through the data network includes information about the individual user, some of which may be disclosed to the general public at the user's option. In addition, information related to the privacy of the user is not disclosed unless the user consents.

In special cases, the user may need to share personal information that has not been disclosed. For example, even if information about a user's access area is excluded from disclosure, the user may want to identify another user in the same access area as himself. As another example, a patient with a disease that is difficult to reveal may not need to disclose his or her name, but may need to identify another patient with the same disease to exchange information about the treatment for that disease.

However, even in the special case described above, if the information is not disclosed, the purpose cannot be achieved, so the user is forced to disclose the information or give up another purpose.

Therefore, in the case of sensitive information that is difficult to disclose to the general public, it is difficult to recognize the general public, but it is necessary to encrypt the information so that it can be identified by others who share the same information.

The present invention aims to solve the above problems of the prior art, and an object thereof is to provide an apparatus and method for converting sensitive information into a one-way encrypted image.

An encryption image processing apparatus provided by an embodiment of the present invention includes a hash code generation unit that receives arbitrary information and generates a hash code encrypted with a fixed length by a predetermined hash function; A hash code division unit for dividing the inputted hash code into a plurality of character string blocks; and an image processing unit for converting the hash code into an encrypted image by determining a phenotype of a plurality of unit elements corresponding to each of the plurality of character string blocks. .

The image processing unit may configure the encrypted image by combining expressions of the plurality of unit elements.

The apparatus for encrypting an image processing may further include a unit element table in which the expression of the string element and the expression of the unit element are mapped, and the image processing unit may query the unit element table to determine a unit corresponding to each string block. The phenotype of the element can be determined.

According to an embodiment of the present invention, the hash code division unit divides the hash code into a plurality of character string blocks having 6 character strings, and the image processing unit, each of the character string groups is a sequence pair of 2 character strings 3 It can be configured to convert each order pair to a grayscale value of the primary color of the display.

In this case, the image processing unit may be configured to generate a plurality of unit images processed with colors corresponding to the converted three primary color gradation values.

The hash code may be an MD5 code, and the hash code division unit may be configured to cut the last two digits of the MD5 code and divide the MD5 code into five character string groups having six digit character strings.

On the other hand, the encryption image processing method provided by an embodiment of the present invention is an encryption image processing method of information performed by an encryption image processing apparatus of information including a hash code generation unit, an image processing unit, and a unit image storage unit, Receiving arbitrary information; Generating a hash code encrypted with the fixed length of the received arbitrary information by a predetermined hash function; Dividing the input hash code into a plurality of character string blocks; And converting the hash code into an encrypted image by determining a phenotype of a plurality of unit elements corresponding to each of the plurality of character string blocks.

According to the encryption image processing apparatus and method according to the present invention, by converting sensitive information, which is difficult to disclose to others, into an encrypted image in one direction, it is difficult for the general public to recognize, but it can be identified by others who share the same information. There is an advantage.

1 is a diagram illustrating a relationship between an encrypted image and a unit element constituting the encrypted image according to an embodiment of the present invention.
2 is a block diagram showing an apparatus for encrypting information according to an embodiment of the present invention.
3 is a conceptual diagram illustrating a process of encrypting a hash code in the encryption image processing apparatus of the information in FIG. 2.
FIG. 4 is a conceptual diagram illustrating a table in which the hash code block values of FIG. 3 are mapped 1: 1 to individual expression types of unit elements.
5 is a diagram illustrating an example of processing an access location of a user as an encrypted image by an information encryption image processing apparatus according to an embodiment of the present invention.
6 is a diagram illustrating an example of processing an access location of a user as an encrypted image by an information encryption image processing apparatus according to another embodiment of the present invention.

The present invention can be variously changed and can have various forms, and specific embodiments will be illustrated in the drawings and described in detail in the text.

However, this is not intended to limit the present invention to a specific disclosure form, and it should be understood as including all modifications, equivalents, and substitutes included in the spirit and scope of the present invention. Terms such as first and second may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from other components. For example, without departing from the scope of the present invention, the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component.

Terms used in the present application are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In this application, terms such as “include” or “have” are intended to indicate that a feature, number, step, operation, component, part, or combination thereof described in the specification exists, or that one or more other features or It should be understood that the existence or addition possibilities of numbers, steps, actions, components, parts or combinations thereof are not excluded in advance.

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

1 is a diagram showing a relationship between an encrypted image and a unit element constituting the encrypted image according to an embodiment of the present invention, and FIG. 2 is a block diagram showing an encrypted image processing apparatus for information according to an embodiment of the present invention , FIG. 3 is a conceptual diagram illustrating a process of encrypting a hash code in the encryption image processing apparatus of the information in FIG. 2.

The encrypted image of the present invention may be composed of m (m≥1) unit elements. The unit element may be part of an encrypted image or information necessary to generate an encrypted image. Each unit element is represented by a plurality of phenotypes. In the expression type, the unit element is actually displayed on the display, and the shape, size, and color of the unit element are specifically expressed on the display. Each expression type is selected in a 1: 1 correspondence to a block string of a hash code, which will be described later, or calculated directly by an operation from a block string, or mapped 1: 1 with a block string and stored in a storage medium or the like. When mapped and stored in 1: 1 with block string, each expression type can be saved as an image file, or as a parameter value for size, shape, color, etc., and a URL that can call an image or parameter value It can also be stored as.

For example, referring to FIG. 1 (a), the encrypted image of the present invention may be an avatar, and the unit element may be an avatar's face shape, eyes, nose, mouth, ears, hairstyle, and clothing. In the example of Fig. 1 (a), the avatar's face shape, eyes, nose, mouth, ears, hairstyle, and clothes are used as unit elements constituting the avatar, but the unit elements may be further subdivided or integrated. For example, the hairstyle can be integrated into the face shape, and conversely, the eye can be subdivided into the shape of the eye and the color of the eye. Each unit element has a plurality of phenotypes. For example, the unit element 'eye' may be represented by k expressions such as eye 1, eye 2, eye 3 ... eye k.

Meanwhile, the encrypted image of the present invention may be an image divided into a plurality of regions, and in this case, each region may be a unit element. For example, referring to FIG. 1 (b), the encrypted image may be a color band having a plurality of colors. The color strip of FIG. 1 (b) is divided into five regions A1 to A5, and each region is a unit element. The expression of the unit element is the color of each region, and the color can be determined by calculation from a block of hash codes.

Referring to FIG. 2, an apparatus for encrypting information according to an embodiment of the present invention may be configured to include a hash code generation unit 11, a hash code division unit 12, and an image processing unit 13.

The hash code generator 11 receives arbitrary information, converts the inputted arbitrary information by a hash function, and generates an encrypted fixed-length hash code.

The arbitrary information may be information related to the location of the user's residence area, access location, access IP, and the like. Also, the arbitrary information may be personal information such as a user's hobbies, age, birthday, school, religion, or ideal type. Arbitrary information may be information reluctant to disclose to the general public, such as medical history and distress. Meanwhile, the arbitrary information may be various types of information other than information related to the user.

The hash function is a function that maps data of arbitrary length to a string of fixed length. A string that is a value obtained by such a hash function is called a hash code. A key is used in a general encryption algorithm, but since the hash function does not use a key, the same string is always output for the same input. In addition, there is a characteristic that the length of the output value does not change even if any input value is put in the hash function. That is, the hash function has a characteristic of generating a string having a fixed length regardless of the length of input information. Another important characteristic of hash functions is that the input value cannot be found through the output value, which is called one-way encryption. That is, the hash code generated through the hash function has a characteristic that it is not possible to decipher what information was originally input. Various hash functions can be used to generate the hash code of the present invention. A typical example of a hash function is MD5 (Message-Digest algorithm 5). MD5 is a 128-bit cryptographic hash function, specified by RFC 1321, and is mainly used for integrity checks to check whether a program or file is intact. MD5 receives a variable-length message and outputs a fixed-length output of 128 bits. More specifically, the input message is divided into 512 bit blocks, and the message is padded to a length that can be divided by 512. Message padding, first, adds the first single bit 1 to the end of the message, fills it with 0 to 64 bits less than the length of a multiple of 512, then the remaining 64 bits are a 64-bit integer representing the length of the original (original) message. (integer). The main MD5 algorithm operates on one 128-bit state consisting of four 32-bit words labeled A, B, C, D. A, B, C, and D are initialized to predetermined constant values. The main MD5 algorithm operates on each 512-bit input message block in turn. After processing each 512-bit input message block, the value of the 128-bit state changes. Processing a message block is divided into 4 steps. One step is called a "round," and each round consists of 16 similar operations based on the nonlinear function F, modular addition, and left rotation. The MD5 algorithm produces a 128-bit fixed-length output through this operation.

The hash code generator 11 of the present invention uses the hash function and the characteristics of the hash code as described above to unidirectionally encrypt the input information. Referring to Figure 3, the hash code (HC) generated by the hash code generation unit 11 of the present invention is composed of N characters.

The hash code division unit 12 divides the hash code generated by the hash code generation unit into m blocks equal to the number of unit elements of the encrypted image.

 Referring to Figure 3, the hash code (HC) is a fixed-length character string consisting of N characters, and the hash code division unit 12 hash codes (HC) m blocks (B1, B2, B3 .. .Bm). Each divided block (B1, B2, B3, ..., Bm) corresponds to the above-described unit elements (IE1, IE2, ... IEm) 1: 1. That is, the hash code division unit 12 divides the hash code HC into m blocks corresponding to each of the m unit elements. Each block (B1, B2, ..., Bm) has a predetermined length. For example, in the example of FIG. 3, the first block B1 is the length of three characters, the second block B2 is the length of two characters, the i block Bi is the length of one character, and the m block ( Bm) is two characters long. The length of the blocks B1, B2, ..., Bm is determined by the number of phenotypes of the unit elements IE1, IE2, ... IEm corresponding to the block. For example, when the hash code (HC) generated by the hash code generator 11 is a hexadecimal string, and the expression type of the first unit element IE1 corresponding to the first block B1 is 256, the first is The length of the block B1 is determined by two digits. Each block has a unit string (UCS1, UCS2, ... USCm) as a value. Meanwhile, the image processing unit 12 may cut a portion of the hash code as necessary. For example, when the image processing unit 12 divides the hash code HC into m blocks based on the number of expressions of each unit element (IE1, IE2, ..., IEm), if there is a remaining character string, the character string Can be cut off.

In this way, the image processing unit 13 determines a phenotype corresponding to a value (that is, a unit string) of a divided block corresponding to each unit element. The phenotype of the unit element is selected by a predetermined phenotype determination function. The phenotype determination function may be different or the same for each unit element. For example, in the example of FIG. 1 (a), since the face elements and eyes, which are unit elements, are different entities having no similarity to each other, the phenotype determination functions of these unit elements are set differently. In contrast, in the example of FIG. 1B, the phenotype of each unit element is the color of each region and may be calculated by the same function. In FIG. 3, [Bi] is the value of the i-th block, that is, the actual character string Si included in the i-th block. For example, in the example of FIG. 3, [B1] is the actual character string S1 (C1C2C3) included in the first block, and [B2] is the actual character string S2 (C4C5) included in the second block. Any unit element IEi may be represented by ki phenotypes (p _{i, 1} , p _{i, 2} , ... p _{i, ki} ), and each phenotype (p _{i, 1} , p _{i, 2} , .. _{.p i, ki} ) has a functional relationship corresponding to the value of Bi corresponding to the unit element and [Bi] 1: 1. Accordingly, the expression pi, j of the i-th unit element can be expressed by the function fi ([Bi]), and the image processing unit 13 is fi, which is a function value corresponding to the actual value Si of block Bi for any unit element IEi (Si) is determined by the output phenotype Pi. In the example of FIG. 3, the output phenotype P1 of the first phenotype IE1 is a function value f1 (S1) corresponding to the actual value S1 of the first block, and the output phenotype P2 of the second phenotype IE2 is the actual value S2 of the second block It is determined by the corresponding function value f2 (S2).

The function fi ([Bi]) for determining the phenotype of the present invention corresponds 1: 1 with all possible values of [Bi] and individual phenotypes (p _{i, 1} , p _{i, 2} , ... p _{i, ki} ) Any form can be used. For example, the function fi ([Bi]) may be an expression, a conversion algorithm, or the like, and [Bi] and individual phenotypes (p _{i, 1} , p _{i, 2} , ... p _{i, ki} ) are mapped 1: 1. It could be a table. The number of individual phenotypes ki is preferably the same as the number of possible values [Bi] of the block Bi, but may be smaller than the number of [Bi].

Meanwhile, the expression may be determined in parallel for each block or may be performed in series for the entire hash code. When the phenotype is determined in parallel for each block, the entire hash code is divided into m blocks, and then the values of m blocks are simultaneously determined and the phenotype of the corresponding unit element is determined. On the other hand, when the phenotype determination is performed in series for the entire hash code, the phenotype determination for each block is sequentially performed.

FIG. 4 is a conceptual diagram showing a table in which the hash code block value [Bi] of FIG. 3 is mapped 1: 1 to individual expression types (p _{i, 1} , p _{i, 2} , ... p _{i, ki} ) of unit elements. to be.

Table Ti is generated for any unit element IEi. The table Ti is a 1: 1 mapping of the value [Bi] of the block Bi corresponding to the unit element IEi and the individual expression pi, j. 3 and 4, in the table T1 for the first phenotype IE1, individual phenotypes p1, j mapped 1: 1 to each value of the first block B1 are recorded. Since the value [B1] of the first block B1 in FIG. 3 is C1C2C3, the image processing unit 13 finds individual expressions p1, k corresponding to C1C2C3 in the table T1 and determines the expression P1 of the unit element IE1.

Referring to FIG. 3 again, the image processing unit 13 configures the final encrypted image EP by combining the determined expressions P1, P2, ..., Pm of each unit element. For example, the image processing unit may configure the avatar as shown in FIG. 1 (a) by combining the determined facial shapes, eyes, nose, mouth, ears, hairstyle, and costume expressions.

Hereinafter, the process of encrypting the input information into the color band image of FIG. 1 (b) using the encrypted image processing apparatus configured according to the embodiment will be described in more detail with reference to FIG. 4.

5 is a diagram illustrating an example of processing an access location of a user as an encrypted image by an information encryption image processing apparatus according to an embodiment of the present invention.

First, the hash code generation unit 11 receives the user's access information, 'children', and generates a hash code using a predetermined hash function. The hash function used in this example is an MD5 function. As described above, MD5 is a 128-bit encrypted hash function, and the output value is a string of 32 hexadecimal digits. Referring to FIG. 5 (a), the MD5 output of the 'children' input information is a string '0DA225621497C8C0CD840F78F1E26748' which is a hexadecimal number of 32 digits.

In the example of FIG. 1 (b), the finally generated encrypted image is composed of five bars A1 to A5, and each bar corresponds to a unit element. Each bar (A1 to A5) is represented by a color composed of the three primary colors R, G, and B components. In this embodiment, each of R, G, and B is set to have 256 gradations. Therefore, each color bar has all possible combinations of R, G, and B gradation values in a phenotype. At this time, there are 256 ^three possible phenotypes. In summary, the encrypted image of FIG. 1 (b) is composed of 5 unit elements each having 256 ³ phenotypes.

Subsequently, the hash code division unit 12 divides the generated MD5 hash code into 5 blocks according to the number of unit elements. Each block length is determined according to the number of phenotypes. In this embodiment, the MD5 hash code is a hexadecimal number for each digit, and the number of phenotypes for each block is 256 ³ , so the length of the block is L, 16 ^L = It is determined to satisfy 256 ³ , and its value is L = 6. That is, the image processing unit divides the hash code into 5 blocks so that each length is 6 digits. At this time, the generated MD5 code is 32 digits, and the required number of digits is 30 digits, so the last 2 digits are truncated. The result of dividing the MD5 code of FIG. 5 (a) by the image processing unit 12 is as shown in FIG. 5 (b). The last two digits of '48' of the hash code of FIG. 5 (a) are truncated, and the 30 digits remaining after the truncation are sequentially divided into 5 unit strings having 6 digits. That is, the hash code with the last two digits truncated is divided into 5 unit blocks by grouping 6 characters from the front. Each block has a unit string as a value. As shown in FIG. 5 (b), each unit string has ODA225 (B1), 621497 (B2), C8C0CD (B3), 840F78 (B4) and F1E267 ( B5).

Subsequently, the image processing unit 13 determines the expression type of the unit element corresponding to each block, that is, the color of each color bar A1 to A5. Specifically, the image processing unit 13 bundles the six characters constituting each unit character string two again, and converts them into gradation order pairs (r, g, b) of three primary colors. Referring to FIG. 5 (c), there are a total of 5 transformed gradation order pairs, respectively, p1 (OD, A2,25), p2 (62,14,97), p3 (C8, C0, CD), and p4 (84, 0F, 78) and p5 (F1, E2,67). On the other hand, since the characters constituting each unit string are all hexadecimal numbers, if each sequence pair is expressed in decimal, p1 (13,162,37), p2 (98,20,151), p3 (200,192,205), p4 (132,15,120) And p5 (241,226,103). This gradation order pair (r, g, b) corresponds to the gradation of each of the three primary colors used by the display for display. For example, in a display using RGB as the three primary colors, this order pair pi (r, g, b) corresponds to the order pair of each grayscale value. Three values making up the ordered pair is because it is possible ^{the two} 16-gradation, that is, the representation of 256 gray levels for each primary color, each of the two-digit hexadecimal numbers. In the example of FIG. 2, the order pair OP1 corresponds to a color (green) in which the gradation values of R, G, and B are 13, 162, and 37, and this color is determined as a phenotype of the first color bar. In the same way, the colors of the second to fifth color bars are determined.

Subsequently, the image processing unit 13 completes the encrypted image by arranging the five generated unit images, that is, color bars. At this time, the arrangement of the unit images may be arranged in the order of the ordered pairs, or may be arranged by changing the order. That is, color bars corresponding to OP1 to OP5 may be arranged in the order of the generated pair. Alternatively, the image processing unit 12 may arrange the generated color bars in the order of the ordered pairs without changing the order. The encrypted image generated through the above processing is displayed on the display.

Since the image displayed through the above processing is based on a hash code that unidirectionally encrypted the access location, which is the original input information, it is impossible to determine which access area this image represents except for the user who knows the original input information. On the other hand, if a user sees a connection location information image identical to his / her access location information image in another person's profile, it can be seen that the other person is accessing from a location very close to him. Therefore, each user can know about the existence of another person who has information in common with him through the encrypted information image, but cannot know whether the other person has other information that is not related to him. For example, a user connected from a child can know what the image corresponding to the access location 'child' is, so it is possible to identify other users who have accessed from the child, but it is not possible to know what image represents a connection location other than the child. You will not be able to see where other users have accessed.

As described above, the present invention may generate an encrypted image using a table in which individual expressions of unit elements are mapped to hash code block values.

FIG. 6 illustrates an example in which a user's access location is processed as an encrypted image by an information encryption image processing apparatus according to another embodiment of the present invention. It is a conceptual diagram showing an example of encrypting with an image.

First, the hash code generation unit 11 receives the user's access information, 'children', and generates a hash code using a predetermined hash function. The hash function used in this example is an MD5 function. As described above, MD5 is a 128-bit encrypted hash function, and the output value is a string of 32 hexadecimal digits. Referring to FIG. 6 (a), the MD5 output of the input information 'children' becomes 32-digit hexadecimal string '0DA225621497C8C0CD840F78F1E26748'.

The avatar of FIG. 1 (a) is composed of seven unit elements, such as a face shape, eyes, nose, mouth, ears, hairstyle and clothes. Each unit element is set to have an appropriate number of individual phenotypes. In this embodiment, there are 16 ³ faces, 16 ⁵ eyes, 16 ⁴ noses, 16 ⁵ mouths, 16 ⁴ ears, It was set up to have 16 ⁵ types of hairstyles and 16 ⁶ types of costumes. Such a setting is only an example, the unit elements may be further subdivided, and the number of individual phenotypes may be set differently.

Subsequently, the image processing unit 12 divides the generated MD5 hash code into seven blocks B1 to B7 to correspond to the unit element. Each block B1 to B2 corresponds to one unit element. The result of dividing the MD5 code of FIG. 6 (a) by the image processing unit 12 is as shown in FIG. 6 (b). In the example of FIG. 6 (b), the first block B1 is a unit element 'face', the second block B2 is a unit element 'eye', and the third block B3 is a unit element 'nose' In, the fourth block (B4) is the unit element 'mouth', the fifth block (B5) is the unit element 'ear', the sixth block (B6) is the unit element 'Hair Day', and the seventh block ( B7) corresponds to the unit element 'costume', respectively. The length of each block is determined according to the number of phenotypes. In this embodiment, since each digit of the MD5 hash code is a hexadecimal number, if the number of phenotypes of the unit element IEi is ki, the length of the corresponding block is Li, It is decided to satisfy 16 ^Li ≥ki. 6 (b), the length of the first block is 3, the length of the second block is 5, the length of the third block is 4, the length of the fourth block is 5, the length of the fifth block is 4, the first The length of the 6 blocks is 5, and the length of the 7th block is 6.

Subsequently, the image processing unit 13 determines the expression type of the unit element corresponding to each block. According to this embodiment, in order to determine the phenotype of each unit element, a table in which a hash code block value and an individual phenotype are mapped 1: 1 is used. Referring to FIG. 6 (c), tables T1 to T7 are provided for each individual element face shape, eyes, nose, mouth, ears, hairstyle and clothes. For example, T1 is related to the unit element 'face type', and the corresponding expression type (face type 1, face type 2, ..) for each value (000,001, ..., FFE, FFF) of the first block B1. .Face type 4095 and face type 4096) are mapped. The image processor finds individual phenotypes corresponding to the values of the divided blocks and determines the phenotype of the corresponding unit element. For example, since the value of the first block in FIG. 6 (b) is ODA, the image processing unit determines 'face type 218' mapped to this value ODA as a unit element 'face type' expression type with reference to table T1. The phenotype of the remaining unit elements is determined in the same way. Individual phenotypes may be stored as image files, as parameter values related to size, shape, color, etc., or as URLs that can call images or parameter values.

Subsequently, the image processing unit 12 completes the encrypted image by arranging the determined phenotypes of the seven unit elements. The encrypted image generated through the above processing is displayed on the display.

Since the image displayed through the above processing is based on a hash code that unidirectionally encrypted the access location, which is the original input information, it is impossible to determine which access area this image represents except for the user who knows the original input information. On the other hand, if a user sees a connection location information image identical to his / her access location information image in another person's profile, it can be seen that the other person is accessing from a location very close to him. Therefore, each user can know about the existence of another person who has information in common with him through the encrypted information image, but cannot know whether the other person has other information that is not related to him. For example, a user connected from a child can know what the image corresponding to the access location 'child' is, so it is possible to identify other users who have accessed from the child, but it is not possible to know what image represents a connection location other than the child. You will not be able to see where other users have accessed.

In the detailed description of the present invention described above, it has been described with reference to preferred embodiments of the present invention, but those skilled in the art or those skilled in the art will appreciate the spirit of the present invention as set forth in the claims below. And it will be understood that various modifications and changes can be made to the present invention without departing from the technical scope.

10: encrypted image generating device 11: hash code generation unit
12: Hash code division unit 13: Image processing unit

Claims (12)

A hash code generator that receives arbitrary information and generates a hash code encrypted with a fixed length by a predetermined hash function;
A hash code divider for dividing the input hash code into a plurality of character string blocks; and
An image processing unit that converts the hash code into an encrypted image by determining a representation of a plurality of unit elements corresponding to each of a plurality of character string blocks
Encrypted image processing device of information comprising a.
According to claim 1, The image processing unit,
An apparatus for processing an encrypted image of information constituting the encrypted image by combining phenotypes of the plurality of unit elements.
According to claim 2,
Further comprising a unit element table stored by mapping the value of the string block and the expression of the unit element,
The image processing unit is an encrypted image processing apparatus for information for determining a phenotype of a unit element corresponding to each string block by querying the unit element table.
The method according to claim 2, wherein the hash code division unit divides the hash code into a plurality of character string blocks having 6-digit character strings,
The image processing unit, each of the character string group is composed of three pairs of two-digit character string, and each image pair is an encrypted image processing apparatus for converting information into three primary color gradation values of a display.
According to claim 4, The image processing unit,
An encryption image processing apparatus for information that generates a plurality of unit images processed with colors corresponding to the converted three primary color gradation values.
The apparatus of claim 5, wherein the hash code is an MD5 code.
The method of claim 6, wherein the hash code division unit,
Cut off the last two digits of the MD5 code,
An apparatus for processing an encrypted image of information for dividing the MD5 code into five character string groups having six character strings.
An encryption image processing method for information performed by an encryption image processing apparatus for information including a hash code generation unit, an image processing unit, and a unit image storage unit,
Receiving arbitrary information;
Generating a hash code encrypted with the fixed length of the received arbitrary information by a predetermined hash function;
Dividing the input hash code into a plurality of character string blocks; And
Converting the hash code into an encrypted image by determining a phenotype of a plurality of unit elements corresponding to each of a plurality of character string blocks
Method for processing an encrypted image of information, including.
The method of claim 8, wherein the step of converting the darkened image,
And combining the determined phenotypes of the plurality of unit elements to construct the encrypted image.
The method of claim 8, wherein the expression of the unit element is mapped to the value of the string block and stored in the unit element table,
The image processing unit determines a phenotype of a unit element corresponding to each string block by querying the unit element table.
The method of claim 8, wherein the step of converting the darkened image,
Dividing the hash code into a plurality of string blocks having 6-digit strings;
Constructing each of the string blocks into a sequence pair of two 2-digit strings; And
And converting each pair of sequences into three primary color gradation values of the display.
The method of claim 11, wherein the hash code is an MD5 code.

Images