JPH11232179A - Digital data work, digital data work processing method, digital data work processor, and medium for recording digital data work processing program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a digital data work processing method which embeds security data in a digital data work and can easily judge whether or not it is illegally copied. SOLUTION: This digital data work processor 100 consists of an automaton producing means 3, a security data inputting means 4, a converting means 5 which converts a bit array of security data inputted from the means 4 into the array of each vertex part of an expanded automaton by using the expanded automation that is selected, a conversion digital data arranging means 8 which converts each vertex part into the array of sequential conversion digital data in the order of an array by using conversion code digital data 6 that respectively belongs to each vertex part which is stored in a conversion code digital data storing means 7 and a security data embedding means 9 which embeds the data 6 in a part of each bit data constituting a work.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a digital data work processing method, a digital data work processing apparatus, and the like. More particularly, the present invention relates to a digital data work mainly composed of music data. The present invention relates to a digital data work processing method and a digital data work processing apparatus for effectively preventing the digital data work.

[0002]

2. Description of the Related Art Conventionally, audio data such as digital audio data and musical sound data recorded on an arbitrary recording medium such as a tape or a disk is transmitted once the recording medium is sold in the market. Without the consent of the copyright owner, the unauthorized copy is sold in large quantities at a low price, so the rights of the copyright owner are unjustly infringed and the copyright owner It is currently suffering damage.

[0003] At present, there is practically no means for effectively preventing such illegal copying, and it is difficult to confirm the evidence from the law, so it is difficult to prosecute such illegal copying or pirated copies. In state. Many methods have been proposed for preventing such unauthorized copying of audio data. However, there are problems such as deterioration in sound quality of reproduced sound, and at present it is not practically used.

Therefore, in order to improve this problem, the copyright holder of the digital audio data, or
The licensee audibly adds security data, such as encryption and signature data composed of digital bit data, indicating that the audio data is genuine audio data that has been authorized for sale, to the audio data itself. Research on "data hiding", which embeds data so that it has no influence and prevents infringement of copyright and ownership of the audio data, has been actively conducted recently. Data hiding technology has not been developed.

[0005] In particular, MIDI (Musical Instrumental Digital Interface) which has been widely used and commercialized recently.
As for MIDI music digital data configured according to the standard of ce), no effective method or device for preventing the above-mentioned problem from occurring has been developed at all.

[0006]

SUMMARY OF THE INVENTION An object of the present invention is to improve the above-mentioned drawbacks of the prior art and, based on a simple technical structure, a person who has a copyright in a predetermined digital data work, or The person who has obtained the license embeds security data in the digital data work in advance, which can later check that the product is its own,
As a result, a digital data work processing method and a digital data work processing apparatus that can easily determine whether or not the product is its own product, whether or not the product has been copied illegally, etc. To provide.

[0007]

The present invention basically employs the following technical configuration in order to achieve the above object. That is, the first of the present invention
As a mode of embedding, when embedding predetermined security data in a work composed of digital data, at least two vertices indicating different states and a predetermined coefficient for connecting each of the vertices are assigned. A plurality of automaton units composed of a set of side groups are combined, and the plurality of vertex groups and each of the vertices are classified into a set of side groups to which the predetermined coefficient is assigned according to a predetermined rule. Using an extended automaton, which is individually connected to each other, converts the array of values of each bit in the digital value of the security data into an array of the vertices constituting the extended automaton, and The conversion code digital data given to the respective This is a method for processing a digital data work which is configured to be embedded in a part of each bit data constituting a digital data work. In a second aspect according to the present invention, a method for processing digital data work A device for embedding predetermined security data in a copyrighted work, comprising an automaton creating means for creating an enlarged automaton from an automaton unit, security data input means for inputting predetermined security data digitized, and input from the security data input means. Converting means for converting the digital bit array in the security data into an array of vertices in the expanded automaton using an appropriate expanded automaton selected from the automaton creating means; Conversion code that each has uniquely Conversion digital data arranging means for sequentially arranging the converted digital data in the order of arrangement of the vertices using digital data; security for embedding the converted code digital data in a part of each bit data constituting a predetermined copyrighted work; And a digital data copyrighted work processing device comprising data embedding means.

Further, as a third aspect of the present invention, at the time of embedding predetermined security data in a work composed of digital data, at least two vertices indicating different states and each of the vertices are shown. A first step of preparing an automaton unit composed of a group of sides to which a predetermined coefficient is assigned, and a second step of manufacturing a copy of the automaton unit; and the two automaton units. To form an expanded automaton in which each vertex of each vertex portion group of each automaton unit is individually connected by each of the side groups to which the predetermined coefficient is assigned according to a predetermined algorithm. The third step, if necessary, is to add the expanded automaton to the automaton if necessary. As a mutton unit, a fourth step of producing a copy of the enlarged automaton and another enlarged automaton obtained by applying the third step described above to the two enlarged automata obtained in the fourth step A fifth step of forming, using the expanded automaton, converting an array of values of each bit in a digital value of predetermined security data into an array of the vertices constituting the expanded automaton. A sixth step, a seventh step of sequentially embedding the given conversion code digital data of the vertex in a part of each bit data constituting the digital data work according to the arrangement of the vertex; A fourth aspect of the present invention is a method for processing a digital data copyrighted work comprising at least two different A plurality of automaton units, each of which is composed of a vertex indicating the state of the vertex and a side group to which a predetermined coefficient for connecting each of the vertices is assigned, and the plurality of vertex groups and the respective vertices are combined. Each of the bits in the digital value of the security data is obtained by using an extended automaton constituted by individually connecting each of the side groups to which the predetermined coefficient is assigned according to a predetermined rule. Is converted into an array of the vertices constituting the expanded automaton, and the conversion code digital data given to the vertices sequentially constitutes the digital data work according to the arrangement of the vertices. The specified security data is read from a digital data work embedded in a part of each bit data At the time of reading, the data at a predetermined bit in the bit data in the digital data work is read, and the read bit data is read out from the predetermined bit data and each of the vertexes. Referring to the conversion digital data table showing the relationship, the data is converted into the array of the respective vertices, and then given in advance from the array of the respective vertices to the respective edges connecting the respective vertices of the predetermined expanded automaton. A digital data literary work processing method for reading out the security data from a digital data literary work in which the security data is embedded, characterized by performing an operation of restoring the security data with reference to a predetermined coefficient.

Further, as a fifth aspect according to the present invention,
A device for reading predetermined security data embedded in a digital data work from a work composed of digital data, and an expanded automaton storage means for storing an expanded automaton; Reading means for reading digital data constituting predetermined bits of the obtained predetermined digital data, digital data read from the digital data work by the reading means being stored in a predetermined and predetermined converted digital data storage means. A conversion digital data table indicating a relationship between the stored bit data and each of the vertices is read from the conversion digital data storage means, and is compared with the digital data, based on a comparison result of the comparison means. Auto expand the digital data A vertex portion array conversion means for converting the array of each vertex portion constituting the ton, and a predetermined expanded automaton stored in the expanded automaton storage means based on an output of the vertex portion array conversion means. And a security data restoring means for restoring each bit constituting the security data from the vertex array.

[0010]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The digital data work processing method and digital data work processing apparatus according to the present invention employ the above-described technical configuration. Specific security data such as encryption data and signature data can be embedded in the necessary digital data work in a format that does not affect human hearing, and can be easily reproduced.

That is, in the present invention, in a digital data work including music data, in general, in a work composed of a large amount of digital data, a specific data of digital data representing each characteristic is used. Even if a bit is replaced by embedding a plurality of predetermined bits of data indicating predetermined security data, it is a good use of the fact that, when reproduced as a whole, the sense of incongruity is rarely manifested. .

In the present invention, as will be described later,
The required security data is subjected to a specific conversion using an algorithm that is difficult for a third party to understand, and the results are used to convert the necessary parts of the digital data work into necessary parts.
Since the security data is embedded, it is extremely difficult for a third party to identify whether or not the security data is embedded. Therefore, even if the security data embedded and partially embedded is destroyed, it is possible to obtain a security data embedding method that is strong in error correction and can restore the security data with a considerable probability.

[0013]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A specific example of a data processing method and a data processing apparatus according to the present invention will be described below in detail with reference to the drawings. That is, FIG. 1 is a block diagram showing the configuration of one specific example of a digital data work processing apparatus 100 according to the present invention. In the figure, an apparatus for embedding predetermined security data in a work 1 constituted by digital data. An automaton creating means 3 for creating an enlarged automaton from an automaton unit, security data input means 4 for inputting predetermined security data 2 digitized, and security data input from the security data input means 4 The conversion means 5 for converting the digital bit array into an array of each vertex in the expanded automaton using an appropriate expanded automaton selected from the automaton creating means 3 and stored in a conversion code digital data storage means 7. That each vertex is The conversion digital data array means 8 and the conversion code digital data 6 for converting into the array of the conversion digital data sequentially in the arrangement order of the respective vertices by using the conversion code digital data 6 which each has its own. And a security data embedding unit 9 for embedding in a part of each bit data constituting the copyrighted work.

It is desirable that the digital data work in which predetermined security data is embedded by the digital data work processing apparatus 100 be stored in an appropriate storage means 20. The automaton creating means 3 used in the present invention includes at least two vertices a1 and a2 indicating different states and each of the vertices a1 and a2.
1, the automaton unit F ₀ which is composed of the side group h1~h4 Metropolitan the predetermined coefficient 1 or 0 is assigned to link each a2, multiple combinations, the plurality of vertex portion group and the respective each vertex, according to a predetermined rule, is to create an enlarged automaton F ₁ constructed are connected individually by each side group to which the predetermined coefficient is assigned.

That is, the automaton creating means 3 according to the present invention uses an automaton F ₀ having at least the configuration as shown in FIG. 2, and the automaton F ₀ has two different automata F _0. States q1, q2
And each vertex a
1 is to use the automaton unit F ₀ which is composed of the side group h1~h4 Metropolitan the predetermined coefficient is allocated for connecting the respective a2.

Each of the automaton units F ₀ used in the present invention is of a known type, and its configuration is, for example, when the state is not changed at the vertex a 1, Returning to the same vertex a1 along the side h1 where the coefficient 0 is given, if the state is changing, along the side h2 where the coefficient 1 is given, the vertex a2 Moving.

The state also changes at the vertex a2 in accordance with the same judgment as described above. The automaton used in the present invention is generally displayed according to a state transition coding method. For example, it is assumed that a finite set is Q and Q is an original state.

[0018]

(Equation 1)

Here, E ₀ is called the 0 side and E ₁ 1 side. s
One ∈Q is determined and called an initial state. And F = (Q,
E ₀ , E ₁ , s) are called automata. On the other hand, B =
{0, 1} is called a bit, and an arbitrary bit string b ₁ ,
b ₂ , b ₃ ,..., b _n are called signature data.

Q ₁ , q ₂ , q ₃ ,..., Q
_n and q _{n + 1} are given by 0 ≦ i ≦ n, and E ₀ (q _i )
= Q _{i + 1} and b _i = 0 or E ₁ (q _i ) = q _{i + 1} and b _i
= 1, and q _i = s, q ₁ ,
q ₂ , q ₃ ,..., q _n , q _{n + 1} are referred to as a signature state sequence.

Therefore, an automaton as shown in FIG. 2, which will be described later, is defined as follows. _{That, Q = {q 0, q} 1} s = q 0 E 0 (q 0) = q 0 E 1 (q 0) = q 1 E 0 (q 1) = q 1 E 1 (q 1) = q _{In the} present invention, two automaton units F ₀ as described above are prepared as F ₀ and F ₀ ′, and, for example, according to a predetermined rule as shown below, that is, an algorithm,
Each of the plurality of vertex portion group and the each vertex, according to a predetermined rule, creating a larger automaton F ₁ which is enlarged is connected individually by each side group to which the predetermined coefficient is assigned Is what you do.

As an example of how to create the larger automaton used At a present invention, for example, as shown in FIG. 3, the automaton unit F _0, such as shown in FIG 2
The number prepared and F _0, F ₀ ', automaton unit F ₀
The states of the vertices a1 and a2 of the automaton unit F ₀ ′ are defined as q0 and q1, respectively.
Are defined as states q0 ′ and q1 ′, respectively.

Next, it is necessary to connect the two automaton units F ₀ and F ₀ ′ by bridging.
In that case, each of the above automaton units F ₀ ,
Of the sides h1 to h4 in each of F ₀ ′, the sides h1 and h3 to which the coefficient 0 is assigned are used for the extension for bridging. At this time, the vertex portions a1 and a2 of the automaton units F ₀ and F ₀ ′ are labeled “outside”, and at the vertex portion, when the extension process is performed, the corresponding automaton unit is assigned It is decided to process it so that it is expanded.

Therefore, in one's own automaton F ₀ ,
At starting from their automaton F ₀ side proceeds in his automaton, that is, the destination side h1 coefficient 0 coming out at the top portion q0 automaton unit F ₀ to the other party automaton unit F ₀ of ' To the automaton q0 'corresponding to the own automaton q0.

By changing the remaining sides h3 and the sides h1 and h3 each having a coefficient of _{0 in the} corresponding automaton unit F ₀ ′ in accordance with such rules, the expanded automaton F as shown in FIG. ₁ will be obtained. Then, according further from the first expansion automaton F ₁ is also possible to obtain a second expanded automaton F _2, further, third, fourth expansion automaton F _3, it is also possible to create F ₄ It is.

Here, the above-mentioned second enlarged automaton
F_TwoTo explain an example of how to create
And the first expanded automato obtained above.
N F ₁Are prepared. That is, as shown in FIG.
Automaton F₁And the first expanded automaton
F₁’.

