# Method of creating and checking electronic image certified by digital watermark

FIELD: information technology.

SUBSTANCE: binary sequence of a secret identification key and a binary sequence of a secret embedding key, a cryptographic function and several Fourier coefficients of the electronic image are pre-generated for the sender and the receiver. An electronic image certified by a digital watermark is created for the sender, for which the electronic image is divided into M units with pixel size n×n. An identifier for the m-th unit of the electronic image is created. The binary sequence of the digital watermark of the m-th unit of the electronic image is determined. The digital watermark is embedded into the m-th unit of the electronic image and operations for certifying units of the electronic image for the sender with the digital watermark are repeated until completion. The receiver is sent the electronic image certified with the digital watermark. Authenticity of the electronic image received by the receiver is checked.

EFFECT: invention increases security of an electronic image certified by a digital watermark from deliberate altering of the content of the image.

3 cl, 9 dwg

The invention relates to the field of telecommunications and information technologies, specifically to techniques for the protection of the authenticity of electronic images compressed using the compression algorithms of electronic images, such as JPEG, MPEG-2, etc. transmitted by the sender to the recipient over a public channel in which the intruder can perform actions on the imposition of the recipient false electronic images.

The claimed method can be used to ensure the authenticity of digital images transmitted in modern telecommunication systems.

Known methods of control of authenticity of electronic images based on the evaluation of the sender and test receiver kitasuminoe insert binary sequence of this image. These methods belong to the cryptographic control of authenticity of electronic images and is described, for example, in the state standard 28147-89. The information processing system. The cryptographic protection. The cryptographic transformation. - M: Gosstandart of the USSR. 1989, p.9-14. In these ways the electronic image consisting of the brightness values of the pixels by their concatenation is converted into a binary sequence of electronic images, which is shared by the sender on consecutive blocks of DL is Noah n bits, where usually n=64. Function encrypt using the pre-generated for the sender and recipient of the binary sequence of the secret key sequentially from each block based on the previous encrypted block is encrypted current block up until comes a binary sequence of electronic images. Of the last encrypted block allocate a binary sequence of length l<n bits, called kitasuminoe insert this image. Then electronic image itself and its emetasedimentary box is passed to communication channel or recorded on electronic media such as CD or DVD discs. Adopted by the recipient, an electronic image of the check, which again divide it by a binary sequence on consecutive received blocks of length n bits, the function of encoding using binary sequences secret key sequentially from each received block based on previous received encrypted block form another encrypted adopted to block until one arrives binary sequence of received electronic images. From the last received encrypted block allocate a length of l<n-bit binary sequence kitasuminoe insert a received image and on the nom match re-formed and adopted hamitosemitic inserts the received electronic image is considered genuine.

The disadvantages of such analogs are:

- relatively low resistance certified cryptographic kitasuminoe insert electronic image to the influence of errors of the transmission channel;

- reduction of bandwidth of transmission channels or the need to use a storage device large capacity due to the inclusion and subsequent transmission over the communication channel kitasuminoe insert electronic image.

There are also known methods of forming and verifying digitally watermarked electronic image using a hashing function. These methods are described, for example, in the patent of the Russian Federation 2258315, IPC^{7}H04L 9/20 from 10.08.05 and are in the preliminary formation of the sender and recipient of the binary sequence of the secret key and hash functions with binary output value. Set the minimum number of K_{min}genuine groups of binary sequences electronic image and the maximum value of the probability P_{Osh}erroneous selection of reference, corresponding to the first bit of the binary sequence of the digital watermark from the sender of the electronic image.

To authenticate the sender of the electronic image by using the hash function and a secret key read p is therefore the k-th, where k=1,2,...K bits of the binary sequence of the digital watermark, the binary sequence of the next reference electronic image and the binary sequence of the secret key. Hairout binary sequence of the next reference electronic image on hash functions and the binary sequence of the secret key and comparing the hash value with the k-th bit of the binary sequence of the digital watermark. When matching hash values with the k-th bit of the binary sequence of digital watermark is passed to the recipient of the binary sequence of the next reference electronic image as certified, and if not consistently transform the binary sequence of the next reference electronic image by changing the low-order bits, hachirou after every conversion, the converted binary sequence of the next reference electronic image on hash functions and the binary sequence of the secret key and comparing the hash value with the k-th bit of the binary sequence of digital watermark before their match. Then convey to the recipient the last converted binary sequence of the next reference electronic image as certified by the th.

After the transfer of the digitally watermarked electronic image extracted from the received binary sequence of the next timing electronic image count corresponding to the first bit of the binary sequence of the digital watermark from the sender electronic image, which hairout taken by the recipient of the binary sequence of the next timing electronic image on hash functions and the binary sequence of the secret key and compare consistently hashed values with the corresponding starting with the first, the values of the bits of the binary sequence of digital watermark before reaching M≥log_{2}P_{Osh}their matches in a row. Upon reaching M matches in a row take the first sample of K consecutive received binary sequence of the next timing electronic image corresponding to the first bit of the binary sequence of the digital watermark from the sender of the electronic image.

To verify the recipient of the authenticity of the received electronic image read sequentially K binary sequences of regular samples of the received electronic image and hachirou on hash functions and the binary sequence binary secret key PEFC is the regular sequences of samples of the received electronic image.
Compare the k-th hash value with the k-th bit of the binary sequence of the digital watermark, and calculates the number of K_{c}hashed binary sequences of the next timing electronic image of the K received samples, which coincided with the values of corresponding bits of the binary sequence of the digital watermark. When K_{c}≥K_{min}believe genuine K received binary sequence of the next timing electronic image, then repeat the steps for authentication of the next group of K received binary sequences ordinary times, electronic images, and the step of verifying that the recipient has received the electronic image is repeated until the completion of reception of all binary sequences of its regular times.

These methods are resistant to errors of the transmission channel on digitally watermarked electronic image.

The disadvantage of these methods is that their implementation is not monitored authentication of electronic images that are compressed using compression algorithms such as JPEG, MPEG-2, etc. This disadvantage of known methods of forming and verifying digitally watermarked electronic image due to the fact that embedding digital is th watermark is in the brightness values of the pixels of the electronic image, and when performing Fourier transform and quantization of Fourier coefficients in the compression process image digital watermark is distorted, which leads to the recognition of genuine adopted by the recipient of the digitally watermarked image.

The closest in technical essence to the claimed method of forming and verifying digitally watermarked electronic image is a method of generating and verifying digitally watermarked electronic image for U.S. patent 7280669, IPC^{8}G06K 9/00 from 09.10.07. The prototype method is forming and verifying digitally watermarked electronic image is in the preliminary formation of a binary sequence a secret key for the sender and recipient, cryptographic functions, the set of Fourier coefficients electronic images of pre-set of Fourier coefficients electronic image highlight belonging to the first frequency domain and belonging to the second frequency region and establish a threshold correlation value. Form the sender digitally watermarked electronic image, which is shared by the electronic image into M blocks, each of size n×n pixels, where n≥2, then form autentificat the R m-th block of the electronic image,
where m=1, 2,..., M, which encrypts the binary sequence of a secret key using a cryptographic function, form of encrypted binary sequence secret key binary sequence authenticator m-th block of the electronic image. Defined as a binary sequence of digital watermark m-th block of the electronic image authenticator m-th block of the electronic image and embed a digital watermark in the m-th block of the electronic image, which performs a Fourier transform on the brightness values of the pixels of the m-th block of the electronic image, form substituting the Fourier coecients of the m-th block of the electronic image of belonging to the first frequency domain of the Fourier coefficients of this block and the binary sequence a digital watermark, replacing belonging to the second frequency domain, the Fourier coefficients of the m-th block of the electronic image formed on replacing the Fourier coefficients of this block, perform inverse Fourier transform on the Fourier coefficients of this block and the converted m-th block of the electronic image is considered digitally watermarked m-th block of the electronic image. Steps to certification by the sender of the digital components of an electronic watermark from the images is repeated until the completion of their receipt.

Transfer to the recipient digitally watermarked electronic image, authenticates the received recipient of an electronic image, which divide the received electronic image into M blocks, each of size n×n pixels, and extracts the digital watermark from the m-th received block electronic image, which performs a Fourier transform on the brightness values of the pixels of the m-th received block electronic image and compute a binary sequence of digital watermark m-th received block electronic image of the Fourier coefficients belonging to the first and second frequency regions of the block. Then form the authenticator m-th received block electronic image, which encrypts the binary sequence of a secret key using a cryptographic function and form of the encrypted binary sequence secret key binary sequence authenticator m-th received block electronic image. Next, calculate the maximum value of the correlation between the binary sequences authenticator and a digital watermark m-th received block electronic image and consider genuine m-th received block electronic image if the maximum correlation value is not less than will precede the flax threshold correlation, then the steps for authentication later adopted components of an electronic image repeat until the end of their reception.

The prototype method is forming and verifying digitally watermarked electronic image provides control of the authenticity of an electronic image, compressed using compression algorithms such as JPEG, MPEG-2, etc.

The disadvantage of the closest analogue (prototype) is relatively low security, digitally watermarked electronic images from imposing a false electronic image of the offender is known at least one digitally watermarked electronic image. This is due to the fact that the offender for which the value of the binary sequence of the secret key is unknown, capable of m-th, where m=1, 2,..., M, the block of digitally watermarked electronic image to extract embedded in the digital watermark, and then embed the extracted digital watermark in the m-th block false electronic image, which checks the recipient will be mistakenly recognized as genuine. To extract embedded in the m-th block of digitally watermarked electronic image digital watermark intruder performs a Fourier transform on the values of brightness of the pixel is in this block, and as well as the receiver, calculates a binary sequence of digital watermark m-th block of the electronic image from the Fourier coefficients belonging to the first and second frequency regions of the block. Consequently, the offender is able without knowledge of the binary sequence of the secret key to extract the binary sequence a digital watermark from a certified electronic image and embed the extracted digital watermark in a false electronic image that the recipient will be considered as genuine.

The technical result of the proposed solutions is to increase the security of digitally watermarked electronic image from deliberate actions to change its content.

This technical result is achieved by the fact that in the known method of forming and verifying digitally watermarked electronic image, which consists in the preliminary formation of a binary sequence a secret key for the sender and recipient, cryptographic functions and the set of Fourier coefficients electronic image, form sender digitally watermarked electronic image, which is shared by the electronic image into M blocks, each of size n×n pixel is in, where n≥2, form authenticator m-th block of the electronic image, where m=1, 2,..., M, define a binary sequence of digital watermark m-th block of the electronic image, embed the digital watermark in the m-th block of the electronic image and actions according to the sender of the digital components of an electronic watermark image is repeated until the completion of their receipt, transmit to the recipient digitally watermarked electronic image, authenticates the received recipient of an electronic image, which extracts the digital watermark from the m-th received block electronic image and shape it the authenticator, and then the steps for authentication later adopted components of an electronic image repeat until the end of their reception, in addition pre-form the binary sequence of the secret authentication key and the binary sequence of the secret key embedding for the sender and recipient. Additionally, pre-formed from a first and a second function of the quantization function dekvantovanie, the set of quantized coefficients of a Fourier electronic image quantization by the first function of the quantization pre-formed of the Fourier coefficients of the electronic image, and notesto binary sequence code Huffman, corresponding to the generated set of quantized coefficients of a Fourier electronic image. Many binary sequences of code Huffman emit pairs of the binary sequence corresponding to a different unit of the quantized coefficients of the Fourier electronic image, and as cryptographic functions form the authentication function.

To generate authenticator m-th block of the electronic image quantuum the brightness of the pixels of this block on pre-formed second function of quantization, form a binary sequence of m-th block of the electronic image by concatenating the quantized luminance values of the pixels of that block, and the authenticator m-th block of the electronic image is formed by converting a binary sequence of this unit using the pre-formed functions of authentication and the binary sequence of the secret authentication key.

To determine the binary sequence of digital watermark m-th block of the electronic image by performing a Fourier transform on the brightness values of the pixels of the m-th block of the electronic image and quantum values of the Fourier coefficients of the m-th block of the electronic image by the pre-formed first is th function of quantization.
Then encode the quantized values of the Fourier coefficients of the m-th block of the electronic image by replacing predefined binary sequence code Huffman, extracted from the binary code sequences Huffman m-th block of the electronic image of the binary sequence matching with a binary sequence comprising one of the pre-formed pairs of binary sequences. The number of bits contained in the binary sequence of digital watermark m-th block of the electronic image is equal to the number of N_{1}allocated binary sequences Huffman code of this block. As a binary sequence of digital watermark m-th block of the electronic image by taking the first N_{1}bit of the binary sequence of its authenticator. For embedding a digital watermark in the m-th block of the electronic image consistently i-e, where i=1, 2,..., N_{1}bits of its binary sequence summed modulo 2 with the i-th bits of the binary sequence of the secret key embedding. At zero i-th aggregate value of i-th selected binary Huffman code sequence m-th block of the electronic images assured by replacing the first binary sequence pairs, otherwise PR the single i-th aggregate value of i-th selected binary Huffman code sequence m-th block of the electronic images assured by its replacement by the second binary sequence pairs.
The remaining binary sequence code Huffman m-th block of the electronic image consider a binary sequence code, Huffman, digitally watermarked m-th block of the electronic image without modification.

For authentication is received by a recipient electronic image emit binary sequence code Huffman its m-th block.

For extracting the digital watermark from the m-th received block electronic image extracted from its binary sequence code Huffman binary sequence matching with a binary sequence comprising one of the pre-formed pairs of binary sequences. The number of bits contained in the binary sequence of digital watermark m-th received block electronic image is equal to the number of N_{2}the selected binary sequences that block. If the selected binary sequences Huffman code this block, j-I, where j=1, 2,..., N_{2}the binary sequence is the first binary sequence pairs, then the j-th bit of the binary sequence of the secret key embedding summed modulo 2 with a zero binary value, otherwise it is summed modulo 2 with a single binary value. Binary consistently is th length of N_{
2}bit j-x summative values consider a digital watermark m-th received block electronic image. To generate authenticator m-th received block electronic image decode binary sequence code Huffman of this unit by replacing their predefined quantized coefficients Fourier electronic images will decanted the Fourier coecients of the m-th received block electronic images on pre-formed functions dekvantovanie perform inverse Fourier transform on decontaminati the Fourier coefficients of this block, quantuum the brightness values of the pixels of the m-th received block electronic images on pre-formed second function of quantization, form a binary sequence of this block by concatenating the quantized luminance values of the pixels of that block, and the authenticator m-th received block electronic image is formed by converting binary sequence of this unit using the pre-formed functions of authentication and the binary sequence of the secret authentication key. Next, the m-th received block electronic image is considered true if the binary sequence of digital watermark bit coincides with the first to N_{2} bits of the binary sequence of its authenticator.

