EA044941B1 - METHOD FOR ENCODING AND DECODING DIGITAL INFORMATION IN THE FORM OF MULTIDIMENSIONAL NANOBAR CODE - Google Patents

Description

The invention relates to a method for encoding/decoding and recording (representing) digital or physical data converted into digital form, as well as the formation of optically readable multi-color codes, which are a family of layers of binary-coded data, and forming placed on a two-dimensional matrix and forming, thus Thus, a template for posting information. Each multi-color code layer is a code representing binary-encoded data arranged on a two-dimensional matrix. The generated family of layers, which is a three-dimensional object, is processed by special compression or overlay algorithms, and a two-dimensional object is formed - a code containing many colored cells and located on a two-dimensional area - a matrix.

The proposed invention can find application in the field of product marking, increasing the information capacity of two-dimensional codes, identification and application, transmission and reading of large volumes of digital information.

The current black and white barcode is very widely used to record digital information that is read by a device in a small space, such as a printed document. However, such a black and white barcode has significant disadvantages. One problem is that it is difficult to record information that includes large amounts of data, such as verbose documents or small images.

To solve this problem, the use of color barcodes has recently been proposed. A color barcode can record much more information than a black and white barcode because a black and white barcode can record information in binary form, whereas a color barcode with multiple colors (palette) can record information using multi-valued records.

Various systems and devices for protecting and transmitting information are known.

There is a known method for encoding a code image (RF patent No. 2251734 IPC G06K 19/06037, priority date 05/09/2000, publication date 06/20/2004). The method includes encoding data in the form of a code, using a cell layout with different colors, shapes or configurations. Its use makes it possible to obtain a technical result in the form of providing the ability to encode more diverse and voluminous information. This result is achieved due to the fact that the method includes the following steps: generating a code conversion table, setting the required data, encoding the required data, determining the parity check area and obtaining an image in the form of a physical or electronic code. Devices for generating and decoding color codes have also been proposed.

Known patents are Color Barcode Producing, Reading and/or Reproducing Method and Apparatus, (US patent No. 2008179407, IPC G06K 9/06, priority date 06/28/2004, publication date 07/31/2008), and Color Barcode Producing Method and Apparatus, Color Barcode Reading Method and Apparatus and Color Barcode Reproducing Method and Apparatus, (US patent No. 2009194592, IPC G06K 9/06, priority date 08/09/2004, publication date 08/06/2009), allowing the generation of two-dimensional color matrix barcodes. The proposed color bars make it possible to record a much larger amount of information than binary matrix ones. The proposed inventions provide a device and method for preserving the integrity of color reproduction and color rendering of a barcode. This condition is achieved by compiling reference tables for the color portion of a color barcode, including references to the cell color, color palette tables that are used as barcode color data, and for a device and method for generating, reproducing and reading a barcode of that color.

A known method and device for encoding/decoding a physical or electronic code image (RF patent No. 2349957, IPC G06K 19/06, priority date 03/26/2005, publication date 03/20/2009). A machine-readable medium with a mixed code written on it is proposed, which includes: a region of the first code image, which contains the first code image obtained by encoding the first information, using color, shade, or a combination thereof, and a region of the second code image, which contains the second a code image obtained by encoding second information using color, hue, or a combination thereof. The mixed code is obtained by adjusting the difference in color and brightness between the first and second code images to a predetermined level and combining these images. The first and second code pictures can be decoded by decoding interpretation information, construction information, error control information, and code direction information stored in the first and/or second code pictures. Such a patent suggests a method of protection against counterfeiting, but nevertheless, the main problem remains of reproducing the color shades of the code when using hardware, especially since the code itself is generated by adjusting the difference in color and brightness between the images of the first and second codes to a given level and combining these images. In addition, if any of the interpretation, construction, error control, and direction information blocks are damaged, the code becomes unreadable.

The disadvantages of the proposed methods include the following: despite the increase in the possible volume of encoded data, it is impossible to place a significant amount of information in the color code

- 1 044941 formations. A color barcode is generated by mapping colors onto the barcode structure. Although the number of ways to express information can be increased by using a color barcode, a color barcode is also a simple combination of colors in the barcode structure. When reading and decoding, the proposed method allows you to detect errors, but no algorithms for correcting them are proposed, or a list of links to the declared colors that can be used in the code is offered. In addition, code conversion tables, which define various colors, shades, shapes or configurations, or combinations thereof in accordance with recognizable characters, including numbers and symbols, allow such barcodes to be copied and counterfeited with sufficient reliability. It is also necessary to note the dependence on hardware.

In order to solve the problem of placing a large amount of information on a plane, in particular placing three-dimensional objects on a plane, there are developments of multidimensional codes. Such codes are generated using extended reality systems. The bottom line is that a three-dimensional image, including a color one, is recreated using the reference points of a two-dimensional image.

For example, there is a known three-dimensional barcode (invented by Content Idea), which consists of twenty-four layers of different colors, thanks to which it can store from 600 KB to 1.8 MB of data. The principle of operation is organized as follows: the barcode is placed as an advertisement on the magazine page. The user brings his reader with special software installed to the tag, scans it and sees an advertising video on the screen.

To interpret a 3D scene in a 2D barcode, specialized modeling languages must be used. For example, the patent Device and method for representing a three-dimensional object based on images with depth (RF patent No. 2237283, IPC G06T 9/40, priority date November 27, 2001, publication date September 27, 2004) offers a method for representing three-dimensional objects based on images with depth. Its use in visualizing a three-dimensional image allows one to obtain a technical result in the form of compact storage of image information, fast visualization with high quality of the output image.

This result is achieved due to the fact that the method includes:

generating a piece of observation point information, color images based on the color information, corresponding pixel points constituting the object, depth images, image nodes consisting of observation point information, a color image and a depth image corresponding to the observation point information;

encoding the generated image nodes.

This invention makes it possible to form a three-dimensional image based on an encoded two-dimensional one, however, reproducing such a two-dimensional object even on paper products without loss of quality is extremely difficult, and in addition, encoding of other types of digital information is excluded.

For the full functionality of the identifying and protective properties of barcodes (two-dimensional symbols) of various configurations, it is necessary to use information security methods; methods using cryptographic algorithms are preferable. Such methods involve converting information using cryptographic functions and algorithms.

A software-implemented digital method of protection against counterfeiting and a device for implementing the method are known (RF application No. 98112241, IPC G09C 5/00, priority date November 29, 1995, publication date June 20, 2000). The proposed method, implemented using a program on a computer system, for creating in digital form an encrypted anti-counterfeiting character introduced into printed material, is characterized in that it includes the steps:

encrypting the input image, which is divided into elementary input segments, converting into a raster form the visible source image depending on the number of said received encrypted elementary output segments;

merging said bitmap visible source image with said encrypted elementary output segments such that the resulting encoded output image is converted to represent a visible image while preserving the internal structure of the encrypted input image;

printing said encrypted output image with sufficient resolution so that the decoding means can be used to extract the encrypted input image.

In this case, the specified visible source image is converted by sampling into a single-color bitmap image, and a multi-level three-dimensional effect is created using the input image composed of the background image.

This method does not allow entering significant amounts of information into the code, and also limits the use of the method only for printed materials.

Other known methods of information security, as a rule, do not involve the use of an image matrix template, which eliminates the possibility of machine reading and decryption of the data.

- 2 044941 dilated messages.

The method of protecting information from unauthorized access (RF patent No. 2227318, IPC G06F 12/14, priority date 06/18/2001, publication date 04/20/2004) proposes a protection method based on the generation of a key, which is stored in the memory of an external device adapted for connection to a computer, decrypting information using a key in an external device, characterized in that the key is generated directly in the external device, while the information is encrypted using a key in the same device.

In this case, the key is generated using pseudo-random sequence signals and external random influence signals, followed by automatic checking of the key for no matches with keys stored in the memory of the external device.

The key is stored in the memory of an external device adapted for connection to a computer, decrypting information using the key in the external device, characterized in that the key is generated when exchanging information between subscribers in the external device of one of the subscribers, encrypting it with a system key previously recorded in the memory system key of all devices of subscribers of the same series, and transfer the encrypted key to another subscriber, decrypt it from another subscriber, while the information is encrypted using the key in the external devices of each subscriber.

The disadvantages of this method include the inability to implement the method in the event of force majeure, such as breakdown of the user’s equipment or failure of equipment segments. Also, this method uses a control sequence (key) that is either shorter or corresponds to the length of the message and there is no accurate estimate for the probability of imposing false information, thus increasing the likelihood of hacking or calculating a workaround to decrypt protected information. Also, there is no option for execution in a graphical machine-readable form of a two-dimensional code.

Known application Two-dimensional colorcode, preparing and restoring method for the code and apparatus here for, (US application No. 5992748 (A), IPC G06F 7/12, priority date 1996-08-08, publication date 1999-11-30) . The method suggests:

device for generating a two-dimensional color code: includes a section of the original image object for output to a processing device; processing means having a code conversion section for outputting two-dimensional color codes corresponding to color gradations separate from CMY colors in the original single pixel image data, and a printing section for printing on a printed sheet.

2D color code recovery device: reads the 2D color code in the reading section to output color gradations separately from CMY colors. The Print section prints the reconstructed image data based on color gradations.

The method proposed in this patent allows you to generate a color barcode using three primary colors (yellow, cyan, magenta), and restore damaged information when scanning a grayscale version of the code. The disadvantages of this method include the difficulty of recovery if the code is damaged (double scanning and additional printing will be required). In addition, this method involves placing a color matrix barcode only on paper.

Additionally, there are common problems when using known barcodes. The main problem is that even a color barcode cannot contain enough information to reproduce multi-page documents, images, sound, video and other media files. Another problem is that a color barcode does not guarantee its own integrity and authenticity when printed and copied due to:

various color management systems for various equipment, unstable color characteristics of the printing device itself, dependence on color rendering and scanner accuracy, possible temporary color degradation on the media.

The closest in terms of the set of essential features to the proposed invention is the Method for encoding and decoding digital information in the form of an ultra-compressed nanobar code (options), (RF patent No. 2656734, IPC G06K 9/18, priority date 12/27/2013, publication date 06/06/2018) , which is adopted as a prototype. The known invention relates to a method for converting (encoding), decoding and recording digital information to form a matrix ultra-compressed two-dimensional code (nanobar code), as well as to optically readable two-dimensional codes representing binary-encoded data placed on a two-dimensional matrix and thus forming , a template for posting information.

The method includes the following actions: receiving information to be encoded, encoding information using a code conversion table, forming a structure of encoded data, encryption, adding information for recovery, obtaining an image in the form of an electronic or physical code.

- 3 044941

After encoding the information, it is encrypted, compressed, and added with redundant information for recovery in case of loss.

Encryption of information is carried out using cryptographic algorithms in two stages: at the first stage, encryption is carried out at the byte level using a polyalphabetic byte cipher with a different shift value for each byte of information; at the second stage, encryption is carried out at the bit level based on the symmetric bit AES encryption algorithm.

Information compression is carried out on the basis of optimal code methods, and the probabilities of occurrence of code words for each block of encoded information are calculated only for this block and recalculated for each block. To detect errors, a special case of BHC codes (Bose - Chowdhury - Hockingham codes) is used. The formation of redundant information occurs using the polynomial xn+xn-1+...+1=0, where neP (P is the space of prime numbers). In this case, the polynomial used is universal, both for the SubBytes operation and for the generation of redundant information.

To obtain a code message, the structure of the encoded data is formed in the form of an ultra-compressed nanobar code in the form of a physical or electronic image of a two-dimensional code containing a background region, a region of orienting elements and a data region. The area of the orienting elements contains a reference square with a frame and an empty field, alignment rectangles and a code border frame; the data area containing the code message is superimposed on the area of the orienting elements in such a way that the elements of the areas do not overlap each other. Any inscription and/or image can be placed inside the reference square, and the dimensions of the reference square, frame and empty field can vary in different directions. The center of the reference square is located at the intersection of the symmetry axes of the alignment rectangles. The main disadvantage of the proposed method is the limited amount of encoded information, as well as the irrational use of the useful area of the code, since the information is located on only one information layer.

Thus, information can be located on only one layer; when reading, monochrome image processing algorithms are used. The proposed invention is an improvement of the above method for encoding and protecting information, since it does not provide for an increase in the volume of converted information while maintaining the matrix formation area, and the use of only one layer for information recovery.

Thus, the main goal of the proposed invention is to develop a method for compressing encoded information and increasing the information capacity of the code, through the formation of a multicolor matrix code - a color nanobar code, using the transformation of a three-dimensional object into a two-dimensional one, which allows one to uniquely identify the object and present information in a highly compacted form.

The technical result of the proposed invention is to increase the information capacity of the code when encoding digital information in combination with an increase in the effective information capacity of the code.

The technical result is achieved by encoding digital information in the form of an ultra-compressed code - a nanobar code, which includes receiving the information to be encoded, encoding the information using a code conversion table and receiving a code message on a storage medium in the form of a physical or electronic code, in which, after encoding the information, it is carried out encryption, compression and addition of redundant information for recovery in case of its loss, information encryption is carried out using cryptographic algorithms in two stages: at the first stage, encryption is carried out at the byte level using a polyalphabetic byte cipher with a different shift value for each byte of information, at the second stage encryption is carried out at the bit level based on the bit-symmetric AES encryption algorithm. The number of mixing rounds when encrypting at the byte level is equal to 1, the resulting sequence of the encrypted message is converted to hexadecimal number system and transferred to the second stage of bit encryption, for the first stage of encryption a table of values 256 by 256 characters or 256 tables of 256 positions is used, while the number of fields in the table corresponds to the number of fields in the ASCII encoding table; at the second stage of encryption (bit encryption), the number of rounds of shuffling is finite and equal to q, while a message P of length a characters is divided into the nth number of blocks with m characters per block and encrypted with the algorithm , containing q rounds of mixing, when encrypting at the bit level, at all encryption rounds the cipher design is changed, namely, between the operations ShiftRows and MixColumns, blocks are shifted while maintaining the mechanism for generating round keys and mixing stages, information compression is carried out based on optimal code methods, and the probabilities of occurrence of code words for each block of encoded information are calculated only for this block and recalculated for each block; to obtain a code message, the structure of the encoded data is formed in the form of an ultra-compressed nanobarcode in the form of a physical or electronic image of a two-dimensional code containing a background area, an area of aligning straight lines, 4 044941 triangles and a data area consisting of at least one data block, wherein the area of the orienting elements contains a reference square with a frame and an empty field, alignment rectangles and a code boundary frame, the data area containing the code message is superimposed on the area of the orienting elements elements so that the elements of the areas do not overlap each other. Any inscription and/or image can be placed inside the reference square, and the dimensions of the reference square, frame and empty field can vary in different directions. The center of the reference square is located at the intersection of the symmetry axes of the alignment rectangles with the difference that digital information, after encoding, is placed on several information layers, which are then summed up according to color templates, taking into account the selected color conversion system. When encoding, information, including both dependent and independent, is placed in a multidimensional nanobar code and encoded sequentially in parts for each layer; to obtain a code message, the structure of the encoded data is formed by summing the information layers containing the encoded information according to color patterns with taking into account the selected color conversion system. To obtain a code message, the structure of encoded data is formed by summing the layers containing encoded information according to color templates, taking into account the selected color conversion system, the number of generated information layers is selected depending on the method of physical or digital implementation of the multidimensional nanobar code, compression algorithms based on graphic capabilities color conversion systems determine the method of forming information layers, their order and the result of addition in the form of a multidimensional nanobar code, which is three-dimensional, displayed in two-dimensional space. For the physical carrier of the code, the alignment rectangles and areas of the orienting elements are colored in the primary colors of the generated color conversion system; the dominant colors are determined as reference color shades based on color shade clustering algorithms.

Decoding of digital information in the form of an ultra-compressed code, including reading encoded data from the code, selecting useful information, decompressing, decrypting and decoding this information using a code conversion table, lost information is restored using information recovery algorithms based on redundant information recorded during code formation, information decompression is carried out based on optimal code methods based on the sum of the obtained probabilities at the compression stage with the calculation of the probabilities of the original code words, information decryption is carried out using the inverse cryptographic transformation function in two stages, at the first stage decryption is carried out at the bit level based on a symmetric bit encryption algorithm AES, in the second stage, decryption is carried out at the byte level using a polyalphabetic byte cipher with a different shift value for each byte of information. At the first stage of decryption (bit encryption), the number of mixing rounds is finite and equal to q, while the message of length P and symbols is divided into the nth number of blocks with m characters per block and decrypted with an algorithm containing q mixing rounds. For the second stage of decryption, a table of values 256 by 256 characters or 256 tables of 256 positions is used, while the number of table fields corresponds to the number of fields of the ASCII encoding table, the number of mixing rounds during decryption at the byte level is 1, the resulting sequence of the encrypted message is converted to hexadecimal number system and is transferred to the second stage of bit decryption with the difference that decoding of the multidimensional nanobar code is carried out by dividing the two-dimensional matrix into encoded information layers using color patterns. The multidimensional nanobar code, visually representing a colored two-dimensional matrix, is divided into contrasting layers according to a color pattern, taking into account the selected color conversion system, and each layer is decoded separately into its own information block, ensuring the safety of independent or dependent information with its subsequent transformation into a single block.

To solve the problem, it was necessary to determine how to store more than one bit of information per cell, which is the standard for two-dimensional, black-and-white barcodes.

By using rows of square cells colored in different colors, code density can be increased. In addition, by using the background field as additional cells, you can make the code multidimensional.

To ensure accurate software reading of color, it is necessary to generate a palette containing a standard of color shades that can be used in the code, thus forming a calibration mechanism. The calibration mechanism specifies the range of averaging color shades, which may differ when read under different conditions (lighting, reading at an angle, etc.).

The applicant of the proposed invention has developed algorithms for clustering color shades and determining the dominant colors of the nanobar code (NBC) field. Color layers can be used as follows.

An image's palette represents the many colors used in an image. If the image is stored in the Red, Blue, Green (RGB) color system format, then each point in this set has three coordinates - Red, Green, Blue (red, green, blue); and if another one is added

- 5 044941 component - alpha channel or transparency (A), then in ARGB format (Alpha Channel, Red, Blue,

Green).

The palette can be represented as a set of points in three-dimensional for RGB or four-dimensional for ARGB spaces. Due to the presence of smooth transitions and halftones of color in the image, the dots will form clouds - so-called clusters, where all the dots of one cluster have a color close to each other. Therefore, for points that fall into one cluster, you can assign one averaged (one of the options) color, and thereby reduce the dimension of the set - the palette.

On the other hand, the image can be stored in CMY (a color system containing Cyan, Magenta, Yellow) or CMYK (Cyan, Magenta, Yellow, Black) format. Thus, it is also possible to cluster colors and identify many layers for recording information.

The information is encoded into a grayscale layer, and there are 255 such layers for one channel. Based on these layers, a full-color image is recreated in the selected system. A full-color image is restored by summing up the layers that act as color image channels.

At the same time, you can take into account the number of colors reproduced on different materials using different output methods (printing, laser engraving, transfer, etc.) or digitally as follows.

For digital space, there are color coding systems for displaying it on the screen. For example, 16-bit color coding allows the image to be divided into channels, each of which characterizes the proportion of red, green or blue colors. These colors are used to create an electronic image. In the case of physical media, such as a printed design, determining the number of layers requires defining or assigning contrasting colors for unambiguous reading and decoding).

Let N be the number of color shades, i = color depth, then the number of layers Y for a digital NSC can be found using the following formula: N = 2ζ for i = 4; Y=N = 2 ⁴ = 16;

at i = 8; Y=N = 2 ⁸ = 256;

at i = 16; Y=N = 2 ¹⁶ = 65536;

at i = 24; Y=N = 2 ²⁴ = 16777216;

at i = 32; Y=N = 2 ³² = 4294967296.

Thus, the digital version of the media, when encoding color in 24 bits, can have more than 16 million layers.

In the case of a physical medium, using known, stable colors, it is possible to create a color conversion system unique to the material used, which allows encoding a discrete number of layers.

For example: on technical titanium, under the influence of laser radiation, it is possible to obtain unambiguous 6 color shades: white, black, yellow, blue, indigo, violet, in this case i=2. This means that a two-layer message can be created on this material, and four primary colors should be chosen for the reference color shades. Let's choose contrasting white, black, yellow and blue.

To use this system to form layers, color can only take two values - 0 (white) and 1 (black) (see Table 1).

Table 1

Correspondence of layers and the generated color conversion system

Reference color (value) Layer First Second White (0;0) 0 0 white white Black (1; 1) 1 1 black black Yellow (1;0) 1 0 black white Blue (0; 1) 0 1 white black

Selected contrasting colors generated by the color conversion system for the technical titanium material are shown in Fig. 1 - the first layer for the formed color conversion system, in FIG. 2 - the second layer for the formed color conversion system.

The generated code layers are converted into a structure of encoded data in the form of a mass

- 6 044941 two-dimensional data containing streaming information about the characteristics of a code cell or electronic images of two-dimensional codes containing background areas, areas of orienting elements and data areas, wherein the image of the areas of orienting elements and the data areas are contrasting with respect to the image of the background area. Processing a family of code layers and their transformation makes it possible to generate a multicolor code containing a family of code layers on a two-dimensional matrix.

The first option is to place related information on layers of multidimensional code.

Let's choose a color conversion system for encoding. For example, the RGB system. This system is decomposed into three layers - Red (red), Green (green), Blue (blue), therefore, it allows you to generate three messages that are in no way related to each other and place them on one two-dimensional matrix.

In the example considered, for clarity, we will assume that a layer (red, green or blue) can take only two values - 0 (black) and 255 (white), i.e. match 1 (black) or 0 (white).

For encoding, the correspondence 1 - white, 0 - black can be used, this does not affect the essence of encoding.

So if we take the color red and split it into RGB channels using the standard function, we get the following channel distribution: 255, 0.0.

In table Figure 2 shows the distribution by layers for primary colors, which can be decomposed into layers with the specified condition (a layer can take only two values - 1 or 255).

Table 2 Distribution by layers for primary colors

Layer Color (RGB parameter) red green blue Red (255:0:0) 255 0 0 white black black Green (0:255:0) 0 255 0 black white black Spshsh (0:0:25?) 0 0 255 black black white Black (0:0:0) 0 0 0 black black black Yellow (255:255:0) 255 255 0 white white black Cyan (0:255:255) 0 255 255 black white white Purple (255:0:255) 255 0 255 white black white White (255:255:255) 2?? 255 255 white white white

Thus, each of the primary colors has a one-to-one correspondence to a certain combination of color channel values. Moreover, each of them takes a value corresponding to the black (1) or white (0) color of the cell of the NBK color nanobar code. The reverse action - adding the channels will allow you to get one of the primary colors corresponding to these channels.

In general, the process of encoding information is as follows. Three independent messages are prepared (see Table 2).

First message:

Mother

Second message:

Soap

Third message:

frame.

- 7 044941

Table 3

Coded message

Thus, the encoded message will occupy an area of 96 cells (Fig. 3). Moreover, in this case, encryption and the addition of redundant information for recovery are not used.

We transform the message using algorithms inverse to the algorithms for decomposing color into layers, taking into account the table. 4.

Table 4

RGB color layers Name colors Color designation Cell color Numeric characteristics of color layers Binary representation View layer Red 1 Red 255.0.0 100 Green 2 Green 0.255.0 010 Blue 3 Blue 0.0.255 001 R White 4 White 255.255.255 111 And Cyan 5 Blue 0.255.255 He — Magenta 6 Purple 255.0.255 101 Yellow 7 Yellow 255.255.0 But - Black 8 Black 0.0.0 000 __And

The encoding result is shown in Fig. 4 - red layer (layer containing the Mom message), in FIG. 5 - green layer (layer containing the Soap message), in FIG. 6 - blue layer (layer containing message frame).

The result of adding layers is presented in table. 5, where the cell is painted in the corresponding color, indicated by a number (see Table 4), after adding the layers.

Table 5

Result of adding layers

The encoding result is a multidimensional color nanobar code obtained using special compression algorithms based on the graphic capabilities of the selected color conversion system, where three independent messages are located on a two-dimensional matrix and occupy, respectively, three times less surface area under the same encoding conditions.

When dividing the encoding result into layers, we get three layers:

The red layer in Fig. 4 (layer containing Mom message),

The green layer in Fig. 5 (layer containing Soap message)

The blue layer in Fig. 6 (layer containing Ramu's message).

Each layer is decoded into messages.

First message:

Mother

Second message:

Soap

Third message:

frame.

Moreover, the order of messages will only affect the color values of the final message, which allows you to arrange layers with independent messages in any order.

To encode in the CMYK system, add to the three layers a fourth one with MaMa information (Fig. 7).

The summary message will contain the following layers:

yellow channel (layer containing the Mom message) - fig. 8;

blue channel (layer containing Soap message) - fig. 9;

magenta channel (layer containing frame message) - Fig. 10;

black channel (layer containing MaMa message) - fig. 7.

- 8 044941

The type of the final coded message is presented in table. 7 (color designations are indicated in Table 6).

Also, layers can be summarized in any order - the information will not be distorted or mixed. When you change the order of layers, the appearance of the code will also change.

Table 6

Color designations in summed layers in the CMYK system

Color Color in CMYK Color designation of color NI 100%, 100%. 100%. 100% 1 1101 100%, 100%. 0%, 100% 2 1110 100%, 100%. 100%. 0% 3 0001 0%, 0%. 0%, 100% 4 1011 100%, II'·.. 100%, 100% 5 1001 100%, 0%, 0%. 100% 6 0100 0%, 100%, 0%. 0% 7 0000 0°... 0%. 0°... 0° 0 8 0010 0%. 0%. 100%. 0% 9

Type of final encoded message

Table 7

Also, the encoded message is uniquely decomposed into layers containing independent information.

These examples show the results of encoding text information, but it is also possible to encode any other digital information. At the same time, the color of the code does not convey information about the content of the information, being an indicator of the multi-layered nature of the code.

The second option is to place related information on layers of multidimensional code.

The specified option for increasing the density of information recording uses digital attributes of color as an information carrier, thereby increasing the capacity of the code cell due to the color itself.

Thus, the cell carries an information capacity and, depending on the number of colors of the color system used, the information capacity of the cell can range from 3 to 32 bits.

The coded message compression algorithm use case uses special compression algorithms based on the graphic capabilities of color conversion systems. Moreover, two encoding options are possible:

coding using only the basic colors of the RGB and CMYK color systems; in this case, it is possible to encode 3 bits of information (3 layers) per color cell.

Let's encode the message and present it in the form of a color code (Table 8).

Table 8

Encoding the message Mom washed the frame.

Dec Bin M 204 11001100 A 224 11110000 m 236 11101100 s 251 11111011 l 235 11101011 R 240 11110000 at 243 11110011 "Space" 32 00100000 46 00101110

The full message will be presented as follows: 110011001111000011101100111110111110101111110000111100110010000000101110.

Let's split the sequence into groups of three bits: 110 011 001 111 000 011 101 100 111 110 111

- 9 044941

110 101 111 110 000 111 100 110 010 000 000 101 110.

Three bits correspond to three layers in the RGB system. The presence of a bit, i.e. 1 corresponds to the maximum numerical value possible in a separate color channel - 255. Absence corresponds to - 0. Let's assign numerical values to each group of bits according to the table. 4.

For the first 3 bits, the values 255.255.0 will be obtained, which correspond to the Yellow color in the RGB system. A cell with the color Yellow will contain 3 bits of information.

The entire message will be encoded in the RGB color system with an additional white color (in this case, the white color includes the information 0.0.0, and not 0 as in the binary display of the code). For a complete message, we will create a visual table of the color layers Red, Green, Blye and their sum (see Table 9).

Table 9

Encoded message, laid out in layers Red, Green, Blue

We get the sequence

110 011 111 111 000 011 101 000 111 000 100 110 010 110 110 010

001 000 001 100 001 011 100 000 111 010 111 100 111 000 011 101

111 001 000 100 000 110 000 101 101 100 011 110 010 111 000 001

101 101 111 101 000 111 010 101 101 000 000.

Let's convert the resulting sequence into an eight-bit one.

11001111 11110000 11101000 11100010 01100101 10110010 00100000 11000010 11100000 11101011 11001110 00011101 11100100 0100 0001 10000101 10110001 11100101 11000001 10110111 11010001 11010101 10100000.

Decoding the sequence, we get the source text: Greetings from Vitalik (see Table 11)

- 10 044941

Table 11

These examples show the results of encoding text information, but it is also possible to encode any other digital information. One color cell with any encoded information will have an information capacity of 3 bits. This coding method, without additional use of compression, makes it possible to reduce the amount of code in proportion to the information capacity of the cell.

Coding using the entire color space of the RGB and CMYK color systems, in this case it is possible to encode either 24 or 32 bits of information per color cell, depending on the selected color system (24 or 32 layers of information).

Let's encode the message and present it in the form of a color code. Mom washed the frame.

Dec Bin m 204 11001100 A 224 11110000 m 236 11101100 s 251 11111011 l 235 11101011 R 240 11110000 at 243 11110011 "Space" 32 00100000 46 00101110

11001100 11110000 11101100 - we get the color coordinates in the decimal number system: 204, 224, 236.

Visual representation of each color layer in the RGB system:

1st color channel 0.0.204;

2nd color channel 0.224.0;

3rd color channel 0.0.236.

- 11 044941

Summing up, we get a cell with the final color with RGB coordinates 204.224.236 - the cell contains the information: M, a, m

The rest of the message is encoded similarly. The final result is presented in table. 12.

Table 12

Color coordinates of the cells of the encoded message Mom washed the frame.

RGB coordinates 204.224.236 224:32:236 251;235;224 32:240:224 236:243:46

Thus, it is possible to compare the effective area occupied by the code for different coding systems for the same message - Mom washed the frame..

With black and white coding - 72 cells - fig. eleven.

When encoding in RGB or CMYK systems using only basic colors - 24 cells

- fig. 12, cell numbers are compiled in accordance with table. 4

7 5 3 6 1 8 6 8 7 7 2 8

4 8 5 7 4 7 8 4 1 8 6 7

When encoding in RGB or CMYK systems using the entire color range of colors - 5 cells (see Table 12).

This encoding, using the entire color range of the RGB or CMYK color systems, allows for a 14.4-fold reduction in area without the use of standard compression algorithms.

We decode a message encoded in the RGB color system using the entire color area of the system (see Table 13).

Table 13

RGB encoded message using the entire color space

Total color in RGB coordinates 207:240:232 226'229'242 32:194:224 236:32:238 242:32:194 232'24^'224 235:232:234 224:0:0

In table Figure 14 shows the sequential decoding of each cell - each cell contains three symbols (3 layers).

- 12 044941

Table 14

Decoding a message

Dec Bin Symbol 20' 11001111 P 240 11110000 1' 232 11101000 II 226 11100010 V 229 11100101 e 242 11110010 T 00100000 "Space" 194 11000010 V 224 11100000 A 236 11101100 m 00100000 "Space" 23S 11101110 O 242 11110010 T 00100000 "Space" 194 11000010 V 232 11101000 II 242 11110010' T 224 1 1100000' A 235 11101011 l 232 11101000 II 234 11101010 To 224 11100000 A

When generating a nanobar code, it should be taken into account that the recommended sequence of actions is as follows:

selection or formation of a color system;

encoding and converting information into binary form for each layer;

adding redundant information to recover lost data;

formation of layers with dependent or independent information;

adding layers;

location on a two-dimensional code matrix.

Advantages of the proposed color nanobar code.

Methods of compression and overlay of information can significantly compress the code, as well as increase its information capacity by adding layers.

When comparing a two-dimensional code with a three-dimensional code located on a two-dimensional matrix, the advantage for a color nanobar code in the area of useful information is obvious (see Table 15).

Table 15

Comparison of the information capacity of a nanobar code and a three-dimensional nanobar code

Possible size Size (in cells) Total area (in cells) Area of auxiliary elements (in cells) Area of useful information (in cells) Nanobar code minimum 21X21 441 241 200 maximum 144X144 20736 241 20495 Color nanooar code. RGB system minimum 21X21 441 241 600 maximum 144X144 20736 241 61485

The advantage of the proposed options is the compaction of information, due to the location of a three-dimensional object on a two-dimensional matrix, in which the formed layers with dependent or independent information are summed up, or by increasing the cell capacity without the use of additional information compression algorithms.

The main advantages of the proposed invention, compared to the prototype:

a multiple increase (at least 3 times for the digital version) of code compactness; color nanobar code is a 3-D object and can contain both dependent and independent information on

-

Claims (4)

layers, the ability to restore information on each layer. In addition, it is possible to restore data, there are color elements in the code structure to recognize the coding color system and decompose into layers and decode information in accordance with it. The compaction of information in the code matrix by adding layers of code and increasing the information capacity of the code occurs with the possibility of application to any surface. CLAIM 1. A method for encoding digital information in the form of an ultra-compressed code - a nanobar code, including receiving the information to be encoded, encoding the information using a code conversion table and receiving a code message on a storage medium in the form of a physical or electronic code, in which, after encoding the information, it is encrypted , compression and addition of redundant information for recovery in case of its loss, information encryption is carried out using cryptographic algorithms in two stages: at the first stage, encryption is carried out at the byte level using a polyalphabetic byte cipher with a different shift value for each byte of information, at the second stage encryption carried out at the bit level based on the symmetric bit AES encryption algorithm, with the number of shuffle rounds in byte-level encryption equal to 1, the resulting encrypted message sequence is converted to hexadecimal number system and transferred to the second bit encryption stage, for the first encryption stage a table is used values 256 by 256 characters or 256 tables of 256 positions, while the number of table fields corresponds to the number of fields of the ASCII encoding table; at the second stage of encryption - bit encryption, the number of mixing rounds is finite and equal to q, while a message P of length a characters is divided into n the th number of blocks with a volume of m characters per block and is encrypted with an algorithm containing q rounds of shuffling; when encrypting at the bit level, at all rounds of encryption the cipher design is changed, namely between the operations of shifting the data of the AES encryption algorithm (ShiftRows) and shuffling the data of the encryption algorithm AES (MixColumns) shift blocks while maintaining the mechanism for generating round keys and mixing stages, information compression is carried out based on optimal code methods, and the probabilities of occurrence of code words for each block of encoded information are calculated only for this block and recalculated for each block to obtain the code The messages generate an encoded data structure in the form of an ultra-compressed nanobar code in the form of a physical or electronic image of a two-dimensional code containing a background area, an area of alignment rectangles, and a data area consisting of at least one data block, wherein the area of orienting elements contains a reference square with a frame and an empty field, aligning rectangles and a code border frame, a data area containing a code message is superimposed on the area of orienting elements so that the elements of the areas do not overlap each other, an inscription and/or image can be placed inside the reference square, and the dimensions the reference square, frame and empty field can be changed, the center of the reference square is located at the intersection of the symmetry axes of the alignment rectangles, characterized in that the digital information, after being encoded, is placed on several information layers, which are then summed up according to color templates taking into account the selected color conversion system, information, including both dependent and independent, when encoding, they are located in a multidimensional nanobar code and encoded sequentially in parts for each layer; to obtain a code message, the structure of the encoded data is formed by summing the information layers containing the encoded information according to color templates, taking into account the selected color conversion systems. 2. The method according to claim 1, characterized in that the number of generated information layers is selected depending on the method of physical or digital implementation of the multidimensional nanobar code, compression algorithms based on the graphic capabilities of color conversion systems determine the method of forming information layers, their order and the result of addition into in the form of a multidimensional nanobarcode, which is at the same time three-dimensional, displayed in two-dimensional space. 3. The method according to claim 1, characterized in that for the physical carrier of the code, the alignment rectangles and areas of the orienting elements are colored in the primary colors of the generated color conversion system, the determination of the dominant colors as reference color shades is carried out on the basis of color shade clustering algorithms. 4. A method for decoding digital information in the form of an ultra-compressed code, including reading encoded data from the code, selecting useful information, decompressing, decrypting and decoding this information using a code conversion table, the lost information is restored using information recovery algorithms based on redundant information recorded when code generation, information decompression is carried out on the basis of optimal code methods based on the sum of the obtained probabilities at the compression stage with calculation -