In preparing the _second enlarged automaton F ₂ , for example, among the sides i 1 to i 8 in each of the above-mentioned automata, especially each side i 2, i 5, i 4 having a coefficient of 1 are those that as changing the corresponding vertex section of the enlarged automaton F ₁ facing the i7. In that case, the respective expanded automata F ₁ , F ₁ ′
Vertices q0 to q4, q0 'to q4'
Are labeled as [medium] or [outside], and in the label of [outside], when the expansion process is performed, the edge at the vertex is assigned to the corresponding automaton unit. The processing is performed so as to extend to the corresponding vertex in the above. In addition, in the label “middle”, when the expansion processing is performed, the side at the vertex is assigned to the corresponding automaton unit. It is decided to process it so that it will not be issued.

The second algorithm obtained by such an algorithm
Structure of large automata F ₂ becomes something like shown in FIG. Hereinafter, similarly, it is possible to create the third and fourth enlarged automata. For reference, if attached to refer to create a third expansion automaton F ₃ of, similarly to the first described above, the second expansion automaton F ₂ to two prepared.

That is, the second expanded automata F ₂ and F ₂ ′ are prepared, and only the side having a coefficient of 0 in each of the expanded automata F ₂ is expanded. In addition, although the above label is attached to each vertex in each expanded automaton F ₂ , in this specific example, only four are selected for eight vertices. It is desirable to attach the above label.

Regarding the combination of the labels in such an operation, in any case, it is desirable that three of them are [medium] labels and the other one is [outer] labels. That is, as a combination of labels, (outer, middle, middle, middle),
(Medium, outside, medium, medium), (medium medium, outside, medium), (medium, medium,
Using two sets selected from the four sets of (medium, outside),
For example, in the expanded automaton F ₂ in FIG. 6, starting from the vertex q0, following the side 1 and starting from the traveling route X and another vertex q2 as shown in FIG.
Following the side 1, two traveling routes of the traveling route Y as shown in FIG. 7 are formed.

In the present invention, since the above-mentioned two round routes X and Y do not intersect with each other, it is convenient to create security data embedded data. In the present invention, how much the extended automaton is required depends on the size of the digital data in the digital data work to be used, but usually, the bit data constituting the security data is 3 bits. In many cases, it is sufficient to use the _second expanded automaton F ₂ using eight vertex parts.

Of course, when the digital data to be embedded with the security data in the digital data work has only three bits, it is usual not to embed the security data in that part. Therefore, when the number of bits of the security data to be embedded is three, it is preferable that the number of bits of the predetermined digital data to be embedded with the security data be at least 5 bits.

The structure of the automaton creating means 3 according to the present invention described above is, as apparent from the above description,
For example, a side group h to which at least two vertexes a1 and a2 indicating different states and a predetermined coefficient 0 or 1 for connecting each of the vertices a1 and a2 are assigned.
Automaton unit F composed of 1 and h2
First means 11 for providing a _0, are respectively stored in a suitable storage unit 13 of the automaton unit F same automaton unit F ₀ of the second means 12, two to create a copy of _0, F ₀ ' and by applying a predetermined algorithm, one automaton unit F ₀ to be disposed at a predetermined position automaton of the same from the apex portion a1 unit F ₀ in the same or other vertex portion in the a1 , A2 extending to the other side of the automaton unit F ₀ ′ having a predetermined coefficient 0 or 1
The third means 14 for creating one expansion automaton F ₁ by treating as allowed to change its extending direction as to be connected to the vertex portion a1 'that put further the expansion automaton F ₁ given The enlarged automaton F ₁ is stored in the storage means 15 at the same time as necessary.
The further back to the first means 11, the desired scale automaton to make a copy of the larger automaton F ₁ Repeat steps in the above third means Fn
And a fourth means 16 (which is the same as the third means 14).

The procedure for generating the expanded automaton Fn will be described with reference to the flowchart of FIG. 9 while referring to the apparatus of FIG. 8. First, after the start, the process proceeds to step (1). , An automaton unit F ₀ is prepared, and in step (2), a copy of the automaton unit F ₀ is created to generate two automaton units F ₀ and F ₀ ′.

Next, the process proceeds to step (3),
Each automaton unit F₀, F₀’
Perform the labeling operation described in step (4).
Each automaton unit F₀, F₀’
Selection of each side h1 to h4 connected to each vertex
After that, in step (5), the predetermined
One automaton using a predetermined algorithm
Unit F₀Selected at a given vertex in
Set the side to another automaton unit F₀’At a given vertex
Perform the extension operation to be changed, and enlarge in step (6).
Automaton F ₁Is extracted.

Thereafter, in step (7), it is determined whether or not the extracted expanded automaton F ₁ is the final expanded automaton of interest. If NO, the expanded automaton F _{1 is determined.} Is returned to step (2), and the above-described configurations are repeated. If YES is determined in step (7), END is set. In the present invention,
The specific enlarged automaton formed as described above is stored in appropriate enlarged automaton storage means 30,
The expanded automaton is used if necessary.

In the present invention, when embedding predetermined security data in a predetermined digital data work using the specific enlarged automaton formed as described above, the predetermined security data is The embedding is executed by converting the digital bit array into an array of vertices in the expanded automaton.

A specific example of the method of embedding the predetermined security data in the digital data work according to the present invention will be described. When embedding the predetermined security data in the work composed of digital data, at least two security data are embedded. A plurality of automaton units composed of vertex portions indicating different states of each other and a side group to which a predetermined coefficient connecting each of the vertex portions is assigned, the plurality of vertex portion groups and the According to a predetermined rule, each of the vertices uses an expanded automaton that is individually connected by each of the side groups to which the predetermined coefficient is assigned, and is used in the digital value of the security data. The array of the value of each bit is converted to the vertex The digital data is converted into a column, and the conversion code digital data given to each of the vertices is sequentially embedded in part of each bit data constituting the digital data work according to the arrangement of the vertices. This is a method for processing digital data works.

The above-described method can be used for the method of creating the expanded automaton in the present invention. In the method of embedding security data according to the present invention, how the expanded automaton is used is described. hand,
It is to convert each digital bit data sequence constituting the security data into an array of vertices in the expanded automaton.

When embedding security data in a digital data work according to the present invention, there is no restriction that an expanded automaton having any format and any characteristic must be used, and any expanded automaton can be used. It is. The point is, how to use the extended automaton.

[0041] In the present invention, therefore, use the expanded automaton F ₂ shown in FIG. 6 will be described with its security data conversion method as an example. That, in the in the enlarged automaton F ₂ in FIG. 6, there is disposed a vertex portion q0~q7 showing eight different states, each apex, two related different apex An edge as two connecting lines toward
There are provided two sides as connection lines received from two different vertices, and each side has a predetermined coefficient of 0 or 1 as shown in the figure. Is attached.

When the expanded automaton is created as described above, the coefficient is added to each vertex of the expanded automaton according to the generation of the expanded automaton (that is, whether or not n of the expanded automaton Fn is odd or even). Although used to determine a label, it has another meaning in the conversion operation of the security data described here, that is, 0 and 1 of the coefficient.
Has the same meaning as the value of each bit constituting the predetermined security data.

First, each vertex in the expanded automaton F ₂ is represented by 3-bit digital data.
The results are summarized as a predetermined correspondence table. That is, the state value data of each vertex of the expanded automaton F ₂ is 3
The table is created by converting the data into digit bit data. For example, as shown in FIG.
Each state of 0 to q7 is created as 3-bit digital data.

That is, the vertex q0 is 000 and the vertex q1 is
001, the vertex q2 is 010, etc., and a corresponding lookup table is created and stored in an appropriate storage means. Next, when the predetermined security data to be embedded in the predetermined digital data work is, for example, “MK”, the digital data corresponding to each Roman character is, for example, as shown in FIG. "MK"
Since M is designated as 001011 and K is designated as 001101, it is constituted by an array of digital data called 001011001101.

Therefore, the security data "M
The digital data bit string of K ”is converted into an array of the vertices of the expanded automaton using the above-described expanded automaton F _2. The procedure is as follows: first, the first (left end) bit data of the digital data bit string of the security data Is 0.

[0046] Thus, starting from the left end of the top portion q0 of the enlarged automaton F _2. In this case, although it is also possible to start from the apex of the enlarged automaton F ₂ throat, in this specific example, to be a as described above. Therefore, now, the left end of the top portion of the enlarged automaton F ₂ q0
Starts.

At this time, since the value of the leftmost bit data of the security data is 0, the vertex q0
, First select an edge having a coefficient of 0, and move to the next vertex along the edge. In this case, the vertex q0
Since the side h1 having a coefficient of 0 is selected from the sides protruding from, the next step is to move to the vertex q2.

Next, at the vertex q2, when the second bit data from the left of the security data is read, it is 0 again.
The edge h2 having the coefficient of 0 is selected, and the vertex returns to the vertex q0. Then, the third bit data from the left of the security data is read out, and since it is 1, this time, the side h3 having a coefficient of 1 out of the side from the vertex q0 is selected, and it is along this side. To the vertex q1.

Thereafter, the fourth bit data from the left of the security data is read out, and since it is 0, the side h4 of the coefficient 0 coming out of the vertex q1 is selected, and the vertex is changed to q3. Will be migrated. Similarly, the fifth bit data from the left of the security data is read out, and since it is 1, the side h5 of the coefficient 1 coming out of the vertex q3 is selected, and the vertex shifts to q2. Then, the sixth bit data from the left of the security data is read out, and since it is 1, the side h6 of the coefficient 1 coming out of the vertex q2 is selected, and the vertex moves to q7.

The above operation is performed on the bit values of all the digital data constituting the security data. As a result, the security data becomes q
0, q2, q0, q1, q3, q2, q7, q5, q
The array is converted into an array of data, such as 7, q6, q3,... Indicating the state of the vertices constituting the extended automaton.

Next, the vertices q0 to q7 are obtained from a table showing digital data indicating the state of each of the vertices determined in advance as shown in FIG.
When each of the corresponding data of the list, the sequential order of the vertex portion qn showing a state of the enlarged automaton F ₂ shown by the data of the respective apex, becomes as in FIG. 12.

That is, each digital bit value of the security data is converted into digital data in the order shown in FIG. Then, the security data to be embedded in the predetermined digital data work is the 3-digit bit data shown in FIG. Next, a method for embedding the converted security data in a digital data work according to the present invention will be described.

First, the digital data literary work used in the present invention is not particularly limited, and may be applied to all literary works represented by digital data, for example, digital data recording media including video and tape. Recorded movies, animations, still images, moving images, documents, drawings, music, voices, photographs, and the like are targets. When embedding the security data according to the present invention, the above-described security data is embedded by overwriting a predetermined digital data portion in the digital data work described above.

More specifically, for example, a MIDI (Music Instrument) which has been actively used and commercialized recently.
al Digital Interface) M
The procedure will be described on the assumption that the security data according to the present invention is embedded in IDI music digital data. That is, the MIDI music digital data includes, for example, a header portion A and a track data portion B as shown in FIG. 13, and the header portion A includes a composer name, a song name, a tempo, a time signature, and the like. The information is described, and the actual music data is described in the track data portion B.