Specified a new set of actions performed due to unpredictable for the offender according to the binary sequence of digital watermark m-th block of digitally watermarked electronic image from the brightness values of the pixels of this block and the binary sequence of the secret authentication key virtually eliminates the possibility of an attacker to generate a binary sequence of digital watermark to be embedded in a false electronic image that will be recognized by the recipient when it is evaluated true. When catching a perpetrator of one or more digitally watermarked digital images due to unpredictability for him according to the binary sequence of digital watermark m-th block of the certified electronic image from the values of the binary sequence of the secret key embedding he is not able to extract the embedded digital watermark to be embedded in a false electronic image. Therefore, this new set of actions will improve the security of digitally watermarked electronic image from deliberate actions to change its content.

The claimed method is illustrated by drawings on which is shown:

- figure 1 is a General diagram of the formation and verification of digitally watermarked electronic image;

- figure 2 - preliminary formation of many binary sequences Huffman code and its corresponding set of quantized coefficients of a Fourier electronic image;

- figure 3 - example of construction of the first function of quantization in tabular form;

- figure 4 is an example of a procedure of reading and numbering of the brightness values of the pixels of the m-th block of the electronic image;

- figure 5 - algorithm digitally watermarked electronic image;

- figure 6 - timing diagram of formation of a digitally watermarked image;

- figure 7 - algorithm authentication of the received electronic image;

on Fig - time diagrams authentication of the received electronic image;

- figure 9 is a graph showing the effect of the proposed method.

Consider the implementation of the method on the example of system development and validation certified digital watermark (DWM) electronic imaging (EI), including a processing unit digitally watermarked electronic image 1 and unit checks the received electronic image 2 (figure 1). The sender from the output of the shaping unit certified by the CSOs digital watermark electronic image 1 digitally watermarked using the secret key of the electronic image passes through the conduit 4 to the recipient. In the transmission channel 4 infringer using the catch block and imposing false electronic image 3 may be intercepting transmitted by the sender digitally watermarked image. The intruder tries to extract a digital watermark from a certified electronic image and the extracted digital watermark trying to embed in a false electronic image, after which the infringer false electronic image passes to the receiver via a transmission channel 4. The receiver checks the received electronic image performs block checking a received electronic image 2 using the secret key.

In the proposed method to ensure the formation and verification of digitally watermarked electronic image, which provides digitally watermarked image to the deliberate actions of the offender to change the content of this image, is implemented by the following sequence of actions.

Preliminary formation for the sender and recipient of the binary sequence of the secret authentication key and the binary sequence of the secret key embedding is as follows. The data sequence is formed by using a random generator and the pulses, generating random equiprobable zero and single pulses, independent of each other. Methods of forming the random selection of symbols binary sequences of the secret key is known and described, for example, in the book: Knut "the Art of computer programming on the computer". - M.: Mir, 1977, vol. 2, p.22. Length binary sequences secret key embedding and secret authentication key must be at least 64 bits, which is described, for example, in the book Mdeed, Dkent "the data encryption Standard: Past and future". TIER, 1988, - t, No. 5, p.45. An approximate form of the binary sequence of the secret key embedding (APS SLE) and the binary sequence of the secret authentication key (DP SKA) is shown in figures 2(a) and 2(b), respectively. Singular values of the bits in the figures is shown as a hatched pulses, zero bits in the form where there's no shading impulses.

The preliminary formation of the sender's and recipient's cryptographic functions in the function of the authentication is as follows. Known methods prior to the formation of the authentication feature is described, for example, in the book Mdeed, Dkent "the data encryption Standard: Past and future". TIER, 1988, - t, No. 5, p.49. They are in the formation of the features of authentication, using the algorithm sirova the ia DES data in feedback mode to text mode or output feedback. This encryption is performed on a binary sequence of unit electronic image, and the encryption key using a binary sequence of secret authentication key. These methods provide for the formation of each bit values generated by the function authentication authenticator block electronic images depending on each bit value of the binary sequence block electronic image and each bit value of the binary sequence of the secret authentication key.

Preliminary formation for the sender and recipient of the first and second functions of quantization, and dekvantovanie is the following. Known methods prior to forming the first function of the quantization described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str. The first function of the quantization described in matrix form. The quantization matrix is n×n coefficients, quantization, usually choose the size matrix size of 8×8, 16×16, and so the Value of each coefficient quantization is defined as a positive integer that divides the value of the corresponding Fourier coefficient block e picture is of when quantization, then the result of the division is rounded up to the nearest integer value. For example, the values of the quantization coefficients of the first quantization function of size 8×8 in accordance with the compression algorithm for digital images from the MPEG-2 described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str shown in figure 3.

Known ways of pre-forming functions dekvantovanie described, for example, in the book Arichards "Coding. H.264 and MPEG-4 standards of new generation". - M, Technosphere, 2005, str. Function dekvantovanie form as the inverse of the first function of quantization. Function dekvantovanie describe in a matrix form. Matrix dekvantovanie has a size of n×n coefficients dekvantovanie, each of which are equal to the corresponding coefficient quantization matrix of the first function of quantization. For functions dekvantovanie perform dekvantovanie quantized coefficients Fourier electronic image by multiplying them by the corresponding coefficient matrix dekvantovanie.

Known methods prior to forming the second function of the quantization described, for example, in the book Arichards "Coding. H.264 and MPEG-4 standards of new generation". - M, Technosphere, 2005, str. In the that the quantization function is defined as the act of replacing the brightness values quantumg pixel block of the electronic image to the nearest value of a set of values {0,
2^{k}, 2·2^{k+1}, 3·2^{k},..., 2^{l}-1}, where k<l, l is the number of binary bits of pixel intensity values, and the brightness of the pixels of the block of electronic images describe values in the range{0, 1, 2,..., 2^{l}-1}. For example, the set of values {0, 2^{k}, 2·2^{k+1}, 3·2^{k},..., 2^{l}-1}, where k=4 and l=8, presented in figure 2(b). All brightness values quantumg pixel block of the electronic image in the range of values 0,1,2,...,8 in their second quantization the quantization function will be replaced by the value 0. Accordingly, all brightness values in the range of values 9, 10, 11,..., 24 when they are quantized at a second quantization function will be replaced by the value 16, etc.

The preliminary formation of the sender and the recipient of many Fourier coefficients electronic image is as follows. Known methods prior to the formation of many Fourier coefficients electronic image is described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str-309. They are to perform, for example, the discrete Fourier transform on a block size of n×n pixels of the electronic image, which is formed by n×n values of the Fourier coefficients of this block. Performing the Fourier converting video over multiple blocks of pixels of the electronic image, get a nite set of Fourier coefficients electronic image. An approximate form of the Fourier coefficients of the electronic image (EF EI) is shown in figure 2(d). The Fourier coefficients of unit electronic images are numbered from the first to the (n×n)-th. The numbering of the Fourier coefficients of unit electronic image is described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str and for a block of size 8x8 is shown in figure 4.

Known methods prior to the formation of both the sender and the recipient of many of the quantized coefficients of the Fourier electronic image is described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str. The preliminary formation of the sender and the recipient of many of the quantized coefficients of the Fourier electronic image perform the quantization of Fourier coefficients electronic image from a previously generated set of pre-formed first function of quantization. For this value of the Fourier coefficients of the electronic image is divided by the corresponding coefficient quantization the first function of the quantization and the Affairs of the deposits are rounded to the nearest integer value. An approximate form of the quantized coefficients of the Fourier electronic image (CCF EI) is shown in figure 2(d). For example, the value 642 of the first Fourier coefficient of the electronic image is divided by the value 8 of the first coefficient quantization the first function of quantization. The result of dividingrounded up to the nearest integer value equal to 80.

The preliminary formation of the sender and the recipient of many binary sequences Huffman code corresponding to the generated set of quantized coefficients of a Fourier electronic images is as follows. Known methods prior to the formation of many binary sequences Huffman code corresponding to the generated set of quantized coefficients of a Fourier electronic images are described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, p.31. The essence of these methods is that for the more frequently occurring values of the quantized coefficients of the Fourier electronic images are assigned shorter binary sequence code Huffman. Example set of binary sequences of code Huffman (DP KX)corresponding to sformirovannost quantized coefficients Fourier electronic image, shown in figure 2(e). For example, the value of 80 quantized Fourier coefficient of the electronic image corresponds to the binary Huffman code sequences of the form 11...0, value : 79 quantized Fourier coefficient - binary Huffman code sequences of the form 11...1 and so on

Many binary sequences of code Huffman emit pairs of the binary sequence corresponding to a different unit of the quantized coefficients of the Fourier image. Choose a pair of quantized coefficients of a Fourier electronic images that differ by a single value, for example, 80 and 79, 23 and 22, etc. Corresponding binary sequence code Huffman form pairs. One of them appoint the first binary sequence pairs, the remaining second binary sequence pairs. For example, for the values of the quantized coefficients of the Fourier electronic image 80 and 79 set in accordance with a binary Huffman code sequences of the form 11...0 and 11...1, respectively, the first of which is defined as the first binary sequence pairs (figure 2(g)), the remainder as a second binary sequence pairs (figure 2(C)). For quantized Fourier coefficient of the electronic image may not be different per unit values of the quantized CoE is ficient Fourier. Then the corresponding quantized coefficient Fourier electronic image binary Huffman code sequence does not belong to the couple. For example, when the pre-formed first function of the quantization reflected in figure 3, for values 5 quantized Fourier coefficient of the electronic image (figure 2(g)) is not characterized by one the value of the quantized Fourier coefficient.

The algorithm of formation of digitally watermarked electronic image is presented on figure 5.

Known methods of separation of electronic images on M blocks each of size n×n pixels, where n≥2, are described, for example, in the book of J. Richardson "Coding. H.264 and MPEG-4 standards of new generation". - M.: Technosphere, 2005, p.38-40. The value of n is usually chosen multiple of 8, for example, 8×8, 16×16 pixels, etc. Of the electronic image, starting, for example, with its top left corner, allocate a matrix of pixels of size n rows and n columns, which forms an m-th, where m=1, 2,..., M, block e image. The separation of the electronic image in M blocks of fixed size allows to form the sender on the transmission and check the receiver for receiving a digitally watermarked electronic image of different size. An example of the brightness values of the pixels (JAP) Mat the Itza size n rows and n columns, which forms the m-th block electron image (BEI), shown in figure 6(C) when m=8, the numbering of which corresponds to the example in figure 4.

Known methods of quantization of the brightness of the pixels of the m-th block of the electronic image by the pre-formed second function of quantization are described, for example, in the book Arichards "Coding. H.264 and MPEG-4 standards of new generation". - M.: Technosphere, 2005, str. The quantization of the brightness of the pixels of the m-th block of the electronic image by the pre-formed second function of the quantization performed by replacing the brightness values quantumg pixel m-th block of the electronic image to the nearest quantized value of a set of values {0, 2^{k}, 2·2^{k+1}, 3·2^{k},..., 2^{l}-1}, where k<l. An example of quantization of the brightness of the pixels of the m-th block of the electronic image by the pre-formed second function of the quantization described in the figure 2(b), is shown in figure 6(d). Value 179 brightness of the first quantumg pixel m-th block of the electronic image is replaced by a quantized value is 176, which is represented by a binary sequence of 10...1, then the value 198 brightness of the second quantumg pixel is replaced by a quantized value is 192, which is represented by a binary sequence type 01...1 etc. Sample in the d quantized luminance values of pixels (CAP) m-th block of the electronic image is presented in figure 6(d).

Known methods of forming the binary sequence m-th block of the electronic image by concatenating the quantized luminance values of the pixels of this block are described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M.: Radio and communication, 1983, p.114-125. They are in sequential reading, from the first to the (n×n)-th binary sequences of quantized luminance values of the pixels of the m-th block of the electronic image in the serial register so that the next binary sequence of quantized intensity values were recorded close to the end of the previous binary sequence.

An approximate form of the binary sequence m-th block of the electronic image (GN m-th BI) is shown in figure 6(d).

Known methods of forming the authenticator m-th block of the electronic image by converting a binary sequence of this unit using the pre-formed functions of authentication and the binary sequence of the secret authentication key is described, for example, in the book Mdeed, Dkent "the data encryption Standard: Past and future". TIER, 1988, - t, No. 5, p.49. They are in the formation of the authenticator m-th block of the electronic image, ISOE is isua data encryption algorithm DES in feedback mode to text mode or output feedback. This encryption is performed on a binary sequence of m-th block of the electronic image, and the encryption key using a binary sequence of secret authentication key. An approximate form of the binary sequence of the secret authentication key (DP SKA) is shown in figure 6(b). These methods provide for the formation of each bit values generated by the function authentication authenticator m-th block of the electronic image according to each bit value of the binary sequence m-th block of the electronic image and each bit value of the binary sequence of the secret authentication key. Approximate type of authenticator m-th block of the electronic image (AUTM th BI) is shown in figure 6(e).

Known methods of performing Fourier transform on the brightness values of the pixels of the m-th block of the electronic image is described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str-309. They are to perform, for example, the discrete Fourier transform on a block size of n×n pixels of the electronic image, which is formed by n×n values of the Fourier coefficients of this block. An outline of the step is icients Fourier m-th block of the electronic image (KF m-th BI) is shown in figure 6(g).

Known methods of quantization values of the Fourier coefficients of the m-th block of the electronic image by the pre-formed first function of quantization are described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str. The values of the Fourier coefficients of the m-th block of the electronic image quantuum by the first function of the quantization them by dividing by the value of the corresponding coefficient quantization its matrix quantization and rounding the result of the division to the nearest integer value. An approximate form of the quantized coefficients of the Fourier m-th block of the electronic image (CCF m-th BI) is shown in figure 6(C).

Known methods of encoding quantized values of the Fourier coefficients of the m-th block of the electronic image by replacing predefined binary Huffman code sequences are described, for example, in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, p.31-34. Starting from the quantized value of the first Fourier coefficient of m-th block of the electronic image to the last, the next is identify with the value of the pre-generated set of quantized to the of fficient Fourier electronic image and the identified value is substituted to the preset corresponding binary Huffman code sequence. An approximate form of binary code sequences Huffman m-th block of the electronic image (BF CH m-th BI) is shown in figure 6(and).

Known methods of allocation of a binary sequence code, Huffman m-th block of the electronic image binary sequences, matching with a binary sequence comprising one of the pre-formed pairs of binary sequences, are described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M, Radio and communications, 1983, str-183. They consist in the comparison of the binary sequence code Huffman m-th block of the electronic image with all binary sequences belonging to one of the pre-formed pairs of binary sequences. When revealing the identity of the compared binary sequences a binary Huffman code sequence m-th block of the electronic image is considered selected. An outline of the selected binary sequence code Huffman m-th block of the electronic image (1-I private. DP HH and so on) is shown in figure 6(and). It is shown that among binary sequence code Huffman m-th block of the electronic image is not all binary sequences are selected.

Count the number of N_{1
the selected binary sequence code Huffman m-th block of the electronic image. Known methods of counting the number of N1the selected binary sequence code Huffman m-th block of the electronic image using counters are described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M, Radio and communications, 1983, str-130. The number of bits contained in the binary sequence of digital watermark m-th block of the electronic image is equal to N1.}

Known methods of adoption as a binary sequence of digital watermark m-th block of the electronic image of the first N_{1}bit of the binary sequence of its authenticator is described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M, Radio and communications, 1983, str-130. To do this in a binary sequence of digital watermark m-th block of the electronic image write the first N_{1}bit of the binary sequence of its authenticator, and the remaining bits of the binary sequence drop. An approximate form of the binary sequence of digital watermark m-th block of the electronic image (DP CEH m-th BI) is shown in figure 6(K).

Known the ways of the sequential summation modulo 2 i-x,
where i=1, 2,..., N_{1}, bits of the binary sequence of digital watermark m-th block of the electronic image with the i-th bits of the binary sequence of the secret key embedding described, for example, in the book Baselabel "Microprocessors and their application in transmission systems and signal processing". - M.: Radio and communication, 1988, p.10. The i-x summarizes the values of the m-th block of the electronic image (i-e NW m-th BI) is shown in figure 6(l). For example, a single value of the first bit of the binary sequence of the secret key embedding summed modulo 2 with a unit value of the first bit of the binary sequence of digital watermark m-th block of the electronic image with the formation of zero values. An approximate form of the binary sequence of the secret key embedding (APS SLE) is shown in figure 6(a).

Known methods of certification of the i-th selected binary sequence code Huffman m-th block of the electronic image at zero i-m summarizes the value of this unit by replacing the first binary sequence pairs, or when a single i-m summarizes the value of this unit by replacing the second binary sequence pairs is described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M, RA is IO and communication, 1983, str-140. To do this, in the memory cell with a zero address record first binary sequence pairs, and a memory cell with a single address record second binary sequence of this pair. When using the i-th sum of the values of the m-th block of the electronic image as the value of the address memory cells of the selected cell is read, the desired binary sequence pairs. An approximate form certified by a selected binary code sequences Huffman m-th block of the electronic image (Disconn. private. BF CH m-th BI) is shown in figure 6(m). For the first selected binary sequence code Huffman m-th block of the electronic image of the form 11...1 calculated zero first summed value. Therefore, this selected binary sequence is replaced by the first binary sequence pairs, that is, the binary sequence of the form 11...0, which is certified.

The remaining binary sequence code Huffman m-th block of the electronic image consider a binary sequence code, Huffman, digitally watermarked m-th block of the electronic image without modification. These methods are described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M Radio and communication, 1983, str-140. For this purpose registers binary sequence code Huffman, digitally watermarked m-th block of the electronic image, record the rest of the binary sequence code Huffman m-th block of the electronic image.

An approximate form of binary code sequences Huffman, digitally watermarked m-th block of the electronic image (DP CH Completed. CEH m-th BI), is shown in figure 6(h).

Known methods of transmission to the recipient digitally watermarked electronic image is described, for example, in the book: Agua, DSI, Mevaseret, Limping "Theory of signal transmission". - M.: Radio and communication, 1986, page 11.

The algorithm authentication of the received electronic image is presented in figure 7.

Known methods of selection binary sequence code Huffman m-th received block electronic image is described, for example, in the book: Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, p.31-34. A Huffman code is a prefix code, for which always possibly adopted by the recipient of the binary sequence to separate from one another binary sequence code Huffman received neighboring blocks electronic images and additional n is x to correctly identify the binary sequence code Huffman m-th received block electronic image. An approximate form of binary code sequences Huffman m-th received block electronic image (BF CH m-th Ave. BI) is shown in figure 8(a).

Known methods of allocation of a binary sequence code, Huffman m-th received block electronic image binary sequences, matching with a binary sequence comprising one of the pre-formed pairs of binary sequences, are described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M, Radio and communications, 1983, str-183. They consist in the comparison of the binary sequence code Huffman m-th received block electronic image with all binary sequences belonging to one of the pre-formed pairs of binary sequences. When revealing the identity of the compared binary sequences a binary Huffman code sequence m-th received block electronic image receiver accepts as selected. An outline of the selected binary sequence code Huffman m-th received block electronic images (Part. BF CH m-th Ave. BI) is shown in figure 8(b). It is shown that among binary sequence code Huffman m-th received block electronic image floor is the switch not all binary sequences accepts selection.

Count the number of N_{2}the selected binary sequence code Huffman m-th received block electronic image. Known methods of counting the number of N_{2}the selected binary sequence code Huffman m-th received block electronic image using counters are described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M, Radio and communications, 1983, str-130. The number of bits contained in the binary sequence of digital watermark m-th received block electronic image is equal to N_{2}.

If the selected binary sequence code Huffman m-th received block electronic image j-I, where j=1, 2,..., N_{2}the binary sequence is the first binary sequence pairs, then the j-th bit of the binary sequence of the secret key embedding summed modulo 2 with a zero binary value, otherwise it is summed modulo 2 with a single binary value. Known methods of identification among the selected binary sequence code Huffman m-th received block electronic image j, where j=1, 2,..., N_{2}the binary sequence, which is the first or the second binary sequence pairs is described, for example, in Soi is e Asikari,
Alebedev microelectronic device design and processing of complex signals. - M, Radio and communications, 1983, str-183. They consist in the comparison of the selected binary sequence code Huffman m-th received block electronic image with the j-th (where j=1, 2,..., N_{2}the binary sequence, which is the first or the second binary sequence pairs. For example, in figure 8(b) shows that the first and fourth selected binary sequence code Huffman m-th received block electronic images are the first binary sequence pair, the second and third selected binary sequences are second binary sequence pairs, etc.

Known methods of summation modulo 2 of the j-th bit of the binary

the sequence of the secret key embedding with zero or single binary value is described, for example, in the book Baselabel "Microprocessors and their application in transmission systems and signal processing". - M.: Radio and communication, 1988, p.10. An approximate form of the binary sequence of the secret key embedding (APS SLE) is shown in figure 8(b), and a binary sequence of length N_{2}bit j-x summative values (DP j-x Sz) are shown in figure 8(d). For example, the first bit of the binary sequence j's summed values takes a single the ranks is the result of the summation of the individual values of the first bit of the binary sequence of the secret key embedding and zero binary values.

Binary sequence of length N_{2}bit j-x summative values consider a digital watermark m-th received block electronic image. There are ways to perform this action are described, for example, in the book Baselabel "Microprocessors and their application in transmission systems and signal processing". - M.: Radio and communication, 1988, p.10 and are writing binary sequence of length N_{2}bit j-x summative values as binary values of a digital watermark m-th received block electronic image. View binary sequence of digital watermark m-th received block electronic image (DP CEH m-th Ave. BI) is shown in figure 8(d).

Known methods for decoding binary sequence code Huffman m-th received block of electronic images by replacing their predefined quantized coefficients Fourier electronic image is described, for example, in the book: Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, p.31-34. Starting from the first to the last decoded value of the binary sequence code Huffman m-th received block electronic image, another is identified with the value of s is part formed of multiple binary sequences Huffman code and the identified value is replaced with the preset corresponding quantized coefficient Fourier electronic image. An approximate form of the quantized coefficients of the Fourier m-th received block electronic image (CCF m-th Ave. BI) is shown in figure 8(e).

Known methods of dekvantovanie of the Fourier coefficients of the m-th received block electronic images on pre-formed functions dekvantovanie described, for example, in the book Arichards "Coding. H.264 and MPEG-4 standards of new generation". - M, Technosphere, 2005, str. The quantized values of the Fourier coefficients of the m-th received block electronic image will decanted function for dekvantovanie their multiplication by the value of the corresponding coefficient quantization its quantization matrix. Example devastovanych of the Fourier coefficients of the m-th received block electronic image (Dec. KF m-th Ave. BI) is shown in figure 8(f). For example, a value of 80 first decanting Fourier coefficient of m-th received block electronic image is multiplied by the value 8 of the corresponding coefficient quantization quantization matrix, presented in figure 3. In the end, the first dekvantovanie the Fourier coefficient of the m-th received block electronic image takes a value of 640.

Known methods of performing inverse Fourier transform on decontaminati the Fourier coefficients of the m-th received block electronic image is described, for example, in the book Data is h, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str-308. As a result of performing the inverse Fourier transform over decontaminati the Fourier coefficients of the m-th received block electronic image form the brightness values of the pixels of this block (YAP m-th Ave. BI), an outline of which is shown in figure 8(C). It is seen that the brightness values of the pixels of the m-th received block of the electronic image and the brightness values of the pixels of the m-th block of the electronic image are different, but the differences are almost imperceptible to the human visual system secondary electron image.

Known methods of quantization of the brightness values of the pixels of the m-th received block electronic images on pre-formed second function of quantization are described, for example, in the book Arichards "Coding. H.264 and MPEG-4 standards of new generation". - M, Technosphere, 2002, str. The quantization of the brightness of the pixels on the second function of the quantization performed by replacing the brightness values quantumg pixel m-th received block electronic image on the nearest quantized value of a set of values {0, 2^{k}, 2·2^{k+1}, 3·2^{k},..., 2^{l}-1}, where k<l. An example of quantization of the brightness of the pixels of the m-th received block electronegativity (CAP m-th Ave.
BI) on pre-formed second function of the quantization described in the figure 2(b), shown in figure 8(and). Quantized value 176 brightness of the first quantumg pixel m-th block of the electronic image represented by a binary sequence of 10...1, the quantized value 192 brightness of the second quantumg pixel m-th block of the electronic image represented by a binary sequence type 01...1 etc.

Known methods of forming the binary sequence m-th received block electronic image by concatenating the quantized luminance values of the pixels of this block are described, for example, in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M, Radio and communications, 1983, p.114-125. They are in sequential reading, from the first to the (n×n)-th binary sequences of quantized luminance values of the pixels of the m-th received block electronic image in the serial register so that the next binary sequence of quantized intensity values were recorded close to the end of the previous binary sequence. An approximate form of the binary sequence m-th received block electronic image (GN m-th Ave. BI) is shown in figure 8(C).

Known methods of forming the AU is edificator m-th received block electronic image by converting a binary sequence of this unit using the pre-formed functions of authentication and the binary sequence secret key authentication is described, for example, in the book Mdeed, Dkent "the data encryption Standard: Past and future". TIER, 1988, - t, No. 5, p.49. They are in the formation of the authenticator m-th received block electronic image in the form of data encryption algorithm DES in feedback mode to text mode or output feedback. The encryption-key algorithm DES data encryption using binary sequence of secret authentication key, and as encrypted data - binary sequence m-th received block electronic image. An approximate form of the binary sequence of the secret authentication key (DP SKA) is shown in figure 8(l), and view the generated authenticator m-th received block electronic image Out. m-th Ave. BI) is shown in figure 8(m).

Next, the m-th received block electronic image is considered true if the binary sequence of digital watermark bit coincides with the first to N_{2}bits of the binary sequence of its authenticator. Known methods for determining the bit matches the binary sequence of digital watermark m-th received block of the electronic image and the first N_{2}bit of the binary sequence of its authenticator described, n is the sample,
in the book Asikari, Alebedev microelectronic device design and processing of complex signals. - M, Radio and communications, 1983, str-183. They consist in the comparison of binary sequences using a digital comparator that generates a control signal only when the full coincidence of the compared binary sequences.

Verification of theoretical assumptions of the claimed method of forming and verifying digitally watermarked image was checked by analytical studies.

The probability P_{stills}making genuine m-th block of the false electronic image formed by the offender without the knowledge of the binary sequence of the secret key embedding and the binary sequence of the secret authentication key, is. The figure 9 shows the dependence of the P_{stills}from the values of N_{1}. It is seen that with increasing values of N_{1}a value of P_{stills}quickly decreases. In information-telecommunication systems, transmission of electronic images should be R_{stills}≤R_{SS}where R_{SS}allowable probability of acceptance by the recipient as genuine a false electronic image. Usually the value of P_{SS}is set equal to 10^{-9}that rekomenduu the Xia,
for example, in the state standard 28147-89. The information processing system. The cryptographic protection. The cryptographic transformation. - M.: state standard of the USSR. 1989, p.9-14. From figure 9 it is seen that the condition R_{stills}≤R_{SS}=10^{-9}occurs when the value of N_{1}≥32, which, as a rule, is performed for blocks of electronic images of size 8×8 pixels or more, as described, for example, in the book in the book Datalen, Aretuska, Mcmorrow, Vukin "Methods of data compression. The device archiver, compression of images and video". - M, DIALOG-MIFI, 2002, str.

The complexity of computing the offender digital watermark to be embedded in a false electronic image that can be recognized by the recipient when it is evaluated true, is estimated at not less than 10^{20}...10^{30}computing operations, as described in the book the Iron I.N. Authentication voice messages and images in the communication channels. / Under the editorship of Prof. Wranovics. - Publishing house of St. Petersburg state Polytechnic University, 2006, str-329. The calculation of this complexity, it is almost impossible for the offender at the modern level of development of computer technology.

Studies show that using the proposed method of generating and verifying digitally watermarked e is zobrazenie enhances the security of the electronic image, certified digital watermark, from the deliberate actions of the offender to change its content.

1. Method of generating and verifying digitally watermarked electronic image, namely, that the pre-form for the sender and recipient of a binary sequence a secret key, an encryption function and a set of Fourier coefficients electronic image, form sender digitally watermarked electronic image, which is shared by the electronic image into M blocks each of size n×n pixels, where n≥2, form authenticator m-th block of the electronic image, where m=1,2,...,M, define a binary sequence of digital watermark m-th block of the electronic image, embed the digital watermark the sign in the m-th block of the electronic image and actions according to the sender of the digital components of an electronic watermark image is repeated until the completion of their receipt, transmit to the recipient digitally watermarked electronic image, authenticates the received recipient of an electronic image, which extracts the digital watermark from the m-th received block electronic image and shape it authenticator, and then the steps for authentication, the placenta is participating accepted components of an electronic image repeat until the end of their reception,
characterized in that it further pre-form the binary sequence of the secret authentication key and the binary sequence of the secret key embedding for the sender and the recipient, the first and second functions of quantization, the function dekvantovanie, the set of quantized coefficients of a Fourier electronic image quantization by the first quantization function pre-built Fourier coefficients electronic images, as well as many binary sequences Huffman code corresponding to the generated set of quantized coefficients of a Fourier electronic image from the set of binary sequences of code Huffman emit pairs of the binary sequence corresponding to a different unit of the quantized coefficients of the Fourier electronic image, and as cryptographic functions form the authentication function, to determine the binary a sequence of digital watermark m-th block of the electronic image by performing a Fourier transform on the brightness values of the pixels of the m-th block of the electronic image and quantum values of the Fourier coefficients of the m-th block of the electronic image by the pre-formed first function of quantization, then encode the values of the quantum is tion of the Fourier coefficients of the m-th block of the electronic image by replacing predefined binary sequence code Huffman,
extracted from the binary code sequences Huffman m-th block of the electronic image of the binary sequence matching with a binary sequence comprising one of the pre-formed pairs of binary sequences, the number of bits contained in the binary sequence of digital watermark m-th block of the electronic image is equal to the number of N_{1}the selected binary sequences Huffman code of this block as a binary sequence of digital watermark m-th block of the electronic image by taking the first N_{1}bit of the binary sequence of its authenticator, for embedding a digital watermark in the m-th block of the electronic image consistently i-e, where i=1,2,...,N_{1}bits of its binary sequence summed modulo 2 with the i-th bits of the binary sequence of the secret key embedding, if zero i-th aggregate value of i-th selected binary Huffman code sequence m-th block of the electronic images assured by replacing the first binary sequence pairs, otherwise the single i-th aggregate value of i-th selected binary Huffman code sequence m-th block of the electronic images assured by its replacement by the second binary posledovatel is of its pair,
the remaining binary sequence code Huffman m-th block of the electronic image consider a binary sequence code Huffman digitally watermarked m-th block of the electronic image without modification, for authentication is received by a recipient electronic image emit binary sequence code Huffman its m-th block, for extracting a digital watermark from the m-th received block electronic image extracted from its binary sequence code Huffman binary sequence matching with a binary sequence comprising one of the pre-formed pairs of binary sequences, the number of bits contained in the binary sequence of digital watermark m-th received unit electronic image is equal to the number of N_{2}the selected binary sequences of this block, if the selected binary sequences Huffman code this block, j-I, where j=1,2,...,N_{2}the binary sequence is the first binary sequence pairs, then the j-th bit of the binary sequence of the secret key embedding summed modulo 2 with a zero binary value, otherwise it is summed modulo 2 with a single binary value, the binary sequence N_{
2}bit j-x summative values consider a digital watermark m-th received block electronic image, the m-th received block electronic image is considered true if the binary sequence of digital watermark bit coincides with the first to N_{2}bits of the binary sequence of its authenticator.

2. The method according to claim 1, characterized in that for forming the authenticator m-th block of the electronic image quantuum the brightness of the pixels of this block on pre-formed second function of quantization, form a binary sequence of m-th block of the electronic image by concatenating the quantized luminance values of the pixels of that block, and the authenticator m-th block of the electronic image is formed by converting a binary sequence of this unit using the pre-formed functions of authentication and the binary sequence of the secret authentication key.

3. The method according to claim 1, characterized in that for forming the authenticator m-th received block electronic image decode binary sequence code Huffman of this unit by replacing their predefined quantized coefficients Fourier electronic images will decanted the Fourier coecients of the m-th received block e is in the image previously formed features dekvantovanie, perform inverse Fourier transform on decontaminati the Fourier coefficients of this block, quantuum the brightness values of the pixels of the m-th received block electronic images on pre-formed second function of quantization, form a binary sequence of this block by concatenating the quantized luminance values of the pixels of that block, and the authenticator m-th received block electronic image is formed by converting a binary sequence of this unit using the pre-formed functions of authentication and the binary sequence of the secret authentication key.

**Same patents:**

FIELD: physics, communications.

SUBSTANCE: invention relates to a method and a device for encryption in a mobile broadcast system. The technical result is achieved due to that in a mobile broadcast system, BCAST service subscription management (BSM) manages terminal subscriber information and sends a first delivery message for BCAST service distribution/adaptation (BSD/A), where the said message contains registration key material (RKM) for registering the broadcast service for the terminal, and also at least one service or content identifier. BSD/A sends a first message to BSM for confirming delivery, where the said message contains information indicating success/failure of receiving the first delivery message, and sends the RKM to the terminal.

EFFECT: increased efficiency of encrypting transmitted content.

21 cl, 18 dwg, 7 tbl

FIELD: engineering of systems for protecting communication channels, which realize claimed method for user authentication on basis of biometric data by means of provision and extraction of cryptographic key and user authentication.

SUBSTANCE: in accordance to the invention, neither biometric template nor cryptographic user key are explicitly represented in information storage device, without provision of biometric sample and information storage device with a pack stored on it, any cryptographic operations with data are impossible.

EFFECT: creation of biometric access system and method for provision/extraction of cryptographic key and user authentication on basis of biometry, increased key secrecy level, increased reliability, expanded functional capabilities and simplified system creation process.

2 cl, 2 dwg

FIELD: automatics and computer science, in particular, identification means for controlling access to autonomous resources.

SUBSTANCE: method includes changing identification information during each new query of autonomous resource, which information is used for identification of carrier during following queries to autonomous resources, by including it in algorithmically converted form on information carrier and in database of central device and checking of its correspondence in a row of previous queries to autonomous resources. Each autonomous resource has memory block for storing conversion algorithms and signs of these algorithms and block for reading/recording carrier information. Central device contains at appropriate data bank addresses the virtual memory blocks for storing information for identification of carriers and memory block for storing a set of algorithms for converting code from one type to another and signs of these algorithms, and for each carrier - information storage address which was used during previous accesses. Carrier contains energy-independent additional memory block for recording, storing and reading additional information code after identification of carrier, available both during manufacture of carrier and its submission to autonomous resource.

EFFECT: increased level of protection from unsanctioned access.

3 cl, 1 dwg

FIELD: engineering of methods for cryptographic transformation of data, possible use in communication, computer and informational systems for cryptographic encryption of information and computation of numbers close to random.

SUBSTANCE: device contains two memory blocks, current time moment timer, two concatenation blocks, two hash-function computation blocks, operation block, computing block.

EFFECT: increased complexity of encryption analysis and decreased probability of reliable prediction of next values of pseudo-random series bits while increasing operation speed of generator.

1 dwg

FIELD: information technologies.

SUBSTANCE: method of data compression is realised with the help of coder. The first unit of coder memory stores preliminarily recorded code combinations (CC_{1}) with number of digits n, where n = 2, 3, 4…, representing a complete set of possible inlet code combinations (CC). The second unit of coder memory stores preliminarily recorded code combinations CC_{2}, which definitely comply with CC_{1} with number of digits that is less or equal to the number of CC_{1}. Input flow of data is separated into CC with identical number of digits n. CC is serially entered into coder, identified, by means of comparison to CC_{1}, presented by according output code combination CC_{2}. CC_{2} present a sequence of groups with identical number of digits n in each one. Combined number of code combinations CC_{2} is m^{n}, where m = 2, 3, 4…, n = 1, 2, 3…. Number of subsequent groups CC_{2} is identified as m^{n-1}, m^{n-2}…. Number of digits of CC_{2} in group is leveled by addition of a nonsignificant zero prior to code combination.

EFFECT: simplicity of realisation, improved speed of coding, reduction of time for data transfer along channel of communication, compression of transmitted signals spectrum width, improved noise immunity of transmission, provision of transmitted or stored information security.

2 cl, 1 dwg, 5 tbl, 5 ex

FIELD: physics, computer engineering.

SUBSTANCE: invention is related to coding of parametres without losses, and in particular to generation and usage of coding rule for efficient compression of parametres. The present invention is based on conclusion that parametres including the first set of parameters of initial signal first part representation and including the second set of parametres of initial signal second part representation, may be efficiently coded, when parametres are arranged in the first sequence of tuples and the second sequence of tuples, besides the first sequence of tuples comprises tuples of parametres having two parametres from single part of initial signal, and moreover, the second sequence of tuples comprises tuples of parametres having one parametre from the first part and one parametre from the second part of initial signal. Efficient coding may be achieved with the help of bit estimation unit in order to assess required number of bits to code the first and second sequence of tuples, besides only sequence of tuples is coded, which results in reduced number of bits.

EFFECT: improved accuracy of coding.

33 cl, 5 dwg

FIELD: methods and devices for additional data insertion in and extraction from audio signals.

SUBSTANCE: proposed procedure for inserting additional data such as watermarks in audio signals and extracting them from compressed audio signal involves separation of audio signal during insertion of additional data into frames, generation of set of prediction filtration factor for each frame, prediction coding of each frame using mentioned coefficients, and for inserting additional data at least one of chosen filtration factors is adjusted to equal value of these additional data. In this way any impact on bit transfer speed is made absolutely impossible.

EFFECT: provision for reading additional data without decoding entire audio signal or impairing quality of music.

7 cl, 3 dwg, 3 tbl

FIELD: information technology.

SUBSTANCE: invention discloses a method of ensuring quality of a sample carrier in relation to analysis of the sample in a sample carrier in an analysis device for extracorporal diagnosis. The sample carrier has a mark for confirming compatibility of the sample carrier with the analysis device. The method involves putting the sample carrier into an image creation position in the analysis device, obtaining an image of the sample carrier and analysis of the obtained image in order to detect appearance of the mark so as to authenticate the sample carrier. If identified as authentic, the sample carrier is confirmed for use in the analysis device and the analysis device can analyse the sample in the sample carrier. Analysis involves irradiation of the sample by passing electromagnetic radiation through the sample carrier.

EFFECT: more reliable analysis.

8 cl, 3 dwg

FIELD: information technology.

SUBSTANCE: face of a presenter at a conference or negotiations is automatically shown and facial images of each presenter are stored in a face database. A time scale is created for graphical identification of presenters when playing back the recorded conference. A facial image, for example is provided instead of general identification of each presenter in the time scale for identification of each presenter associated with the time scale.

EFFECT: matching the time scale of participation of a presenter at a video conference with parametres of the presenter.

32 cl, 6 dwg

FIELD: information technology.

SUBSTANCE: tree structure which is a result of syntax analysis of electronic ink is created. The tree structure contains one or more grids representing this tree structure on the level of a paragraph unit, line unit, sentence unit and/or list unit. The grid includes columns and each column includes word alternatives associated with the corresponding unit and which represents alternative identification results. A request is sent to the tree structure to obtain alternative identification results, where the request gives one or more units in the tree structure. Alternative identification results are received from the units in the units in the tree structure.

EFFECT: invention provides alternatives relating to complex presentation of electronic ink beyond a single line of the electronic ink.

20 cl, 34 dwg

FIELD: medicine.

SUBSTANCE: invention relates to devices for ridge pattern recording and can be used in access limitation systems. The device comprises a base with a main rule of temperature-sensitive elements mounted on it, located across the direction of motion of a finger and electrically connected to the block of image processing. On the base two additional rules of temperature-sensitive elements are placed, connected to the block of image processing, which longitudinal axes lie in the same plane perpendicular to the direction of motion of a finger at scanning, and shifted relative to the base rule of temperature-sensitive elements along the direction of movement of a finger. At projection of rules of temperature-sensitive elements to the plane perpendicular to the direction of the finger motion, each of the additional rules of temperature-sensitive elements intersect with one its end with the end of the main rule of temperature-sensitive elements, forming in the projection three sides of isosceles trapezoid, with the part of the projection of the main rule of temperature-sensitive elements between the points of intersection is a smaller base of the trapezoid and the sections of the projections of additional rules of temperature-sensitive elements are the lateral sides. Parts of the rules from the points of intersection of the projections to their nearest ends are not less than 0.5 mm.

EFFECT: use of the invention provides a more complete picture of a finger pattern.

4 cl, 2 dwg

FIELD: medicine.

SUBSTANCE: for diagnostics of predisposition to diabetes mellitus of the first type of the open palms are scanned together with fingers of the left and right hands (LH, RH) with a digital photocamera with high resolution ability or with a special scanner, made to order. Digital images are transmitted to a personal computer. The fingerprint of the distal phalanges and dermatoglyphic topography traits of palmar patterns are evaluated. When the diagnostics the following are recorded on the phalanges: the nature of patterns, ridge account; on palms: ridge account, value of the angle atd, the direction of the main palmar lines A, B, C and D in the palm field, the character of patterns on the thenar, hypothenar and interdigital fields, width and type of location of palmar lines, location of the palmar and axial threeradiuses. Interpretation of dermatoglyphic signs is carried in accordance with internationally accepted classification. Lifting of fingers and palmar prints is produced by printer's ink on paper and then they are scanned. Each dermatoglyphic sign a weight factor is assigned. If the sum of the coefficients is > 3.0 the risk is the greatest and the likelihood of disease is > 0.9. If the sum of the coefficients is ≤0.44 the risk is minimal and the probability of disease is <0.1.

EFFECT: method is simple, economical, noninvasive, requires no expensive equipment and reagents.

6 cl, 3 dwg, 1 tbl

FIELD: information technology.

SUBSTANCE: when processing an electronic image of a ridge pattern, the said image undergoes binarisation through filtration, joining false discontinuities on the image, removal of false lime merging and levelling pixels of the electronic image relative a given pixel intensity threshold, after which the skeleton of the binary electronic image is formed by thinning its lines to given thickness. After determination of munitia coordinates on the skeleton of the ridge pattern, their centre of mass is calculated. In order to define arguments of the biometrical code function, cores of the ridge pattern are isolated, for which distance from the centre of mass is calculated for each munitia. The core is the munitia with the shortest distance from the centre of mass. A tree is constructed from each core to the rest of the munitia. The length of the branches of each tree is calculated and the values are graded. Munitia concentration arguments are calculated and the values are used to form the biometrical code of the ridge pattern.

EFFECT: more reliable fingerprint biometrical code, reduced number of operations when comparing codes and formation of the code taking into account increase in probability of occurrence of false munitia moving from the centre of the fingerprint image.

9 cl, 9 dwg