JP2002189715A - Code number embedding system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To embeds a code number in document information while relating the code number to a specific character. SOLUTION: The system comprises a 1st storage means which stores a document, a number generating means which generates the code number, a 2nd storage means which stores the generated code number in binary notation, a 3rd storage means which stores retrieval information, a 4th storage means which stores substitute information corresponding to the stored retrieval information, an extracting means which extracts document information matching the retrieval information in the 3rd storage means from the document information in the 1st storage means, and a substituting means which makes the extracted document information correspond to the digit of the code number in the 2nd storage means and substitute the extracted document information for the substitute information stored in a 4th storage means; and a specific character is set as retrieval information in a document, document information matching it is extracted, and the extracted information is outputted in prescribed font or substitute font according to the respective digit values of a code number given to the document to embed the code number.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a distributed document or a copy thereof when a document whose copying is prohibited is printed or sent as an electronic document by embedding an encryption number in the document. When is collected,
The present invention relates to a system for specifying a distribution destination from an embedded encryption number.

[0002]

2. Description of the Related Art It is widely used to create and print various documents using a document editing device such as a personal computer or a word processor. On the other hand, some documents, that is, those whose copying is to be prohibited, exist. In such a case, for example, print "Confidential" or "Don't copy" on the cover, copy the required number of copies from the base paper, and press the mark "Secret" or "Don't copy" on each copy. In this case, a method of communicating the intention of the creator is used. Moreover,
By duplicating the name of the distribution destination or a different number depending on the distribution destination, it is possible to identify the distribution destination when copied.

[0003] Further, in the case of an electronic document, at present, words such as "prohibition of copying", "prohibition of transfer", and "prohibition of printing" are added to the conscience of the recipient.
However, if the person who obtained such a document had malicious intent to provide a copy to another person (others including the recipient of the document are hereinafter referred to as "third parties"), the document was distributed. It is easy to duplicate a document excluding key parts such as the distribution name and distribution number, and it is extremely difficult to identify the distribution destination even if the copy is recovered at a later date. is there. Therefore, it is hard to say that a substantial effect of prohibiting the copying of secret documents can be expected, and in the present situation, it is necessary to rely on the conscience of the recipient.

A method for solving such a problem has been proposed in Japanese Patent Application Laid-Open No. Hei 4-310175. In this method, characters in a document are printed with a predetermined font, but one character at a specific location is printed with a replacement font. After the document is distributed, when the document is copied and collected, a character printed in the replacement font is found, and the distribution destination is specified by the position occupied by the character in the whole. According to this method, it is necessary to store a replacement font for all characters in addition to a predetermined font (for example,
If the predetermined font is Mincho font and the replacement font is Gothic font, and both are provided as standard, there is no need to prepare them separately.)

Further, since the position of the character to be printed with the replacement font is determined by the relationship between the total number of characters and the number of copies to be issued, there is no difference between the characters at that position depending on the font, or the difference. Even if a symbol or the like having a small size is printed with the replacement font, it becomes very difficult to identify the symbol. In other words, if the characters there happen to be "." Or ",", it is extremely difficult to specify the distribution destination of the document when it is collected, even if it is printed in the replacement font. Would be difficult.
If the character is "(space)", it is useless at all.

Further, in this method, there is only one key character, that is, a character for finding an encryption number in a document, but copying is repeated until the character is collected. In some cases, a part that is difficult to read occurs, and if there is a character serving as a key in that part, it is expected that the encryption number cannot be specified reliably. Furthermore, when the document is passed on to a third party, the full text of the document is not necessarily passed on,
For example, only a certain page may be passed. In such a case, as described above, there is a possibility that the encryption number cannot be specified reliably.

[0007]

A problem with the technique proposed in the above-mentioned publication is that since a character to be a key is determined by a position obtained by calculation, it is not known which character is a key. As described above, in some cases, it is expected that it will not be possible to reliably specify the distribution destination even if the distribution destination is collected. The present invention relates to specific document information in a document, for example, a specific character or a figure other than a character, by associating an encryption number with a code, and using a method of embedding the encryption number in the document information. It is an object of the present invention to solve the various problems described above and to suppress leakage of a secret document to a third party.

[0008]

According to the present invention, a first storage means for storing a document, a number generation means for generating a different encryption number for each distribution destination, and an encryption number generated by the number generation means. A second storage unit that stores binary information, a third storage unit that stores search information, and a fourth storage unit that stores replacement information corresponding to the search information stored in the third storage unit. Storage means; extracting means for extracting, from the document information stored in the first storage means, document information matching the search information stored in the third storage means; The extracted document information is made to correspond to the digit of the encryption number stored in the second storage means, and the document information extracted by the extraction means based on the digit value is stored in the fourth storage means. Number provided with replacement means for replacing the replacement information with It is an eye-inclusive system.

Further, according to the present invention, a first storage means for storing a document, a number generation means for generating a different encryption number for each distribution destination, and a storage of the encryption number generated by the number generation means in a binary number. A second storage unit that stores replacement information, a third storage unit that stores search information, a fourth storage unit that stores replacement information corresponding to the search information stored in the third storage unit, Extracting means for extracting, from the document information stored in the first storage means, document information matching the search information stored in the third storage means, and storing the document information in the third storage means The retrieved search information is made to correspond to the digit of the encryption number stored in the second storage means, and the document information extracted by the extraction means based on the digit value is stored in the fourth storage means. Replacement means for replacing the replacement information with the stored replacement information. Was is a cryptographic number embedded system.

Further, according to the present invention, first storage means for storing a document, number generation means for generating a different encryption number for each distribution destination, and the encryption number generated by the number generation means are stored in binary. A second storage means, an area storage means for storing a plurality of area boundary information set in the first storage means, and a fourth storage means for storing replacement information corresponding to the set area. The area stored in the area storage means is made to correspond to the digit of the encryption number stored in the second storage means, and stored in the first storage means based on the digit value of the encryption number. And a replacement unit that replaces the document information in the area with the replacement information stored in the fourth storage unit.

According to the present invention, the encryption number embedding system further comprises data reading means for reading a stored document from an external storage device, and input means for inputting an encryption number, and reading from the data reading means. The stored document information is stored in the first storage unit, the search information is stored in the third storage unit, the replacement information is stored in the fourth storage unit, and the encryption number input from the input unit is represented by a binary number. Storing the document information in the second storage means, extracting the document information matching the search information from the document information by the extracting means, and making the extracted document information correspond to the digit of the encryption number; An encryption number confirmation system wherein the extracted document information is replaced by the replacement means with replacement information stored in the fourth storage means based on the digit value.

Further, according to the present invention, in the encryption number confirmation system, the document information read from the data reading means is stored in the first storage means, the search information is stored in the third storage means, and the replacement information is stored in the third storage means. The encryption number input by the input means is stored in a fourth storage means in binary,
Storing in the second storage means, and extracting the document information matching the search information from the document information by the extraction means, and making the search information correspond to the digit of the encryption number;
On the basis of the digit value, the extracted document information is replaced by the replacement information by the replacement means.

Further, according to the present invention, in the encryption number confirmation system, the document information read from the data reading means is stored in the first storage means, the area boundary information is stored in the area storage means, and the replacement information is stored in the first storage means. 4, the encryption number input from the input means is stored in a binary number in the second storage means, and the set area is made to correspond to the digit of the encryption number. The document information contained in the area is replaced with replacement information based on the replacement information.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention is roughly divided into two methods, a method of embedding an encryption number in a specific character in a document and a method of embedding an encryption number in a figure other than a character as an object of document information. Divided into two. First, an embodiment of the present invention in which an encryption number is embedded in specific characters in a document as document information will be described. Document information; indicates character codes and attribute information (for example, font, size,...) Constituting a document. Search information; information for extracting the character code or attribute information of document information. Replacement information; information for replacing the extracted document information.

FIG. 1 is a diagram showing the relationship between a document and these pieces of information. In addition, in order to simplify explanation, it was as follows. 1) Attribute information may be omitted from the document information in order to compress the data amount. Here, it is assumed that the attribute information is stored together with the character code. 2) The data amount of one document information is fixed, and the unit is 1. 3) “Character code” may be simply described as “character”. In the present invention, in order to make the description easier to understand, the document information and the search information are limited to characters, and the replacement information is limited to information relating to fonts which are attributes of these characters. And storage means connected thereto.

An embodiment of an encryption number embedding system according to the present invention will be described below. Embodiment 1 A first embodiment of an encryption number embedding system according to the present invention relates to an encryption number embedding system that outputs specific document information included in a document not as a predetermined font but as replacement information (a font for replacement). However, the meaning of the “specific” does not depend on its position in the entire document, but, for example, focuses on a specific character “ha”, and a plurality of “ "
The cipher number is embedded by outputting a predetermined font or a replacement font. Specific characters are only identifiable characters, that is, characters that are difficult or impossible to identify, such as “.”, “,”, And “(space)” as described above, are excluded from the beginning. In the case of a document having a large number of pages, the method proposed in the above publication can be solved by using a method such as embedding a plurality of encryption numbers.

That is, a specific character in a document is set as search information, and document information that matches the extracted character is extracted. Depending on whether you want to output in the same font or a replacement font that is prepared separately.
This is for embedding an encryption number. For example, search information is "ha" and "ha" appears in the target document.
Are associated with each digit of the encryption number in the order of appearance, and are output in a predetermined font or a replacement font depending on the digit value. A different binary encryption number, [00
001], [00010], [00011],..., And the encryption number [00001]
In the document, the "ha" appearing at the 0th position is associated with the least significant digit (the 0th digit) of the encryption number, and since the value is "1", the document is a replacement font. "Ha"
Correspond to the first to fourth digits, and are output in a predetermined font because their values are “0”.

Similarly, in the document with the encryption number [00010], the first occurrence of “ha” is replaced with 0%.
And "ha" appearing second to fourth times are output in a predetermined font. The document with the encryption number [00011] outputs the 0th and 1st occurrence of “ha” as a replacement font, and the 2nd to 4th occurrence of “ha” as a predetermined font. That is, the digits of the encryption number are made to correspond to the order of appearance of the search information,
If the digit value of the cipher number is "0", it is output in a predetermined font. It is.

FIG. 2 is a diagram for explaining the principle of embedding, for example, an encryption number [00011] in a character "ha" in a document in this embodiment. Of course, characters other than "ha" are output in a predetermined font. In addition, the digit values “0” and “1” of the encryption number may be reversed. In the above example, the correspondence is made from the 0th digit in the order of appearance. The order in which they are performed may be changed.

FIG. 3 is a block diagram showing the configuration of the encryption number embedding system according to this embodiment. DAH (dx) of the first storage means is a character, and DAZf (dx) is
The attribute information is stored. These storage means DAH (d
x) and DAZf (dx) are indexed by the address counter dx. ANG of the second storage means is:
The binary encryption number is stored. Therefore, if the number of digits of ANG is x, the number of different encryption numbers that can be generated is 2
^X pieces. D3 () of the third storage means stores the search information “ha”. D4 () of the fourth storage means stores replacement information “Gothic”. AX and BX of the encryption number generation data storage means store encryption number generation data α and β.

Here, α = 3 ([00011]), β
= 9 ([01001]), the encryption number of the n-th document is α + n × β (0th = [00011], 1st = [01100], 2nd = [10101],...
・). The output processing unit OP outputs various data according to instructions from the CPU (not shown). When output to a printing unit, font data and the like of the character are obtained from the character code and attribute information and output to a print buffer or the like. In addition, the data may be output to another device via an external (may be built-in) storage device (hard disk or floppy disk) or a communication line. The arrows in FIG. 3 indicate the direction of data flow.

FIGS. 4, 5, and 6 illustrate the present embodiment.
FIG. 5 is a diagram illustrating an example of a document on which encryption is to be embedded, and a state where each data is stored in each storage unit at that time. FIG. 4 is an example of 130 pieces of document information, and “•” indicates document information other than “ha”. FIG. 5 shows the first storage means, D
AH () and DAZf () indicate a state in which document information is stored. For each dx, the character code is DAH (dx), and the attribute information is DAZf (d).
x). The last document information (dx =
After 130), END1 is stored, indicating that there is no document information thereafter. DAH (dx) stores characters (character codes to be exact) and DAZf (dx
As for x), “Mincho” is stored so that all characters are output in Mincho. This means that when output without embedding the encryption number, all characters are output in "Mincho". Note that the capacity of one piece of document information is often not constant, but here, for simplicity, it is assumed to be constant, and the unit is 1. Therefore, dx
Is larger than 1, the next document information is indexed.

FIG. 6 shows that the third storage means D3 () uses "ha" as the search information, the fourth storage means D4 () uses "Gothic" as the replacement information, and AX and BX use the code for generating the encryption number. This shows a state in which the data α and β are stored and the number of copies counter BC stores the number of issued copies HN. "Ha" stored as search information is extracted from the document information,
Depending on the digit value of the corresponding encryption number, it is determined whether to output "wa" in "Gothic" or "Mincho" as it is. The encryption number may be any value as long as it is different for each document to be output. For simplicity, here, the encryption number of the n-th (n = 0) -th document is α + n × β. The fonts required in this example are “Mincho” as the predetermined font and “Ha” in the font “Gothic” prepared as replacement information.

FIG. 7 is a flowchart (hereinafter referred to as "flow shown in FIG. 7") showing the processing procedure of the encryption number embedding system according to the present embodiment. Hereinafter, FIG.
Will be described with reference to the document shown in FIG. 4 as an example. Preparation step: Document information is DAH (), DAZf ()
, Search information “ha” is D3 (), replacement information “Gothic” is D4 (), and the number of issued copies HN is a copy counter BC.
Are respectively stored. Further, data α and β for generating an encryption number are stored in AX and BX, respectively.

Step A1: The initial value α (= 3) of the encryption number stored in AX is stored in ANG. Therefore, the encryption number to be embedded in the first output document is [0
0011]. Step A2: Store 0 in the address counter dx of the digit counter ax, DAH (dx) and DAZf (dx). Step A3: DAH (d
It is determined whether or not x) is END1. If it is END1, that is, if the end code has been output from the first storage means, the process proceeds to step A12, and if it is not END1, the process proceeds to step A4. In this example, when dx <131, the process proceeds to step A4, and when dx = 131, END
1 is output, and the process proceeds to Step A12. Step A4: The character code DAH (dx) is output via the output processing unit OP.

Step A5: It is determined whether or not the character code DAH (dx) at the address dx is the same as the search information D3 (). If it is determined that they are not the same, the process proceeds to step A9, and if it is determined that they are the same, the process proceeds to step A6.
In this example, dx is 16, 49, 55, 102, 115
At this time, the output of DAH (dx) matches the search information "ha" stored in D3 (), so that the character code "ha"
Is extracted, and the process proceeds to step A6. If dx is any other value, the process proceeds to step A9.

Step A6: ANG (ax) is ax (a) from the lower order of the second storage means ANG for storing the encryption number.
(x = 0) represents the bit output. As will be described later, ax is initially 0 (0 is stored in step A2), and 1 is added each time "ha" is extracted. Therefore, when dx = 16, 0, and when dx = 49, Is 1,
.., Dx = 115 when it is 115. Therefore, if the encryption number is [00011], ANG (0),
ANG (1) outputs “1”, and ANG (2), AN
G (3) and ANG (4) output “0”. Similarly, if the encryption number is [01100], ANG
(0), ANG (1) and ANG (4) output “0”, and ANG (2) and ANG (3) output “1”. This value is determined. If "1", the process proceeds to step A7, and if "0", the process proceeds to step A8.

Step A7: D4 () is output. That is, in step A3, it is determined that the DAH (dx) is not an END code, and in step A5, it is determined that "ha". When the value of the ax digit of ANG is "1", the predetermined font "" Morning body ”(DAZf (dx))
The replacement information “Gothic” stored in D4 () is output (the attribute information is replaced), and the process proceeds to step A10. Step A8: DAZf (dx) is output. In other words, when the DAH (dx) is determined not to be an END code in step A3, it is determined to be “wa” in step A5, and when the value of the ax digit of the encryption number is “0”, the font is a predetermined font. “Mincho” (DAZf (dx)) is output as it is (the attribute information is not replaced), and the process proceeds to step A10.

Step A9: At step A3, it is determined that DAH (dx) is not an END code.
If it is determined in step 5 that the character is other than "wa", the predetermined font "Mincho" (DAZf (dx)) is output as it is (the attribute information is not replaced), and the process proceeds to step A11. move on. Step A10: 1 is added to the digit counter ax.
The digit counter ax is updated in step A5 by DAH (d
This is performed only when x) is determined to be “ha”,
If the value is other than "ha", ax does not change. Step A11: 1 is added to the address counter dx of DAH () and DAZf (), and the process returns to step A3.
The processing in steps A2 to A11 is performed in step A3.
Therefore, the processing is performed until the END code is detected, so that all document information is targeted.

Step A12: When all document information is processed, END1 is detected in step A3, and 1 is subtracted from the copy counter BC. Step A13: The number of copies HN is initially stored in the copy counter BC. When the BC is updated to 0 by updating the BC in step A12, the process of embedding the cipher numbers in all documents and outputting the same is performed. This is the end of the process, and the process is completed in step A15. And BC
If ≠ 0, the process proceeds to step A14. Step A14: The next encryption number is generated. The first encryption number is [00011] and the next encryption number is β
(= 9) is repeatedly added, so that the embedded encryption numbers are [00011], [01100], and [101].
01],... Thereafter, the process returns to step A2 to output the next document in which the new encryption number is embedded. If the encryption number is [00011], dx = 16,
For “ha” of 49, in the case of [01100], dx
In the case of [10101], the character DAH (dx) and its attribute D4 () are output for “ha” of dx = 16, 55, 115 for “ha” of = 55, 102. The characters DAH (dx) and DAZf (dx) are output for the other dx.

FIG. 8 is a diagram showing an example of a document output at the 0th time in which the encryption number is embedded in the document shown in FIG. 4 by the encryption number embedding system according to the present embodiment. As a result of the encryption number being embedded in this way, the document output at the 0th time (encryption number = [00011]) is as shown in the figure. When this document or a copy is collected, the document information is arranged in order, and "・ ・ は ・ ・ ・ ・ ・ ・
・ ・ ・ ・ ・ ・ ・ ・ ・ ・ ・ ・ ・ ・ (However, the first and second “ha” from the left are Gothic, and the third to fifth “ha” are Mincho body). By rearranging only "ha" in reverse,
"Hahahahaha" and the code number is [0001
1] (however, the first and second “ha” from the right are Gothic, and the third to fifth “ha” are Mincho).

Embodiment 2 In a second embodiment of the encryption number embedding system according to the present invention, a plurality of search information are prepared, and these search information are made to correspond to the digit values of the encryption number. Document information that matches the search information is output in a predetermined font or a replacement font. For example, search information
"N", "u", "ki", "o", "ha".
"N" is the fourth digit of the encryption number, "u" is the third number of the encryption number
.., “Ha” correspond to the 0th digit of the encryption number, and the binary encryption number [0000
1],... Are embedded, the encryption number [0000]
In the document [1], all “ha” are output in a replacement font, and other characters “n”, “u”, “ki”, and “o” are output in a predetermined font. In the document with the encryption number [00010], all “O” are replaced fonts and other characters “N”,
“U”, “ki”, and “ha” are output in a predetermined font.
In the document with the encryption number [00011], all “O” and “Ha” are replaced fonts, and other characters “N”, “U”,
"K" is output in a predetermined font. In this way, by associating the search information with the digit value of the encryption number, the encryption number can be embedded in the document.

FIG. 9 is a diagram for explaining the principle of embedding, for example, an encryption number [00011] in a document in this embodiment. FIG. 10 is a block diagram illustrating the configuration of the encryption number embedding system according to the present embodiment. 11, 12, and 13 are diagrams illustrating an example of a document on which encryption embedding is performed according to the present embodiment, and a state in which each data is stored in each storage unit at that time. In the present embodiment, characters (“ha”, “o”, “ki”, “u”, “u”) appearing in a document (FIG. 11) output in “Mincho” (predetermined font)
The case of embedding an encryption number for “n” will be described. As shown in FIG. 9, the method of embedding the encryption number is to associate each target character, that is, the search information, with the digit of the encryption number in the storage order, and when the search information is extracted in the document, The digit value of the encryption number to be executed is "1"
If the attribute stored in DAZf (dx) is D
4 (ax),
If it is "0", it is output in DAZf (dx), that is, in a predetermined font. Of course, the above 5
All characters other than characters are output in a predetermined font.

As shown in FIG. 11, the document has 22 (“ha”, “o”, “ki”, “u”, “n”) and 150
(= 172-22) other characters (indicated by “•” in FIG. 11), and END1
Is stored. FIG. 12 shows a state in which, out of the document information shown in FIG. 11, document information that matches the search information is stored in the first storage means DAH (dx) and DAZf (dx). Character code is DAH (dx)
Characters are stored in the address dx of 0 to 171 and their attribute information (here, “Mincho”) is stored in the address dx of DAZf (dx) in the range of 0 to 171 corresponding to the character code. I have. The address dx = 172 has E
The ND1 code is stored.

FIG. 13 shows characters ("ha", "o", "o") in D3 (ax) as search information for embedding an encryption number.
"K", "U", "N") indicate a state stored in D4 (ax) corresponding to the search information as replacement information for replacing a predetermined font. . Here, "ha", "u" and "gothic",
Although “O”, “K”, “N” and “Maru Gothic” are associated, all search information may be associated with the same font or may be associated with different items one by one. .
Also, as in FIG. 6, a state is shown in which α and β are stored in the AX and BX as data for generating the encryption number, and the number of issued copies HN is stored in the copy counter BC. .

FIG. 14 is a flowchart showing a processing procedure of the encryption number embedding system according to this embodiment.
Note that steps having the same processing content in the flowchart are denoted by the same step numbers, and detailed description thereof is omitted (the same applies hereinafter). Hereinafter, according to FIG.
The flow of processing will be described using the document shown in FIG. 11 as an example. Note that the characters used as search information are ("wa", "o",
"", "U", "N"), the fonts to be prepared in addition to the specified font, Mincho,
"H", "U" Gothic, "O", "K", "N"
Only the round Gothic body is required. Here, differences and features of the flow shown in FIG. 14 (this flow) from the flow shown in FIG. 7 are as follows. Step A2: In this flow, 0 → ax is deleted (step A2-0). Step A5: In this flow, delete, step A5-
Added 0 to A5-3. Step A7: In this flow, D4 () is changed to D4 (a
x) (Step A7-0). Step A10: Deleted in this flow.

Particularly, in this flow, the digit counter a
The use of x is different, and the search information stored in D3 () is used as a counter for sequentially instructing, but the point that ANG (ax) outputs the digit value of the encryption number is the same. . After outputting DAH (dx) in step A4, in order to index the search information stored in D3 (ax), ax is first cleared in step A5-0. Then, steps A5-1 and A5-2
And D3 (ax) becomes END2 (where D3 (ax)
Indicating the end of the search information stored in),
Alternatively, it is determined whether or not the output value of DAH (dx) matches D3 (ax). The output of D3 (ax) is E
ND2 indicates that there is no search information that matches the document information, and the process proceeds to step A9. DAH (dx)
Is equal to the output of D3 (ax), the process proceeds to step A6. If the output of D3 (ax) does not match the output of END2 or DAH (dx), the process proceeds to step A5-3 to determine the next search information.
The digit counter ax is updated, and the process returns to step A5-1. Therefore, the process proceeds to step A6 only when the document information is “ha (0)”, “o (1)”, “ki (2)”, “u (3)”, “n (4)”. (The number in parentheses indicates the value of ax at that time). Step A6
Then, the digit value of the encryption number is determined, and the attribute to be output is determined. Assuming that the encryption number is [01011], the 0th, 1st, and 3rd digits from the least significant digit are “1”, and D4 ( ax)
However, the second and fourth digits are 0, and the document information “ki”,
DAZf (dx) is output as the attribute of “n”.

That is, "ha" and "u" are output in Gothic style, "O" is output in round Gothic style, and all other document information is output in Mincho style. Where 2
The document (encryption number = [10101]) to be output
The processing procedure will be described as an example. 1) Execute steps A1 and A2-0 and proceed to step A3. 2) After executing steps A3, A4, A5-0, repeat steps A5-1, A5-2, A5-3. If END2 is detected in step A5-1, step A9
And outputs DAZf (dx), updates dx, and returns to step A3. These processes are repeated for dx = 0 to 7. During this time, DAH (dx), DAZf (d
x) is output. 3) When dx = 8 and the process returns to step A3,
After executing steps A4 and A5-0, step A5-
1, A5-2 and A5-3 are repeated in the same manner, but when ax becomes 1, the output ("O") of DAH (dx)
The outputs of D3 (ax) match, and in step A5-2, "Y
ES ”, and the process proceeds to Step A6. 4) In step A6, ANG (ax) is determined, and since the first digit of the encryption number is 0, step A8 is executed, and DAZf (dx), that is, "Minchotai" is output. . If the eleventh digit of the encryption number is 1, step A7-0 is executed, and D4 (ax), that is, "round Gothic" is output. Step A11
Then, dx is updated, and the process returns to step A3.

5) When dx = 9-15, step A
When returning to 3, the same operation as when dx = 1 is repeated, and in step A4, DAH (dx) and step A9
In step A11, DAZf (dx) is output, and in step A11, dAZf (dx) is output.
After updating x, the process returns to step A3. 6) When dx = 16 and the process returns to step A3,
After executing steps A4 and A5-0, step A5-
1, A5-2 and A5-3 are executed in the same manner, but when ax is 0, the output ("wa") of DAH (dx) and D3 (a
The outputs of x) match, and in step A5-2, YES is determined, and the flow proceeds to step A6. 7) In step A6, ANG (ax) is determined, and since the 0th digit of the encryption number is 1, step A7-0 is executed.
Is executed, and D4 (ax), that is, “Gothic” is output. If the 0th digit of the encryption number is 0, step A8 is executed, and DAZf (dx), that is, "Mincho" is output. In step A11,
dx is updated, and the process returns to step A3.

FIG. 15 shows a document (cipher number =
[10101]). As above,
The encryption number can be embedded in the document, for example,
If documents are output in Mincho and Gothic styles, they will stand out and give a sense of incongruity. Next, a method for solving such a problem will be described.

Embodiment 3 The first method is a method of changing the character itself instead of changing the font of the character. For example, "... in technology ..." and "... in technology ..." have exactly the same meaning. In the Japanese language, both of these expressions are commonly used. Therefore, the reader does not care about the difference between "at" and "at". There are other such combinations of "at" and "at", and these can be used to embed an encryption number.

FIG. 16 is a diagram showing an example of such a combination. FIG. 17 shows an example of a document in which an encryption number generated by using the method of this embodiment is embedded. Here, the encryption number is [00011], and FIG.
(A) illustrates the invention of the first embodiment, and FIG.
Is an example in which an encryption number is embedded using the invention of the second embodiment. Since both are output in the same font,
Discomfort is reduced. In FIG. 17A, “word” and “i” are mixed, but FIG.
The characters are unified (they are not mixed), making it hard for third parties to notice.

FIG. 18 is a flowchart showing the processing procedure of the example shown in FIG. 17A, and FIG.
FIG. 7 is a flowchart illustrating a processing procedure of the example illustrated in FIG. The flow shown in FIG. 18 shows the case where both the search information and the replacement information are one character. The flow shown in FIG. 19 shows a case where the search information and the replacement information have the same number of characters, and as shown in the upper right of FIG. is there. In these processing procedures, the flow shown in FIG.
The difference from the flow shown in FIG. 13 is that, of the document information, the attribute information DAZf (dx) is output as it is without being changed, and what is changed is the character DAH (dx).

The processing procedure will be described below with reference to the flowchart shown in FIG. A list of search information and replacement information used here is shown in the upper right of the drawing. Each of the combinations of the search information and the replacement information has the same number of characters. The first character of search information and replacement information is D3 (ax) and D4 (ax), and the next character is D
31 (ax) and D41 (ax). When the number of characters is 1, the end code END3 is stored in D31 (ax), but D4 (ax) is empty. In the processing procedure, a match between the output DAH (dx) of the document information and the output of D3 (ax), which is the first character of the search information, is obtained by changing ax (ax = 0 to 5). . When the output of D3 (ax) becomes END2, there is no match, so DAH (d)
x) and DAZf (dx) are output (the former in step A4-2, and the latter in step A789).

When the document information DAH (dx) matches the one-character search information (when END3 is detected in the second character), the process proceeds to step A6, and the output is determined based on the digit value of the encryption number. If the digit value of the encryption number is 1, A
The character code is output in 4-4, and the attribute is output in A789. Document information DAH (dx) and DAH (dx + 1)
Is matched with the two-character search information, step A6-1
To determine the output according to the digit value of the encryption number. When the digit value of the encryption number is 1, the character code of the first character is output in A4-3, the attribute of the first character is output in A7-2, and after updating dx, the second character is output in steps A7-4 and A789. To output. If the character information DAH (dx) matches the first character of the two-character search information, but the DAH (dx + 1) does not match the second character of the two-character search information, the process returns to step A5-1 and the next A similar process is performed for the search information. this is,
For example, the case where the same character is present in the second character and the first character such as “substance” and “body type” in the search information is considered.

The flow shown in FIG. 19 is based on the assumption that both the search information and the replacement information have two or less characters. Of course, the case of three or more characters is also predicted. Subsequent to “YES”, the process of determining the third character may be added in the same manner as the second character.

Fourth Embodiment As described above, the search information and the replacement information have the same number of characters. However, as shown in the lower part of FIG. 16, the numbers of both characters may be different. Even in such a case, the processing procedure can be slightly complicated. However, for example, there is a document "... at: conference room ...", and in order to embed an encryption number, "..." is replaced by "...", and "...: conference room ...""
It is considered abnormal rather than uncomfortable. In order to solve such a problem, it is necessary to perform processing after judging the character string before and after, instead of processing the character alone, such as “O” and “O”.

In this case, by processing with a combination of “at” and “at”, it is possible to create a document that does not cause any discomfort. The same applies to "time" and "time".
It can be solved by using a combination of In this example, “3:20” is changed to “3:20”.
Minutes and time to watch are prevented from being replaced by time to watch.
If this is used conjunctively, it can be resolved if it can be replaced with "time", but parsing is indispensable to find the verb's adnominal form and conjunctive, and if not possible, However, it is expected that the processing time will increase significantly. For this reason, the problem is solved by adding a character, such as "ru-time", which indicates the union form of the verb before "hour". Since "time" follows the verb noun form, the characters added before it are "u",
It may be "ku", "su", ..., "bu". In addition, in order to limit the case where “time” is used as a conjunction, “,” or “ni,” is added later, so that “time” that follows the union form of the verb is Can be limited.

FIG. 20 shows an example of such search information and replacement information. FIG. 21 shows the storage state of these pieces of information with a part omitted from the example of FIG. The digit setting indicates which digit value of the encryption number is to be referred to. In the examples so far, the order of storage of the search information and the like has been used as a key. The same kind as the above is provided to be regarded as the same group. Note that D5 (13) and D5 (1
4) and D5 (15), the same digit setting is performed, but the character strings with low appearance frequency can be covered by grouping them.

FIG. 22 is a flowchart showing only the part of embedding the encryption number in one document using the data of FIG. FIG. 23 shows examples of documents before and after embedding an encryption number according to the present embodiment. By performing processing according to the procedure of the flow shown in FIG. 22, FIG.
As shown in FIG. 3, it becomes possible to embed an encryption number by changing a character string (however, the encryption number is changed to [10001]
1]).

Embodiment 5 The second method is a method of partially changing the font of a character. For example, by preparing special fonts for characters used in many documents, such as some hiragana, numbers, and symbols (of course, they may be kanji), it is possible to use “Mincho” and “Gothic” fonts. The method is not so conspicuous as “ha”, but can be a method that is hardly conspicuous and can be reliably identified. FIG. 24 is a diagram showing an example. FIG. 24B shows “Ha” in Mincho and Gothic fonts, but these differences are noticeable depending on the size of the characters. For this reason,
When the predetermined font is the Mincho font, as shown in (A) and (C), a similar font Mincho font A in which the Mincho font is used as a base and some of its pixels are changed. Alternatively, Mincho C may be used as replacement information. Mincho A is a cut of part of Mincho font B (in the ellipse), and Mincho C is a cut of font B of Mincho in which pixels are added (a part of the ellipse) It is.

Embodiment 6 Further, in one font, if a part of a pixel is cut and added to another part, the effect is improved.
FIG. 25 is a diagram showing an example. If it is assumed that a copy copied from the distributed one is collected, the state of the copying machine at that time (original performance, compatibility with toner and ink, paper for copying, printing of power supply voltage, temperature, humidity, etc.) Depending on the condition, the document may be thicker or thinner than the original, resulting in the Mincho A in FIG.
If it is limited to one such as C, it may be difficult to decode in some cases. In order to solve such a problem, as shown in FIG. 25, one font is changed by both methods, that is, a method of deleting a part and adding a part. By doing so, it is possible to cope with which state the copying machine has at that time.

Embodiment 7 Embodiment 7 of the present invention sets a plurality of areas in a document,
Each set area is made to correspond to the digit of the encryption number, and the character is output in a predetermined font or a replacement font according to the digit value. For example, 5 areas 0
4 are set in the document. 2 different for each distribution destination
.., Embedded in the document with the encryption number [00001], all the characters appearing in the area 0 are output in the replacement font, and the characters in the other areas 1 to 4 are output. All appearing characters are output in a predetermined font. In the document with the encryption number [00010], all the characters appearing in the area 1 are output in the replacement font, and the characters appearing in the other areas 0 and 2 to 4 are all output in the predetermined font. The document with the encryption number [00011]
All characters appearing in areas 0 and 1 are output in a replacement font, and all characters appearing in other areas 2 to 4 are output in a predetermined font. In this way, by associating the set area with the digit value of the encryption number, the encryption number can be embedded in the document.

FIG. 26 shows the encryption number [0001]
1] is a diagram showing the principle of embedding [1] in a document. Of course, characters outside the set area are output in a predetermined font. In the above description, the digit values “1” and “0” of the encryption number may be reversed, and each digit of the encryption number corresponds to the least significant digit. May be used. FIG. 27 is a block diagram illustrating the configuration of the encryption number embedding system according to the present embodiment.

FIG. 28, FIG. 29, and FIG. 30 are diagrams showing an example of a document for which encryption embedding is performed according to the present embodiment, and a state where each data is stored in each storage unit at that time.
Hereinafter, in a document output in “Mincho” (predetermined font) (FIG. 28), a case where an encryption number is embedded in a set area based on replacement information stored corresponding to the area. Will be described. As shown in FIG. 26, the method of embedding the encryption number is such that each set area corresponds to the digit of the encryption number, and when the document information of the area is extracted, the digit value of the corresponding encryption number is “1”. ”, The attribute stored in DAZf (dx) is changed to D4
Replace with the replacement information stored in (ax), "0"
In this case, DAZf (dx), that is, output in a predetermined font. Of course, all characters other than the set area are output in a predetermined font. FIG.
As shown in FIG. 8, the document consists of 407 characters,
After the last character, END1 is stored.

FIG. 29 shows a state in which the document information of FIG. 28 is stored in the first storage means DAH (dx) and DAZf (dx). Character code is D
Characters are stored at addresses 0 to 406 of the address dx of AH (dx), and their attributes (here, “Mincho”) are stored in DAZf (dx) in correspondence with the character codes. END1 is stored at the address dx = 407. FIG. 30 shows a state in which the set area boundary information and replacement information which is information for replacing a predetermined font are stored. As the area boundary information, the start address of the area is stored in rs (ax), and the address next to the end of the area is stored in re (ax). Here, areas 0, 3, and 4 correspond to “Gothic” and areas 1 and 2 correspond to “Round Gothic”, but all areas may correspond to the same font or 1 Different fonts may correspond to each other.
As in FIG. 6, α and β are stored in AX and BX as data for generating an encryption number, and a copy counter B
C shows a state where the number of issued copies HN is stored.

FIG. 31 is a flowchart showing a processing procedure of the encryption number embedding system according to the present embodiment.
Hereinafter, the processing of this embodiment will be described with reference to the flowchart shown in FIG. In addition to the Mincho font, which is a predetermined font, Gothic fonts and round Gothic fonts are required for all characters. The differences between the flow shown in FIG. 31 (this flow) and the flow shown in FIG. 7 and the characteristic points are as follows. 1) Step A2; 0 → RK is added in this flow (Step A2-0) 2) Step A5; Deleted in this flow, Step A5
−0 to A5-4 are added. 3) Step A7; In this flow, D4 () is changed to D4 (a
Change to x) (Step A7-0) 4) Step A9; delete in this flow 5) Step A10; delete in this flow

In the flowchart shown in FIG. 31,
The usage of the digit count ax is different, and the area is used as a counter for sequentially indicating the area.
(Ax) is the same in that the digit value of the encryption number is output. When the flag RK is used and RK = “1”,
A case where dx indicates an inside of any set area is indicated, and a value of “0” indicates a case where the outside of the area is indicated. Steps A5-0 and A5-1 determine whether the area is inside or outside the area and store the result in the flag RK. That is, if dx indicates outside the area, step A
5-0, A5-1 determines "NO", and as described later, in such a case, RK = 0, so that
Also in step A5-2, "NO" is determined, and the execution of step A8 is repeated. dx = 9 (0), 11
1 (1), 200 (2), 259 (3), 333 (4)
At step A5-0, YES is determined. The number in parentheses indicates the value of ax at that time.

In step A5-4, the flag RK is set to "1".
In step A6, the digit value of the encryption number is determined, and the attribute to be output is determined. For example, if the encryption number is [0
1011], the 0th digit, the 1st digit, and the 3rd digit from the least significant digit
The digit is “1”, the attribute of the document information in areas 0, 1, and 3 is D4 (ax), the second and fourth digits are “0”, and the document in area 2 and 4 DAZf as an attribute of information
(Dx) is output. That is, in areas 0, 1, and 3, gothic is output, in areas 2 and 4, round gothic is output, and all other document information is output in Mincho.

FIG. 32 is a view showing a document in which an encryption number is embedded in the example of the document shown in FIG. 28 by the encryption number embedding system according to the present embodiment. Although a detailed description is omitted, a method in which a block is made into one region, or a method in which each page is made into one region if the number of pages is large, can be considered. FIG. 33 is a diagram illustrating an example of a document in which each of one or a plurality of selected blocks is set as one region.
Steps A4, A7, A7-0, A8, and A4 in the flowcharts shown in FIGS.
In A9, the expression << output: xx >> indicates that, for example, if the present apparatus is connected to a printing apparatus via a communication line, xx is sequentially transmitted as printing data. Although it is shown, it is conceivable that after transmission of xx, it takes time to perform processing until transmission of the next xx.

That is, when the communication line is used for a purpose other than this purpose (another device, another application, or the like), it is assumed that the time for occupying the line becomes longer. In such a case, a buffer for temporarily storing the document in which the encryption number is embedded may be provided, and transmitted each time one document is generated. In that case,
The buffer BF (d whose address is controlled by dx
x) is provided. Step A4: DAH (dx) → BF (dx) Step A7: D4 () → BF (dx) Step A7-0: D4 (ax) → BF (dx) Step A8: DAZf (dx) → BF (dx) Step A9: Each step is changed as in DAZf (dx) → BF (dx), and BF (x) may be transmitted before step A12 (x = 0 to dx−
1).

Embodiment 8 Embodiment 8 of the present invention relates to an encryption number. For example, in a target document, when embedding an encryption number in the character "ha", if the number of "ha" included in the document is larger than the number of digits of the encryption number, the remaining "ha"
It relates to a device in which the same encryption number is repeatedly embedded. For this purpose, when the value of ax indicating the digit of the encryption number exceeds the number of digits, the value may be returned to 0.

FIG. 34 is a flowchart showing a part of the processing procedure of the encryption number embedding system according to this embodiment. That is, as shown in the flow of FIG.
Steps A10-0 and A10-1 may be inserted between steps A10 and A11 in the flow shown in FIG. Thus, for example, if the number of digits in the storage unit of the encryption number is 5 (ANGDG = 5), when the value of ax becomes 5, if it is cleared, the same applies to the subsequent “wa”. , The same encryption number is embedded.

FIG. 35 is a diagram showing an example in which two identical cipher numbers and one least significant digit of the cipher number are embedded in eleven "ha" s. FIG. 36 shows the extracted “ha”
Are arranged in reverse order of the extraction order, and at least two same encryption numbers are embedded.

Embodiment 9 Embodiment 9 of the present invention also relates to an encryption number. An example
For example, if the encryption number is embedded in one type of character or several
If the key character is copied,
If only part of the document is recovered or
It is possible that the number cannot be specified. like this
To solve multiple problems, one document contains multiple
Provides a way to embed issues. This embodiment is the same as the above embodiment.
1 is based. That is, a plurality of search information
(Character) and replacement information (attribute, here font)
(Ax) and D4 (ax).
In response, a plurality of different encryption numbers can be generated
The initial value and the addition / subtraction are stored in AX () and BX ().
Keep it. There are various methods for generating an encryption number.
Now, one document contains three different types of document information.
It is assumed that an encryption number is embedded. In FIG.
The method of generating the encryption number described in this example has been described. Sand
That is, in order to generate three different encryption numbers 0 to 2,
Use initial values α0 to α2, and different addition and subtraction factors β0 to β2
In this example, the number of adjustments is adjusted each time the document changes.
You.

FIG. 38 shows a situation where these data are stored. Here, az indicates which of a plurality of sets of encryption number / search information / replacement information is selected, and the selected encryption number, search information, and replacement information change depending on the value of az. . ax (az) is
With a storage device that indexes the digits of each encryption number, for example,
When ax (az) is k, the document information DAH (dx) is searched using the search information D3 (az), and the matching k-th document information is referred to the k-th digit from the lower end of the encryption number az, and its attribute It indicates whether to output the information as it is or to replace it with a round Gothic type. For example, in FIG.
Assuming that az = 0, ax (0) = 3, and an encryption number are embedded in the document 2, the character "ha" is searched in the document 2, and
The encryption number 0 is embedded in the second “ha”. That is, the third digit of the encryption number 0 is referred to, and the attribute of “ha” is determined depending on whether the value is 1 or 0. In this case, it is 1 (fourth from the lowest), and “Gothic” is output. In addition,
ANG (az, ax (az)) represents the output of the ax (az) digit from the least significant digit of the encryption number az. Of course, the encryption number of each document needs to be different in the range of encryption number 0, encryption number 1, and encryption number 2. For example, encryption number 1 of document 1 and encryption number 0 of document 2 are required.
There is no problem even if they are the same.

FIG. 39 is a flowchart showing a processing procedure for a portion where an encryption number is embedded. The output DAH (dx) of the document information is compared with D3 (az), and if there is a match, DAZf (d
It is determined whether to output x) or D4 (az). In this example, there are three encryption numbers, and which encryption number is used is determined by the value of az.

Embodiment 10 Embodiment 10 of the present invention relates to a method of updating an encryption number. When a new encryption number is generated, a predetermined odd number is added to or subtracted from the previous encryption number, and a sum or a sum is calculated. The difference is used as a new encryption number. For example, if the number of digits in the storage unit for the binary number is 8 digits, 4 is added to the number, and the number exceeding the 8 digits is ignored, and the encryption number is sequentially generated. Are 64, and the 65th code has the same encryption number. That is, the lower two digits do not function at all and operate as if the number of digits of the encryption number is six. If we add an odd number instead of an even number 4, we get 25
Six types of encryption numbers can be generated (any odd number may be used).

(Certification) The number of digits of the encryption number is set to 8 digits,
If the value is s and the added odd number is (2y + 1), the n-th
The encryption number is s + (2y + 1) (n-1). That
The encryption number after α is s + (2y + 1) (n-1 + α)
And this value is the same as the n-th encryption number for the first time.
Let's say (N + α) th encryption number is obtained
Assuming that overflow has occurred k times before, s + (2
y + 1) (n-1 + α) = s + (2y + 1) (n-1)
+2 ⁸ After the transfer of k, α (2y + 1) = 2 ⁸ Since k (2y + 1) is an odd number, α = 2 ⁸ is p
However, α becomes the smallest when p = 1,
And α = 2 ⁸ And the same encryption at the (n + 256) th
A number is generated. That is, n, (n + 1),.
· The (n + 255) th encryption number is different
It becomes Therefore, 256 encryption numbers can be generated.
You. Here, y, s, n, k, and p are all integers.

Embodiment 11 Embodiment 11 of the present invention relates to a method for updating a plurality of encryption numbers. When embedding a plurality of encryption numbers in a document, that number of encryption numbers is required.However, instead of generating the required number of encryption numbers, increase the number of digits involved in generating and storing the encryption numbers. In advance, it is divided into a plurality of pieces. For example, when generating three 8-digit encryption numbers, both for the initial value and for the
A 24-digit register is prepared, addition and subtraction are performed, and the obtained result may be divided by 8 digits.

FIG. 40 is a diagram showing an example in which three 8-digit encryption numbers are generated simultaneously. In FIG. 40, if the encryption number is 8 digits and the addition / subtraction B is an odd number, the third encryption number will be different from each other up to 256. For the cipher number,
There is no guarantee. However, for example,
With 0B46FBH (hexadecimal notation), 200 or more of the three encryption numbers can be secured. By using such addition and subtraction, different encryption numbers can be efficiently generated and embedded in a document.

Embodiments 12 to 15 Embodiments 12 to 15 of the present invention relate to the storage and reproduction of the documents created in the first, second and seventh embodiments. Such storage of confidential documents is not limited to the conventional purpose of preservation, and should be saved as a tool to identify the distribution destination of the document when a copy etc. is recovered at a later date. Need to be kept.

The present invention makes this possible, and a document without an encryption number embedded therein (hereinafter referred to as an original document)
When saving a document, the replacement information, encryption number generation information, search information, area boundary information (area boundary information), etc. are also saved so that the same document as when the document with the encryption number embedded is output. Is what you do. Search information is
Only in the first and second embodiments, the area boundary information is stored only in the seventh embodiment. Although the original document and the above information other than the original document can be stored separately,
Since it is indispensable information, if it is stored at the same time, it is possible to prevent forgetting to save, and the efficiency will be improved.

Embodiments 13 to 15 In Embodiments 13 to 15 of the present invention, an encryption number is input.
Means to decrypt the code number decrypted from the recovered copy
No. related to those that play the document by entering
I do. Other than the means for inputting the encryption number,
We can utilize means. FIG. 45 shows an example of the second embodiment.
And enter the encryption number decrypted from the recovered copy
And output the document with that encryption number in a distributed state
It is a flowchart figure which shows a processing procedure. Example 1,
2 and 7 are, of course, different,
It can be understood by comparing the flows shown in FIGS. 7, 14, and 31.
Thus, the processing procedure is very similar. Therefore,
Have these together, and for each document, for example, search information
Information, replacement information, area boundary information, and encryption number generation
A method of changing the usage information is also conceivable. for that purpose,
It is necessary to provide some kind of switch and determine which method to use.
A mechanism that can do this is needed. How to remember it
The storage means DW is provided as shown in FIG.
In the flow shown in FIG. 14 and FIG.
What is necessary is just to make it a flow. That is, the person who embeds the encryption number
As a method, any of Example 1, Example 2, and Example 3
Cryptography to make the method selectable by the operator
Enter the method of embedding the number and store it in the storage unit DW
Remember. In this example, the first embodiment, the second embodiment, or
When the method of the third embodiment is selected, 1 is stored in the storage unit DW,
It is assumed that 2 or 3 is stored, respectively. this
Various methods can be selected according to the operator's intention.
The structure of the cryptographic number itself
Can be made difficult for a third party to understand.

FIGS. 41 and 42 are diagrams showing examples of the flowchart. That is, by determining the DW, necessary information (the distinction between search information and area boundary information) may be selected. Also, if you save the value of DW at the same time,
This is effective both when reading the document from the external storage device and when reproducing the document. FIG. 43 is a flowchart showing a processing procedure when necessary information is stored in an external storage device, and FIG. 44 is a flowchart showing a processing procedure when reading necessary information from the external storage device.

The difference from the flow shown in FIG. 14 is that there is no preparation step, step A1 is replaced with step A1-0, and steps A12 to A14 are omitted. The preparation step is realized by reading data from the external storage device in the flow shown in FIG. 44.
There is an input step A1-0, and steps A12 to A14 are omitted to limit the output to a necessary document. Therefore, the processing procedure for reproduction can be shared, except that the entrance is only partially different.

Embodiment 16 Embodiment 16 of the present invention shows a method for reducing the overall resources by arranging the above-described encryption number embedding system in a document creating apparatus. That is, many means including the CPU and the first storage means can be shared with various means used in the document creation apparatus, and all processing can be realized by a program, so that almost all costs are reduced. There is a feature that can be configured without raising. For example, the configurations for realizing the first, second, and seventh embodiments are shown in FIGS. 3, 10, and 27. These configurations are basically the same as the configurations of the personal computer and the word processor, and store programs. This can be realized with almost the same configuration except that the area for performing the operation is increased and the storage unit is slightly increased.

Embodiment 17 As another arrangement method, the present system can be arranged in a printing apparatus. Also in this case, similarly, many means can be shared with various means used in the printing apparatus, which hardly causes a cost increase. Furthermore, since the document is transmitted from the document creation device to the printing device only once by being placed in the printing device, there is a merit that congestion of the line is reduced. For example, "ha",
In addition to using kana characters and numbers having a high frequency of appearance such as "no", "wo", "to", and "ru" as search information, replacement information is prepared using the invention of the fifth embodiment, If the encryption number is embedded by using the invention of the second embodiment, as is currently performed, the document in which the encryption number is embedded on the printing apparatus side only needs to be transmitted from the document creating apparatus to the printing apparatus. Will be printed.

Embodiment 18 Embodiment 18 of the present invention is intended to make the operation of the encryption number embedding system smoother. Some printed or printed documents should be kept confidential and some should not. It is meaningless to activate the cryptographic number embedding system at the time of the latter output or printing.

In the invention of the sixteenth embodiment, the switch is linked to the program on the document creation device side, for example, by clicking a predetermined icon, or in the invention of the seventeenth embodiment, a switch is provided on the printing device side, What is necessary is just to operate by the on / off. When the apparatus is operated, the processing time is naturally longer than when the apparatus is not operated. However, the provision of the switch means solves such a problem.

Nineteenth Embodiment A nineteenth embodiment of the present invention provides an encryption number embedding system,
By making it seemingly complicated, if you try to copy the key part down face down, it is as if you have something to give the hint of "down here"
This is so that the embedded encryption number is not noticed. Also, when binding printed documents, it is necessary to bind the ones determined for each distribution destination. In the case of dropping, for example, a method of binding while considering these numbers and pages becomes possible.

Embodiments 20 to 23 In the embodiments 20 to 23 of the present invention, when a document in which an encryption number is embedded is recovered, the encryption number is decrypted from the recovered material and the distribution destination is specified. It is related to a management sheet to be. The management sheet only needs to be output so that at least the distribution destination number corresponds to the encryption number embedded therein.

FIG. 46 is a diagram showing an example of this management sheet. The figure shows an example in which three encryption numbers are embedded, but the number of encryption numbers may be one. In addition, the distribution shelf may be left empty, and after printing this sheet, the department name, name, etc. may be entered by hand, or the distribution number and distribution list may be stored separately. It may be printed in this column. If such a management sheet is created and stored at the same time as the distribution document in which the encryption number is embedded, it becomes a very effective tool when the distribution document is collected later. The output is not performed by the operator, but is output together with the output of the distribution document, thereby preventing forgetting to output. A means for generating a distribution number and a means for creating a management sheet are provided. Initial values and data for updating are set in the preparation stage, and the distribution number is written in the management sheet every time one document is output. It is only necessary to update the distribution number and finally output the management sheet.

FIG. 47 is a flowchart showing this processing procedure. Taking the flow shown in FIG. 7 according to the invention of the first embodiment as an example, the flow shown in FIG. 47 is used for setting an initial value of the distribution destination number (store the initial value in the HNS) and updating it in preparation. Setting of a value (here, it is set to 1 and 1 is added in step A12-1), and new steps A12-0, A12-1, and A14-
0 (inside the broken line in FIG. 47) may be added. However, FIG.
In this flow, one encryption number is assigned to one document.

Embodiment 22 In Embodiment 22 of the present invention, an original document, that is, a document in which an encryption number is embedded, is usually stored in an external storage device such as a hard disk. By storing, it is possible to prevent the management sheet serving as a key for decrypting the encryption number from being forgotten to be stored. In this case, there are a method of treating the management sheet as data accompanying the original document, and a method of treating the management sheet as one file. In the latter case, it is necessary to set the file name. For example, the file name of the document is changed to “ABC.doc”.
, "ABC.doch" or "AB
Ch. doc "," ABC.doh "," ABCh.do "
By setting the file name of the original document according to a certain rule such as "ch", the relevance to the original document becomes clear. In the former case, it is not necessary to set a file name, but it is not possible to call only the management sheet, and by calling a document, it is also called from an external storage device.

Embodiment 23 In Embodiment 23 of the present invention, when deleting an original document, the management sheet is no longer required, and it is no longer necessary to reproduce a document in which a specific encryption number is embedded. It is time. Therefore, if the original document, the management sheet, and the data for embedding the encryption number are simultaneously deleted, the operability is improved, unnecessary files are automatically deleted, and the memory efficiency of the apparatus is improved.

Other Embodiments As described above, document information is composed of character codes and their attribute information. In the above description, search information is character (code), and replacement information is character (code) or attribute (font). However, the search information may be attribute information. For example, it is also possible to embed an encryption number by setting search information = “Gothic” and replacement information = “Round Gothic”.

FIG. 48 is a diagram showing an example in which an encryption number is embedded using search information as attribute information. FIG. 48 (A)
Take the document shown in the example. “·” And “G” represent one character (character code may be any). "・"
The character is a font other than Gothic font such as Mincho font,
“G” indicates that the object is Gothic. It is assumed that the encryption number [10110] is embedded in such a document. FIG. 49 is a diagram showing a processing procedure for embedding an encryption number using search information as attribute information.

The flow shown in FIG. 49 is exactly the same as the flow shown in FIG. 7, except for step A5, and the description is omitted. FIG. 48B shows a document in which an encryption number is embedded in the document shown in FIG. In FIG. 48B, for the encryption number [10110] and the remaining four “Gs”,
The lower four digits of the encryption number are embedded. However, in FIG. 48B, continuous characters are replaced with another font, so that the characters are more noticeable. In order to improve this, a method may be used in which continuous objects are regarded as one. The result is as shown in FIG.

FIG. 50 is a flow chart showing a processing procedure in which this continuous one is regarded as one. To do so, as shown in the flow of FIG.
Step A5-0 may be added between step A5 and step A6 in the flow shown in FIG. Where dx =
When the value is 0, the value in parentheses on the left side of step A5-0 is -1, so that it is necessary to take measures to avoid this.

Next, an embodiment of the present invention for embedding an encryption number in figures other than characters as document information will be described. Hereinafter, for the sake of simplicity, the document information is assumed to be a line, and the replacement information is assumed to be information relating to the type and thickness of the line, which are attributes of the line. Storage means is used.

Embodiment 24 In Embodiment 24 of the present invention, document information other than characters included in a document, in particular, an attribute of a figure is output as an attribute stored as document information, or stored as replacement information. Whether to output with the attribute specified, refer to the encryption number,
The present invention relates to an "encryption number embedding system" for embedding an encryption number. For example, focusing on a certain figure and outputting a plurality of figures appearing in the document with attributes stored as document information together with them, or outputting with attributes separately stored as replacement information Is used to embed an encryption number.

That is, a figure included in a document is set as search information, document information that matches the extracted information is extracted, and the extracted information is extracted from the document information by each digit value of the encryption number assigned to the document. The cryptographic number is embedded depending on whether the attribute stored along with is output as it is or the separately stored replacement information is output as the attribute of the figure. For example, if the search information is "line"
The "lines" appearing in the target document are associated with each digit of the encryption number in the order of appearance, and after referring to the digit value, the attribute is stored as document information or stored as replacement information. Output with any of the attributes. As an example of embedding an encryption number in a "straight line", a case where search information is a "straight line", all those attributes stored as document information are "solid lines", and replacement information is a "dashed line" This will be described (hereinafter, “straight line” is referred to as “line”).

This method focuses on the type of “line”, and has a different binary encryption number [0000] for each distribution destination.
For example, in the case of embedding [1], the “line” appearing at the 0th position is made to correspond to the least significant digit (0th digit) of the encryption number, and since the value is “1”, it is stored as replacement information. Attribute (that is, the broken line), the first to fourth “lines” are made to correspond to the first to fourth digits, and their values are
Since it is "0", it is output with the attribute stored as document information (that is, a solid line). Similarly, the document with the encryption number [00011] has the attribute in which the “line” that appears at the 0th and the 1st appears as replacement information,
The fourth line that appears is output with the attribute stored as document information.

That is, each digit of the encryption number is made to correspond to the order of appearance of the “line”. If the digit value of the encryption number is “0”, the attribute is stored as document information. By outputting with a stored attribute, an encryption number is embedded in a “line” in a document.
When referring to the digit value of the encryption number, "0" and "1"
May be reversed, and in the above-described example, the correspondence is made from the zeroth digit in the order of appearance. However, the correspondence may be made from the most significant digit, or the order of correspondence may be changed.

FIG. 51 is a diagram for explaining the principle of embedding, for example, an encryption number [00011] in a “(straight) line” in a document in this embodiment. Of course, figures and characters other than “lines” are output with attributes stored as document information. The configuration of the encryption number embedding system according to the present embodiment is the same as that of FIG. 3 described above, but the function thereof is different.

Each component will be described with reference to FIG. DAH (dx) stores character codes, control codes, graphic codes, and the like, and DAZf (dx) stores attribute information. These storage means DAH (dx), DAZf
(Dx) is indexed by the address counter dx. ANG stores a binary encryption number.
Therefore, if the number of digits of ANG is x, the number of different encryption numbers that can be generated is 2 ^X. D3 () stores the search information “line”. D4 () stores the replacement information “dashed line”. AX and BX store encryption number generation data α and β. Here, α = 3 [00011],
β = 9 [01001], and the encryption number of the n-th document is α + n × β (0th = [00011], 1st = [01100], 2nd = [10101],...
・).

The output processing unit OP outputs various data according to instructions from the CPU (not shown). When outputting to a display unit or a printing unit, various codes and attribute information stored in the DAH (dx) are output to a pixel generation unit included in the printing unit. In addition, the data may be output to an external (may be built-in) storage device (hard disk or floppy disk) or another device via a communication line. The arrows in the figure indicate the direction in which data flows.

FIG. 52, FIG. 53, and FIG. 54 are diagrams showing an example of a document before and after the encryption embedding according to the present embodiment, and a state where each data is stored in each storage means at that time. FIG. 52A shows an example of document information.
Document information other than “lines”, for example, figures other than lines such as characters, control codes, rectangles and ellipses are shown. FIG.
The first storage means DAH () and DAZf () show a state in which document information is stored. For each dx, the document information is stored in DAH (dx), and the attribute information is stored in DAZf (d).
x). Also, next to the last document information,
END1 is stored, indicating that no document information exists thereafter. Characters, control codes, and graphics are stored in DAH (dx). When DAH (dx) is a “line”, DAZf (dx) stores those “lines” as “solid lines”.
"Solid line" is stored as an attribute so as to be output as. This means that if you output without embedding the encryption number,
This means that all lines are output as “solid lines”. Note that the capacity of one piece of document information is often not fixed, but here, for simplicity, it is assumed that the capacity is fixed and the unit is one.
And Therefore, if dx is greater than 1, the next document information is indexed.

FIG. 54 shows that the third storage means D3 () uses "lines" as search information, the fourth storage means D4 () uses "dashed lines" as replacement information, and AX and BX use encryption codes. The number generation data α and β and the copy counter BC
This shows a state in which the number of issued copies HN is stored. A "line" stored as search information is extracted from the document information, and it is determined whether the "line" is output as a "dashed line" or as it is as a "solid line" according to the digit value of the corresponding encryption number. . The encryption number may be any value as long as it is different for each document to be output. For the sake of simplicity, here, the encryption number of the n-th (n = 0) -th document is represented by α + n × β. The types of lines required in this embodiment are only the attribute “solid line” used as a standard and the attribute “dashed line” of the line prepared as replacement information.

Next, the processing procedure of this embodiment will be described. Note that the flowchart showing the processing procedure is the same as that of FIG. 7 described above, and will be described with reference to FIG. Preparation: The document information is stored in DAH (dx), the search information “line” is stored in D3 (), the replacement information “dashed line” is stored in D4 (), and the number of issued copies HN is stored in the copy counter BC. Further, data α and β for generating an encryption number are respectively represented by AX and B
Store in X. Step A1: The initial value α (= 3) of the encryption number stored in AX is stored in ANG. Therefore, the encryption number to be embedded in the first output document is [00011]. Step A2: Store 0 in the address counter dx of the digit counter ax, DAH (dx) and DAZf (dx). Step A3: DAH (d
When x) is END1, that is, when the end code is output from the first storage means, the process proceeds to step A12.

In this embodiment, when dx <131, the process proceeds to step A4. When dx = 131, END1 is output, and the process proceeds to step A12. Step A4: DAH (dx) of the document information is output via the output processing unit OP. Step A5: Document information DAH (dx) at address dx
Is the same as the search information D3 (). If it is determined that they are not the same, the process proceeds to step A9, and if it is determined that they are the same, the process proceeds to step A6. In this embodiment,
When dx is 16, 49, 55, 102, and 115, D
Since the output of AH (dx) matches the search information "line" stored in D3 (), the code of the line "line" is extracted, and the process proceeds to step A6. If dx is any other value, the process proceeds to step A9. Step A6: ANG (ax) represents a bit output of ax (ax = 0 to) digits from the lower order of the second storage means ANG for storing the encryption number. As described later, ax
Is initially 0 (0 is stored in step A2),
Each time a “line” is extracted, 1 is added, so dx =
16, when dx = 49, 1, ...,
The value is 4 when dx = 115. Therefore,
If the encryption number is [00011], ANG (0), AN
G (1) outputs “1”, and ANG (2), ANG
(3), ANG (4) outputs “0”.

Similarly, if the encryption number is [01100], ANG (0), ANG (1), and ANG (4)
"0" is output, and ANG (2) and ANG (3)
"1" is output. This value is determined. If "1", the process proceeds to step A7, and if "0", the process proceeds to step A8. Step A7: D4 () is output. That is, DAH
(Dx) is determined not to be an END1 code in step A3, and is determined to be a “line” in step A5,
When the value of the x digit is 1, instead of the attribute “solid line” (DAZf (dx)), which is stored as document information,
Replacement information "dashed line" stored in 4 () (D4 ())
Is output (the attribute information will be replaced),
Proceed to step A10.

Step A8: DAZf (dx) is output. That is, DAH (dx) becomes EN in step A3.
If it is determined that the code is not a D code, and if it is determined as a “line” in step A5 and the value of the ax digit of the encryption number is 0, the attribute “solid line” (DAZf
(Dx)) is output as it is (the attribute information is not replaced), and the process proceeds to step A10. Step A9: DAH (dx) is set to EN in step A3.
If it is determined that it is not a D code, and if it is determined in step A5 that it is not a “line”, the attribute “solid line” (DAZf (dx)) stored as document information is output as it is (the attribute information is Not replaced), step A
Proceed to 11.

Step A10: 1 is added to the digit counter ax. Updating of the digit counter ax is performed in step A5 at D
This is performed only when AH (dx) is determined to be a “line”, and ax does not change when it is other than a “line”. Step A11: 1 is added to the address counter dx of DAH () and DAZf (), and the process returns to step A3. Note that the processing in steps A2 to A11 is performed until the END1 code is detected in step A3.
All document information is targeted. Step A12: When the processing for all document information is completed, END1 is detected in step A3, and 1 is subtracted from the copy counter BC.

Step A13: The copy number counter BC includes:
Initially, the number of issued copies HN is stored, and step A12
When the BC is updated to 0 by the update of BC, this means that the process of embedding the cipher numbers in all the documents and outputting all the documents has been completed, and the process is completed in step A15.
When BC ≠ 0, the process proceeds to step A14. Step A14: The next encryption number is generated. The first encryption number is [00011], the next encryption number is B
(= 9) is repeatedly added, so that the embedded encryption numbers are [00011], [01100], and [101].
01], [...]. Thereafter, step A2
To output the next document in which the new encryption number is embedded.

When the encryption number is [00011], dx
In the case of [01100] with respect to the “line” of dx = 16,49, [1010]
1], the line code DAH (dx) and the attribute D4
() Is output, and for other dx, the line code D
AH (dx) and its attribute DAZf (dx) are output. As a result of embedding the encryption number in this way, the document output at the 0th time (encryption number = [0001
1]) is as shown in FIG. When the document or the copy is collected, the line document information is arranged in the reverse order of appearance, as shown in FIG. 51, and it can be seen that the encryption number is [00011].

For example, when the encryption information is embedded in the two attributes of the “straight line”, the search information is “straight line”.
The attributes stored in the document information are all “solid line” (type) and “0.5 mm” (thickness), and their replacement information is “dashed line” (type).
The case of “1.0 mm” (thickness) will be described (hereinafter, “straight line” is referred to as “line”). This method focuses on two attributes of “line” type and thickness, and separates the encryption number by two digits, combines the attributes with two-digit values, and processes them.

For example, "00" indicates the type and thickness as document information, "01" indicates type as document information, thickness indicates replacement information, "10" indicates type replacement information, As for the thickness, as described in the document information, "11"
Outputs the type and thickness of the attribute as per the replacement information. That is, the encryption number to be embedded is, for example, 2
If the base number is [101100], the “line” that appears at the 0th position is associated with the least significant digit (the 0th digit) and the 1st digit of the encryption number, and the value is “00”. Attributes stored in the information (“solid line” and “0.5 m
m ”) and the first appearing“ line ”is made to correspond to the second and third digits of the encryption number, and the value is“ 11 ”.
, The attributes (“dashed line” and “1.0 mm”) stored as replacement information are output, and the “line” appearing second is made to correspond to the fourth and fifth digits of the encryption number, Since the value is “01”, the type is the attribute stored in the document information, and the thickness is
Attributes stored as replacement information (“solid line” and “1.
0 mm "). In this way, the encryption number is embedded in the "line" in the document. The method
This can be applied when attributes stored as document information have a plurality of types and a plurality of attributes.

FIG. 55 shows an example. That is, when there are a plurality of types of attributes stored as document information, or when there are a plurality of attributes themselves, these attributes are combined and two or three or more digits of the encryption number are combined. It is made to correspond.
FIG. 55 (A) shows a case where an encryption number is embedded in a plurality of attributes, and FIGS. 55 (B) and (C) show a case where one attribute can take a plurality of values. By doing this, 1
A two-digit encryption number can be embedded in individual document information.

FIGS. 56 and 57 show the state stored in each storage means. FIG. 56 shows the storage state of the document information. The document information is stored in dx = 0 to 130, and the END1 code indicating the end is stored in dx = 131. “•” other than “line” stored in DAH (dx) indicates a graphic code other than characters and lines. DAZf0 (dx) and DAZf1 (dx) indicate the type and thickness as their attributes. Actually, besides these attributes, the positions of “start point” and “end point”, “color”, other There are some, but they are omitted here.

FIG. 57 shows the storage state of search information, replacement information, data for generating an encryption number, and the number of output copies.
That is, when a line is extracted as document information, two digits extracted from an encryption number generated from α and β are referred to,
Depending on the value, DAZf0 (dx) or D40, DAZ
It is determined which of f1 (dx) and D41 is output. An example of the determination method is shown on the right side of FIG.

FIG. 58 is a flowchart showing a processing procedure of the encryption number embedding system according to the present embodiment.
In the flow shown in FIG. 58, ANG (ax)
Are the ax digits and ax + of the register storing the encryption number.
Output a single digit value. 1) When the DAH (dx) of the document information is not “line” (determined in step A5: “NO”), DAZf0 (dx) and DAZf1 (dx) are output (step A9-0, executed in step A9-1). . Therefore, the document information does not change. 2) The DAH (dx) of the document information is “line”, and the output of ANG (ax) is (determined in step A5: “YES”).
When "00" (determined in step A6-0: "YE
S ”), DAZf0 (dx) =“ solid line ”, DAZf1
(Dx) = “0.5 mm” is output (step A7-0,
(Execution in step A8-0).

3) When the DAH (dx) of the document information is "line" (determined in step A5: "YES"), the output of ANG (ax) is 01 (determined in step A6-1: "YE").
S ”), DAZf0 (dx) =“ solid line ”, D41 =
"1.0 mm" is output (step A7-1, step A
8-1). 4) The DAH (dx) of the document information is a “line” (step A).
5: “YES”) The output of ANG (ax) is “1”
0 "(determined in step A6-2:" YES ")
D40 = “broken line”, DAZf1 (dx) = “0.5 m
m ”(executed in steps A7-3 and A8-3). 5) The DAH (dx) of the document information is a “line” (step A).
5: “YES”) The output of ANG (ax) is “1”
1 "(determined in step A6-2:" NO "), D
40 = “dashed line” and D41 = “1.0 mm” are output (executed in steps A7-2 and A8-2).

As described above, ANG (ax) outputs the two digits of the encryption number. Therefore, in step A10, 2 is added for updating ax. Thus, when one attribute has a plurality of values, or
When one document information has a plurality of attributes, one document information has a plurality of digits (however, a binary number).
Can be embedded. FIG. 59 shows an original document in which an encryption number is not embedded, and FIG.
This is an example of a document in which an encryption number [01100011] is embedded therein. In this way, an 8-digit binary number encryption number can be embedded in four pieces of document information.

In the above description, "(straight) line" is used as document information, and "type" and "thickness" of "line" are used as replacement information. In addition, "curve" is used as document information. , "Rectangle", "Ellipse including circle", "Arrow", and many other shapes. Similarly, replacement information also includes "Position", "Size", "Fill pattern", "Shadow", , "Shadow patterns", and many other attributes are available.

Embodiment 25 In Embodiment 25 of the present invention, specific document information included in a document, in particular, a graphic code is output as a graphic code stored as document information, or stored as replacement information. The present invention relates to an “encryption number embedding system” that embeds an encryption number after referring to an encryption number to determine whether to output a graphic code. For example, focusing on a figure stored as search information, a plurality of the figures appearing in a document are targeted, and they are output as a figure stored as document information, or stored as replacement information. The cryptographic number is embedded depending on whether the data is output as a figure.

That is, a figure in a document is set as search information, and document information that matches the extracted information is extracted. The cryptographic number is embedded depending on whether to output a figure stored as "?" Or to output separately stored replacement information. For example, the search information is "rectangle", and "rectangles" appearing in the target document are associated with each digit of the encryption number in the order of appearance,
With reference to the digit value, a figure stored as document information is output as a “rectangle” as it is, or a figure stored as replacement information, for example, output as a “rounded rectangle” Is what you do. As an example, a case where the search information is “rectangle” and the replacement information is “corner rectangle” will be described when embedding the encryption number in “rectangle”.

This method focuses on a “rectangle”.
Different binary encryption number for each destination, [00001]
In the case of embedding as an example, the “rectangle” appearing at the 0th position is made to correspond to the least significant digit (0th digit) of the encryption number, and since the value is “1”, it is stored as replacement information. “Rounded rectangle” is associated with the first to fourth “rectangles” corresponding to the first to fourth digits, and since their values are “0”, the “rectangle” stored as document information is And output as it is.

Similarly, the document with the encryption number [00011] is the “rectangular rectangle” stored as replacement information with the “rectangle” appearing in the 0th and first places, and the “rectangular” appears in the second to fourth places. "" As document information
Is output as is. That is, the digits of the encryption number correspond to the order of appearance of the “rectangle”, and if the digit value of the encryption number is “0”, the “rectangle” stored as the document information is changed to “1”.
Then, by outputting the “rounded rectangle” stored as the replacement information, the encryption number is embedded in the “rectangle” in the document. The replacement information (“rounded rectangle”) and the document information (“rectangle”) attribute may not always be the same. For example, the attribute of “rounded rectangle” includes an attribute of “radius of １ ／ circle” drawn at least at the vertex of the rectangle. In such a case, it is necessary to define some “radius generation method” (for example, when the length of the short side is N1 to N2, the radius = short side / 6). The description of the attribute information stored in addition to the replacement information is omitted for simplicity (that is, it is assumed that the attributes are the same for both “rectangle” and “rounded rectangle”).

FIG. 61 is a diagram for explaining the principle of embedding, for example, an encryption number [00011] in a “rectangle” in a document in this embodiment. Of course, figures and characters other than “rectangles” are output using codes stored as document information. Note that the digit values “0” and “1” of the encryption number may be reversed.
Although the correspondence is made from the first digit, the correspondence may be made from the highest digit, or the order of correspondence may be changed.

FIG. 62, FIG. 63, and FIG. 64 are diagrams showing an example of a document for which encryption embedding is performed according to the present embodiment, and a state where each data is stored in each storage unit at that time. FIG. 62 is an example of the document information, where “•” indicates document information other than “rectangle”, for example, characters, control codes, and figures other than rectangles. FIG. 63 shows the first storage means DAH (d
x) shows a state in which the document information is stored. For each dx, the document information is stored in the DAH (dx). Also, END1 is stored next to the last document information, which indicates that there is no document information thereafter.
Note that the capacity of one piece of document information is often not fixed, but here, for simplicity, the unit is set to one and set to one. Therefore, if dx is greater than 1,
The next document information shall be indexed. Also,
The attribute information of the document information may be anything in this description, but it goes without saying that both “rectangle” and “rounded rectangle” are output according to their attributes.

FIG. 64 shows that the third storage means D3 () stores "rectangle" as search information, and the fourth storage means D4 () stores
“Rounded rectangle” is used as replacement information, AX and BX use encryption number generation data α and β, and copy counter BC
Represents a state in which the number of issued copies HN is stored. The “rectangle” stored as the search information is extracted from the document information, and the “rectangle” is output as it is or the “rectangle” is changed to the “rounded rectangle” according to the digit value of the corresponding encryption number.
And decide whether to output. The encryption number may be any value as long as it is different for each output document.
The encryption number of the (n = 0) -th document is α + n × β.

The flowchart showing the processing procedure of this embodiment is common to FIG. 18 described above. In steps A4 and A5, what is to be output ("rectangle" or "rounded rectangle") is determined, and in step A789, the attribute stored as document information is output. FIG. 65 is a diagram showing a document in which an encryption number is embedded in a “rectangle” in the document shown in FIG. 62.

Twenty-Sixth Embodiment A twenty-sixth embodiment of the present invention outputs specific document information included in a document, in particular, an attribute of a control code as an attribute stored as document information, or stores the attribute as replacement information. "Encryption number embedding system" that embeds the encryption number after referring to the encryption number to determine whether to output with the attribute
It is about. For example, certain control codes,
Focusing on a line feed code or tab code, for a plurality of line feed codes or tab codes appearing in a document, the attribute is stored as document information or an attribute stored as replacement information. The encryption number is embedded depending on whether or not to output.

That is, a line feed code or a tab code in a document is set as search information, and document information that matches the search information is extracted, and the extracted information is used as the value of each digit of the encryption number assigned to the document. In this case, an encryption number is embedded depending on whether to output using an attribute stored as document information or to output using replacement information prepared separately. For example, search information is referred to as “line feed code”, and “line feed code” appearing in the target document is associated with each digit of the encryption number in the order of appearance, and the attribute or replacement information stored as document information by the digit value Output with the attribute stored as As an example, when the encryption number is embedded in the “line feed code”, the search information is “line feed code”, all the attributes (line feed amount) stored as document information are set to “10 mm”, and stored as replacement information. A description will be given of the case where the attribute, ie, the line feed amount is “8 mm”.

