WO2019127514A1

WO2019127514A1 - Graphic code generation method and apparatus, graphic code verification method and apparatus, device, and storage medium

Info

Publication number: WO2019127514A1
Application number: PCT/CN2017/120244
Authority: WO
Inventors: 张振山
Original assignee: 国民技术股份有限公司
Priority date: 2017-12-29
Filing date: 2017-12-29
Publication date: 2019-07-04
Also published as: CN112106072A

Abstract

A graphic code generation method and apparatus, a graphic code verification method and apparatus, a device, and a computer-readable storage medium. The generation method comprises: firstly acquiring a unique identifier (S101); binding the identifier to a byte to be encoded (S102); then generating a main body portion of a graphic code according to the bound byte to be encoded (S103); and using the identifier as a check portion of the graphic code to generate a complete graphic code (S104). Compared with existing graphic codes, the graphic code generated by means of the method has a check portion, so that a user such as a merchant can observe whether the check portion is changed so as to determine whether a graphic code such as a two-dimensional code has been tampered with or replaced. The method is intuitive and simple, and the problem of it not being easy to discover that an existing graphic code such as a two-dimensional code is tampered with or replaced is solved, and the use experience of a user is enhanced.

Description

Graphic code generation and verification method and device, device and storage medium

Technical field

The present invention relates to the field of graphic codes, and in particular, to a method and device for generating and verifying a graphic code, a device, and a storage medium.

Background technique

The graphic code such as the two-dimensional code plays an increasingly important role in daily life, for example, the user uses the payment code/payment code for mobile payment, and the user uses the two-dimensional code for making friends.

With the increasing importance of two-dimensional codes, their security has received more and more attention. The news that existing criminals use their own legal QR codes to replace or obscure the merchant's QR code is also increasing. The tampering or replacement of the code is not easy to detect, and ultimately causes economic losses.

technical problem

The invention provides a method, a device, a device and a storage medium for generating and verifying a graphic code, so as to solve the problem that the existing two-dimensional code and the like are not easily detected by being tampered with or replaced.

Technical solution

In order to solve the above technical problems, the present invention adopts the following technical solutions:

A graphic code generating method includes:

Obtaining an identifier verified by uniqueness, the identifier being a bytecode that satisfies the coding requirement of the graphic code;

Binding the byte to be encoded corresponding to the graphic code to the identifier;

Encoding the bound bytes to be encoded to generate a main body portion of the graphic code;

The identifier is added as a check portion of the graphic code to the preset position of the main body portion to generate a graphic code.

Further, obtaining the identifier verified by the uniqueness includes:

Receiving an identifier to be verified;

Call the identifier database;

Find if the identifier to be verified exists in the identifier database;

If not, the identifier to be verified is an identifier that is verified by uniqueness.

Further, after generating the graphic code, the method further includes: adding the identifier to the identifier database.

Further, adding the identifier as a verification portion of the graphic code to the preset position of the main body portion includes:

Get the location setting parameters;

Determining a preset position according to a position setting parameter;

Add the identifier to the preset location.

Further, binding the to-be-encoded byte corresponding to the graphic code to the identifier includes:

Handling identifiers according to preset processing rules;

Inserting the processed identifier into the byte to be encoded according to the preset insertion position;

A tag byte for marking the processed identifier is added to the to-be-coded byte to generate a bound byte to be encoded.

A graphic code verification method includes:

Scanning the graphic code, and dividing the graphic code into a verification part and a main part according to the preset position of the verification part;

Decoding the main body portion to obtain a corresponding to-be-executed byte;

Verifying that the identifier corresponding to the verification part has a legal binding relationship with the byte to be verified;

If it does not exist, the operation corresponding to the byte to be executed is refused.

Further, whether the identifier corresponding to the verification check part and the to-be-verified byte have a legal binding relationship include:

Get the tag byte in the byte to be executed;

Determining an identifier carried by the byte to be executed according to the tag byte;

Whether the identifier corresponding to the identifier carried by the execution byte and the check portion satisfies a preset condition;

If yes, the identifier corresponding to the verification part has a legal binding relationship with the byte to be verified;

If not, there is no legal binding relationship between the identifier corresponding to the verification part and the byte to be verified.

A graphic code generating device includes:

An obtaining module, configured to obtain an identifier verified by uniqueness, the identifier being a bytecode that satisfies a graphic code encoding requirement;

a binding module, configured to bind the to-be-encoded byte corresponding to the graphic code to the identifier;

An encoding module, configured to encode the bound byte to be encoded to generate a main body portion of the graphic code;

And a generating module, configured to add the identifier as a check portion of the graphic code to a preset position of the main body portion to generate a graphic code.

A graphic code verification device includes:

a scanning module, configured to scan a graphic code, and divide the graphic code into a verification part and a main part according to a preset position of the verification part;

a decoding module, configured to decode the main body part, and obtain a corresponding to-be-executed byte;

a verification module, configured to verify whether a identifier corresponding to the verification part has a legal binding relationship with the to-be-verified byte;

The execution module is configured to refuse to perform an operation corresponding to the to-be-executed byte if it does not exist.

An apparatus comprising: a processor, a memory, and a communication bus, wherein

The communication bus is used to implement connection communication between the processor and the memory;

The processor is operative to execute one or more programs stored in the memory to implement the steps of the graphics code generation method provided by the present invention, or the steps of the graphics code verification method.

A computer readable storage medium storing one or more programs, one or more programs executable by one or more processors to implement the steps of the graphics code generation method provided by the present invention, Or the steps of the graphic code verification method.

Beneficial effect

The invention provides a graphic code generation and verification method and device, device and storage medium. The generation method first acquires a unique identifier, binds the identifier to the byte to be encoded, and then binds according to the binding. The to-be-coded byte generates a main part of the graphic code, and uses the identifier as a verification part of the graphic code to generate a complete graphic code; the generated graphic code has a verification part compared with the existing graphic code, and the merchant The user can observe whether the verification part has been changed to determine whether the graphic code such as the two-dimensional code has been tampered with or replaced, which is intuitive and simple, and solves the problem that the existing two-dimensional code and the like are falsified or replaced, and the problem is enhanced. User experience. At the same time, based on the graphic code provided by the present invention, the user such as the buyer can also remind the terminal whether the graphic code has been tampered with or replaced after scanning the code, thereby enhancing the security of the operation such as payment by the user.

DRAWINGS

1 is a flowchart of a method for generating a graphic code according to Embodiment 1 of the present invention;

2 is a schematic structural diagram of a graphic code generating apparatus according to Embodiment 1 of the present invention;

3 is a flowchart of a method for verifying a graphic code according to Embodiment 2 of the present invention;

4 is a schematic structural diagram of a graphic code verification apparatus according to Embodiment 2 of the present invention;

FIG. 5 is a flowchart of a method for processing a graphic code according to Embodiment 3 of the present invention; FIG.

FIG. 6 is a first schematic diagram of a graphics code according to an embodiment of the present invention;

FIG. 7 is a second schematic diagram of a graphics code according to an embodiment of the present invention;

FIG. 8 is a schematic structural diagram of a device according to an embodiment of the present invention.

BEST MODE FOR CARRYING OUT THE INVENTION

The invention is applicable to all terminal devices, including PCs, mobile phones, PADs, deposit machines, and the like. The present invention will be further described in detail below with reference to the accompanying drawings.

Embodiment 1:

FIG. 1 is a flowchart of a method for generating a graphic code according to Embodiment 1 of the present invention. Referring to FIG. 1, the method for generating a graphic code provided by this embodiment includes the following steps:

S101: Acquire an identifier that is verified by uniqueness, and the identifier is a bytecode that satisfies the coding requirement of the graphic code.

In some embodiments of the present invention, the step includes: receiving an identifier to be verified; calling an identifier database; finding whether the identifier to be verified exists in the identifier database; if not, the identifier to be verified is verified by uniqueness Identifier.

Specifically, the present invention can provide an interface interface for the user to input a personalized identifier, such as a person name, a store name, a mobile phone number, an ID card number, an organization code, etc., which satisfies the coding requirements of the graphic code such as the two-dimensional code. Bytecode, then look up in the identifier database to find out if the identifier entered by the user already exists. If it does not exist, use it as the identifier for uniqueness verification. If it already exists, remind the user to re-enter, or The graphic code bound by the identifier is displayed to the user for the user to determine whether the graphic code needs to be invalidated to reapply the graphic code.

In order to ensure the accuracy of the identifier database, after generating the graphic code, the method further comprises: adding the identifier to the identifier database.

S102: Bind the to-be-encoded byte corresponding to the graphic code to the identifier.

In some embodiments of the present invention, the step includes: processing the identifier according to a preset processing rule; inserting the processed identifier into the byte to be encoded according to the preset insertion position; adding in the byte to be encoded A tag byte used to mark the processed identifier to generate a bound byte to be encoded.