In the track data portion B, as shown in FIG. 14, for example, characteristic data such as timing, ON / OFF, height, and velocity are arranged along the time axis. By playing at the same time, you can listen to the actual music. In the characteristic data, the timing is data indicating a time at which a sound is produced or stopped, and the ON / OFF data is data for discriminating whether a key is pressed or released,
The height data is, for example, data indicating the position of a keyboard of a piano, and the velocity is data indicating speed.

In the present invention, for example, the last three digits of all digital velocities in FIG.
The security data after conversion shown in FIG. 12 will be sequentially embedded. In this case, in this specific example, an array of digital data representing the digital watermark “MK” shown in FIG. 12 is repeatedly embedded in all velocity data arranged along the time axis. In some cases, the security data may be embedded only in a predetermined portion.

Further, the data is not limited to the velocity data, but can be embedded in other data. Further, in this specific example, an example is shown in which the security data is embedded in the last three digits of the velocity data. However, when each data of the security data is represented by 2 bits, the velocity data is embedded. Will be embedded in the last two digits of the security data.

However, in the present invention, it is not always necessary to embed the security data in the lower three digits or the lower two digits of the velocity data, and it is also possible to embed the security data in a predetermined digit of the velocity data. It is possible. In other words, an example of the digital data work in the present invention is music data, and the music data is MIDI (Music Instrumental Digital I / O).
It is desirable that the data be configured according to the standard of (nterface).

As described above, in the method of processing a digital data work according to the present invention, each of the at least one characteristic value constituting the music data is arranged in the time axis direction. It is preferable that each bit of the converted digital data is embedded in some bits of the digital data. In the present invention, it is preferable that the digital data constituting the music data in which the converted digital data is embedded are lower-order bits of the digital data.

As is apparent from the above description, another aspect of the present invention is a digital data work composed of digital data, and each characteristic digital data constituting the digital data work. At least some of the digital data in
A plurality of vertex portions indicating different states from each other and a plurality of automaton units configured from a side group to which predetermined coefficients for connecting the respective vertex portions are assigned, and the plurality of vertex portion groups Each of the vertices is represented by a digital value of the security data by using an expanded automaton that is individually connected to each of the sides to which the predetermined coefficient is assigned according to a predetermined rule. Is converted to an array of the vertices constituting the extended automaton, and the converted digital data given to the vertices are sequentially embedded according to the arrangement of the vertices. It is a copyrighted work.

As is clear from the above description, the method of processing a digital data work according to the present invention involves at least two different states when embedding predetermined security data in a work composed of digital data. A plurality of automaton units, each of which is composed of a vertex portion to be shown and a side group to which a predetermined coefficient connecting each of the vertex portions is assigned, and combining the plurality of vertex portion groups and each of the vertices. In accordance with a predetermined rule, using an expanded automaton that is individually connected and configured by each of the side groups to which the predetermined coefficient is assigned, the value of each bit value in the digital value of the security data is used. Convert the array to the array of the vertices that make up the augmented automaton and give it to the vertices, respectively. The gist is a method of processing a digital data work in which the converted code digital data is sequentially embedded in a part of each bit data constituting the digital data work according to the arrangement of the vertexes. Things.

When the present invention is applied to, for example, music data among digital data works, individual digital data arranged in the time axis direction in at least one characteristic value constituting the music data. It is desirable to embed security data consisting of the converted digital data formed as described above in each bit of the converted digital data in some bits of
In this case, it is desirable that the digital data constituting the music data in which the converted digital data is embedded be lower-order bits of the digital data.

A specific operation procedure of the above-described digital data work processing method according to the present invention will be described with reference to a flowchart of FIG. At the time of embedding, after the start, in step (1), it is composed of at least two vertices indicating different states and a side group to which a predetermined coefficient for connecting each of the vertices is assigned. The first step of preparing an automaton unit is performed, and in step (2),
A second step of manufacturing a copy of the automaton unit is performed, and then proceeding to step (3), the two automaton units are combined, and each vertex of each vertex group of each automaton unit is replaced with a respective one. ,
According to the predetermined algorithm as described above, a third method is used to form an expanded automaton individually connected by each of the side groups to which the predetermined coefficient is assigned.
In step (4), it is determined whether or not the expanded automaton obtained in step (3) is a desired expanded automaton. If NO, the process returns to step (2). Until the required expanded automaton is obtained, execute the fourth step in which the steps (2) and (3) are repeated, and then proceed to step (5) to use the expanded automaton. After executing the fifth step of converting the array of the values of each bit in the digital value of the predetermined security data into the array of the vertices constituting the expanded automaton, the process proceeds to step (6). The conversion code digital data given to each of the vertices is sequentially converted into predetermined characteristic data that sequentially constitutes the digital data work according to the arrangement of the vertices. Performing a sixth step of embedding a portion of the bit data.

Thereafter, the process proceeds to step (7), and the seventh step of storing the digital data work in which the created security data is embedded in appropriate storage means is executed, and the process ends. In another aspect of the present invention, when embedding predetermined security data in a work composed of digital data,
A first step of preparing an automaton unit composed of a plurality of vertices indicating different states and a group of edges to which each of the vertices is assigned a predetermined coefficient, a copy of the automaton unit In the second step of manufacturing, the two automaton units are combined, and each of the vertices of each vertex portion group of each of the automaton units is assigned the predetermined coefficient according to a predetermined algorithm. A third step of forming an expanded automaton individually connected by each of the side groups, a fourth step of repeating the third step until a required expanded automaton is obtained, and using the expanded automaton in advance. The array of the value of each bit in the digital value of the predetermined security data is expanded A fifth step of converting the converted code digital data given to each of the vertices into a predetermined sequence for sequentially forming the digital data work according to the arrangement of the vertices. A sixth step of embedding part of each bit data of the characteristic data, and a seventh step of storing the created digital data work in which the created security data is embedded in an appropriate storage means.
And recording a program for causing a computer to execute a method of embedding predetermined security data in a digital data work.

FIG. 16 shows a method and an apparatus for reading the predetermined security data from the digital data work in which the predetermined security data is embedded as described above. A specific example will be described with reference to FIG. The method of reading security data according to the present invention is executed by using the above-described security data embedding method in a reverse manner.

That is, basically, first, a predetermined enlarged automaton shown in FIG. 6 is used.
Further, a vertex portion as shown in FIG. 10 and a bit data table corresponding thereto are used. Also, it is assumed that the characteristic data in the digital data work in which the security data is embedded is known in advance.

That is, a plurality of automaton units composed of at least two vertices indicating different states and a side group to which a predetermined coefficient for connecting each of the vertices is assigned are combined. Using a plurality of vertex groups and each of the vertices, according to a predetermined rule, using an expanded automaton configured by being individually connected by each of the side groups to which the predetermined coefficient is assigned, The array of the values of each bit in the digital value of the security data is converted into the array of the vertices constituting the extended automaton, and the conversion code digital data given to the vertices is converted according to the array of the vertices. , Digital data sequentially embedded in a part of each bit data constituting the digital data work From crop At a method for reading the predetermined security data, prepared after the start, the digital data work to be examined in step (11),
In step (12), digital data relating to a predetermined characteristic value in the digital data work is read out, and in step (13), bits in a predetermined digit of the digital data are read out. The data is read, and in step (14), the read bit data of the predetermined digit portion is referred to by referring to a conversion digital data table indicating a predetermined relationship between the bit data and each vertex. Then, in step (15), each vertex of the expanded automaton is connected from the array of each vertex using a predetermined expanded automaton. With reference to a predetermined coefficient previously assigned to each side, the array of each vertex is converted into an array of bit data values constituted by the coefficients.

Thereafter, the process proceeds to step (16), where the security data is read from the converted bit data value array, and is compared with predetermined security data previously stored in predetermined security data storage means. In (17), it is determined whether or not the detected security data matches the predetermined security data, and the process ends.

In another aspect of the security data reading method according to the present invention, at least two vertices indicating different states and a predetermined coefficient for connecting each of the vertices are allocated. A plurality of the automaton units each composed of a set of sides are combined, and the plurality of vertex groups and each of the vertices are assigned to the side to which the predetermined coefficient is assigned according to a predetermined rule. Using an extended automaton configured to be individually linked by each of the groups, converting the array of values of each bit in the digital value of the security data into an array of the vertices constituting the extended automaton, The conversion code digital data given to each of the vertices is sequentially converted to the data according to the arrangement of the vertices. When reading the predetermined security data from the digital data work embedded in a part of each bit data constituting the digital data work, the predetermined bit in the bit data in the digital data work is Read the data at
A predetermined digit portion of the digital data is inspected, and the read bit data of the predetermined digit portion is converted into a converted digital signal indicating the relationship between the predetermined bit data and each vertex. With reference to the data table, the data is converted into the array of the respective vertices, and then, from the array of the respective vertices, using the predetermined expanded automaton, the respective vertexes of the expanded automaton are connected. By referring to a predetermined coefficient given to each side in advance, the array of each vertex is converted into an array of bit data values composed of the coefficients, and the security is converted from the array of the converted bit data values. A digital data embedment of security data characterized by performing an operation of restoring the data; A recording medium recording a program for executing a method from over data work reading the predetermined security data to the computer.

As an apparatus for executing the above security data reading method, for example, an apparatus having the following configuration as shown in FIG. 1 can be considered. That is, a device 35 for reading predetermined security data embedded in a digital data work from the work composed of digital data,
Expanded automaton storage means 30 for storing an expanded automaton; digital data reading means 3 for reading digital data constituting predetermined bits of predetermined digital data from the digital data work 1
1. The relationship between the bit data stored in the predetermined converted digital data storage means 7 and each of the vertices, the digital data read from the digital data work 1 by the reading means 31 Is stored in the converted digital data storage means 7
A comparing means 32 for reading out the digital data and comparing the digital data with the digital data; a vertex portion array converting means 33 for converting the digital data into an array of respective vertices constituting the enlarged automaton based on the comparison result of the comparing means 32; Based on the output of the vertex array conversion means 33, the respective bits constituting the security data are restored from the vertex array using the predetermined expanded automaton stored in the expanded automaton storage means 30. A digital data copyrighted work processing device 35 is shown, which is composed of security data to be restored and restoration display means 34 for displaying the security data.

The expanded automaton storage means 30 in the present invention is connected to a predetermined automaton creation means 3, and the automaton creation means 3 has at least two vertexes indicating different states and each of the vertices. An automaton unit composed of a side group to which a predetermined coefficient for connecting each of the vertices is assigned,
An expanded automaton configured by combining a plurality of the plurality of vertex groups and each of the vertices individually according to a predetermined rule by each of the side groups to which the predetermined coefficient is assigned. Is to create.

In the method of reading security data from a digital data work according to the present invention described above, an expanded automaton to be used is determined in advance, and any characteristic data in the digital data work is determined. The following is an example where it is known how many digits of security data are embedded in which part of
A specific example of such a case in which a digital data literary work in which the above information is unknown is also possible will be described below.

For example, a method of reading security data from music data composed of MIDI data according to the present invention will be described. First, as described above,
For example, the inspection is started on the assumption that security data is embedded in the last n digits of the velocity digital data in the MIDI data. Then, first, the number of digits n
Is set to n = 4, and it is checked whether or not security data is embedded in this portion.

Therefore, it is assumed that the last four digits of the digital data at the velocity are as shown in FIG. Next, the expanded automaton F ₃ created in advance in the present invention
(I.e., larger automaton with apex group having 16 different states q) a calculated similarly from the respective vertex portions q0 in to the expansion automaton F ₃ predetermined (not shown) to each q15 As shown in FIG. 17, the data bit data value indicating the corresponding state is determined using the predetermined table, for example, the table shown in FIG. 18, as shown in FIG. 19 is compared with the last four digits of the digital data
As shown in, for converting the digital data values of Figure 17 the sequence of the vertex portion of the expanded automaton F _3.

On the other hand, a part of the expanded automaton F ₃ includes, for example, sides formed between vertices as shown in FIG. 20, and a coefficient (1) assigned to each side.
Or 0). Therefore, next, FIG.
The sequence of digital data values from the information converted into the sequence of each vertex portion qn of the enlarged automata F ₃ relates in the velocity in the digital data work, shown in 9, as illustrated in Figure 20 It is determined whether or not a proper side exists.

For example, in the expanded automaton F ₃ shown in FIG. 20, the sides h1 from q0 to q1 and q0 to q1
There is a side h2 toward 3 and further a side h3 from q1 to q4, but no side from q0 to q4 or from q2 to q3. Therefore, looking at the corresponding column in FIG. 19 in the MIDI music data extracted from the digital data work, there is an edge from q0 to q1, and q
It can be seen that there is an edge from 1 to q4.

[0077] In this way, so that the check out whether follow exactly the same sides as the sides having At a bit string extracted from MIDI music data the enlargement automaton F _3. For example, as described above,
By checking the state of the two vertices, the relationship can be estimated.

That is, two adjacent pairs (qn and qm)
Is correct, it is estimated that there is an edge from vertex qn to vertex qm. Conversely, if the edge does not exist, the set may be incorrect. It is judged that the nature is high. Also, in view of the configuration of the expanded automaton F ₃ , it is estimated that an error occurs even when there is a vertex array that does not exist.

[0079] Then, for example, the sequence of the vertex portion by expanding automaton F ₂ shown in FIG. 6, for example, as shown in FIG. 21, assuming that a following such a state, q0, q1, q4, q6, q4 , Q5, q1, q2 , q
0, q1, q4, q6, q4... As described above, for example, as shown in FIG.
There cannot be a sequence of 1 → q2.

The continuation of the sides can be corrected by a correction method described later, and the continuation of the sides of q5 → q0 → q2 can be made correct. Then, after the correction, the above-mentioned array is q0, q1, q4, q6, q4, q
5, q0, q2, q0, q1, q4, q6, q4 ...
After it is determined that, by using the coefficients given in advance to each side of the expanded automaton F _2, by reading out the coefficient of edges between vertices unit for each successive, for example, the sequence of the apex Can be converted into a bit data string of the following security data.

In this example, the side having the coefficient of 1 is traced. The bit data string of 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0 is read as a watermark embedded in the digital data work as security data. In other words, when reading the security data in the present invention, it is important to determine whether to trace the side of the coefficient 1 or the side of the coefficient 0 among the sides of the expanded automaton.

If the embedded security data remains unchanged without any tampering, all adjacent sets must be correct, but if any part of the security data is tampered with, If so, some sets are determined to be incorrect sets, as described above.
Therefore, in the present invention, the two sets that are used to confirm whether the number n of bits to be extracted by the above method is 4 bits, 3 bits, or 2 bits is a correct set. Check if there is.

For example, when the lower 4 bits are detected and the correct set is 75% or less, the same detection operation is performed again using the lower 3 bits, and the correct set in that case is 75% or less. If so, the same detection operation is performed again using the lower two bits. When 75% or more correct pairs are detected first, the number of digits to be detected is set to that value.

An example of the above error correction will be described. For example, (S) → (a), (a) → (b), (b)
The sequence of → (c), (c) → (e) is a correct set. Pattern I Now, in the above pattern, the relationship of 〇 is a correct pair,
Is a group whose relationship is incorrect.

In this case, (S) → (a) → (?) →
In the relationship (c) → (e), (a) → (?)
(?) → (c) is regarded as a correct group at the same time, and (?) Is determined, so that (?) = (B) is found. Therefore, the correct arrangement order is (S) → (a) → (b) →
It can be seen that (c) → (e).

[0086]

(Equation 2)

Now, let us consider a case where there are two erroneous sets between the correct sets in the above pattern, and there is no side part (a) → (c). In this case, (d) is determined as an erroneous state and replaced with another state. And
(?) And (?) And (c) are simultaneously regarded as a correct set, and (?) Is determined to find that (?) = (B).

Therefore, the correct arrangement order is (S) →
It can be seen that (a) → (b) → (c) → (e).

[0089]

(Equation 3)

Now, when there are two erroneous pairs between the correct pairs in the above pattern, and two erroneous pairs continue,
When skipping one piece (that is, excluding (d)), the set of (a) → (b) is recognized as a correct set. In this case, by determining (d) as an unnecessary state and deleting it, the following correct arrangement is found.

(S) → (a) → (b) → (c) On the other hand, in the present invention, the expanded automaton is used as described above, and each vertex in the expanded automaton is connected. At least two routes that return to the original vertex following the side having the same coefficient are formed, and any one of the routes is used. Is obtained.

In other words, by creating an expanded automaton in the present invention, the rule is that the lower one bit is increased each time the image is expanded. Therefore, even if the least significant bit is falsified, Even if it is lost, the embedded security data can be restored from the remaining bits.

[0093]

As described above, the digital data work processing apparatus and the digital data work processing method according to the present invention have the above-mentioned configurations, and therefore, a predetermined digital data work can be processed by a human. It is possible to embed specific security data, for example, encryption data, signature data, and the like in the required digital data work in a format that does not affect the hearing of the user, and it is possible to easily reproduce it.

In the present invention, as will be described later,
The required security data is subjected to a specific conversion using an algorithm that is difficult for a third party to understand, and the results are used to convert the necessary parts of the digital data work into necessary parts.
Since the security data is embedded, it is extremely difficult for a third party to identify whether or not the security data is embedded. Therefore, even if the security data embedded and partially embedded is destroyed, it is possible to obtain a security data embedding method that is strong in error correction and can restore the security data with a considerable probability.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a specific example of a digital data copyrighted work processing device according to the present invention.

FIG. 2 is a diagram showing an example of an automaton unit used in the present invention.

FIG. 3 shows a state in which two sets of automaton units used in the present invention shown in FIG. 2 are prepared and an enlarged automaton is prepared.

FIG. 4 is a diagram showing an example of an enlarged automaton according to the present invention.

FIG. 5 shows a state in which two sets of enlarged automaton units are prepared to create another enlarged automaton from the enlarged automaton shown in FIG. 4;

FIG. 6 is a diagram illustrating a configuration example of an enlarged automaton.

FIG. 7 is a diagram illustrating an example of a procedure for creating another enlarged automaton according to the present invention.

FIG. 8 is a block diagram showing a configuration of a specific example of an automaton creation device according to the present invention.

FIG. 9 is a flowchart illustrating a procedure for creating an enlarged automaton according to the present invention.

FIG. 10 is an example of a correspondence table in which the states of vertices used in the present invention and the states are displayed as digital data.

FIG. 11 is a correspondence table in which alphabetic symbols used for security data according to the present invention are displayed by digital data.

FIG. 12 is a table illustrating an array of security data converted into an array of vertices and displaying the values of the vertices in digital data;

FIG. 13 is a diagram illustrating a configuration example of digital data of MIDI music data.

FIG. 14 is a diagram showing an example of a configuration of a track data section in the MIDI music data.

FIG. 15 is a flowchart illustrating an example of an operation procedure of a digital data work processing method according to the present invention.

FIG. 16 is a flowchart showing an example of an operation of a method of reading predetermined security data from a digital data work used in the present invention.

FIG. 17 is a diagram illustrating an example of a case where a velocity portion in digital data of MIDI music data is read;

FIG. 18 is a correspondence table in which the state of each vertex is displayed as digital data when another enlarged automaton is used.

FIG. 19 is a table showing an example in which an array of vertices is obtained from a digital data work according to the present invention using an expanded automaton.

FIG. 20 is a diagram showing a part of the configuration of another enlarged automaton.

FIG. 21 is a diagram illustrating a relationship between a bit data string of a digital work to be inspected and a vertex array of an expanded automaton.

[Explanation of symbols]

100: Digital data work processing device 1: Digital data work 2: Security data 3: Automaton creation means 4: Security data input means 5: Conversion means 6: Conversion code digital data 7: Conversion code digital data storage means 8: Conversion digital data array means 9 ... security data embedding unit 10 ... digital data work storage means 11 ... first means 12 ... second means 13 ... storage means to create a copy of the automaton unit F ₀ to provide an automaton unit F ₀ 14, 16 ... Third means for creating an enlarged automaton 15, 30 ... Expanded automaton storage means 20 ... Digital data work storage means 31 with security data embedded therein 31 ... Readout means 32 ... Comparison means 33 ... Vertex portion array conversion means 34 … Restore display Stage 35 ... digital data work processing apparatus

Claims (15)

[Claims] When embedding predetermined security data in a work composed of digital data, at least two vertices indicating different states and a predetermined coefficient for connecting each of the vertices are assigned. A plurality of automaton units composed of a set of side groups are combined, and the plurality of vertex groups and each of the vertices are classified into a set of side groups to which the predetermined coefficient is assigned according to a predetermined rule. Using an expanded automaton composed of each connected individually,
The array of the values of each bit in the digital value of the security data is converted into the array of the vertices constituting the extended automaton, and the conversion code digital data given to the vertices is converted into the array of the vertices. , A digital data copyrighted work is sequentially embedded in a part of each bit data constituting the digital data copyrighted work. 2. The digital data work processing method according to claim 1, wherein the digital data work is music data. 3. The music data is a MIDI (Music In)
The digital data copyrighted work processing method according to claim 1, wherein the data is data configured according to the standard of a strumental digital interface. 4. A configuration in which each bit of the converted digital data is embedded in a part of bits of individual digital data arranged in a time axis direction in at least one characteristic value constituting the music data. The method for processing a digital data work according to any one of claims 1 to 3, wherein 5. The fixed digital data work processing according to claim 4, wherein the digital data constituting the music data in which the converted digital data is embedded are lower bits of the digital data. Method. 6. A digital data work constituted by digital data, wherein at least a part of the digital data in each characteristic digital data constituting the digital data work has at least two different states. Combining a plurality of automaton units each composed of a vertex portion indicating the above and a side group to which a predetermined coefficient connecting each of the vertex portions is assigned,
Each of the plurality of vertex groups and each of the vertices, according to a predetermined rule, using an expanded automaton configured by being individually connected by each of the side groups to which the predetermined coefficient is assigned, The array of the values of each bit in the digital value of the security data is converted into the array of the vertices constituting the extended automaton, and the converted digital data given to the vertices is converted according to the array of the vertices. , A digital data work characterized by being sequentially embedded. 7. An apparatus for embedding predetermined security data in a copyrighted work composed of digital data, comprising: an automaton creating means for creating an enlarged automaton from an automaton unit; and security data for inputting predetermined digitalized security data. The input means, the digital bit array in the security data input from the security data input means, using an appropriate expanded automaton selected from the automaton creation means, the arrangement of each vertex in the expanded automaton A conversion digital data array means for sequentially arranging the converted digital data in the arrangement order of the vertices using the conversion code digital data inherent in each of the vertices; and the conversion code digital. data And a security data embedding means for embedding a part of each bit data constituting a predetermined literary work. 8. The automaton creating means, comprising: an automaton unit comprising at least two vertices indicating different states and a side group to which predetermined coefficients for connecting the vertices are assigned. , A plurality of vertex groups and each of the vertices are individually connected according to a predetermined rule by each of the side groups to which the predetermined coefficient is assigned. 8. The digital data work processing device according to claim 7, wherein the digital data work processing device creates an enlarged automaton. 9. A first method for preparing an automaton unit comprising at least two vertices indicating different states and a side group to which a predetermined coefficient for connecting each of the vertices is assigned. Means, a second means for creating a copy of the automaton unit, a vertex arranged at a predetermined position in one of the automaton units by applying a predetermined algorithm to each of two identical automaton units A predetermined side having a predetermined coefficient extending from one portion to another vertex in the same automaton unit is changed in its extending direction so as to be connected to one vertex in the other automaton unit. The third means for creating an expanded automaton by processing in the same manner, and further, if necessary, the expanded automaton 9. The digital data work according to claim 8, further comprising: a fourth means for copying and repeating the operation in the third means to create an enlarged automaton of a desired scale. Processing equipment. 10. When embedding predetermined security data in a work composed of digital data, at least two vertices indicating different states and a predetermined coefficient for connecting each of the vertices are assigned. A first step of preparing an automaton unit composed of a set of sides, a second step of producing a copy of the automaton unit, a combination of the two automaton units, and a vertex of each automaton unit A third step of forming each of the vertices of the group according to a predetermined algorithm to form an expanded automaton individually connected by each of the side groups to which the predetermined coefficient is assigned, and a necessary expanded automaton; The fourth and fourth steps are repeated until the
A fifth step of using the extended automaton to convert an array of values of each bit in a digital value of predetermined security data into an array of the vertices constituting the extended automaton A sixth step of sequentially embedding the given conversion code digital data of the vertex portion in part of each bit data of predetermined characteristic data constituting the digital data work according to the arrangement of the vertex portion; And a seventh step of storing the digital data work in which the created security data is embedded in an appropriate storage means. 11. When embedding predetermined security data in a work composed of digital data, at least two vertices indicating different states and a predetermined coefficient for connecting each of the vertices are assigned. A first step of preparing an automaton unit composed of a set of sides, a second step of producing a copy of the automaton unit, a combination of the two automaton units, and a vertex of each automaton unit A third step of forming each of the vertices of the group according to a predetermined algorithm to form an expanded automaton individually connected by each of the side groups to which the predetermined coefficient is assigned, and a necessary expanded automaton; The fourth step of repeating the second and third steps until obtained, the enlargement A fifth step of using an automaton to convert an array of values of each bit in a digital value of predetermined security data into an array of the vertices constituting the extended automaton; A sixth step of sequentially embedding the given conversion code digital data in a part of each bit data of predetermined characteristic data constituting the digital data work according to the arrangement of the vertexes; And storing a program for causing a computer to execute a method of embedding predetermined security data in the digital data work, comprising a seventh step of storing the digital data work in which the data is embedded in an appropriate storage means. recoding media. 12. A combination of a plurality of automaton units each comprising at least two vertices indicating different states and a side group to which a predetermined coefficient for connecting each of the vertices is assigned. Using a plurality of vertex groups and each of the vertices, according to a predetermined rule, using an expanded automaton configured by being individually connected by each of the side groups to which the predetermined coefficient is assigned, The array of the values of each bit in the digital value of the security data is converted into the array of the vertices constituting the extended automaton, and the conversion code digital data given to the vertices is converted according to the array of the vertices. , A digital data work which is sequentially embedded in a part of each bit data constituting the digital data work. When reading the predetermined security data from the product, the data at the predetermined bit in the bit data in the digital data work is read, and a predetermined predetermined digit portion in the digital data is read. Inspect and convert the read bit data of the predetermined digit portion into an array of the respective vertex portions with reference to a conversion digital data table showing a predetermined relationship between the bit data and the respective vertex portions. Then, from the array of the respective vertices, using a predetermined enlarged automaton, by referring to a predetermined coefficient previously given to each side connecting each vertex of the expanded automaton ,
The embedded security data is characterized by converting the array of each vertex into an array of bit data values composed of the coefficients, and performing an operation of restoring the security data from the array of converted bit data values. A digital data copyrighted work processing method comprising reading the security data from a digital data copyrighted work. 13. A combination of a plurality of automaton units each comprising at least two vertices indicating different states and a side group to which a predetermined coefficient for connecting each of the vertices is assigned. Using a plurality of vertex groups and each of the vertices, according to a predetermined rule, using an expanded automaton configured by being individually connected by each of the side groups to which the predetermined coefficient is assigned, The array of the values of each bit in the digital value of the security data is converted into the array of the vertices constituting the extended automaton, and the conversion code digital data given to the vertices is converted according to the array of the vertices. , A digital data work which is sequentially embedded in a part of each bit data constituting the digital data work. When reading the predetermined security data from the product, the data at the predetermined bit in the bit data in the digital data work is read, and a predetermined predetermined digit portion in the digital data is read. Inspect and convert the read bit data of the predetermined digit portion into an array of the respective vertex portions with reference to a conversion digital data table showing a predetermined relationship between the bit data and the respective vertex portions. Then, from the array of the respective vertices, using a predetermined enlarged automaton, by referring to a predetermined coefficient previously given to each side connecting each vertex of the expanded automaton ,
The embedded security data is characterized by converting the array of each vertex into an array of bit data values composed of the coefficients, and performing an operation of restoring the security data from the array of converted bit data values. A recording medium which stores a program for causing a computer to execute a method of reading predetermined security data from a digital data work, wherein the program is configured to read the security data from the digital data work. 14. An apparatus for reading predetermined security data embedded in a digital data work from a work composed of digital data, comprising: an expanded automaton storage unit for storing an expanded automaton; Reading means for reading digital data forming predetermined bits of predetermined digital data from a copyrighted work, and digital data read from the digital data copyrighted work by the reading means for a predetermined and predetermined conversion A comparing means for reading a converted digital data table indicating a relationship between the bit data stored in the digital data storing means and each of the vertices from the converted digital data storing means and comparing with the digital data; Based on the comparison result, the digital data Vertex array conversion means for converting the data into an array of the respective vertices constituting the expanded automaton, and a predetermined expanded automaton stored in the expanded automaton storage means based on the output of the vertex array conversion means. And a security data restoring means for restoring each bit constituting the security data from the vertex array using the security data restoring means. 15. The expanded automaton storage means is connected to a predetermined automaton creation means, and the automaton creation means connects at least two vertices indicating different states to each of the vertices. A plurality of automaton units composed of a side group to which a predetermined coefficient is assigned,
Creating an expanded automaton configured by individually connecting the plurality of vertex groups and each of the vertices according to a predetermined rule with each of the side groups to which the predetermined coefficient is assigned. 15. The digital data copyrighted work processing device according to claim 14, wherein: