FR3008812A1 - SYSTEM FOR USING AN INFORMATION CODE AND READER READING AN INFORMATION CODE - Google Patents

Abstract

The invention proposes a system (100) equipped with an information code reader (20) capable of reading an information code (SQ). The information code reader (20) comprises a decision unit which determines whether or not a confidential data code is placed after an end identification code or an end position, a second decoding unit whose function is to decode the confidential data code which the decision unit has detected the presence, and a processing unit which, if there has been decryption of a confidential data code by the second decoding unit, performs a mapping process consisting of at least presenting the decryption results of the confidential data code, storing these results or subjecting them to a processing which is adapted to them, and which delivers a predefined identification information or stores it.

Description

The present invention relates to a system for using an information code and to a reader reading such an information code. BACKGROUND OF THE INVENTION [Prior art] The method of transmitting information and its portable terminal described in the Patent Document 1 referenced below is a good example of a technique for generating and reading two-dimensional codes containing confidential data. In this prior art, a portable terminal located on the transmitter side displays on the screen of a display the QR code generated by converting to this QR code transmitted data encrypted by the application of an encryption key provided by a key entry device (Patent Document 1: paragraph 0020, line 21, Figure 4). In reception, a portable terminal requests an encryption key as soon as an encryption has been detected by reading by means of a camera, in particular the QR code image displayed on the screen of the transmitting portable terminal (Patent document 1: paragraph 22, Figure 5). [Prior Art Documents] [Patent Documents] [Patent Document 1] Japanese Patent Application No. 2004-147006. However, the data encrypted by the information transmission method and portable terminal disclosed by this Patent Document 1 generally have no meaning in themselves as textual information when the encrypted information is reconverted into QR code; it is therefore not uncommon for the information displayed on the screen of the portable terminal or the like to be inconsistent or to correspond to control codes which may affect the control of the on-screen display.

Therefore, any incoherent information can induce the user of such a portable terminal a certain suspicion or raise a security problem by the possibility that ensues to encourage those who can see that it is 5 encrypted information to behave in a malicious way by attempting to decipher fraudulently. In order to solve these problems, the inventors of the present Application have arrived at this point of view in designing an information code such as when the total number of public data codes coded as code words representing data to be made public is less than to the capacity of the code area where these code words are to be stored, the end code code of the code string thus formed by these public data codes arranged in this code area is placed at the end of this chain, or that an end identification information specific to the end position of the code string formed by the public data codes is at a predefined position of that code string, whereas confidential data encoded as codewords representing data to be held secret are after this end identification code or after this end position specified by the end identification ormation. In this information code configuration where the decryption results of the public data codes read by a conventional reading apparatus are obtained without the decryption of the confidential data codes, the user who only uses the such a reading device will hardly be able to realize that confidential data codes have been recorded. On the other hand, only the special reading devices that deliver the results of decryption of confidential data codes makes it easier to process the decrypted data from such confidential data codes. However, this configuration alone remains problematic because it does not make it possible to discern whether the post-reading data processed by the special reading device are or are not data that were originally made confidential. SUMMARY OF THE INVENTION Dedicated to the resolution of the foregoing problems, the object of the present invention is to provide a reader capable of reading an information code constituted so that the presence of confidential data is hardly discernible in the case of reading by a conventional reading device, as well as the system implementing such a reader. In addition, it is also intended to provide a configuration that makes it possible to discern more precisely whether the post-reading data processed in this reader is or is not data that was originally made confidential. In order to achieve these objectives, according to a first aspect, the invention proposes a system for using an information code, remarkable in that it comprises: an information code generator which generates a code of information information, and an information code reader which reads the information code generated by the information code generator, wherein the information code generator is configured to generate an information code of such so that, A) when a total number of public data codes encoded as code words representing data to be made public is less than a maximum capacity of the code area where these codewords are to be stored, i) a end identification code is added immediately after a code string composed of the public data codes stored in the code area, the end identification code indicating an end of the code string, or ii) a piece of information 25 'identific end identification is arranged at a given position in the code string in the code area, the end identification information which identifies an end position of the code string composed of the public data codes in the code field. code area, and B) where the confidential data codes encoded as code words representing data to be held secret are disposed after the end identification code or after the end position identified by the identification information of end, and the information code reader comprises, a first decoding unit which attempts to decipher either all the code words arranged before the end identification code in the code string or all the codewords arranged before the end position in the code string, the end position being identified by the end identification information a decision unit which determines whether a confidential data code is stored or not after the end identification code is after the end position in the code string, a second decoding unit decodes the confidential data codes when the decision unit determines that the confidential data codes are stored in the code string. the code string, and a processing unit which, when the second decoding unit has decoded the confidential data code, i) performs a first processing consisting at least of delivering the decryption results of the confidential data code, to be memorized the decryption results of the confidential data code or realize according to the decryption results of the confidential data code, and ii) performs a second processing consisting either of delivering or memorizing a predetermined identification information. According to a second aspect, the invention provides an information code reader capable of reading an information code in which, A) when a total number of public data codes encoded as code words representing data to be rendered. is less than a maximum capacity of the code area where these codewords are to be stored, i) an end identification code is added immediately after a code string composed of the public data codes stored in the code area , the end identification code indicating an end of the code string, or ii) end identification information is disposed at a given position in the code string in the code area, the information of end identification which identifies an end position of the code string composed of the public data codes in the code area, and B) the confidential data codes coded as code words representing data to be held secret are disposed immediately after the end identification code or immediately after the end position identified by the end identification information, characterized in that the information code reader comprises a first unit of identification. decoding which attempts to decipher either all the codewords arranged before the end identification code in the code string or all the codewords arranged before the end position in the code string, the end position being identified by the end identification information a decision unit which determines whether or not a confidential data code is stored either after the end identification code or after the end position in the code string, a second unit of decoding which decodes the confidential data codes when the decision unit determines that the confidential data codes are stored in the code string, and a unified processing unit which, when the second decoding unit has decoded the confidential data code, i) performs a first processing consisting at least of delivering the decryption results of the confidential data code, storing the decryption code results of confidential data or realize according to the decryption results of the confidential data code, and ii) performs a second processing consisting of either delivering or storing a predetermined identification information. In the information code processed by the invention according to the first aspect, the confidential data code encoded as code words representing data to be held secret is placed after an end identification code or after a specified end position. by end identification information. Conventional reading devices that decipher the existing data until they meet this end identification code or this end position, and therefore do not attempt to decrypt the confidential data codes, thus make it difficult to discern the presence in itself. On the other hand, the information code reader at the heart of the present invention whose second decoding unit decodes the confidential data codes when the decision unit has recognized the presence of a confidential data code, thus allows decrypt the confidential data encoded and stored as such. In addition, the information code reader is designed such that in case of decryption of a confidential data code by the second decoding unit, the processing unit performs at least one mapping process. such as presenting the decrypted results of this confidential data code, storing them, or a processing adapted to them, and presenting or memorizing predefined identification information. Thus, the fact that the mapping is completed by the presentation of a predefined identification information or its storage makes it easier, depending on whether such presentation or storage takes place or not, to discern with greater precision whether the data processed by this mapping process are valid confidential data or not. In preferred embodiments of the invention, according to the first aspect or the second aspect, one or more of the following arrangements may be used: the processing unit is configured to: storing in a predetermined memory portion or delivering both the decrypted data of the confidential data codes and the identification information that are matched when the second decoding unit has decoded the confidential data codes, and storing in the portion of memory or issue, without the identification information, the decrypted results of all code words arranged before the end identification code in the code string or the decrypted results of all code words stored before the end position identified by the end identification information in the code string when the second decoding unit has not decoded the data codes co nfidentielles. This configuration in which the identification information mapped to the decrypted data of the confidential data code is presented or stored when the second decoding unit has deciphered a confidential data code makes it easy to discern more quickly and with greater certainty whether the presented data or the stored data are valid confidential data or not. the processing unit is configured to memorize in the memory portion or to deliver combined data in which an upstream identification information is added upstream of the stored data constituting the decrypted data and downstream identification information is added downstream stored data composing the decrypted data when the second decoding unit has decoded the confidential data codes, the upstream and downstream identification information being the identification information.

This configuration gives the possibility while allowing to discern more precisely whether the presented or stored data is valid confidential data or not, to specify more precisely the extent that the data string where the valid confidential data is located. occupies in the presented or stored data. the system comprises a connection portion connecting to the different sites of a predefined network, the information code generator is configured to generate the confidential data code which comprises address information specifying an address within the network the processing unit is configured to store in the memory portion or to output at least the address information and identification information that is matched when the second decoding unit has decoded the code of confidential data; and the connection portion is configured to connect to the site specified by the address information when the address information and the identification information that are mapped are delivered or stored in the memory portion. In this configuration, the connection portion accesses the site specified by the address information as long as the processing unit has matched it with the identification information in the data it presents or stores. . Conversely, access to the site specified by invalid data may be restricted if the data presented or stored is not valid confidential data. By using this technique, even if, for example, another two-dimensional code in which the address of another site is recorded is affixed to an information code where confidential data is recorded and an illegal act such as a diversion to another site is committed, access to this other site by the connection portion can not be done until there is no matching with the identification information. It is therefore possible to more effectively prevent any access that would result from such unlawful diversion.

According to an advantageous arrangement of the invention according to the first aspect: the information code generator is configured to generate the confidential data codes by encrypting the data to be kept secret on the basis of a predetermined encryption key, and encoding the encrypted data to be kept secret; the information code reader comprises a decryption key storage unit in which is a decryption key is stored; and the second decoding unit is configured to: attempt to decode the secret data by using the decryption key stored in the decryption key storage unit when the decision unit determines that the confidential data codes are stored, performing the first processing and the second processing when the confidential data codes have been decrypted successfully according to the decryption key, and performing a predetermined alert processing when the confidential data codes have been decrypted without success. According to an advantageous arrangement of the invention according to the second aspect: the confidential data codes are codes produced by encrypting the data to be kept secret, on the basis of a predetermined encryption key, and by coding the data to be held secret encrypted; the information code reader comprises a decryption key storage unit in which is a decryption key is stored; and the second decoding unit is configured to: attempt to decode the secret data by using the decryption key stored in the decryption key storage unit when the decision unit determines that the confidential data codes are stored, perform the first processing and the second processing when the confidential data codes have been decrypted successfully according to the decryption key, and perform a predetermined alert processing when the confidential data codes have been decrypted without success.

In this configuration which involves a treatment to give an alert in case of unsuccessful decryption for example, especially when the decryption key stored by the reader is not valid, the user can thereby easily know that the matching process did not proceed normally and identify the cause. BRIEF DESCRIPTION OF THE FIGURES In the accompanying figures, Fig. 1 is an explanatory diagram conceptually describing the information code usage system of a first embodiment.

Fig. 2 is an explanatory diagram conceptually describing an exemplary application of the information code usage system of Fig. 1. Fig. 3 (A) is an explanatory diagram conceptually describing a constituent example of the generator. of information codes used in the information code utilization system of Fig. 1, Fig. 3 (B) being a block diagram showing an example of hardware configuration of the printer used by the code generator. information in Figure 3 (A). FIG. 4 is a flowchart illustrating an exemplary flow of the information code generation operations performed by the information code generator of FIG. 3. FIG. 5 is an explanatory diagram showing an example of data structure and codes to which the code generation process of FIG. 4 applies, FIG. 5 (A) showing an example of a print data record, FIG. 5 (B) an example of a structure after the sorting of the print code. step S115, Fig. 5 (C) an exemplary structure after adding the various codes to steps S121 to S137, Figs. 5 (D), 5 (E) and 5 (F) respectively illustrating configuration examples 1, 2 and 3 of the confidential code shown in Figure 5 (C). Fig. 6 is an explanatory diagram illustrating an example of a QR code configuration of type 1. Fig. 7 is a block diagram illustrating an example hardware configuration of the information code reader used by the code usage system. FIG. 8 is a flowchart illustrating an example of a decoding operation carried out by the information code reader of FIG. 7. FIG. 9 is a flowchart illustrating an example of the flow of information. Decryption operations associated with the decoding process of FIG. 8. FIG. 10 is a flowchart illustrating an example of the data transfer operations carried out in the decoding process of FIG. 8. FIG. 11 is a flowchart illustrating a example of the connection operations carried out by the computer terminal of FIG. 1. FIG. 12 is an explanatory diagram of FIG. presenting a concrete example of information code SQ generated by the information code generator shown in FIG. 3 in particular. Figure 13 is an explanatory diagram illustrating an example of a common QR code structure. Fig. 14 is an explanatory diagram in which the mapping relationships between mode identifiers and modes are specified. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS [First Embodiment] A first embodiment of the invention is hereinafter described with reference to the accompanying figures. The information code utilization system 100 schematized in FIG. 1 (sometimes hereinafter simply referred to as "system 100"), equipped with an information code generator 1 capable of generating such codes (sometimes referred to as "system 100"). hereinafter more simply "generator 1") and an information code reader 20 capable of reading the information codes SQ generated by the information code generator 1 (sometimes referred to hereinafter simply as "reader 20 "), thus forms a set adapted to use, via its information code reader 20, the information codes SQ generated by the information code generator 1. Moreover, the system 100 is also provided with a terminal computer 60 consisting of computer equipment capable of communicating wirelessly or wired with the reader 20, as well as a management unit 80 connected to the Internet, in which site information has been recorded notammen t. The choice to take the QR code as an example of the information code SQ processed by the information code utilization system 100 is not limiting since the invention is applicable to the formats Datamatrix, MaxiCode, CP Code, PDF417 and RSS Composite including the same as this QR code. In any case, the SQ information code has a structure in which, when the total number of public data codes encoded as code words representing data to be made public is less than the capacity of the code area where these words The end identification code that indicates the end of the code string thus formed by these public data codes arranged in this code area is placed at the end of this string, or the information end identification which makes it possible to specify the end position of the code string formed by these public data codes is at a predefined position of this string. Moreover, this SQ information code is thus configured that the confidential data codes coded as codewords representing data to be kept secret are placed after this end identification code or after this end position specified by the information. end identification. The system 100 shown diagrammatically in FIG. 1 is applicable under the conditions illustrated in FIG. 2 for example. The following description will be made by taking as a representative example this system 100 applied in the configuration of Figure 2, without its application examples are limited.

In the example of FIG. 2, the address information of a given site is recorded in encrypted form in the information code SQ generated by the generator 1. The decryption by the reader 20 of the secret code of this code SQ information provides access to the address information of the given site. The information code SQ is associated with the data structure illustrated in FIG. 12 for example, this particular point being the subject of a subsequent description. On the other hand, the reader 20 makes it possible to decipher the two-dimensional QR codes which correspond to usual QR codes. If site address information is stored in such a two-dimensional QR code, it is arranged that this address information can be acquired. In this regard, the data structure of such a two-dimensional QR code is that shown in Figure 13 for example. On this basis, the reader 20 makes it possible to transmit the address information acquired from the SQ information code or a two-dimensional QR code to this computer terminal 60, which is designed to attempt to connect to the site to which it refers. the address specified by this address information provided by the reader 20. However, the computer terminal 60 which determines on the basis of identification information added to the transmitted data (symbol which identifies the confidential data in the example of FIG. 2) if the data acquired has been obtained by decryption of an SQ information code or if they have been obtained by decryption of a two-dimensional QR code, will connect to the address site resulting from the decryption of the code SQ information, but will not connect to the one corresponding to the address obtained by decrypting the two-dimensional QR code. The following description will deal with this system taken as a representative example.

In the first place, the information code generator 1 is described with reference to the diagrams of FIG. 3 in particular. Fig. 3 (A) is a schematic diagram of the printer 10 and the personal computer 1 connected to it, and Fig. 3 (B) is a block diagram illustrating an example of hardware configuration of the printer 10.35. As shown in FIGS. 1 and 3 (A), the information code generator 1 is organized around a computer equipment 2 and a printer 10, in a configuration where this computer equipment 2 and this printer 10 are located. 5. The function of the printer 10 is to print on a label P 5 in particular an OR code generated on the basis of character data (hereinafter referred to generically as "printing data") such as characters. alphanumeric, kanji or symbols provided by the computer equipment 2 and applied to this printer 10. For the purpose of the invention, the term "QR code" means any code that complies with the fundamental specification of the two-dimensional QR code symbols. (JIS X 0510: 2004) Japanese Industrial Standards (JIS). For example, constituted by a personal computer of known type, the computer equipment 2 is shared between a computer console 4 and a monitor 3. The computer console 4 is equipped with a microprocessor, a main memory, a computer and a computer. a hard disk (recording device), an input / output interface, a communication interface, a keyboard and a pointing device in particular, not shown. The monitor 3 is a device that displays on screen the information that it delivers to the computer console 4 to which it is connected. 20 A printer driver installed (integrated) in this computer console 4 can extract at will to the printer 10 the print data containing characters such that the user of the computer equipment 2 wishes to print on the label P in the form of a QR code. With reference to FIG. 3 (B), the printer 10 is mainly constituted by a microprocessor 11, a memory 12, an interface 13, a drive roller controller 14, a print head controller 15, driving roller 17 and a print head 18 in particular. It should be noted that these elements 30 are either mounted on unrepresented printed circuits, or placed under a not shown housing. The microprocessor 11 is a microcomputer (hereinafter abbreviated as "micro") capable of driving the printer 10 as a whole, and capable of constituting with the memory 12 connected thereto via a memory bus computer equipment providing an information processing function. In addition to the memory 12, this microprocessor 11 is also connected to the interface 13, the drive roller controller 14 and the print head controller 15.

The memory 12 is a semiconductor memory device which includes for example a random access memory (dynamic RAM memory, static RAM memory, etc.) and a read only memory (EPROM memory, EEPROM memory, etc.). The random access memory of this memory 12 is furthermore constituted by a buffer zone where the character data transmitted by the computer equipment 2 is stored by a work zone that the microprocessor 11 uses during various processes such as arithmetic operations and theoretical operations. In its read-only memory have previously been implemented programs dedicated to the execution of the code generation process described later as well as the system programs which manage the various hardware components such as the drive roller controller 14 and the head controller. 15. The interface 13 is an input / output interface which receives the print data and other data transmitted by the computer console 4 of the aforementioned computer equipment 2. It is connected to the microprocessor 11 by a serial bus in particular. The print data inputted to the microprocessor 11 via this interface 13 is coded according to the code generation process described hereinafter.

A control device controlling the drive mechanism of the roller 17 (not shown), the drive roller controller 14 is connected to the microprocessor 11 via a serial bus in particular. Depending on the control signals delivered by this microprocessor 11, it controls the rotation of the drive roller 17, its stop and the direction of its rotation in particular. The print head controller 15 corresponds for example to a thermal head for printing any patterns on labels of heat-sensitive paper. Its connection with the microprocessor 11 is by serial bus 35 in particular. In this embodiment where the QR code generated by the code generator described later can be printed on a thermosensitive label, the registration patterns, the graduated patterns and the particular data codes which structure the QR code are printed on the label. thermosensitive in synchronism with its lead driven by the drive roller controller 14. The following description illustrates the example of a thermal head print head controller 15. Since it will print a QR code, it may very well be a head for inkjet printing or impact matrix printing, the printing equipment may correspond to a laser printer or a printer. LED printer. In this printer architecture 10, the print data inputted to it by the computer equipment 2 is stored for a time in the buffer zone of the memory 12 via the interface 13 before being delivered to the processing of the printer. code generation whose description follows. Here, the code generation process is described with reference to FIGS. 4 to 6. The flow chart of FIG. 4 illustrates the progress of its operations. FIG. 5 is an example of data and code structures to which the code generation process of FIG. 4 applies, FIG. 6 illustrating an exemplary configuration of type 1 QR code. As shown in FIG. 4, FIG. the code generation process initiated by the microprocessor 11 and the memory 12 activated when the printer 10 is turned on begins with an initialization operation in step S101. In this process, the working area of the memory 12 and its buffer zone where the print data are stored are reset, as are the predefined flags and counters in particular.

Processing of step S103 of scanning for the presence of received print data is repeated until there is receipt of print data (No at step S103). Upon detecting reception of such data (Yes at step S103), the count value of the timer is reset at step S105 that follows. The timer whose count value is reset at this step S105 then measures a predefined time in step S107 which follows. The processing performed in step S107 determines whether the time set by the aforementioned timer is elapsed. In other words, because of the need to determine in the subsequent step S111 whether or not the printing data sent by the computer equipment 2 contains encryption data, the program proceeds to step S109 to the predefined time flow (Yes at step S107) if data relating to the encryption was not sent by the computer equipment 2 before a delay corresponding to a predefined time of a second for example is expired. On the other hand, if this predefined time is not elapsed (No in step S107), the processing performed in the subsequent step S111 determines whether a position information of confidential data indicating the positional relation in the data record which must be kept secret (hereinafter referred to as "confidential data") and an encryption key used to encrypt them have been received or not as encryption data. If their reception has been validated (Yes in step S111), the program proceeds to the processing of the following step S113, while there is a return to the processing of the step S107 when it has not been able to be (No in step S111) to again measure the elapsed time. Thus, when the lapse of the prescribed period of time has been validated in step S107 (Yes in step S107), a predefined flag specifying whether or not the print data contains confidential data is set to [0] at step S109. Set to [0], this flag indicates that they do not contain one; they contain it if it is set to [1]. As a result, a processing of setting [1] of this flag is carried out in the following step S113 when it has been determined in step S111 that data relating to the particular encryption has been received (Yes to the step S111).

When the predefined flag is set to [1] in step S113, a reorganization processing of the public data and confidential data takes place in the following step S115. Indeed, when the print data contains data to be made public to third parties (public data) and data that it is desirable to keep secret by hiding them (confidential data) and that these data are placed pell-mell in the registration, a sharing processing between public data group and confidential data group is performed by permutation of the order in which the data are stored on the basis of the [position information indicating the positional relationships of the confidential data in the recording] acquired in step S111. For example, as shown in FIG. 5 (A), a print data record transmitted by the computer equipment 2 containing in this order public data A, confidential data a, public data B and data 3, the permutation effected in step S115 of the order in which these data are stored leads, as illustrated in FIG. 5 (B), to rearranging them in the order of public data A, public data B, confidential data a and confidential data R. This grouping between public data and confidential data has the effect of facilitating the addition processing of an end identification code and a confidential identification code in steps S121 and S125 In the following step S117, an encoding process is performed in accordance with the JIS basic specification (JIS X 0510: 2004) on each of the public data and confidential data. This process generates, on the one hand, the public data codes coded as code words representing the data to be made public and, on the other hand, the confidential data codes coded as code words that represent data to be kept secret. In step S121 the addition processing of an end identification code after the public data code takes place. The end identification code is constituted for example by the sequence [0000] in 4-bit coding and, as illustrated in FIG. 5 (C), is positioned just after the public data code B which follows the public data code A. For the sake of convenience, the public data codes are rendered in Figure 5 (C) by the expression [public codes] and the end identification code by that of [end character] respectively . Processing in the next step S123 determines whether or not the aforementioned predefined flag is set, i.e. whether confidential data is present or not. In the presence of confidential data (case where the flag is set to [1]: Yes in step S123), the program proceeds to the processing of step S125. In the absence of confidential data (case where the flag is set to [0]: No in step S123), the program goes to step S135 by disregarding the series of confidentiality treatments (steps S125 to S133). Steps S125 to S133 relate to a series of confidentiality processes that are executed when the print data contains confidential data. First, the processing of step S125 adds a confidentiality identification code just after the end identification code. The processing performed at this step S125 consists in placing a confidentiality identification code immediately after the end identification code, so as to indicate explicitly that the immediately subsequent data codes [have been coded as codewords representing confidential data]. By making tangible the presence of a confidential data code in the SQ information code (data code placed after the end identification code) when the QR code generated by this code generation process (information code SQ) is decoded by a reader of QR codes in particular (information code reader 20 for example), this operation makes it possible to prevent any reading of unwanted or distorted data which would have been unduly taken for confidential data, but also to avoid any incident that may result. The next step S127 determines by calculation the text length of the confidential data code, of which it adds the code just after the confidentiality identification code. This operation, which identifies the zone in which the confidential data code is placed and its range, makes it possible, during the decoding of the SQ information code resulting from this code generation process, by a reader of QR codes in particular (information code reader). For example), to know how far the confidential data code extends and whether it is an encrypted data code. In the example of Fig. 5 (C), the sum of the text length of the confidential data code a and the text length of the confidential data code 13, calculated as text length, is added just after the confidentiality identification code. In this same FIG. 5 (C), for the sake of convenience, the confidential data codes are noted [confidential codes] and the confidentiality identification code [confidentiality identifier], respectively. In the following step S129, the need or not to encrypt the confidential data codes is determined according to whether an encryption key (encryption key) is present or not. In other words, when an encryption key is received from the computer equipment 2 in the step S111, the encryption processing takes place in the step S131 since there is an encryption key (key encryption) (Yes at step S129). On the other hand, in the absence of an encryption key if it has not been received from the computer equipment 2 at step S111 (No at step S129), the program passes the processing of enciphering step S131 and accessing step S133.

Even if no encryption key has been received in step S111, however, it is found when the computer equipment 2 has previously stored one on an information storage medium such as the memory 12 or a hard disk (Yes at step S129), in which case the encryption process of step S131 takes place.

Step S131 performs the encryption processing of the confidential data codes. This treatment consists, for example, in encrypting the confidential data codes using a known visual cryptographic technique (visual secret sharing schemes). It thus increases the level of security compared to the addition of unencrypted plaintext data. In the example of FIG. 5 (D), the part [encrypted data] that constitutes the confidential data code a is encrypted, and is jointly generated a [start column], a [number of characters] and a [data item]. decryption key control]. The [start column] positioned at the top is a position information of the encrypted confidential data to which the value of the address expressible for the zero address assigned at the beginning of the print data corresponds. The [number of characters] that follows is the number of characters of the encrypted confidential data. On the basis of this position information, the data decoded by a QR code reader, in particular from the SQ information code generated by this code generation process, can be placed in respect of the positional relations that they occupied in the process. before encoding them as code words, even if they were not ordered. The [decryption key control data] added at the end is key identification information that allows you to specify your decryption key used to decrypt the secret code in question; in the case of a common key cryptosystem where the encryption key and the decryption key are identical (also called "secret key cryptosystem"), the decryption key control data also allows the key to be specified. encryption; hence the possibility of easily specifying the decryption key of the confidential data code (decryption key) during decoding by a QR code reader including the SQ information code generated by this code generation process, but also to determine whether or not it is a decryption key. In this regard, the confidential data code R has the same structure as the confidential data code a; thus, it may be to add as the decryption key control data the same information as the decryption key which decrypts the confidential data code a or, if the confidential data of the confidential data code [3 are encrypted with another encryption key different from that of the confidential data code a, to add a [decryption key control data] which specifies this other decryption key. Under these conditions, it becomes possible to easily specify the keys that make it possible to decrypt each confidential data code during the decoding by a QR code reader, in particular of the SQ information code generated by this code generation process, as well as determine whether or not keys are keys to decryption. The process performed in step S133 adds the confidential data code immediately after the text length. In the example shown in Fig. 5 (D), the confidential data code a and the confidential data code [3 are added after the text length. Since conventional two-dimensional code readers do not read the fill codes placed after the end identification code in two-dimensional code decoding, the confidential data codes thus placed after the end identification code can not be read. Thus, the existence of confidential data codes not being known even in reading by a conventional reader of two-dimensional codes containing them, the conditions for the user of this reader is not aware of the presence of confidential data s find some of them together. The processing performed in the following step S135 adds a fill code (fill data) after the confidential data code, in accordance with the processing algorithm described in the JIS fundamental specification (JIS X 0510: 2004). Subsequently, the processing of step S137 adds an error correction code. The error correction code thus added in step S137 is obtained by generating an error correction symbol for the data to be decrypted (public data codes, confidential data codes, etc.) according to a known method (algorithm generating error correction codes described in the JIS fundamental specification (JIS X 0510: 2004 for example)), and then encoding it as an error correction code. These processes generate data codes having the structure shown in Figure 5 (C). In step S139, different cells are created on the basis of the data codes generated in step S137, which are arranged in the data block illustrated in FIG. 6. With respect to the type 1 QR code shown in FIG. 6 and forming a square of 21 cells (modules) side, 26 blocks of data (AO to A25) consisting of 8 cells arranged on 2 columns of 4 lines are placed in the code area excluding the information of format (hatched areas of Figure 6), graduated patterns and registration patterns placed at the three corners. Referring to the example of Fig. 5 (C), the public data code A is placed at AO to A2, the public data code B at A3 to A6, and the end identification code at A7. Following this end identification code, the confidentiality identification code, the text length and the confidential data codes occupy the cells A8 to A1 7 which normally correspond to the positions where fill codes are inserted.

Is thus placed in A8 the confidentiality identification code, in A9 following the text length, then in the following cells A10 to A1 3 the confidential data code has, finally in Al 4 to Al 7 the confidential data code 13. As for a usual QR code, the error correction code is at the end in A20 to A25, and fill codes occupy cells A18 to A19 which correspond to empty areas. Furthermore, the cells A15 and A18 being positioned on either side of a graduated pattern, they are split into A15 and A15 ', and Al 8 and A18' respectively. In step S131, a decryption key proper can be added in place of the [decryption key control data], as shown in Fig. 5 (E). This makes it possible, even if a particular QR code reader decoding the SQ information code generated by the present code generation process does not have, for example, a decryption key of the confidential data code a, of decrypting the confidential data code. a and return the original plaintext if it is made that it is tempted to decipher the data codes subsequent to the confidential identification code when the presence of such a code has been recognized .

The same applies to the confidential data code 13 to which a decryption key itself can be added in the same way in place of the [decryption key control data]. The decryption key to be added may be the same as that decrypting the confidential data code a or when the confidential data of the confidential data code [3 have been encrypted with another encryption key different from that of the confidential data code a , but also not to be and in this case correspond to this other encryption key. This arrangement makes it possible, in particular when a QR code reader decodes the SQ information code generated by this code generation process, to decrypt the respective confidential data codes and to restore the original plaintext. it is made sure to try to decipher the data codes subsequent to the confidential identification code once the presence of such a code has been recognized, even if this QR code reader for example does not have the keys of respective decryption corresponding to each confidential data code.

Moreover, even when it has been concluded in step S123 that there is no confidential data (case where the flag is set to [0]: No in step S123), it is possible to insert between step S123 and step S135 an addition processing step before the unencrypted plaintext data of the [start column] and [number of characters] added in step S131, as illustrated Figure 5 (F). In doing so, the data decoded by a QR code reader, in particular from the SQ information code generated by this code generation process, can be placed in respect of the positional relations that they occupied in the recording before their coding as codewords, even if they were not ordered. As is apparent from the preceding description, the confidential data codes of the SQ information code generated by the code generation process executed by the microprocessor 11 of the information code generator 1 are placed in step S133 after the end identification code by partially or totally replacing the filling codes. Under these conditions, where the confidential data codes placed after the end identification data code can not be read by a conventional reader, the presence of data to be kept secret is not known even when read by a conventional reader. a two-dimensional code containing such confidential data codes. It is therefore possible to ensure that the user of such a conventional reader is not aware of the presence of confidential data.

No information corresponding to the decoded data of these confidential data codes being displayed on the screen of a conventional reader even if such confidential data codes are present, the user who is therefore not aware of the existence confidential data does not have to be suspicious or incited to illicit behavior such as breaking the code. Even if, moreover, the information corresponding to the decoded data of a confidential data code is a control data in particular, the display on the screen will not be likely to be disturbed because it will not be displayed there. In the aforementioned example, the description is illustrative of the printing of the SQ information code on a label P by the printer 10. This example is not limiting, however, since this information code SQ can be represented visually, for example in a configuration where the execution by the personal computer console 4 of the code generation process of FIG. 4 leads to displaying the information code SQ to the monitor 3. In this case, the Code generation processing of Figure 4 can be conceptualized as a computer program. Thus, the computer which functions as a two-dimensional code generator under the control of this two-dimensional code generation program has the same functions and effects as the microprocessor 11, in particular of the aforementioned printer 10.

In the aforementioned example, the description has also been made to illustrate it on the transmission of the printing data by the computer equipment 2 connected to the printer 10, but it remains possible with computer equipment capable of outputting data. textual like characters, kanji and symbols, to obtain the aforementioned functions and effects by adopting an architecture in which a device with such a function as a digital camera, a mobile phone, a laptop computer or a portable terminal is connected to the printer 10.

The architecture of the information code reader 20 is the subject of the following description. The information code reader 20 is a device which makes it possible to decode the SQ information codes generated by the information code generator 1, and then to display them on a support (SQ information codes printed by the device). printing 10 for example). Since the structures of the SQ information codes decodable by the information code reader 20 have already been described with reference to FIGS. 5 and 6, their description will therefore be omitted. In addition, this information code reader 20 can also read the usual two-dimensional QR codes (common QR codes devoid of confidential data after the end identification code in particular). The codes intended to be read by the information code reader 20 including these usual SQ information codes and these QR two-dimensional codes are designated by information codes C.

FIG. 7 shows that the information code reader 20 consists mainly of an optical system comprising a lighting light source 21, a photosensor 23 and an imaging lens 27 in particular, by a micro system comprising a memory 35, a control circuit 40, a service switch 42 and a liquid crystal display 46 in particular, and by an electrical circuit which comprises in particular a power switch 41 and a battery 49. These equipment mounted on unrepresented printed circuit boards or put under housings not shown offer a hardware architecture similar to that of a conventional QR codes reader.

The optical system is thus organized around a lighting light source 21, a photosensor 23 and an imaging lens 27 in particular. The illumination light source 21 whose function is to emit a lighting light Lf, may be constituted for example by a red LED diode and a diffusion lens or a convergent lens placed on the emission side of this LED. In the present configuration, two light sources 21 are installed on either side of the photoreceptor sensor 23 in a mounting which makes it possible to illuminate the label P by the illumination light Lf delivered through the reading orifice of FIG. a housing not shown. The aforementioned information code C is printed on this label P. The photosensor 23 is designed to receive the light Lr reflected by the label P and the information code C. Y correspond, by way of example, to the sensors of FIG. a two-dimensional array of photoreceptor elements constituted by semiconductor image detector devices such as C-MOS sensors and CCD sensors in particular. The photosensor 23 is mounted on a printed circuit board (not shown) so that its photoreceptive face 23a can receive the incident light which hits it via the imaging lens 27.

The imaging lens 27 acts as an imaging optical system for forming an image on the photoreceptor face 23a of the photosensor 23 by converging the incident light striking it through the reading port. It is constituted for example by a tube and by a plurality of convergent lenses housed inside this tube.

The following description relates to the overall architecture of the micro circuit. This micro circuit notably comprises an amplifier circuit 31, an analog-digital converter circuit 33, a memory 35, an address generator circuit 36, a synchronization signal generator circuit 38, a control circuit 40, a service switch 42 , an LED 43, a buzzer 44, a liquid crystal display 46 and a communication interface 48. As its name indicates, it is articulated around the control circuit 40 and the memory 35, which can operate in accordance with FIG. microcomputer.

Amplified by a predefined gain by accessing the amplifier circuit 31, the image signal output by the photosensor 23 of the optical system is input into the analog-to-digital converter circuit 33 to be converted from analog to digital signal. With this done, the resulting digitized image signal, i.e. the image data, is entered into the memory 35 for storage in the image data storage area. For its part, the synchronization signal generating circuit 38 is designed to be able to generate a synchronization signal intended for the photosensor 23 and the address generating circuit 36, which circuit 36 generates the storage addresses of the image data to be stored. in the memory 35 on the basis of the synchronization signal thus delivered to it this synchronizing signal generator circuit 38. The memory 35 is a semiconductor memory device such as a random access memory (DRAM memory, SRAM memory, etc.) and a read-only memory (EPROM memory, EEPROM memory, etc.) for example. The RAM of this memory 35 is designed to provide both a storage area of the aforementioned image data and a working area used by the control circuit 40 for the arithmetic operations and the theoretical operations associated with the different processes. In its read-only memory were previously implemented specific programs that allow in particular to perform the decoding processes described below, but also the system programs that control the various equipment such as the lighting light source 21 and the photosensor 23 in particular.

Microprocessor on the scale of the information code reader 20, the control circuit 40 consisting of a central unit, a system bus and an input-output interface in particular, forms with the memory 35 a computer equipment having functions of data processing. This control circuit 40 is adapted to connect to various I / O devices via an embedded I / O interface and, in a second embodiment, is connected to a power switch. 41, a service switch 42, an LED 43, a buzzer 44, a liquid crystal display 46 and a communication interface 48 in particular.

This configuration makes it possible to monitor and manage the power switch 41 and the service switch 42, to turn on and turn off the LED 43 serving as a signaling light, to switch on and off the sound of the audible alarm 44 which can emit a beep or an alarm, to control the screen of the liquid crystal display 46 to display the contents of the codes of the information code C lu, as well as to supervise the communication of the the communication interface 48 for communicating in series with the external devices. The peripherals connected to the communication interface 48 include in particular a main computer HST, which constitutes a hierarchically superior system to the information code reader 20. Moreover, the communication interface 48 also functions as an interface capable of handling communications with the computer terminal 60 (FIG. 1 in particular) below via a wireless communication system such as a wireless or infrared local area network or via a known wired communication system.

The supply circuit is constituted by the power switch 41 and the battery 49 in particular. The on-off switching of the power switch 41 managed by the control circuit 40 controls the passage or the breaking of the drive voltage supplied by the battery 49 to the various devices and circuits. The battery 49 is a secondary battery which supplies a DC voltage of determined level; for example, lithium batteries can provide this. This battery 49 is not required for architectures in which the power supply is provided by an external device such as the main computer HST (management unit 80) connected via the communication interface 48 for example.

When, in this configuration adopted for the information code reader 20, a predefined autodiagnosis initiated at power up to the power switch 41 is terminated normally and allows the reading of a C code information. input applied by the service switch 42 (electronic flip-flop for example) activates the emission of the lighting light Lf. Activation by the user-controlled electronic flip-flop causes the control circuit 40 to output on the basis of the synchronization signal a light-emitting signal to the illuminating light source 21; upon receipt of this light emission signal, the illumination light source 21 illuminates the LED that provides the illumination light Lf. The illumination light Lf which illuminates the information code C is then reflected; this reflected light Lr striking the imaging lens 27 through the orifice of the reader forms an image of the information code C on the photoreceptor face 23a of the photosensor 23. The image data of the photosensor 23 exposed by the image of the information code C are subjected to image processing by the micro system described above and are transmitted to the decoding process described later via the image data storage area of the memory 35.

The computer terminal 60 is presented as a desktop computer or a laptop. In its hardware configuration, it may be a personal computer such as a desktop computer, a notebook computer or an electronic tablet, but also a computer terminal such as a smartphone or a mobile phone . It can be configured to communicate with the reader 20 and, if it has been designed to provide access to the Internet, it may also be other types of information processing devices. This computer terminal 60 is at least equipped with a central unit, a memory unit structured around a random access memory, a read only memory, a non-volatile memory and other memory devices. a work area consisting of input devices such as keys and a touch panel, a display unit consisting of a known display device such as a liquid crystal display, and a display unit. communication supporting communications via a wireless communication system such as a wireless or infrared local area network or via a known wired communication system.

The management unit 80 (in this specification, the management unit 80 is also referred to as the "HST main computer") is constituted for example by a known computer. This management unit 80 is at least equipped with a central unit, a memory unit structured around a random access memory, a read-only memory, a non-volatile memory and other memory devices, and a work area consisting of input devices such as keys and a touch panel, a display unit consisting of a known display device such as a liquid crystal display, and a unit communication system 10 supporting communications by a wireless communication system such as a wireless or infrared local area network or a known wired communication system. This architecture may have been designed so that the management unit 80 (main computer HST) delivers to the information code generator 1 an encryption key used to encrypt the confidential data and a decryption key identical to this key The decoding process is described here with reference to FIGS. 8, 9 and 10. FIG. 8 represents a flowchart detailing the sequence of decoding operations carried out by the controller 20. the management unit 80. FIG. 9 is a flowchart detailing the progress of the decryption processing operations corresponding to the step S23 of FIG. 8. Finally, FIG. 10 illustrates a flow chart showing the progress of the operations of the transfer processing. indicated in step S24 of FIG. 8. As indicated in FIG. 8, the decoding process initiated for example by the activation of the circuit 40 and the memory 35 on powering the information code reader 20 firstly performs an initialization process in step S11. This processing has the effect of resetting the work area of the memory 35 and its image data storage area where the image data, but also the predefined flags and counters are stored. The information code reader 20 described herein is connected to the main computer HST (management unit 80), from which it acquires the decryption key data as adjustment data. Step S12 resets the count values of the timer. The timer whose count values are set to zero at this step S12 measures the time allotted in step S13.

The processing performed in step S13 determines whether the time allowed has been measured by this timer. In fact, for the purpose of determining in the next step S14 whether or not the setting data transmitted by the main computer HST contains decryption key data (decryption key), the program proceeds to the processing of the step S16 when the time runs out, five seconds for example, in the case where there has been no transmission by the HST main computer of encryption data before this time has elapsed (Yes to step S205). On the other hand, when the time allowed is not past (No in step S13), the processing performed in step S14 will determine whether or not a decryption key has been received. If yes (Yes at step S14), the program proceeds to step S15 which follows, but returns to step S13 if this reception could not be confirmed (No to step S14), where again the time is measured. The decryption key (decryption key) transmitted by the main computer HST may be previously stored in the memory 35 for example. In this case, the memory 35 corresponds to an example of a decryption key storage unit where decryption keys are stored. If it is found in step S13 that the time has elapsed (Yes in step S13), the value of the predefined [Key] flag is set to [0] in step S16. This flag [Key] indicates whether or not the confidential data codes of the SQ information code are decrypted by a decryption key, the value [0] (case of Key = 0) indicating that there is no decryption by a decryption key and the value [1] (case of Key = 1) that there is decryption by a decryption key. Therefore, if it has been determined in step S14 that a decryption key has been received (Yes in step S14), the processing performed in step S15 which follows sets [1] to the value of this flag [Key]. After the value of the predefined [Key] flag has been set to [1] in step S15 or step S16, the next step S17 acquires the image data. For this purpose, an extraction processing of the image data stored in the image data storage area of the memory 35 takes place, which allows for example to obtain the coded image of the information code C as shown in Fig. 6. In step S18 which follows, detection processing of the locating patterns is performed. The detection of the identification patterns present in the three corners of the information code C as illustrated in FIG. 6 leads to detecting the profile of the information code C in the following step S19. The detection of these locating patterns placed at the three corners and that of the code profile can be achieved by a known method implemented for the QR code (registered trademark). Next, the calculation processing of the central coordinates of each cell operated in step S20 makes it possible to determine in step S21 the color, black or white, of each cell. This operation giving access to the format information indicated in FIG. 6 (hatched areas of FIG. 6) and the data blocks, the following step S22 determines, in the presence of a block of missing or other data, whether is possible to correct it. When it has been determined in step S22 that such an error correction was possible (Yes in step S22), the error is corrected, then a decryption process is performed in step S23 which follows . On the other hand, since the error can not be corrected when the possibility of correcting it could not be validated in step S22 (No in step S22), the program proceeds to step S17 and each of the processing steps S17 to S22 is performed on the basis of a new image data acquisition. These treatments of steps S20 to S22 can also be carried out according to a known method applied with the QR code (registered trademark). The details of the step S23 are specified therein, the following description of the decryption process will be made with reference to FIG. 9. As shown in FIG. 9, the decryption process consists first of all in setting to zero ( 0) the values of the [Encryption] and [KeyError] flags in step S31. The respective values of [n], [Slow], [Len2] are then set to 0 (zero) in step S32. Step S33 performs acquisition processing of the nth data code indicated by the counter n. The following step S34 determines whether this nth data code acquired in step S33 is or not an end identification code. If it turns out that this data code acquired in step S33 is an end identification code (Yes in step S34), the program proceeds to the processing of step 40 since the usual data codes placed before the end identification code are therefore complete and the information code C in question no longer contains others. If, on the other hand, it turns out that the data code acquired in step S33 is not an end identification code (No in step S34), thereby indicating that there still exist usual data before the end identification code is reached, the program proceeds to the processing of the next step S35 where the acquisition of the following data code, ie the number of codes (number of characters) takes place i of the (n + 1) -th data code. As described with reference to Fig. 5 (D), this operation is based on the fact that the number of characters is stored at the position corresponding to the second character of the data code, the details in paragraph [8.4 Coding data] of the JIS fundamental specification (JIS - X 0510: 2004). The acquisition of the number of codes (number of characters) i in step S35 gives access to the step S36 which follows where a data number acquisition processing takes place for this single number of characters (i) , then in step S37 by performing a decryption (decoding) process of the data code in question, i.e., the public data code (code of data encoded as codewords representing data to be made public).

After completion of the decryption processing of the data codes in step S37, step S38 sets the counter n to [n + j + 1] to indicate the next data code. Then in step S39, there is addition of the value of the number of characters i acquired in S35 to the current value of [Slow]. In this way, [Slow] represents the total number of characters counted up to the end identification code. When step S34 is set to Yes, it is arranged to obtain the total number of characters present up to the end identification code. After step S39, an acquisition process of the nth data code is again carried out by returning to the processing of step S33.

The steps S33 to S39 thus relate to a decoding process by acquisition of the usual data codes (first data code, public data codes) which are intrinsically placed in front of the end identification code (the start side of the data with respect to the code end identification in the data chain of Fig. 5 (C)) and decoded. The control circuit 40 in particular which executes these different steps corresponds to an example of [first decoding unit], whose function is to decipher the content placed upstream of the end identification code in a code string.

The processing carried out in step S40 determines whether or not the predefined [Key] flag has been set to [1], that is to say if decryption by a decryption key of the confidential data code of the information code C. If it is established that this flag is not set to [1] (No in step S40), this decryption process is terminated because no decryption with a decryption key then imposes itself.

On the other hand, when the predefined flag [Key] has been set to [1] (Yes to step S40), the need to decrypt with a decryption key makes the processing in step S41 which follows, where the counter n is set to n + 1, then to step S42 where an acquisition process of the nth data code indicated by the counter n is performed. Then, in the following step S43, the nth data code acquired in step S42 is processed to determine whether or not it is a confidentiality identification code. In particular, the control circuit 40 executing this step S43 corresponds to an example of a [decision unit] whose function is to determine whether confidential data codes are placed after the end identification code. Indeed, the step S43 essentially determines that confidential data codes are present after the end identification code if it is a confidential identification code and, if this is not the case , that no confidential data code appears after the end identification code. The presence of a confidential data code downstream of the data code identified as the confidentiality identification code (Yes in step S43) causes the program to proceed to the processing of the successive step S44 of acquiring the code of 35. next data, i.e. the number of characters i (number of secret codes) of the (n + 1) th data code. As for step S35, this operation is based on the fact that the number of characters is stored at the position corresponding to the second character of the data code.

When step S43 has validated the presence of a confidential identification code, it can be made to notify the main computer HST of its presence in the information code C in question. This arrangement makes it possible to know at the main computer level HST that the data codes coming after the end identification code are confidential data codes. Furthermore, in the case where information other than a filling code but without being a confidential data code (for example information that no longer corresponds to a filling code due to inconsistent data) would be placed in the zone. number of codes after the end identification code intended to accommodate only such filling codes (empty part of the code area), the fact that no information indicating that it is a confidential data code is delivered to the main computer to prevent any false maneuver may be induced by the decoding of such information other than a confidential data code.

On the other hand, if it could not be determined that the data code in question was a confidentiality identification code (No at step S43), the present decryption process is terminated, no confidential data code therefore not included in the information code C in question beyond the confidentiality identification code.

If there is acquisition in step S44 of the number of characters i (number of secret codes, also called "number of columns of secret codes"), step S45 which follows gives rise to the acquisition of the data codes confidential, in particular from the empty data area (data area after the confidentiality identification code), which are subject to a confidential data acquisition processing for the only number of data j of this number secret codes (i). In addition, step S47 sets the counter n to the next data item, i.e., sets it to [n + 1 + j] to indicate the decryption key control data item, and then acquires of this umpteenth decryption key control data (key identification information).

Based on the decryption key control data acquired in this step S47, step S48 determines whether the decryption key received from the main computer HST at the previous step S14 is suitable as a key for decrypting the data. encrypted this nth confidential data code (in other words, if the encryption key used for the encryption of the nth confidential data code is compatible with the decryption key that has been prepared). If the compatibility of this decryption key is established in step S48 (Yes in step S48), decryption of the encrypted data (confidential data) in step S49 that follows. In this regard, this encryption uses a known visual cryptographic technique (visual secret sharing schemes), which allows decryption to return to the original plaintext even in the case where the encrypted data of confidential data code l have been through such a visual cryptographic technique. On the other hand, if the compatibility of the decryption key could not be established in step S48 (No in step S48), the value of [KeyError] is set to [1] in step S52. In this way, the value taken by [KeyError] is information that specifies whether the decryption key (decryption key) stored in the reader 20 is compatible or not with the encryption key (encryption key) used to encrypt the code confidential data. [KeyError] = 1 means that the decryption key (decryption key) stored in the reader 20 is not compatible with the encryption key (encryption key) used to encrypt the confidential data code. The processing of step S50 decrypts the confidential data code. In other words, since the encrypted data (confidential data) could be decrypted in the previous step S49, the confidential data code is decrypted (decoded) on the basis of the encrypted data thus decrypted at this step S49. Then there is also acquisition of the number of characters decrypted k. At the end of the decryption processing of step S50, the value of [Encryption] is set to step S51. Thus, the value of [Encryption] is information that specifies whether or not a confidential data code has been decrypted, 1 indicating that the confidential data code has been decrypted, 0 that it has not been decrypted. In addition, the value of [Len2] is set to [Slow + k] in step S51. In this way, the post-processing steps S34, S40 of FIG. 9 will acquire and decode the data codes placed after the end identification code, originally not decoded (confidential data codes). The control circuit 40 in particular which executes these different steps corresponds to an example of [second decoding unit], the function of which is to decode the confidential data codes whose presence has been established by the decision unit. The processes of FIG. 9 illustrate by way of example the process which leads to deciphering the SQ information code in which, as indicated in FIG. 12, a type of confidential data (encrypted data) is placed after a code of confidentiality identifier (confidentiality identifier), a number of secret code columns (number of characters) is it before these confidential data and a decoding key control data is after it (that is to say a configuration in which a type of confidential data is recorded in accordance with the data structure of Fig. 5 (C)); however, in the case of an SQ information code in which several types of confidential data have been recorded as illustrated in FIG. 5 (C), it suffices to apply the treatments of steps S42 to S50 to the plurality of privacy codes for each privacy code to be decrypted.

As is apparent from the preceding description, the information code reader 20 thus constituted makes it possible to decode a confidential data code even if this confidential data code (second data code) is placed in the code area after the code end identification where there are originally only fill codes (empty part of the code area). It is therefore possible to decode data codes which are in the empty part of the code area where code words are to be placed. Thus, the information code reader 20 makes it possible to decode the information code SQ generated by the aforementioned information code generator 1.

The configuration retained in the previous decoding process is that of the acquisition of decoding key control data, but it may very well be for example to acquire a decryption key in place of the processing of the step S47 when a decryption key proper as described with reference to Figure 5 (E) is added to the confidential data code. Even in the presence of confidential data codes encrypted with different encryption keys, it is still possible by making sure to acquire each decryption key in place of step S47 when each decryption key is added to each of the decryption keys. confidential data codes, to return to the original plaintext by decryption of the respective confidential data codes, even if the information code reader 20 in question does not have the decryption keys.

The following description relates to the data transfer processing performed in step S24 of FIG. 8. This processing is carried out for example according to the flow chart shown in FIG. 10, according to a process of transferring data from the reader 20 to another computer terminal 60 for example. This computer terminal 60 to which the data is transferred can be a particular device predefined in the reader 20, but also correspond to the device which establishes the communication with the reader 20 during the processing of FIG. 10. This treatment determines firstly whether the value of [KeyError] is not 1. If [KeyError] is 1, indicating that the decryption key (decryption key) stored in the reader 20 is not compatible with the encryption key used when encrypting the encryption key. confidential data code, the confidential data code is therefore not decrypted. In this case, step S61 validates the Yes option and error processing is performed in step S72. This error processing may for example consist of sounding an alarm by means of the buzzer 44, but also to display an error message to the display unit of the liquid crystal display 46 in particular. It can also be a predefined signal provided by the LED 43 (flashing for example).

On the other hand, when the value of [KeyError] is 0, step S61 is set to No and the value of n is initialized to 0. Then, the value of [cp] is applied to the start address of the data. decrypted (read results) obtained at the end of the decryption process of FIG. 9.

Step S63 then determines whether the value of [Encryption] is or is not 0. The option validated in step S62 being No for [Encryption] equaling 1, the characters [SC]] are transferred as a mark of code. In other words, the information code that the program tries to read in FIG. 8 is an SQ information code generated by the aforementioned generator 1, and [Encryption] taking the value 1 in step S51 of FIG. Fig. 9 When there is decryption of confidential data codes by the processing of Fig. 9, the characters [SQ] are transferred to step S64 as identification information.

In this configuration, the control circuit 40 which executes the processing of steps S63, S64 in particular corresponds to an example of [processing unit]; if, in this example, the confidential data code has been decrypted by the [second decoding unit] above, the matching process consists in presenting the decryption results, whereas a predefined identification information (mark [SQ]) is mapped to the confidential data code decryption results thus presented. On the other hand, when the value of [Encryption] is 0, the Yes option of step S62 is enabled and the program transfers to the computer terminal 60 the [OR] characters as a code mark. Thus, when the information code C that the program seeks to read in FIG. 8 is a usual QR code that does not contain confidential data codes, steps S40 or S43 of the processing of FIG. 9 are set to No and the processing of step S51 is not executed; in this case, [Encryption] remains unchanged at its initial value of 0 and follows at step S65 the transfer of the characters [OR] to the computer terminal 60. Indeed, in this configuration, the [SQ] characters are transferred as first identification information in case of decryption of confidential data codes by the processing of Figure 9; in the absence of such decryption by this processing, the characters [OR] are transferred as the second identification information distinct from this first identification information.

After steps S64 or S65, the processing performed in step S66 determines whether n is or is not the value of [Slow]. With No in step S66, the processing of step S67 determines whether n is the value of [Len2] or not. With No in step S67, the data of the address cp is transferred to the computer terminal 60 in step S70, then the values of n and cp are incremented. If, in this processing, the address specified by cp is in the read result field of the public data codes, steps S66 and S67 set to No, the processing of step S70 is reiterated, and the Reading results of the public data codes are transferred in order. When otherwise n is set to [Slow], i.e. when the read results of the public data codes have all been finished, the program enables the Yes option at step S66. and the mark ["] which is the start identifier of confidential data is transferred. Thus, in the transfer processing of the repetitive step S70 after the step S68, the read results of the confidential data codes are transferred in turn. If, in this processing, the address specified by cp is located after step S68 in the read results field of the confidential data codes, the program validates the No option at steps S66 and S67, the processing of the Step S70 is reiterated and the read results of the confidential data codes are transferred in order. When n is set to [Len2], i.e. when the read results of the confidential data codes have all been transferred, the Yes option of step S67 is validated and the mark [ Constituting the end-of-confidential data identifier is transferred.

In this configuration, the computer terminal 60 acquires the reading results of the public data codes (public data recorded as public data codes) and those of reading the confidential data codes, inserted between a confidential data start identifier and an identifier. end of confidential data (confidential data recorded as confidential data codes). In the example illustrated in FIG. 12, the data of the information code SQ is arranged in a form in which the [QR code presentation site information], treated as public data, is recorded in the code 35 SQ information as public data code. The address of the site labeled [http://www.abcdef.com], treated as confidential data, is encrypted in the SQ information code as a confidential data code. When the reader 20 decrypts this information code SQ following the processing of FIG. 8 and transfers it according to that of FIG. 10, the computer terminal 60, on receiving this transferred data, proceeds first to the acquisition identification information [SQ], then to that of the reading results of the public data codes, that is, [QR code presentation site information]. Then there is the acquisition of information ["http://www.abcdef.com"] which constitutes the confidential data. The analysis made by the computer terminal 60 of the series of data thus received enables it by detecting the identification information [SQ] to highlight the presence of confidential data in the received data. The detection of symbols ["] and ["] makes it possible to specify that the data they enclose are confidential data, hence the possibility of specifying [http://www.abcdef.com] as constituting by nature a given data 15 confidential. On the other hand, when the information code C read by the reader 20 following the processing of FIG. 8 takes the usual layout of a QR code (registered trademark) illustrated by FIG. 13, the computer terminal 60, on receiving these read results, proceeds first to the acquisition of the information [OR], then to that of the reading results of the public data codes (address data 20 [http: //www.abcdef. cm] in the example of Figure 13). Figure 14 illustrates an exemplary identifier (mode indicator) common to the SQ information code and the current QR code. In this configuration, the mode identifier [0000] is treated as an end identification code for example. Whether it is an SQ information code or a custom QR code, the same structure can be attributed to the public data and the end identification code; for example, as shown in Figure 13, the mode identifier is assigned at the beginning of each of the data that constitutes the public data, which allows to specify the mode to which each data belongs. The following description relates to the connection processing performed by the computer terminal 60. In the connection process illustrated in FIG. 11, the different initializations are first carried out in the step S81, and then the process determines whether whether or not data was received from the reader 20 (S82). In the absence of data received from the reader 20 after the initialization has been completed, the program goes to No in step S82 and a waiting state is established durably (waiting state for receiving data from of the reader 20). If there has been reception of data from the reader 20 at the end of the initialization process, the program proceeds to Yes at step S82, and it is determined whether or not there has been reception of a stop character indicating the end of the data. With No in step S83, a storage process in step 84 is repeated until a stop character is received. Receiving a stop character (i.e., when the series of data sent by the reader 20 has been fully received) validates the Yes option in step S83. The Yes option in step S83 links to the detection of the code mark from the data provided by the reader 20 (i.e. data from the transfer processing of FIG. 9). When the code mark contained in the data received from the reader 20 is not [SQ] but [QR], the valid program No at step S86 because the data in question does not result from the decryption of a confidential data code, and this connection process is terminated. In other words, when the data sent by the reader 20 does not result from the decryption of an SQ information code containing confidential data, but from data for which a custom two-dimensional QR code has been decrypted, no processing of connection to a website does not take place even if this data contains a URL indicating the address (Internet address). On the other hand, the data received from the reader 20 which contains the code mark [SQ] is held to result from the decryption of a confidential data code. In this case, step S86 is set to Yes and it is determined (step S87) whether the characters ["] ["] confidential data identifiers have been detected in the received data. If these confidential data identifiers could be, step S87 goes to Yes and there is extraction (step S88) of the address information (URL) of the website on the Internet that is specified by the data in this field. If it has not been possible to detect confidential data identifiers, step S87 is set to No and the processing of figure 11 is terminated. Then, there is connection to the website destined for Internet specified by the address information retrieved in step S88, the results of which are displayed on a particular display screen (step S89). For example, where the address inserted between the confidential data identifiers ["] and ["] is a website offered by a specific service provider (company, shop, public body, individual, other agents, for example), there is acquired from this website an image proposed by the latter, which is displayed on the display unit of the computer terminal 60. Thus, no connection to the site takes place in the absence of information address obtained from a confidential data code in the processing of Figure 11 (address associated with confidential data identifiers). When a confidential data code has been decrypted by the control circuit 40 corresponding to the second decoding unit of the aforementioned information code reader 20, a matching process is performed by this control circuit 40 acting as processing unit, which presents both the decrypted results of the confidential data code in question and the predefined identification information (mark [SQ], marks ["], ["])). In this way, the presentation of the results of decryption of confidential data codes mapped to the identification information makes it possible for the external device constituted by the computer terminal 60 to decide more easily and more precisely whether the data presented are not valid confidential data.

If there has been decryption of a confidential data code, the control circuit 40 corresponding to the processing unit has combined data whose structure results from the placement of the upstream identification information (mark ["] ) as identification information placed in front of the chain of decrypted data obtained by decryption of that confidential data code, and the placement of the downstream identification information (mark ["]) as identification information placed behind the chain of data of these decrypted data (data including data structure "http://abcdef.cm" for example). Such a configuration makes it possible to know more precisely whether the data presented is valid confidential data or not, while facilitating the more detailed knowledge of the domain occupied in the data string by these valid confidential data present within the data thus presented.

If there has been no decryption of a confidential data code and a public data code has been decrypted, the control circuit 40 corresponding to the processing unit presents the decryption results of this code of data. public data by no longer matching the mark 5 [SQ] as identification information, but the mark [QR] as other information (i.e., the decrypted results of the content placed upstream of the code of end identification in the code string). Such a configuration makes it possible, if it has not been matched [SQ] in the data presented or if the mark [OR] has been, to specify that the data presented does not contain confidential data. valid. Moreover, it can be made so for the processing of FIGS. 8 and 9 that in the case of decryption of a confidential data code, the control circuit 40 acting as a processing unit puts the decrypted data which results from such a decryption of confidential data code in correspondence with the identification information (mark [SQ], marks ["], ["]) and stores them in the memory 35 (memory unit) or in an external memory device In other words, it can be made in the above example that data similar to those sent in step S24 are stored in the memory 35 in case of decryption of confidential data codes. . It is therefore easier to quickly and accurately distinguish whether the decrypted data of a confidential data code and stored by matching them with the credentials is or is not valid confidential data. Moreover, it can be done so for the processing of FIGS. 8 and 9, when it has not been deciphered of confidential data code, but a public data code has been, that the circuit 40, that is to say the processing unit, puts the result of the decryption of this public data code in correspondence not with the mark [SQ] as identification information, but with the mark [ QR] as other information (i.e., the result of decrypting the content placed upstream of the end identification code in the code string) and stores it in the memory 35 (memory unit) or in a An external memory device connected to the reader 20. In doing so, it is possible to specify that valid confidential data is not contained in the stored data if it has not been mapped to the [SQ] mark. or if they have been with the mark [Q R]. The above example illustrated the presentation of the results of decryption of confidential data codes or their storage for the matching process in the case of decryption of such confidential data codes, but it may very well be a matter of processing adapted to the decryption result of the confidential data codes. Such a [processing adapted to the result of decryption of confidential data codes] may notably consist in executing a command contained in the decrypted confidential data code. For example, when the aforementioned address information and a command indicating to [send to the computer terminal 60] have been recorded as confidential data code content, a processing such as that of FIG. 10 is executed in response to this command for sending to the computer terminal 60 address information matched with the identification information. In addition, when the content stored in the confidential data code corresponds to a predefined information and to a command of [storage in memory 35], this command will store in the memory 35 this predefined information matched with the information of identification.

Such an arrangement makes it possible to specify a posteriori that the information stored in the memory 35 is valid confidential data. In this configuration equipped with a computer terminal 60 (connecting portion) which connects to each of the sites of a given network, the information code generator 1 generates confidential data codes containing an address information which specifies an address within the network. On the other hand, the processing unit of the reader 20, if there has been decryption of a confidential data code by the second decoding unit, delivers to the computer terminal 60 at least the address information set. correspondence with identification information, which computer terminal 60 (connection portion) is adapted to connect to the site specified by the address information provided that there is presentation of the addressed address information in correspondence with the identification information.

In this configuration, the computer terminal 60 (connection portion) accesses the site specified by this address information, provided that the address information has been mapped to the identification information in the data from the processing unit. Conversely, when the data presented is not valid confidential data, access to the site specified by this illegal data may be restricted. By adopting this technique, the access of the computer terminal 60 (connection portion) to another site will not be done until the identification information has been matched even in the case of a fraudulent act to orient the user to this other site by affixing another two-dimensional code in which is recorded the address of this other site on the information code where were stored confidential data for example. It is therefore possible to defeat more effectively such access by fraudulent diversion. In addition, the information code generator 1 generates a confidential data code by encryption and encryption of data to be kept secret based on predefined encryption keys. However, the information code reader, provided with a memory 35 where the decryption keys (encryption key storage unit) are stored, is designed so that the control circuit 40 acting as a second decoding unit tries to when the presence of a confidential data code has been validated, to decrypt it using the decryption key stored in the memory 35 (decryption key storage unit). In the event of successful decryption with this decryption key, it performs the mapping processing, then presents or stores the identification information; on the other hand, it delivers an alarm of a predefined nature (processing of the step S72) in the event of failure of decryption with the decryption key.

In this operating mode where an alarm is given in the event of failure of the decryption, in particular when the decryption key stored in the reader 20 is not a valid key for example, the user, armed with this alert, will know that the matching process did not proceed normally and could easily grasp the cause. [Other Embodiments] The present invention is not limited to the single embodiment which has just been described with reference to the figures above, since the following embodiments, for example, also fall within the technical scope of its claims. In the architecture of FIG. 1 in particular, the information code generator 1 and the information code reader 20 formed, for example, separate devices; however, this information code generator 1 can also act as an information code reader 20. The computer terminal 60 of the first embodiment formed a separate connection portion of the reader 20, but it is not excluded that opt for an architecture in which a portion of this reader 20 serves as a connection portion (control circuit 40 and communication interface 48). In other words, it may be a configuration in which the program executing the processing of FIG. 11 is stored in the reader 20 and where the control circuit 40 executes this program. In this case, it is sufficient that the so-called transfer operations of Figure 10 are replaced by the concept of transfer to the program in question. For its part, the so-called "reception" part of FIG. 11 can be by the concept of extraction by the reader 20. The control circuit 40 which constitutes in this case the processing unit of the reader 20 stores in the memory 35, if a confidential data code has been decrypted, at least the address information matched with the identification information. If this address information mapped to the identification information is stored in the memory of the reader 20, the program executing the processing of FIG. 11 will connect to its launch at the site specified by this address information.

The example presented focused on an information code generator whose SQ information codes are printed; however, these may very well not be. By way of example, the information code generator 1 can generate image data from which the image of the SQ information code is displayed, in which case the SQ information code thus generated can be acquired. by a display medium (portable computer terminal equipped with a display device or fixed computer terminal) by sending or migration of data via a storage medium, and thus come to display there. It may also be an architecture in which the information code generator 1 marks on an object the SQ information code generated by the processing of FIG. 4 by application of a known direct marking method. The first embodiment illustrated an exemplary SQ information code generated by the code generator 1 in which, when the total number of public data codes encoded as code words representing data to be made public is less than the capacity. of the code area where the codewords are to be placed, the end identification code indicating the end of the code string formed by the public data codes placed in the code area is placed at the very end of this string , but this example is not limiting.

When, by way of example, the total number of public data codes coded as code words representing data to be made public from the information code SQ generated by the information code generator 1 is less than the capacity of the code area where the codewords are to be placed, the end identification information which identifies the end position of the code string formed by the public data codes can be set to a predefined position of this code code. chain. In this case, the confidential data codes encoded as code words representing data to be held secret may be after the end position specified by the end identification information.

Various examples of end identification information may be envisaged and, instead of the end identification code of the first embodiment, end position data to specify the end position of the formed code string. by the public data codes] obtained by calculating the overall text length of the public data codes (i.e. the data for specifying the text length to the end position) may be placed or added at the beginning of the public data codes. This procedure allows you to specify the length and range of the data up to the end position of the public data code, as well as to know the position at which the public data codes end (end position). In this case, when a confidential data code is incorporated in the SQ information code, it is sufficient after adding a confidentiality identification code in particular following the end position specified by the end identification information. (end position data), insert a privacy identification code similar to that of the first embodiment.

In the SQ information code, the confidential data codes placed after the end identification code or after the end position specified by the end identification information may correspond to the aforementioned confidential data codes encoded as code words representing data to be kept secret, but also after having been the subject of a predefined treatment. By predefined processing is meant, among other things, the reorganization of the constituent bits of the confidential data, their distributed arrangement as well as the conversion of the value of the data specified by the constituent bits of the confidential data. Again, specifying this drive side processing mode 20 decrypts the confidential data codes. [Legend of symbols] 1 ... Information code generator 20 ... Code reader 35 ... Memory (memory unit, decryption key storage unit) 40 ... Control circuit (first decoding unit, decision unit, second decoding unit, processing unit) 60 ... Computer terminal (connection portion) 100 ... SQ information code utilization system ... Code of information

Claims (10)

REVENDICATIONS1. System for using an information code (100), characterized in that it comprises: - an information code generator (1) which generates an information code (SQ), and - a reader of information an information code (20) which reads the information code (SQ) generated by the information code generator, wherein the information code generator is configured to generate an information code (SQ) of such so that, A) when a total number of public data codes encoded as codewords representing data to be made public is less than a maximum capacity of the code area where these codewords are to be stored, i) a code end identification is added immediately after a code string composed of the public data codes stored in the code area, the end identification code indicating an end of the code string, or ii) identification information end is arranged at a given position in the a code string in the code area, the end identification information that identifies an end position of the code string composed of the public data codes in the code area, and B) where the codes of confidential data coded as code words representing data to be held secret are disposed after the end identification code or after the end position identified by the end identification information, and the information code reader ( 20) comprises, a first decoding unit which attempts to decipher either all the code words arranged before the end identification code in the code string or all the codewords arranged before the end position in the code string , the end position being identified by the end identification information a decision unit which determines whether or not a confidential data code is stored either after the end identification code or after the end identification code. end position in the code string, a second decoding unit which decodes the confidential data codes when the decision unit determines that the confidential data codes are stored in the code string, and a processing unit which, when the second decoding unit has decoded the confidential data code, i) performs a first treatment consisting at least of delivering the decryption results of the confidential data code, storing the decryption results of the confidential data code or performing according to the results decrypting the confidential data code, and ii) performs a second processing consisting of either delivering or storing a predetermined identification information. A system for using an information code (100) according to claim 1, characterized in that the processing unit is configured to: store in a predetermined memory portion (35) or deliver both data decrypted from the confidential data codes and identification information that are matched when the second decoding unit has decoded the confidential data codes, and store in the memory portion (35) or issue, without the information identification, the decrypted results of all the codewords arranged before the end identification code in the code string or the decrypted results of all the codewords arranged before the end position identified by the information of end identification in the code string when the second decoding unit has not decoded the confidential data codes. An information code utilization system (100) according to claim 2, characterized in that the processing unit is configured to store in the memory portion (35) or to output combined data in which a upstream identification information is added upstream of the stored data of the decrypted data and downstream identification information is added downstream of the stored data of the decrypted data when the second decoding unit has decoded the confidential data codes, the information upstream and downstream identification being the identification information. 4. A system for using an information code (100) according to any one of claims 1 to 3, characterized in that the system comprises a connection portion (60) connecting to the different sites of a network predefined, the information code generator is configured to generate the confidential data code which includes address information specifying an address within the network, the processing unit is configured to store in the memory portion (35) or to deliver at least the address information and the identification information that are matched when the second decoding unit has decoded the confidential data code; and the connection portion (60) is configured to connect to the site specified by the address information when the address information and the identification information that are mapped are delivered or stored in the portion. memory (35). An information code usage system (100) according to any one of claims 1 to 4, characterized in that the information code generator is configured to generate the confidential data codes by encrypting the data to be kept secret on the basis of a predetermined encryption key, and coding the data to be secret encrypted; the information code reader (20) comprises a decryption key storage unit in which a decryption key is stored; and the second decoding unit is configured to: attempt to decode the secret data by using the decryption key stored in the decryption key storage unit when the decision unit determines that the confidential data codes are stored , Performing the first processing and the second processing when the confidential data codes have been decrypted successfully according to the decryption key, and performing a predetermined alert processing when the confidential data codes have been decrypted without success. 30 An information code reader (20) capable of reading an information code (SQ) in which A) when a total number of public data codes encoded as codewords representing data to be made public is less than at a maximum capacity of the code area where these code words are to be stored, i) an end identification code is added immediately after a code string composed of the public data codes stored in the code area, the code identification end indicating an end of the code string, or ii) end identification information is disposed at a given position in the code string in the code area, the end identification information which 5 identifies an end position of the code string composed of the public data codes in the code area, and B) the confidential data codes encoded as codewords representing data to be kept secret are available. immediately after the end identification code or immediately after the end position identified by the end identification information, characterized in that the information code reader (20) comprises a first decoding unit which attempts to decipher either all the codewords arranged before the end identification code in the code string or all the code words stored before the end position in the code string, the end position being identified by the code code. end identification information a decision unit which determines whether or not a confidential data code is stored either after the end identification code or after the end position in the code string, a second decoding unit which decodes the confidential data codes when the decision unit determines that the confidential data codes are stored in the code string, and a processing unit which, when the second decoding unit has decoded the confidential data code, i) performs a first treatment consisting at least of delivering the decryption results of the confidential data code, storing the decryption results of the confidential data code or performing according to the decryption results of the confidential data code, and ii) performs a second processing consisting either of delivering or storing a predetermined identification information. 30 An information code reader (20) according to claim 6, characterized in that the processing unit is configured to: store in a predetermined memory portion (35) or deliver both the decrypted data of the code confidential data and identification information which are matched when the second decoding unit has decoded the confidential data codes, andemore in the memory portion (35) or issue, without the identification information, the decrypted results of all the codewords arranged before the end identification code in the code string or the decrypted results of all the codewords arranged before the end position identified by the end identification information in the code string when the second decoding unit has not decoded the confidential data codes. An information code reader (20) according to claim 7, characterized in that the processing unit is configured to store in the memory portion (35) or to provide combined data in which identification information The upstream is added upstream of the stored data constituting the decrypted data, and downstream identification information is added downstream of the stored data constituting the decrypted data when the second decoding unit has decoded the confidential data codes, the identification information. upstream and downstream being the identification information. An information code reader (20) according to any one of claims 6 to 8, characterized in that the system comprises a connection portion (60) connecting to the various sites of a predefined network, the generator information code is configured to generate the confidential data code which includes address information specifying an address within the network, the processing unit is configured to store in the memory portion (35) or to deliver at least the address information and identification information that are matched when the second decoding unit has decoded the confidential data code; and the connection portion (60) is configured to connect to the site specified by the address information when the address information and the identification information that are mapped are delivered or stored in the portion. memory (35). An information code reader (20) according to any one of claims 6 to 9, characterized in that the confidential data codes are codes produced by encrypting the data to be kept secret, on the basis of a key d predetermined encryption, and coding data to keep secret encrypted; the information code reader (20) comprises a decryption key storage unit in which a decryption key is stored; and the second decoding unit is configured to: attempt to decode the secret data by using the decryption key stored in the decryption key storage unit when the decision unit determines that the confidential data codes are stored , performing the first processing and the second processing when the confidential data codes have been decrypted successfully according to the decryption key, and performing a predetermined alert processing when the confidential data codes have been decrypted without success.