The preset processing rule can be selected by the user, and a general processing rule can be used, for example, directly using the identifier itself as a processed identifier, or encrypting the identifier, etc., such general processing rules do not need to be performed in the graphic code. It can also be a user-defined processing rule, such as recombining the parity of the bytecode, for example, reorganizing "00001111" according to the odd-numbered bits and then "00110011". These personalized processing rules are required. Write the graphic code for later verification.

In some other embodiments of the present invention, the binding may be a one-to-one association or the like in the background of the device. The preset insertion position may be any position, for example, at the beginning, end or middle of the byte to be encoded. The tag byte can be implemented by an adjacent byte, for example, 2 bytes of R8, indicating that 8 bytes after the byte R are identifiers, which can be implemented by non-adjacent bytes, such as A and B, indicating bytes. The byte between A and byte B is an identifier, which can also be implemented by a single byte, such as L, indicating that all bytes before byte L are identifiers, such as H, indicating all bytes after byte H. Is an identifier.

S103: Encode the bound byte to be encoded to generate a main part of the graphic code.

This step is a conventional encoding process for implementing text-to-graphic conversion. The implementation can refer to the prior art and will not be described again.

S104: Add the identifier as a check portion of the graphic code to the preset position of the main body portion to generate a graphic code.

In some embodiments of the present invention, the step includes: acquiring a location setting parameter; determining a preset location according to the location setting parameter; and adding the identifier to the preset location. The position setting parameter can be set by the user or the system default. For example, as shown in FIG. 6, the position setting parameter is to set the four outer corners of the main part as the preset position, and the identifier “1234” is sequentially added to the second. The four outer corner edges of the dimension code, for example, as shown in FIG. 7, the position setting parameter is that the lower edge of the body portion is taken as the preset position, and the identifier "1234" is sequentially added to the lower edge of the two-dimensional code.

2 is a schematic structural diagram of a graphic code generating apparatus according to Embodiment 1 of the present invention. Referring to FIG. 2, the graphic code generating apparatus 2 provided in this embodiment includes:

The obtaining module 21 is configured to obtain an identifier that is verified by uniqueness, and the identifier is a bytecode that satisfies a graphic code encoding requirement;

The binding module 22 is configured to bind the to-be-encoded byte corresponding to the graphic code to the identifier;

The encoding module 23 is configured to encode the bound byte to be encoded to generate a main body portion of the graphic code;

The generating module 24 is configured to add the identifier as a check portion of the graphic code to the preset position of the main body portion to generate a graphic code.

In some embodiments of the present invention, the obtaining module 21 is specifically configured to receive the identifier to be verified; call the identifier database; and find whether the identifier to be verified exists in the identifier database; if not, the identifier to be verified is unique The identifier of the sexual verification; if it exists, the user is reminded to re-export the identifier to be verified until the identifier to be verified is the identifier verified by the uniqueness.

In some embodiments of the invention, the acquisition module 21 is further configured to add an identifier to the identifier database after generating the graphics code.

In some embodiments of the present invention, the generating module 24 is specifically configured to acquire a location setting parameter, determine a preset location according to the location setting parameter, and add the identifier to the preset location.

In some embodiments of the present invention, the binding module 22 is specifically configured to process the identifier according to the preset processing rule; insert the processed identifier into the byte to be encoded according to the preset insertion position; A tag byte for marking the processed identifier is added to the section to generate a bound byte to be encoded.

The embodiment provides a method and a device for generating a graphic code. The method first acquires a unique identifier, binds the identifier to the byte to be encoded, and then generates a graphic according to the bound byte to be encoded. The main part of the code, and the identifier as the check part of the graphic code, generates a complete graphic code; the generated graphic code has a verification part compared with the existing graphic code, and the user can observe the verification part Whether it is changed or not, to judge whether the graphic code such as the two-dimensional code has been tampered with or replaced is intuitive and simple, and solves the problem that the existing two-dimensional code and the like are falsified or replaced, and the user experience is enhanced.

Embodiment 2:

FIG. 3 is a flowchart of a method for verifying a graphic code according to Embodiment 2 of the present invention. Referring to FIG. 3, the method for verifying a graphic code provided by this embodiment includes the following steps:

S301: Scan the graphic code, and divide the graphic code into a verification part and a main part according to the preset position of the verification part.

The user scans the graphic code such as the two-dimensional code by using the camera, or recognizes the graphic code stored locally, and then the terminal can divide the graphic code into the verification part and the main part according to the preset position of the verification part. As shown in FIG. 6, the preset position of the check portion is the outer edge of the four corners of the main body portion, and the portion of the outer edge of the four corners of the two-dimensional code is used as an identifier, that is, the identifier is "1234". The rest is the main part; as shown in Fig. 7, the preset position of the check part is the lower edge of the main part, and the part of the lower edge of the two-dimensional code is used as the identifier, that is, the identifier is "1234", and the rest Part is the main part.

S302: Decode the main body part to obtain a corresponding to-be-executed byte.

This step is a decoding step, and the image-to-text conversion is implemented. The implementation is referred to the prior art, and will not be described again.

S303: Verify that the identifier corresponding to the verification part has a legal binding relationship with the to-be-verified byte. If yes, go to step S304. If not, go to step S305.

In some embodiments of the present invention, the step includes: acquiring a tag byte in the byte to be executed; determining, according to the tag byte, an identifier carried by the byte to be executed; and an identifier and a check carried than the byte to be executed Whether the corresponding identifier meets the preset condition; if yes, the identifier corresponding to the verification part has a legal binding relationship with the byte to be verified; if not, the identifier corresponding to the verification part and the byte to be verified are not There is a legal binding relationship.

The tag bytes have been described in the first embodiment and will not be described again. The preset condition corresponds to the processing rule in the first embodiment, and may be various; for example, the processing rule directly uses the identifier itself as the processed identifier, and then the preset condition at this time is carried by the to-be-executed byte. The identifier corresponding to the identifier and the verification part need to be the same. If the processing rule is to encrypt the identifier, the identifier carried by the execution byte is decrypted to obtain a decrypted identifier. That is, the identifier corresponding to the decrypted identifier needs to be the same as the identifier, and if the processing rule is to recombine the parity of the bytecode, the identifier carried by the executed byte is reversely reorganized to obtain a reverse recombination. The identifier, the default condition at this time, is that the identifier after the reverse reorganization needs to be the same as the identifier corresponding to the check portion.

S304: Perform operations corresponding to the to-be-executed byte, such as payment, payment, and adding a friend.

S305: Rejecting the operation corresponding to the to-be-executed byte, and reminding the user that there is a problem with the graphic code such as the two-dimensional code.

4 is a schematic structural diagram of a graphic code verification apparatus according to Embodiment 2 of the present invention. Referring to FIG. 4, the graphic code verification apparatus 4 provided in this embodiment includes:

The scanning module 41 is configured to scan the graphic code, and divide the graphic code into the verification part and the main part according to the preset position of the verification part;

The decoding module 42 is configured to decode the main body part to obtain a corresponding to-be-executed byte;

The verification module 43 is configured to verify whether the identifier corresponding to the verification part has a legal binding relationship with the to-be-verified byte;

The execution module 44 is configured to: if yes, execute an operation corresponding to the byte to be executed, and if not, refuse to perform an operation corresponding to the byte to be executed.

In some embodiments of the present invention, the verification module 43 is specifically configured to acquire a tag byte in a byte to be executed; according to the tag byte, determine an identifier carried by the byte to be executed; and an identifier carried by the byte to be executed Whether the identifier corresponding to the verification part satisfies the preset condition; if yes, the identifier corresponding to the verification part has a legal binding relationship with the byte to be verified; if not, the identifier corresponding to the verification part and the word to be verified There is no legal binding relationship in the section.

The embodiment provides a graphic code verification method and device. Based on the graphic code provided by the present invention, after the user scans the code, the user can also remind the terminal whether the graphic code has been tampered with or replaced, and enhance the operation of the user. safety.

Embodiment 3:

In this embodiment, the graphic code is taken as a two-dimensional code as an example for description.

Mobile payment methods are becoming more and more popular. Many merchants set the QR code of WeChat and Alipay for consumers to scan the code for payment. The QR code is maliciously altered or replaced (for example, the criminal uses the legal QR code generated by itself to replace or obscure the merchant's QR code), and it is not easy to detect, resulting in economic loss. (For example, when the store is at the peak of the sales period, the owner has no leisure time to confirm whether each customer's payment has been paid. Even worse, if the owner does not carry the mobile device with him, it is impossible to get the customer's payment in time. In this case, if the merchant's QR code is maliciously altered or replaced, the merchant is not easy to find in time, directly causing the customer to scan the code after tampering or replacing the QR code, and the money is paid to the illegal molecule, resulting in Economic losses). If you add a QRID around the QR code (Quick Response The code identification, in the embodiment, is implemented by an identifier, and the naked eye recognition can quickly determine whether the two-dimensional code information has been tampered with, and provides a means for identifying whether the two-dimensional code is replaced or subjected to tampering. This embodiment is proposed on the basis of a very fast and effective method.

In this embodiment, the database storage identifier is pre-established, and before the user applies for the two-dimensional code, an identifier (which may be a legal format of all legal two-dimensional codes, such as numbers, letters, Chinese characters, etc.) is selected, and the database is searched for whether it already exists. The identifier, if present, reselects the new identifier, if not present, adds the identifier to the database; then, adds the identifier of the QR code to a predetermined location of the QR code generation information, and Mark the position, generate a two-dimensional code, and print the identifier around the two-dimensional code. When scanning the QR code, scan the code together with the information identifier around the two-dimensional code. After decoding, set according to advance. Good position, extract the QR code identifier, compare it with the identifier around the QR code, if it is consistent, continue the next operation; otherwise, terminate the current operation and give the QR code illegal Information alert.

FIG. 5 is a flowchart of a graphics processing method according to Embodiment 3 of the present invention. Referring to FIG. 5, the graphics code processing method provided in this embodiment includes the following steps:

S501: Obtain an identifier of the two-dimensional code.

The user can input any identifier, which can be a number, a letter, a Chinese character, etc., all symbols satisfying the two-dimensional code encoding format, and whether the previously recorded identifier information is completely consistent with the identifier input by the user in the database; , then use it as the identifier of the QR code and store it in the database, and continue to the next step; otherwise, remind the user to re-enter.

S502: Add an identifier to an agreed location in the QR code message and mark it.

Adding an identifier to an agreed position in the two-dimensional code message used to generate the two-dimensional code, and marking the location of the identifier, the location is marked by: xxxxx...AmmmB...xxxxx or AmmmB xxxxxxxxxx or xxxxxxxxxxAmmmB, etc. The position of the location in the QR code generation information is not fixed, as long as it is agreed in advance. The A mark starts to record the identifier information, the B mark the QRID information record is terminated, and the mmm is the specific content of the identifier.

This step implements the binding of the identifier to the two-dimensional code to be generated to ensure the uniqueness of each two-dimensional code.

S503: Generate a two-dimensional code.

Generating a body portion of the two-dimensional code (ie, the image portion in FIG. 6 or FIG. 7) according to the two-dimensional code message after the insertion of the identifier, and adding an identifier as a check portion around the body portion of the two-dimensional code (ie, In Fig. 6 or Fig. 7 and 1234, when scanning the code, the body portion of the two-dimensional code and its surrounding identifier as the check portion are simultaneously scanned.

S504: Decode and verify the two-dimensional code.

Decoding the main part of the two-dimensional code, and extracting the identifier of the main picture part and comparing the identifier obtained by the direct scan code according to the position mark of the identifier; if the two are consistent, the verification is passed, and the subsequent payment is continued. Wait for the steps; otherwise, terminate the current operation and give a warning that the QR code is illegal.

In this embodiment, before generating the two-dimensional code, it is necessary to select an identifier QRID capable of indicating the uniqueness of the two-dimensional code, which identifier is not used previously (that is, different from other identifiers stored in the database). And, the identifier needs to be stored in the database; the identifier is added to a fixed location for generating the QR code information to generate a two-dimensional code. Adding an identifier around the generated two-dimensional code, the two-dimensional code includes surrounding identifiers, and after the scan code is decoded, the extracted identifier is verified, and if not, the two-dimensional code is illegally notified, thereby Implement the binding of the identifier to the QR code. At the same time, it is possible to quickly identify whether the two-dimensional code is replaced. Due to the binding of the two-dimensional code to the identifier and the uniqueness of the identifier, it is possible to judge whether the two-dimensional code is replaced or falsified by visually observing the identifier information.

This embodiment is a great improvement on the existing two-dimensional code security authentication, but it can be quickly judged whether the two-dimensional code is maliciously altered or replaced by visual observation, which is a great improvement on the existing two-dimensional code security authentication mechanism. It can be used to effectively solve the problem that the merchant's collection QR code is maliciously tampering, replacing, etc., which is not available in other existing two-dimensional code security authentication technologies.

Specifically, as shown in FIG. 7, an embodiment of the present invention further provides a device, such as a terminal, a server, and the like, including: a processor 71, a memory 72, and a communication bus 73, where

The communication bus 73 is used to implement connection communication between the processor 71 and the memory 72;

The processor 71 is operative to execute one or more programs stored in the memory 72 to implement the steps of the methods provided by all embodiments of the present invention.

The present invention also provides a computer readable storage medium having stored one or more programs, one or more programs being executed to implement the steps of the methods provided by all embodiments of the present invention.

It can be seen from the implementation of the above embodiments that the present invention has the following beneficial effects:

The above is a further detailed description of the present invention in connection with the specific embodiments, and the specific embodiments of the present invention are not limited to the description. It will be apparent to those skilled in the art that the present invention may be made without departing from the spirit and scope of the invention.

Claims

A method for generating a graphic code, comprising:

Obtaining an identifier verified by uniqueness, the identifier being a bytecode that satisfies a graphic code encoding requirement;

Binding the to-be-encoded byte corresponding to the graphic code to the identifier;

Encoding the bound bytes to be encoded to generate a main body portion of the graphic code;

The identifier is added as a check portion of the graphic code to a preset position of the main body portion to generate the graphic code.
The method of generating a graphic code according to claim 1, wherein the obtaining the identifier verified by the uniqueness comprises:

Receiving an identifier to be verified;

Call the identifier database;

Finding whether the identifier to be verified exists in the identifier database;

If not, the identifier to be verified is an identifier that is verified by uniqueness.
The graphics code generating method according to claim 2, further comprising: adding the identifier to the identifier database after generating the graphics code.
The method of generating a graphic code according to claim 1, wherein the adding the identifier as a verification portion of the graphic code to a preset position of the main body portion comprises:

Get the location setting parameters;

Determining the preset position according to the location setting parameter;

Adding the identifier to the preset location.
The method for generating a graphic code according to any one of claims 1 to 4, wherein binding the byte to be encoded corresponding to the graphic code to the identifier comprises:

Processing the identifier according to a preset processing rule;

Inserting the processed identifier into the byte to be encoded according to a preset insertion position;

Adding a tag byte for marking the processed identifier to the to-be-coded byte, and generating the bound byte to be encoded.
A method for verifying a graphic code, comprising:

Scanning the graphic code, and dividing the graphic code into a verification part and a main part according to a preset position of the verification part;

Decoding the main body portion to obtain a corresponding to-be-executed byte;

Verifying that the identifier corresponding to the check portion has a legal binding relationship with the to-be-verified byte;

If not, the operation corresponding to the to-be-executed byte is refused to be performed.
The method of verifying a graphic code according to claim 6, wherein the verifying whether the identifier corresponding to the check portion and the byte to be verified have a legal binding relationship includes:

Obtaining a tag byte in the to-be-executed byte;

Determining, according to the tag byte, an identifier carried by the to-be-executed byte;

Aligning whether an identifier carried by the to-be-executed byte and an identifier corresponding to the check portion meet a preset condition;

If yes, the identifier corresponding to the check part has a legal binding relationship with the to-be-verified byte;

If no, the identifier corresponding to the verification part does not have a legal binding relationship with the to-be-verified byte.
A graphic code generating device, comprising:

An obtaining module, configured to obtain an identifier verified by uniqueness, the identifier being a bytecode that satisfies a graphic code encoding requirement;

a binding module, configured to bind the to-be-encoded byte corresponding to the graphic code to the identifier;

An encoding module, configured to encode the bound byte to be encoded to generate a main body portion of the graphic code;

And a generating module, configured to add the identifier as a check portion of the graphic code to a preset position of the main body portion to generate the graphic code.
A graphic code verification device, comprising:

a scanning module, configured to scan a graphic code, and divide the graphic code into a verification part and a main part according to a preset position of the verification part;

a decoding module, configured to decode the main body part, and obtain a corresponding to-be-executed byte;

a verification module, configured to verify whether a identifier corresponding to the check portion has a legal binding relationship with the to-be-verified byte;

The execution module is configured to refuse to perform the operation corresponding to the to-be-executed byte if it does not exist.
An apparatus, comprising: a processor, a memory, and a communication bus, wherein

The communication bus is configured to implement connection communication between the processor and the memory;

The processor is configured to execute one or more programs stored in the memory to implement the steps of the graphic code generating method according to any one of claims 1 to 5, or the graphic according to claim 6 or The steps of the code verification method.
A computer readable storage medium, wherein the computer readable storage medium stores one or more programs, the one or more programs being executable by one or more processors to implement claim 1 The steps of the method of generating a graphic code according to any one of the preceding claims, or the step of the method of verifying the graphic code according to claim 6 or 7.