This method focuses on the “line feed code” and differs for each distribution destination. That is, the line feed amount is changed according to the encryption number. Binary encryption number, [0
[0001], for example, the "new line code" appearing at the 0th position is associated with the least significant digit (the 0th digit) of the encryption number, and the value is "1". "8 mm" corresponds to the first to fourth "new line codes" in the first to fourth digits, and since their values are "0", "10 mm" stored as document information is stored. Is output as is. Similarly, the document with the encryption number [00011] is “8 mm” in which 0th and 1st appearing “new line code” are stored as replacement information, and 2nd to 4th appearing “new line code” is the document. "10 mm" stored as information is output as it is. In other words, replace each digit of the encryption number with
And if the digit value of the encryption number is “0”, “10 mm” stored as document information is
If “1”, “8m” stored as replacement information
By outputting "m", the encryption number is embedded in the "line feed code" in the document.

The processing procedure of this embodiment is the same as that of the flow shown in FIG. FIG. 66 shows an example of a document in which an encryption number is embedded.
Shows the storage state of data such as document information, search information, and replacement information. FIG. 68 is an example of a document in which the encryption number [0101] is embedded in the document of FIG. In the embodiments 24, 25, and 26, for the sake of simplicity, a description has been given of a state in which information on characters (codes), control codes, graphic codes, and the like are mixed. Although the description has been made in the state where DAZf (dx) is stored, for example, the character and the control code may be stored in the same storage unit, and the graphic may be stored in another storage unit. Twenty-Seventh Embodiment A twenty-seventh embodiment of the present invention outputs specific document information included in a document, in particular, an attribute of a blank code (space) or a control code, in particular, an attribute relating to color as an attribute stored as document information. This is related to an “encryption number embedding system” that embeds an encryption number after referring to the encryption number, whether to perform the conversion or output the attribute (specific color) stored as the replacement information. A blank code or a control code is provided with an attribute related to a color, and information on a color is embedded in these codes while referring to the encryption number, whereby the encryption number can be embedded.

Although this method has no effect on a document to be printed, it is effective as one method for embedding an encryption number in a document distributed by electronic means. Even if color information is embedded in these codes, these codes themselves are not displayed, so that there is an advantage that the document cannot be seen by a reader. Further, by examining the collected electronic document, the embedded encryption number can be read. For example,
Including these characters, these codes include ^2C colors,
If it is possible to have color information of one color selected by the document creator, it is possible to embed a binary C-digit encryption number in one blank or one control code. Therefore, if an encryption number is embedded in N blanks by this method, it means that 2 ＾ C ＾ N kinds of encryption numbers can be embedded.

FIG. 69 is a view for explaining the principle of embedding in this embodiment. Here, a method of embedding an encryption number by using color information of four colors of black, red, blue and brown and referring to a two-digit encryption number is shown. In this state, when embedding an encryption number, a space is extracted from the document information, and two digits are referred to from the least significant digit (0th digit) of the encryption number in the order of extraction, and if "00", "black" is used. , "01", "blue" if "10", and "brown" if "11".
Of course, the document information other than the blank is output as the original document.

FIG. 70 is a flowchart showing the processing procedure of the encryption number embedding system according to this embodiment.
If the two digits of the encryption number are “00”, an attribute stored as document information, that is, DAZf (dx) (= white) may be used as in the example described above. This method has the characteristic that it does not appear on the surface of the distributed document at all, that is, the recipient does not know that the document has an embedded cryptographic number. In this case, the problem remains. For this purpose, a method of electronically prohibiting the modification of the document, prohibiting the browsing of the format of the document, and electronically prohibiting the printing of the distributed document on paper may be adopted.

FIG. 71 is a diagram showing an example of a document in which an encryption number is embedded according to this embodiment. FIG. 72 is a diagram showing an example in which an encryption number [001011] is embedded in the document shown in FIG. 71 according to this embodiment. Of course, it is blank and these colors are not visible as such. The color can be checked by replacing the space with another character. Although the document example includes three blanks, since the number of colors stored as replacement information is four, the expression, 2 ＾
When C ＾ N, C = 2 and N = 3, 64 types of encryption numbers can be embedded in three blanks. The first space is “brown” because the encryption number is 0 and the first digit is “11”, and the next space is because the second and eighth digits of the encryption number are “10”. "Blue",
The next blank is “black” because the fourth and fifth digits of the encryption number are “00”.

[0133]

According to the present invention, when outputting and distributing a document for which copying is prohibited, specific document information included in the document is made to correspond to the digit of the encryption number in the order of appearance, and the digit value in the document is determined by the digit value. By changing or not changing the document information, a different encryption number can be embedded in the document for each distribution destination, and when the distributed document or the duplicated document is collected, the document is distributed The destination can be specified, and transfer of the secret document or a copy thereof is suppressed.

Further, according to the present invention, when outputting and distributing a document for which copying is prohibited, the search information stored in the storage means is made to correspond to the digit of the encryption number, and the digit value is used to output the document information in the document. By changing or not changing the document, a different encryption number can be embedded in the document for each distribution destination. When the distributed document or the duplicated document is collected, the distribution destination of the document is changed. It is possible to specify the secret document, and the transfer of the secret document or the copy thereof is suppressed.

Further, according to the present invention, since the characters are output with the same attribute, it is difficult to notice that the encryption number is embedded, or even if it is, it can be decrypted by a third party. This makes it difficult to transfer copies and the like.

Further, according to the present invention, since the output is performed with the same attribute, it becomes difficult to notice that the encryption number is embedded, and the character string before and after is extracted in consideration of the character string before and after. It is a document without any.

Further, according to the present invention, since the replacement font is output as characters which are close to the original font and are easy to identify, it becomes difficult to notice that the encryption number is embedded, and at the same time, the decryption of the encryption number is performed. The accuracy is improved.

Furthermore, according to the present invention, a document is copied to be thicker or thinner than a document due to various factors. If both the part to be deleted (thinned) and the part to be added (thickened) are present in the font, both cases can be handled.

Further, according to the present invention, when outputting and distributing a document for which copying is prohibited, the set area is made to correspond to the digit of the encryption number, and the digit value changes or does not change the document information in the document. This makes it possible to embed a different encryption number in a document for each distribution destination. Therefore, when a distributed document or a document obtained by copying the document is collected, the distribution destination of the document can be specified, and transfer of a secret document or a copy thereof is suppressed.

Further, according to the present invention, it is possible to embed more cipher numbers in one document, and the accuracy of decryption is improved.

Further, according to the present invention, different encryption numbers can be embedded in one document, and the accuracy of decryption is improved. Further, according to the present invention, all digits of the storage means for storing the encryption number can be effectively used.

Further, according to the present invention, a plurality of encryption numbers can be easily generated. Further, according to the present invention, when a document for which copying is prohibited is created, the document and the above information are stored together to verify whether or not the document collected at a later date is the same as the distributed document. Thus, when the document needs to be re-created in order to perform the operation, the necessary data can be surely stored.

Further, according to the present invention, when a document whose duplication is prohibited is recovered, the document is analyzed to determine an encryption number embedded in the recovered document, and the number is stored in the stored document. And the related information can be reproduced, and the distribution destination can be specified more reliably.

Further, according to the present invention, when a document whose duplication is prohibited is recovered, the document is analyzed to determine an encryption number embedded in the recovered document, and the number and the stored document are stored. The distributed document can be reproduced from the relevant information, and the distribution destination can be specified more reliably.

Further, according to the present invention, when a document whose copying is prohibited is recovered, the document is analyzed to determine an encryption number embedded in the recovered document, and the number and the stored document are saved. And the related information can be reproduced, and the distribution destination can be specified more reliably.

Further, according to the present invention, a document is usually created by document creation application software such as a personal computer. When an operation of embedding an encryption number in a created document and outputting (for example, printing) is performed, the encryption number embedding system is used to embed the encryption number, thereby changing the original application software for document creation. External device (such as a printing device) existing beyond the communication line, such as a printing device
Can embed an encryption number in a document without changing the software. Further, each unit of the encryption number embedding system can be shared with the unit on the document creation device side.

Further, according to the present invention, usually, when a document is created by a document creation device such as a personal computer, and the document received from the document is embedded with an encryption number and printed, the encryption number is embedded by an encryption number embedding system. Is performed, the encryption number can be embedded in the document without changing the original printing software. Further, each means of the encryption number embedding system can be shared with the means on the printing apparatus side, and when one printing apparatus is shared by a plurality of document creating apparatuses, it is transmitted from the document creating apparatus to the printing apparatus. Information amount hardly increases.

Further, according to the present invention, some of the documents to be distributed do not need to be confidential, and some do not need to embed an encryption number, such as a commonly used format document. When printing such a document, the document creation device performs the process of embedding the encryption number and sends it to the printing device. The number of times of transmission is used. The number of times can be reduced, and the overall processing speed can be improved.

Furthermore, according to the present invention, by explicitly outputting a different number for each distribution destination, the number is noticed as a number for keeping secret, and it becomes difficult to notice the existence of an encryption number.

Further, according to the present invention, when a copy or the like in which an encryption number is embedded is collected, the distribution destination of the document can be specified by associating it with a management sheet. Therefore, although the creation of the management sheet is indispensable, by providing a step that is automatically created in a series of processes, forgetting to create the management sheet can be prevented.

Furthermore, according to the present invention, when a distribution or a copy is collected, a management sheet is indispensable for locating the distribution destination. When saving a document electronically, the document is securely saved even if the operator neglects to save the management sheet. Further, according to the present invention, the relationship between the document and the management sheet becomes clear, and the operation of saving the management sheet becomes unnecessary.

Further, it is meaningless if information for embedding the management sheet or the encryption number is stored as a file in a state where the original document is deleted. Therefore, according to the present invention, when deleting a document, By deleting both, the external storage device can be used effectively.

Further, according to the present invention, a figure has many attributes such as length and width, line thickness, line type, fill pattern, and presence or absence of a shadow, and these attributes are changed. Otherwise, the encryption number can be embedded, and the transfer of the document or copy to a third party by distributing the secret document in which the encryption number is embedded can be suppressed.

In addition, in many cases, the figure may be any one such as a figure very similar to a figure, for example, a so-called rounded rectangle in which a rectangle and a vertex are arcs, a regular hexagon and a regular hexagon. However, according to the present invention, when outputting, it is possible to embed an encryption number depending on whether or not these figures are changed to similar ones.

Further, according to the present invention, the control code (tab, indent, line feed code) contains data for controlling the amount, and this is used as attribute information to change these amounts. Thus, the encryption number can be embedded.

Further, according to the present invention, even if a space or a control code is output, these control the output position of a character or the like, and have no attribute other than the size thereof. By providing information and using it as attribute information, an encryption number can be embedded.

[Brief description of the drawings]

FIG. 1 is a diagram showing the relationship between terms used in describing text information as an object of the present invention.

FIG. 2 is a diagram for explaining the principle of embedding an encryption number in a document according to the first embodiment.

FIG. 3 is a block diagram illustrating a configuration of an encryption number embedding system according to the first embodiment.

FIG. 4 is a diagram illustrating an example of a document on which encryption embedding is performed according to the first embodiment.

FIG. 5 is a diagram illustrating an example of data stored in a first storage unit in the first embodiment.

FIG. 6 is a diagram illustrating an example of data stored in another storage unit in the first embodiment.

FIG. 7 is a flowchart illustrating a processing procedure of the encryption number embedding system according to the first embodiment;

FIG. 8 is a diagram illustrating an example of a document output as 0th in which the encryption number is embedded in the document illustrated in FIG. 4 by the encryption number embedding system according to the first embodiment.

FIG. 9 is a diagram for explaining the principle of embedding an encryption number in a document in the second embodiment.

FIG. 10 is a block diagram illustrating a configuration of an encryption number embedding system according to a second embodiment.

FIG. 11 is a diagram illustrating an example of a document on which encryption embedding is performed according to the second embodiment.

FIG. 12 is a diagram illustrating an example of data stored in a first storage unit in the second embodiment.

FIG. 13 is a diagram illustrating an example of data stored in another storage unit in the second embodiment.

FIG. 14 is a flowchart illustrating a processing procedure of the encryption number embedding system according to the second embodiment;

FIG. 15 is a diagram illustrating an example of a document output secondly in which an encryption number is embedded in the document illustrated in FIG. 11 by the encryption number embedding system according to the second embodiment.

FIG. 16 is a diagram showing an example of a combination in a case where an encryption number is embedded by changing a character itself.

FIG. 17 illustrates an example of a document in which an encryption number generated by using the method of the third embodiment is embedded.

FIG. 18 is a flowchart illustrating a processing procedure of the encryption number embedding system according to the third embodiment.

FIG. 19 is a flowchart illustrating a processing procedure of the encryption number embedding system according to the third embodiment.

FIG. 20 illustrates an example of search information and replacement information when the number of characters is different according to the fourth embodiment.

FIG. 21 shows the storage state of these pieces of information in the storage means, with a part omitted from the example of FIG. 20.

FIG. 22 is a flowchart showing only a part of embedding an encryption number in one document using the data of FIG. 21;

FIG. 23 illustrates an example of a document before and after embedding an encryption number according to the fourth embodiment.

FIG. 24 is a diagram illustrating an example of a case where a character font is partially changed in the fifth embodiment.

FIG. 25 is a diagram illustrating an example in which a part of a font pixel is cut and added to another part according to the fifth embodiment.

FIG. 26 is a diagram for explaining the principle of embedding an encryption number in a document according to the seventh embodiment.

FIG. 27 is a block diagram illustrating a configuration of an encryption number embedding system according to a seventh embodiment.

FIG. 28 is a diagram illustrating an example of a document on which encryption embedding is performed according to the seventh embodiment.

FIG. 29 is a diagram illustrating an example of data stored in a first storage unit in the seventh embodiment.

FIG. 30 is a diagram illustrating an example of data stored in another storage unit according to the seventh embodiment.

FIG. 31 is a flowchart illustrating a processing procedure of the encryption number embedding system according to the seventh embodiment;

FIG. 32 is a diagram illustrating a document in which an encryption number is embedded by the encryption number embedding system according to the seventh embodiment in the document example illustrated in FIG. 28;

FIG. 33 is a diagram illustrating an example of a document in which a block is one area according to the seventh embodiment.

FIG. 34 is a flowchart illustrating a part of a processing procedure of the encryption number embedding system according to the eighth embodiment.

FIG. 35 is a diagram illustrating an example of a document before and after embedding an encryption number according to an eighth embodiment.

36 is a diagram in which characters in which the encryption number is embedded are extracted from the document in which the encryption number is embedded in FIG. 35, and are arranged in reverse order of the extraction order.

FIG. 37 is a diagram for explaining the encryption number generation method according to the ninth embodiment.

FIG. 38 is a diagram illustrating an example of data stored in each storage unit in the ninth embodiment.

FIG. 39 is a flowchart illustrating a processing procedure for a portion where an encryption number is embedded according to the ninth embodiment;

FIG. 40 is a diagram illustrating an example of generating a plurality of encryption numbers according to the eleventh embodiment.

FIG. 41 shows an encrypted number decrypted from the recovered copy,
FIG. 11 is a flowchart of reproducing the document by inputting.

FIG. 42 is a continuation of the flowchart of FIG. 41;

FIG. 43 is a flowchart showing a processing procedure when saving in an external storage device.

FIG. 44 is a flowchart showing a processing procedure when reading from an external storage device.

FIG. 45 is a flowchart showing a processing procedure for inputting an encryption number decrypted from a collected copy and outputting the document having the encryption number in a distributed state.

FIG. 46 is a diagram illustrating an example of a management sheet for decrypting an encryption number from a collected document and specifying a distribution destination.

FIG. 47 is a flowchart illustrating a processing procedure for creating a management sheet.

FIG. 48 is a diagram illustrating an example in which an encryption number is embedded using search information as attribute information.

FIG. 49 is a flowchart showing a processing procedure for embedding an encryption number using search information as attribute information.

FIG. 50 is a flowchart showing a processing procedure in which consecutive characters are regarded as one character.

FIG. 51 is a diagram illustrating the principle of embedding an encryption number in a document according to the twenty-fourth embodiment.

FIG. 52 is a diagram illustrating an example of a document before and after performing encryption embedding according to Embodiment 24.

FIG. 53 is a diagram illustrating an example of data stored in a first storage unit in Embodiment 24.

FIG. 54 is a diagram illustrating an example of data stored in another storage unit in the twenty-fourth embodiment.

FIG. 55 is a diagram illustrating an example in which attributes stored as document information have a plurality of types and a plurality of attributes in the twenty-fourth embodiment.

FIG. 56 is a diagram showing an example of data stored in a first storage means in the example shown in FIG. 55;

FIG. 57 is a diagram showing an example of data stored in other storage means in the example shown in FIG. 55;

FIG. 58 is a flowchart illustrating a processing procedure of the encryption number embedding system according to the twenty-fourth embodiment;

FIG. 59 is a diagram illustrating an example of a document on which encryption embedding is performed according to Example 24.

60 is a diagram illustrating an example of a document in which an encryption number is embedded in the document illustrated in FIG. 59 according to the twenty-fourth embodiment.

FIG. 61 is a diagram for explaining the principle of embedding an encryption number in a document in the twenty-fifth embodiment.

FIG. 62 is a diagram illustrating an example of a document on which encryption embedding is performed according to Embodiment 25.

FIG. 63 is a diagram illustrating an example of data stored in a first storage unit in the twenty-fifth embodiment.

FIG. 64 is a diagram illustrating an example of data stored in another storage unit in the twenty-fifth embodiment.

FIG. 65 is a diagram illustrating an example of a document in which an encryption number is embedded in the document illustrated in FIG. 62 according to the twenty-fifth embodiment.

FIG. 66 is a diagram illustrating an example of a document on which encryption embedding is performed according to Example 26;

FIG. 67 is a diagram illustrating an example of data stored in each storage unit in Embodiment 26.

FIG. 68 is an example of a document in which an encryption number is embedded in the document shown in FIG. 66 according to the twenty-sixth embodiment.

FIG. 69 is a view for explaining the principle of embedding an encryption number in a document in the twenty-seventh embodiment.

FIG. 70 is a flowchart of the encryption number embedding system according to the twenty-seventh embodiment;

FIG. 71 is a diagram illustrating an example of a document on which encryption embedding is performed according to Example 27;

FIG. 72 is an example of a document in which an encryption number is embedded in the document shown in FIG. 71 according to the twenty-seventh embodiment.

[Explanation of symbols]

DAH (dx), DAZf (dx) ... first storage means,
ANG: second storage means, D3 (): third storage means,
D4 (): fourth storage means, AX, BX: encryption number generation data storage means, dx: address counter, BC: copy counter, ax: digit counter.

Continued on the front page (51) Int.Cl. ⁷ Identification symbol FI Theme coat II (Reference) G09C 5/00 G09C 5/00

Claims (27)

[Claims] A first storage unit that stores a document; a number generation unit that generates a different encryption number for each distribution destination; and a second storage unit that stores the encryption number generated by the number generation unit in a binary number. Storage means; third storage means for storing search information; fourth storage means for storing replacement information corresponding to the search information stored in the third storage means; Extracting means for extracting, from the document information stored in the storage means, document information that matches the search information stored in the third storage means; and extracting the document information extracted by the extraction means, Replacement means for associating with the digit of the encryption number stored in the second storage means and replacing the document information extracted by the extraction means with replacement information stored in the fourth storage means based on the digit value Embedded with an encryption number Only system. 2. A first storage unit for storing a document, a number generation unit for generating a different encryption number for each distribution destination, and a second storage unit for storing the encryption number generated by the number generation unit in a binary number. Storage means; third storage means for storing search information; fourth storage means for storing replacement information corresponding to the search information stored in the third storage means; Extracting means for extracting, from the document information stored in the storage means, document information matching the search information stored in the third storage means; and searching for the document information stored in the third storage means. The information is associated with the digit of the encryption number stored in the second storage unit, and the document information extracted by the extraction unit based on the digit value is stored in the fourth storage unit. Replacement means for replacing with replacement information. And an encryption number embedding system. 3. The encryption number embedding system according to claim 1, wherein the search information and the replacement information are different characters or character strings, and are extracted by the extraction unit using the search information. An encryption number embedding system, wherein a character or a character string of document information is replaced with a character or a character string stored as the replacement information. 4. The encryption number embedding system according to claim 3, wherein the search information and the replacement information are different characters or character strings, and are before or / and after each character or character string. , A cryptographic number embedding system comprising the same character or character string. 5. The encryption number embedding system according to claim 1, wherein the search information is a character, the replacement information is information on a font of the character, and the font is a pixel of the character. , Or a code number embedding system characterized in that pixels are added to some of them. 6. The encryption number embedding system according to claim 5, wherein the search information is a character, the replacement information is information on a font of the character, and the font deletes some pixels of the character. And an encryption number embedding system, wherein a pixel is partially added. 7. A first storage unit for storing a document, a number generation unit for generating a different encryption number for each distribution destination, and a second storage for storing the encryption number generated by the number generation unit in a binary number. Means, area storage means for storing a plurality of area boundary information set in the first storage means, fourth storage means for storing replacement information corresponding to the set area, area storage The area stored in the means is made to correspond to the digit of the encryption number stored in the second storage means, and the area stored in the first storage means is stored based on the digit value of the encryption number. Replacing the document information with the replacement information stored in the fourth storage means. 8. The encryption number embedding system according to claim 1, wherein the number of the document information extracted by the extraction means or the number of the set areas is an encryption number. An encryption number embedding system characterized by embedding the same encryption number again when the number of digits is larger than. 9. The encryption number embedding system according to claim 1, wherein the number generation means generates and stores a plurality of different encryption numbers, and stores one or more encryption numbers. A plurality of sets of search information and replacement information or a plurality of areas are set, and a different encryption number is embedded in each group. 10. The encryption number embedding system according to claim 1, wherein the number generation means adds or subtracts a given initial value or an encryption number embedded in a previous document. A cryptographic number embedding system, wherein a numerical value is added and subtracted by using a given odd number as an addition / subtraction number, and the result is used as a new cryptographic number. 11. The encryption number embedding system according to claim 9, wherein, when generating a plurality of encryption numbers, the encryption number storage means is divided into a predetermined number of digits and stored in the divided portions. An encryption number embedding system, characterized in that the number is used as an encryption number. 12. The cryptographic number embedding system according to claim 1, wherein an external (or internal) storage device (such as a hard disk or a floppy disk) is provided. And writing means for writing data therein, wherein when document information stored in the first storage means is stored in the external storage device, at least replacement information stored in the fourth storage means; An encryption number embedding system characterized by storing search information stored in a third storage means or area boundary information stored in an area storage means. 13. The encryption number embedding system according to claim 12, further comprising: data reading means for reading a stored document from an external storage device; and input means for inputting an encryption number. The document information read from the means is stored in the first storage means, the search information is stored in the third storage means, the replacement information is stored in the fourth storage means, and the encryption number input from the input means is stored. The document information is stored in a binary number in the second storage unit, and the document information that matches the search information is extracted from the document information by the extraction unit. The extracted document information is made to correspond to the digit of the encryption number. An encryption number confirmation system, wherein the extracted document information is replaced by the replacement information stored in the fourth storage means by the replacement means based on the digit value. 14. The encryption number embedding system according to claim 12, further comprising: data reading means for reading a stored document from the external storage device; and input means for inputting an encryption number. The document information read from the reading unit is stored in the first storage unit, the search information is stored in the third storage unit, the replacement information is stored in the fourth storage unit, and the encryption number input by the input unit is stored. Is stored in the second storage means as a binary number, and the document information that matches the search information is extracted from the document information by the extraction means, and the search information is made to correspond to the digit of the encryption number. An encryption number confirmation system for replacing the extracted document information with replacement information based on the extracted document information. 15. The encryption number embedding system according to claim 12, further comprising: a data reading unit that reads a stored document from the external storage device; and an input unit that inputs an encryption number. The document information read from the reading means is stored in the first storage means, the area boundary information is stored in the area storage means, and the replacement information is stored in the fourth storage means. Is stored in the second storage means as a binary number, the set area is made to correspond to the digit of the encryption number, and based on the digit value, the document information included in the area is replaced with the replacement information by the replacement means. An encryption number confirmation system characterized by being replaced. 16. The cryptographic number embedding system according to claim 1, wherein each means of the cryptographic number embedding system is arranged in a document creation device, and a document in which the cryptographic number is embedded is externally provided. When an operation to output to a device (such as a printing device) is performed by the document creation device,
What is claimed is: 1. A document creation apparatus, comprising: transmitting document information generated every time a document in which an encryption number is embedded is generated to a device connected via a communication line or the like. 17. The encryption number embedding system according to claim 1, wherein each means of the encryption number embedding system is arranged in a printing device, and the encryption number is set via a communication line or the like. A printing apparatus, wherein, when a document to be embedded is received, the document information is output to a printing unit while generating a document in which an encryption number is embedded, or each time the document is generated. 18. The encryption number embedding system according to claim 1, further comprising a switch for inhibiting a process of embedding an encryption number. 19. The encryption number embedding system according to claim 1, further comprising: fifth storage means for storing a different number for each distribution destination, wherein the encryption number is embedded. And outputting the number stored in the fifth storage means to some or all pages of the distribution document. 20. The encryption number embedding system according to claim 1, wherein a number or a character (hereinafter, referred to as a distribution destination number) specifying a distribution destination is stored. Means, and a management sheet creating means for creating a management sheet in which the distribution number is associated with the encryption number embedded in the document of the distribution destination. A cipher number embedding system for instructing the start of creation of a management sheet before or after outputting a document. 21. The encryption number embedding system according to claim 12, wherein when the document information stored in the first storage unit is stored, the created management sheet is also stored. Characterized encryption number embedding system. 22. The encryption number embedding system according to claim 21, wherein when the management sheet is stored together with the document, the management sheet is stored together with the document as information accompanying the document, or
An encryption number embedding system, wherein the file name of the management sheet is obtained by adding a predetermined character string to the file name of the document. 23. The encryption number embedding system according to claim 12, wherein when an operation of deleting a document stored in the external storage device is performed, a management sheet stored together with the document. And / or an information for embedding an encryption number is also deleted. 24. The encryption number embedding system according to claim 1, wherein the search information is a graphic code, and the replacement information is attribute information of the graphic. And an encryption number embedding system. 25. The encryption number embedding system according to claim 1, wherein the search information is a graphic code, and the replacement information is a graphic code different from the graphic. Characterized encryption number embedding system. 26. The encryption number embedding system according to claim 1, wherein the search information is a control code, and the replacement information is attribute information of the control code. And an encryption number embedding system. 27. The encryption number embedding system according to claim 1, wherein the search information is related to a space or a control code, and the replacement information is related to the space or the control code. A cryptographic number embedding system, characterized in that the information is color information with attributes.