CN102270312B - Method for making point bitmap, and goods-fleeing prevention verification method - Google Patents
Method for making point bitmap, and goods-fleeing prevention verification method Download PDFInfo
- Publication number
- CN102270312B CN102270312B CN 201110202570 CN201110202570A CN102270312B CN 102270312 B CN102270312 B CN 102270312B CN 201110202570 CN201110202570 CN 201110202570 CN 201110202570 A CN201110202570 A CN 201110202570A CN 102270312 B CN102270312 B CN 102270312B
- Authority
- CN
- China
- Prior art keywords
- bitmap
- matrix
- bit map
- row
- scrambled
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a method for making a point bitmap and relates to the technical field of anti-counterfeit technologies. The method comprises the following steps of: S11, encrypting plain codes into encrypted codes; S12, converting the encrypted codes into a point bitmap; and S13, printing the point bitmap to form a mark which is attached to an object. The invention also discloses a goods-fleeing prevention verification method. The method comprises the following steps of: S31, reading the point bitmap; S32, converting the read point bitmap into encrypted codes; S33, decrypting the encrypted codes into the plain codes; and S34, comparing the plain codes and a database and judging whether the plain codes are stored in the database, if the plain codes are not stored in the database, determining that the object onto which the point bitmap is attached is a fake object, and if the plain codes are stored in the database, but the plain code information is not consistent, determining that goods fleeing exists. By the goods-fleeing prevention verification method, anti-counterfeiting and goods-fleeing prevention verification of the object is realized.
Description
Technical field
The present invention relates to field of anti-counterfeit technology, particularly a kind of bit map/bitmap method for making and anti-string goods verification method.
Background technology
Existing antifalsification label can only record the information of distinguishing article genuine-fake, but the true and false of only knowing article in the logistics management industry is inadequate, to prevent also whether article from going here and there goods, and existing anti-counterfeiting technology mainly adopts the mode of scanner scanning bar code and two-dimension code, can't verify so whether to go here and there goods.Do not have a kind of antifalsification label can realize going here and there goods checking in prior art, therefore, the antifalsification label of making anti-string goods is present problem demanding prompt solution.
Summary of the invention
The technical matters that (one) will solve
The technical problem to be solved in the present invention is: how to realize the making of bit map/bitmap antifalsification label.How to utilize bit map/bitmap antifalsification label checking string goods.
(2) technical scheme
For solving the problems of the technologies described above, the invention provides a kind of bit map/bitmap method for making, comprise the following steps:
S1: plain code is encrypted to scrambled;
S2: convert described scrambled to bit map/bitmap;
S3: described bit map/bitmap is printed as the label that is attached on article.
Wherein, described step S2 specifically comprises:
S2.1: will add respectively delegation before the first row of the 0-1 matrix of described scrambled and first row and row form new 0-1 matrix;
S2.2: be that 1 or 0 position is set to a little in new 0-1 matrix, new 0-1 matrix conversion is become bit map/bitmap.
Wherein, described step 2.1 also comprises that the ranks to the front and back of the 0-1 matrix of described scrambled block before, adds respectively delegation and a new 0-1 matrix of row formation before the first row of the 0-1 matrix in step S2.1 after blocking and first row.
Wherein, also comprise between described step S2.1 and step S2.2 every row of the 0-1 matrix of described scrambled, every row are done logical operation, and in conjunction with the authorization information that forms the described bit map/bitmap of decimal number generation that in the front matrix of new 0-1 matrix, element is corresponding.
Wherein, the algorithm of encrypting in described step S1 is symmetric key cryptography or asymmetric-key encryption method.
Wherein, also comprise step before step S1:
Foundation stores the data bank of described plain code.
The present invention also provides a kind of anti-string goods verification method, comprises the following steps:
A1: read the described bit map/bitmap of above-mentioned any one;
A2: convert the bit map/bitmap that reads to scrambled;
A3: scrambled is decrypted into plain code;
A4: described plain code and data bank are compared, judge whether store described plain code in described data bank, if not, the article that post described bit map/bitmap are adulterant, if but plain code information is inconsistent, go here and there goods.
Wherein, described plain code comprises: item name, model, time, deliver from godown and put in storage ground.
(3) beneficial effect
The present invention passes through plain code is encrypted, and converts scrambled to bit map/bitmap, has realized the checking to preventing article dummy string goods.
Description of drawings
Fig. 1 is a kind of bit map/bitmap method for making process flow diagram of the embodiment of the present invention;
Fig. 2 is the matrix diagram of a kind of scrambled in the method for Fig. 1, shows a kind of 8 * 8 matrix; It can be also the matrix that surpasses 8 * 8 sizes.
Fig. 3 is the matrix after adding line on the first row of the matrix of Fig. 2 and first row matrix basis;
Fig. 4 is the computing schematic diagram when last column of the matrix of Fig. 3 and last row interpolation authorization information;
Fig. 5 is the example matrix schematic diagram of a scrambled, and the right is decimal number corresponding to every row;
Fig. 6 is the distribution plan of the point of bit map/bitmap corresponding to the matrix in Fig. 5;
Fig. 7 is a kind of anti-string goods verification method process flow diagram of the embodiment of the present invention.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail.Following examples are used for explanation the present invention, but are not used for limiting the scope of the invention.
As shown in Figure 1, a kind of bit map/bitmap method for making process flow diagram for the embodiment of the present invention comprises:
Step S101 is encrypted to scrambled with plain code.The various information of plain code for need encrypting, as: comprise goods item name, model, time, deliver from godown and the information such as the ground that puts in storage.Encryption method can adopt existing encryption method, as: symmetric key cryptography or asymmetric-key encryption method (for example: AES 256, DES, 3DES).Encrypt front with the plain code information encode, as: 10031602030405, the meaning is: 100316 expression times: deliver from godown March 16 2010 time, the 02 concrete item name of expression: optical mouse, 03 expression model: wireless 2.4G model, 04 expression is delivered from godown: deliver from godown in Beijing, and 05 expression is put in storage: put in storage in Changsha.Be encrypted to scrambled by AES 256 bit encryption algorithms with 10031602030405 again.The information of encode also can be stored in and form document data base in database.
Step S102 converts scrambled to bit map/bitmap.Usually the scrambled after encrypting is the matrix form of scale-of-two or sexadecimal (can 8 group convert scale-of-two to), as shown in Figure 2, there is shown 8 * 8 matrix.Each element value wherein is 0 or 1, specifically turns step as follows:
As shown in Figure 3, add respectively delegation and a new 0-1 matrix of row formation before the first row of the 0-1 matrix of scrambled and first row; Also can the ranks of the front and back of 0-1 matrix be blocked before, add respectively delegation and a new 0-1 matrix of row formation before the first row of the 0-1 matrix after blocking and first row, the element of new this row and column that adds can or be 0 for 1, in the present embodiment, is all 1.
Be that 1 or 0 position is set to a little in new 0-1 matrix, new 0-1 matrix conversion is become bit map/bitmap.
Preferably, comprise that also 0-1 matrix to described scrambled is (if block, 0-1 matrix for the scrambled after blocking) every row, every row are done logical operation, and in conjunction with the authorization information that forms the described bit map/bitmap of decimal number generation that in the front matrix of new 0-1 matrix, element is corresponding.Logical operation comprise XOR, with or etc. computing, as shown in Figure 4, in the present embodiment, adopt XOR.The columns and rows at P0-P7 in Fig. 4, PC0-PC7 place have shown the result that computing obtains.Authorization information comprises the value as matrix last column in the left side in Fig. 5 and last row, and decimal sequence corresponding to the 0-1 matrix of the scrambled shown in the right itself.When reading bit map/bitmap, if having a stain on label, may affect and read, can judge that whether a bit this place exists according to this authorization information, make read more accurate.
Bit map/bitmap in Fig. 5 after matrix conversion as shown in Figure 6.
Step S103 is printed as this bit map/bitmap on the label that is attached on article.As shown in Figure 6, bit map/bitmap adopts the round dot of 0.1mm diameter, and its interval only has 0.3mm, utilizes particular sorted to be scattered in irregular figure, in order to represent corresponding scrambled.Bit map/bitmap is printed on paper general naked eyes and only feels that paper is graceful light canescence, can't see choice refreshments, can't discover.
The present invention also provides a kind of method of utilizing above-mentioned bit map/bitmap to verify string goods, as shown in Figure 7, comprising:
Step S301 reads bit map/bitmap.Can be with talking pen or other scanning device when reading.No matter be talking pen or miscellaneous equipment, the hardware module of wherein all integrated realization and step S101 and step S102 reverse functions, and the integrated storer that stores data bank.
Step S302 converts the bit map/bitmap that reads to scrambled, and transfer process is above-mentionedly to convert scrambled to bit map/bitmap opposite process.If can not read in bit map/bitmap or transfer process, after if the point in bit map/bitmap converts the 0-1 matrix to, can not be corresponding with the 0-1 matrix of scrambled (if block, the 0-1 matrix after needing 0-1 matrix with scrambled to block is corresponding), to post the article of this bit map/bitmap be adulterant in explanation.
Step S303 is decrypted into plain code with scrambled.
Step S304 compares plain code and data bank, judges whether store described plain code in described data bank, and if not, the article that post described bit map/bitmap are adulterant, otherwise execution in step S305.
Step S305, whether checking is consistent with the plain code information of data bank in plain code information, if inconsistent, goes here and there goods, and particularly, the information such as the title of article, model, the place of delivering from godown are consistent, and the place of putting in storage is inconsistent, go here and there goods.
Above embodiment only is used for explanation the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; without departing from the spirit and scope of the present invention; can also make a variety of changes and modification; therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (7)
1. a bit map/bitmap method for making, is characterized in that, comprises the following steps:
S1: plain code is encrypted to scrambled;
S2: convert described scrambled to bit map/bitmap, described step S2 specifically comprises:
S2.1: will add respectively delegation before the first row of the 0-1 matrix of described scrambled and first row and row form new 0-1 matrix;
Every row, every row to the 0-1 matrix of described scrambled are done logical operation, and generate the authorization information of described bit map/bitmap in conjunction with decimal number corresponding to element in the matrix that forms before new 0-1 matrix;
S2.2: be that 1 or 0 position is set to a little in new 0-1 matrix, new 0-1 matrix conversion is become bit map/bitmap;
S3: described bit map/bitmap is printed as the label that is attached on article.
2. bit map/bitmap method for making as claimed in claim 1, it is characterized in that, described step 2.1 also comprises that the ranks to the front and back of the 0-1 matrix of described scrambled block before, adds respectively delegation and a new 0-1 matrix of row formation before the first row of the 0-1 matrix in step S2.1 after blocking and first row.
3. bit map/bitmap method for making as claimed in claim 1 or 2, is characterized in that, the algorithm of encrypting in described step S1 is symmetric key cryptography or asymmetric-key encryption method.
4. bit map/bitmap method for making as claimed in claim 1 or 2, is characterized in that, also comprises step before step S1:
Foundation stores the data bank of described plain code.
5. bit map/bitmap method for making as claimed in claim 1 or 2, is characterized in that, described plain code comprises: item name, model, time, deliver from godown and put in storage ground.
6. an anti-string goods verification method, is characterized in that, comprises the following steps:
A1: read the described bit map/bitmap of any one in claim 1 ~ 4;
A2: convert the bit map/bitmap that reads to scrambled;
A3: scrambled is decrypted into plain code;
A4: described plain code and data bank are compared, judge whether store described plain code in described data bank, if not, the article that post described bit map/bitmap are adulterant, if but plain code information is inconsistent, go here and there goods.
7. anti-string goods verification method as claimed in claim 6, is characterized in that, described plain code comprises: item name, model, time, deliver from godown and put in storage ground.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110202570 CN102270312B (en) | 2011-07-19 | 2011-07-19 | Method for making point bitmap, and goods-fleeing prevention verification method |
| CN201310184944.4A CN103400172B (en) | 2011-07-19 | 2011-07-19 | Bit map/bitmap manufacture method and the bit map/bitmap made by the method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110202570 CN102270312B (en) | 2011-07-19 | 2011-07-19 | Method for making point bitmap, and goods-fleeing prevention verification method |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310184944.4A Division CN103400172B (en) | 2011-07-19 | 2011-07-19 | Bit map/bitmap manufacture method and the bit map/bitmap made by the method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102270312A CN102270312A (en) | 2011-12-07 |
| CN102270312B true CN102270312B (en) | 2013-06-19 |
Family
ID=45052613
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110202570 Expired - Fee Related CN102270312B (en) | 2011-07-19 | 2011-07-19 | Method for making point bitmap, and goods-fleeing prevention verification method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102270312B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102968725A (en) * | 2012-09-28 | 2013-03-13 | 北京农业信息技术研究中心 | Method for tracing anti-fake markings for agricultural product |
| CN103136565B (en) * | 2013-01-22 | 2015-06-17 | 北京印刷学院 | Multi-variable multi-parameter gradient ternary circulating encryption anti-fake information storage brand |
| CN105718978B (en) * | 2014-12-03 | 2020-04-24 | 航天信息股份有限公司 | QR code generation method and device, and decoding method and device |
| CN113392664B (en) * | 2021-06-22 | 2023-04-18 | 杭州沃朴物联科技有限公司 | Anti-counterfeiting two-dimensional code generation method, anti-counterfeiting method and device |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1825331A (en) * | 2005-02-26 | 2006-08-30 | 深圳鼎识科技有限公司 | Method of product anti-forge and goods logistic information managing |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2518359C (en) * | 2003-03-27 | 2008-12-30 | Graphic Security Systems Corporation | System and method for authenticating objects |
-
2011
- 2011-07-19 CN CN 201110202570 patent/CN102270312B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1825331A (en) * | 2005-02-26 | 2006-08-30 | 深圳鼎识科技有限公司 | Method of product anti-forge and goods logistic information managing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102270312A (en) | 2011-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113574913B (en) | Method and system for preparing and performing object authentication | |
| CN101369306B (en) | Electronic label security system | |
| CN102855510B (en) | Anti-fake product and recognition methods thereof | |
| WO2016145705A1 (en) | Time-based encrypted nfc cell phone terminal anti-counterfeit system and method | |
| US20070215685A1 (en) | System and Method of Product Identification Using a URL | |
| CN101201886B (en) | Three-he-code method for recognizing commodity | |
| CN102722737B (en) | A kind of paper document tamper resistant method | |
| CN104854642A (en) | Method and apparatus for marking manufactured items using physical characteristic | |
| CN102270312B (en) | Method for making point bitmap, and goods-fleeing prevention verification method | |
| CN102831529A (en) | Radio frequency based commodity information identification method and system | |
| CN101950370A (en) | Method for coding combined two-dimensional code | |
| CN105740928A (en) | Anti-counterfeiting method for two-dimensional code picture | |
| CN101286203A (en) | Chip-free quasi RFID multiple verification low cost encrypted EPC composite label and system | |
| CN101887713B (en) | Encryption method and device for font library | |
| CN202870898U (en) | Radio frequency-based commodity information identification system | |
| CN108082723B (en) | Anti-counterfeiting bottle cap based on CPU (Central processing Unit) password chip and working method thereof | |
| CN102542471A (en) | Product anti-counterfeiting system based on internet of things technology and anti-counterfeiting method | |
| CN1643841A (en) | Encryption key hiding and recovering method and system | |
| CN104424568A (en) | Authentication false-proof traceability system employing circuit core chip ID number as identification | |
| CN102456146A (en) | Method for guaranteeing uniqueness of digital certificate based on RFID (radio frequency identification device) technology | |
| CN111062456A (en) | Two-dimensional code encryption algorithm | |
| CN103544511A (en) | Anti-counterfeiting identification | |
| CN102867260A (en) | Bluetooth-based commodity information identification method and system | |
| CN112101962A (en) | Data security anti-counterfeiting control method | |
| CN103400172A (en) | Point bitmap and manufacturing method thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130619 Termination date: 20190719 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |