CN105005806A - Matrix point diagram, generation method, generation system and anti-counterfeit label - Google Patents
Matrix point diagram, generation method, generation system and anti-counterfeit label Download PDFInfo
- Publication number
- CN105005806A CN105005806A CN201510549699.1A CN201510549699A CN105005806A CN 105005806 A CN105005806 A CN 105005806A CN 201510549699 A CN201510549699 A CN 201510549699A CN 105005806 A CN105005806 A CN 105005806A
- Authority
- CN
- China
- Prior art keywords
- data
- point
- algorithm
- character
- content caching
- 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.)
- Granted
Links
Landscapes
- Storage Device Security (AREA)
Abstract
The invention provides an anti-counterfeit label. A data point portion comprises a function bit portion, a data bit portion, a verification sum portion, and an original feature extraction state portion. The function bit portion comprises a version number mark point bit, a Map algorithm type mark point bit, a density value mark point bit, a block index mark point bit, and an encryption algorithm type mark point bit. A method for generating the anti-counterfeit label comprises steps of: calculating the size of a memory cache Ap and the occupied quantity of data points; calculating the quantity of required filling characters and character information; distributing the quantity of effective data bits stored in a content cache Tp; arranging the filling data in the content cache Tp and encrypting the data; verifying the data bits and carrying out addition to the obtained data bits; carrying out sparse processing to the data bits so as to obtain a content cache Tp2; obtaining the data bits which the content cache Tp2 can bear, effective data bits and the quantity of the filling characters; writing information in the memory cache Ap; and transforming the data in the memory cache Ap, and implanting the transformed data in a blank grid. The anti-counterfeit label has a unique pattern and a large amount of data.
Description
Technical field
The present invention relates to TAG field, especially a kind of matrix point diagram, generation method, generation system and antifalsification label.
Background technology
At present, existing anti-counterfeiting mark pattern major part adopts the coding rule being similar to OID coding techniques to generate, and can only generate the anti-counterfeiting mark of limited quantity.Its shortcoming be for: due to anti-counterfeiting mark store coding information quantity little, therefore, mass data information cannot be stored; In addition, because the coding rule being similar to OID coding techniques belongs to general and disclosed coding techniques, therefore, the security performance of anti-counterfeiting mark is reduced.
Summary of the invention
For the weak point existed in the problems referred to above, the invention provides a kind of pattern that formed unique and with a kind of antifalsification label of mass data information, with generation method and generation system thereof.
For achieving the above object, the invention provides a kind of matrix point diagram, comprise anchor point part and data point part, described data point part comprises function digit part, data bit portion, School Affairs part and primitive character and extracts status sections;
Described function digit part comprise version number's monumented point position for representing version number, for represent numerical digit sparse Processing Algorithm type Map algorithm types monumented point position, for representing the density value monumented point position of valid data bit quantity, the block index mark point position for code figure quantity basic in representing matrix point diagram and the encryption algorithm type monumented point position for representing matrix point diagram cryptographic algorithm.
Above-mentioned matrix point diagram, wherein, also comprises the monumented point position of filling character for filling character in described function digit part.
The invention provides a kind of matrix dot map generalization method, comprise the following steps:
Step 1, storage allocation buffer memory Ap, and calculate the size of this memory cache Ap and the quantity of data point institute's occupy-place in memory cache Ap;
Step 2, utilize the result of following formula input in memory cache Ap needed for the quantity of filling character and character information:
P＝(A-3)％4，
Wherein, P is the quantity of filling character;
Step 3, utilize following formula to distribute to deposit the quantity of valid data position in the content caching Tp at significant figure strong point:
Tn＝A-14，
Wherein, Tn is valid data bit quantity;
Step 4, after padding data, filled data to be arranged in content caching Tp, and in multiple cipher mode, choose a kind of cipher mode the data after arrangement are encrypted;
Step 5, in content caching Tp arrangement after data bit verify, and the data bit obtained after this verification is added to content caching Tp arrange after data after;
Step 6, sparse process is carried out to the data bit of content caching Tp, to obtain a content caching Tp2 with data and new significant figure strong point;
Step 7, content caching Tp2 to be calculated, with draw can carry in this content caching Tp2 number of data bits, valid data position quantity and the quantity of filling character;
Fill in version number successively in step 8, memory cache Ap, fill character and quantity, the type of sparse Processing Algorithm, block call number, data in content caching Tp2 in the quantity of valid data position and content caching Tp2;
Step 9, be after binary data by the data transformations in memory cache Ap, it be implanted in the blank grid for implantation number strong point according to order from left to right and from top to bottom, to form a matrix point diagram in antifalsification label or antifalsification label.
Above-mentioned generation method, wherein, in step 1, comprises following sub-step:
Step 11, distribution one section of memory cache Ap, and utilize following formula to calculate the size of this memory cache Ap:
A＝(dim-1)≠dim，
Wherein, A is the size of memory cache Ap, and dim is the size of dimension;
Step 12, following formula is utilized to calculate bit quantity shared by data point in memory cache Ap:
C＝(A-3)/≠2，
Wherein, C bit quantity shared by data point.
Above-mentioned generation method, wherein, in step 2, the numerical value obtained after this formulae discovery, comprises following two kinds of situations,
Situation one:
As P=0, show can not to produce in function digit the monumented point position of filling character that needs are filled character;
Situation two:
When P ≠ 0, show to produce the fill character monumented point position identical with filled character quantity in function digit, now, needs are inserted in each fills character monumented point position numeral 0.
Above-mentioned generation method, wherein, in step S4, comprises following sub-step:
Step 41, utilize following formula to distribute to deposit the quantity of valid data position in the content caching Tp at significant figure strong point:
Tn＝A-14，
Wherein, Tn is valid data bit quantity;
Step 42, utilize a kind of cryptographic algorithm of following formula stochastic generation:
Above-mentioned generation method, wherein, in step S6, comprises selectable low-density algorithm and high density algorithm:
Low-density algorithm is the 2to4 algorithm for 2bit data being converted to 4bit data, and mapping table is as follows:
High density algorithm is the 2to3 algorithm for 2bit data being converted to 3bit data, and mapping table is as follows
Above-mentioned generation method, wherein, in step S7, the number of data bits utilizing following formula to draw respectively can to carry in yard figure, the quantity of valid data position and the quantity of filling character,
Bits＝(dim*(dim-1))–3；
DataBits23＝Bits/3*2；
PaddingBits23＝Bits％3；
DataBits24＝Bits/4*2；
PaddingBits24＝Bits％4；
Wherein, Bits represents the number of data bits that code figure can carry;
When DataBits23 represents use 2to3 algorithm, the quantity of denotable valid data position;
When PaddingBits23 represents use 2to3 algorithm, the quantity of filling character;
When DataBits24 represents use 2to4 algorithm, the quantity of denotable valid data position;
When PaddingBits24 represents use 2to4 algorithm, the quantity of filling character.
The invention provides a kind of matrix dot map generalization system, comprising:
Memory cache size computing module, the size of the memory cache arrived for utilizing following formula dispensed,
A＝(dim-1)≠dim，
Wherein, A is the size of memory cache, and dim is the size of dimension;
Bit quantity computing module shared by data point, calculates bit quantity shared by data point in memory cache Ap for utilizing following formula:
C＝(A-3)/4≠2，
Wherein, C bit quantity shared by data point;
To fill character number calculating section, for utilize the result of following formula input needed for the quantity of filling character and character information,
P＝(A-3)％4，
Wherein, P is the quantity of filling character;
Valid data bit quantity computing module, for utilizing following formula to distribute the quantity depositing valid data position in content caching Tp,
Tn＝A-14，
Wherein, Tn is valid data bit quantity;
Data arranging module, after padding data in content caching Tp, utilizes following formula to arrange filled data,
N＝E％4+4，
Wherein, N represents permutation algorithm exponent number, and E represents cryptographic algorithm;
Data encryption module, for choosing a kind of cipher mode by multiple cipher mode, is encrypted the data after arrangement in content caching Tp;
Data bit correction verification module, for verifying the data bit of the data after arrangement in content caching Tp, and adds to after the data in the content caching of significant figure strong point after arrangement by the data bit obtained after this verification;
Sparse processing module, carries out sparse process with to the data bit in the data after arrangement in content caching Tp, to obtain a content caching Tp2 with data and new significant figure strong point;
COMPREHENSIVE CALCULATING module, for calculating content caching Tp2, with draw can carry in this content caching Tp2 number of data bits, valid data position quantity and the quantity of filling character;
Fill in module, for filling in version number in memory cache Ap successively, fill character and quantity, the type of sparse Processing Algorithm, block call number, data in content caching Tp2 in the quantity of valid data position and content caching Tp2;
Modular converter, for being binary data by the data transformations in memory cache Ap;
Data point implant module, for being implanted in binary data in the blank grid for implantation number strong point according to order from left to right and from top to bottom.
The present invention also provides a kind of antifalsification label including matrix point diagram, comprises the matrix point diagram group be made up of at least two matrix point diagrams, described matrix point diagram group comprise basis matrix point diagram, be arranged on the rotation matrix point diagram of its side;
Described basis matrix point diagram and institute's rotation matrix point diagram are all comprise anchor point part and data point part, and described data point part comprises function digit part, data bit portion, School Affairs part and primitive character and extracts status sections;
Described function digit part comprise version number's monumented point position for representing version number, for represent numerical digit sparse Processing Algorithm type Map algorithm types monumented point position, for representing the density value monumented point position of valid data bit quantity, the block index mark point position for code figure quantity basic in representing matrix point diagram and the encryption algorithm type monumented point position for representing matrix point diagram cryptographic algorithm.
Compared with prior art, the present invention has the following advantages:
1, the matrix point diagram in the present invention by algorithmic rule specifically defined after, thus it is unique and with the matrix point diagram of mass data information to form pattern;
2, in antifalsification label of the present invention, if the data volume defined is greater than the capacity of a matrix point diagram, can set according to the quantity of data volume to matrix point diagram, and can set the pattern of multiple matrix point diagram, thus increase the diversity of form;
3, because algorithmic rule used in the present invention has privacy and originality, ensure that the difficulty that matrix point diagram is decrypted, make matrix point diagram have anti-counterfeiting performance, can be applicable to anti-counterfeit field;
4, for generating this matrix dot map generalization method and generation system can form the matrix dot graph code system having magnanimity coded message;
Accompanying drawing explanation
Fig. 1 is the structural drawing of matrix point diagram in the present invention
Fig. 2 is the structural level block diagram of the matrix point diagram of Fig. 1;
Fig. 3 is another structural level block diagram of the matrix point diagram of Fig. 1;
Fig. 4 is the process flow diagram generating method part in the present invention;
Fig. 5 is the structural drawing of generation system part in the present invention;
Fig. 6 is the structural drawing of antifalsification label in the present invention.
Main Reference label declaration is as follows:
1-anchor point part; 2-data point part; 21-function digit part; 22-data bit portion; 23-School Affairs part 23; 24-primitive character extracts status sections
Embodiment
As shown in Figures 1 and 2, the invention provides a kind of antifalsification label, the matrix point diagram that this antifalsification label is greater than 9 by a dimension forms, this matrix point diagram comprises anchor point part 1 and data point part 2, and data point part 2 comprises function digit part 21, data bit portion 22, School Affairs part 23 and primitive character and extracts status sections 24.
Wherein, function digit part 21 comprise version number's monumented point position for representing version number, for represent numerical digit sparse Processing Algorithm type Map algorithm types monumented point position, for represent valid data bit quantity density value monumented point position, for representing the block index mark point position of basic code figure quantity in antifalsification label and the encryption algorithm type monumented point position for representing matrix point diagram cryptographic algorithm.
As shown in Figure 3, the invention provides a kind of antifalsification label, the matrix point diagram that this antifalsification label is greater than 9 by a dimension forms, this matrix point diagram comprises anchor point part 1 and data point part 2, and data point part 2 comprises function digit part 21, data bit portion 22, School Affairs part 23 and primitive character and extracts status sections 24.
Wherein, function digit part 21 comprise version number's monumented point position for representing version number, for represent numerical digit sparse Processing Algorithm type Map algorithm types monumented point position, for represent valid data bit quantity density value monumented point position, for represent basic code figure quantity in antifalsification label block index mark point position, for the encryption algorithm type monumented point position of representing matrix point diagram cryptographic algorithm and the monumented point position of filling character for filling character.
As shown in Figure 4, the invention provides a kind of generation method of antifalsification label, comprise the following steps:
Step 1, storage allocation buffer memory Ap, and calculate the size of this memory cache Ap and the quantity of data point institute's occupy-place in memory cache Ap.
In step 1, following sub-step is comprised:
Step 11, distribution one section of memory cache Ap, and utilize following formula to calculate the size of this memory cache Ap:
A＝(dim-1)≠dim，
Wherein, A is the size of memory cache Ap, and dim is the size of dimension;
Step 12, following formula is utilized to calculate bit quantity shared by data point in memory cache Ap:
C＝(A-3)/≠2，
Wherein, C bit quantity shared by data point.
Step 2, utilize the result of following formula input in memory cache Ap needed for the quantity of filling character and character information:
P＝(A-3)％4，
Wherein, P is the quantity of filling character.
In step 2, the numerical value obtained after this formulae discovery, comprises following two kinds of situations,
Situation one:
As P=0, show can not to produce in function digit the monumented point position of filling character that needs are filled character;
Situation two:
When P ≠ 0, show to produce the fill character monumented point position identical with filled character quantity in function digit, now, needs are inserted in each fills character monumented point position numeral 0.
Step 3, utilize following formula to distribute to deposit the quantity of valid data position in the content caching Tp at significant figure strong point:
Tn＝A-14，
Wherein, Tn is valid data bit quantity.
Step 4, after padding data, filled data to be arranged in content caching Tp, and in multiple cipher mode, choose a kind of cipher mode the data after arrangement are encrypted.
Comprise following sub-step in step 4:
In step 41, following formula is utilized to distribute the quantity depositing valid data position in the content caching Tp at significant figure strong point:
Tn＝A-14，
Wherein, Tn is valid data bit quantity.
The code of permutation algorithm is as follows:
Step 42, utilize a kind of cryptographic algorithm of following formula stochastic generation:
The function of cryptographic algorithm is as follows:
Step 5, in content caching Tp arrangement after data bit verify, and the data bit obtained after this verification is added to content caching Tp arrange after data after.
School Affairs is used for verifying data bit, and computing method are as shown in minor function:
Step 6, sparse process is carried out to the data bit of content caching Tp, to obtain a content caching Tp2 with data and new significant figure strong point.
In step s 6, selectable low-density algorithm and high density algorithm is comprised:
Low-density algorithm is the 2to4 algorithm for 2bit data being converted to 4bit data, and mapping table is as follows:
High density algorithm is the 2to3 algorithm for 2bit data being converted to 3bit data, and mapping table is as follows
Step 7, content caching Tp2 to be calculated, with draw can carry in this content caching Tp2 number of data bits, valid data position quantity and the quantity of filling character.
In the step s 7, the number of data bits utilizing following formula to draw respectively can to carry in yard figure, the quantity of valid data position and the quantity of filling character,
Bits＝(dim*(dim-1))–3；
DataBits23＝Bits/3*2；
PaddingBits23＝Bits％3；
DataBits24＝Bits/4*2；
PaddingBits24＝Bits％4；
Wherein, Bits represents the number of data bits that code figure can carry;
When DataBits23 represents use 2to3 algorithm, the quantity of denotable valid data position;
When PaddingBits23 represents use 2to3 algorithm, the quantity of filling character;
When DataBits24 represents use 2to4 algorithm, the quantity of denotable valid data position;
When PaddingBits24 represents use 2to4 algorithm, the quantity of filling character.
Fill in version number successively in step 8, memory cache Ap, fill character and quantity, the type of sparse Processing Algorithm, block call number, data in content caching Tp2 in the quantity of valid data position and content caching Tp2;
Step 9, be after binary data by the data transformations in memory cache Ap, it be implanted in the blank grid for implantation number strong point according to order from left to right and from top to bottom, to form a matrix point diagram in antifalsification label or antifalsification label.
Wherein, blank grid is the blank grid of a 9x9.
As shown in Figure 5, the invention provides a kind of generation system of antifalsification label, comprising:
Memory cache size computing module, the size of the memory cache Ap arrived for utilizing following formula dispensed,
A＝(dim-1)≠dim，
Wherein, A is the size of memory cache Ap, and dim is the size of dimension.
Bit quantity computing module shared by data point, calculates bit quantity shared by data point in memory cache Ap for utilizing following formula:
C＝(A-3)/4≠2，
Wherein, C bit quantity shared by data point.
To fill character number calculating section, for utilize the result of following formula input needed for the quantity of filling character and character information,
P＝(A-3)％4，
Wherein, P is the quantity of filling character.
The numerical value obtained after this formulae discovery, comprises following two kinds of situations,
Situation one:
As P=0, show can not to produce in function digit the monumented point position of filling character that needs are filled character;
Situation two:
When P ≠ 0, show to produce the fill character monumented point position identical with filled character quantity in function digit, now, needs are inserted in each fills character monumented point position numeral 0.
Valid data bit quantity computing module, for utilizing following formula to distribute the quantity depositing valid data position in content caching Tp,
Tn＝A-14，
Wherein, Tn is valid data bit quantity.
Data arranging module, after padding data in content caching Tp, utilizes following formula to arrange filled data,
N＝E％4+4，
Wherein, N represents permutation algorithm exponent number, and E represents cryptographic algorithm.
The code of data arranging module is as follows:
Data encryption module, for choosing a kind of cipher mode by multiple cipher mode, is encrypted the data after arrangement in content caching Tp.
Data encryption module utilizes a kind of cryptographic algorithm of following formula stochastic generation:
The function of data encryption module is as follows:
Data bit correction verification module, for verifying the data bit of the data after arrangement in content caching Tp, and adds to the data bit obtained after this verification after the data in the content caching of significant figure strong point after arrangement.
Data bit correction verification module is used for verifying data bit, and computing method are as shown in minor function:
Sparse processing module, carries out sparse process for the data bit in the data after arrangement in content caching Tp, to obtain a content caching Tp2 with data and new significant figure strong point.
Sparse processing module comprises selectable low-density computing module and high density computing module:
Low-density computing module is the 2to4 algorithm for 2bit data being converted to 4bit data, and mapping table is as follows:
High density computing module is the 2to3 algorithm for 2bit data being converted to 3bit data, and mapping table is as follows
COMPREHENSIVE CALCULATING module, for calculating content caching Tp2, with draw can carry in this content caching Tp2 number of data bits, valid data position quantity and the quantity of filling character.
The number of data bits that COMPREHENSIVE CALCULATING module utilizes following formula to draw respectively can to carry in yard figure, the quantity of valid data position and the quantity of filling character,
Bits＝(dim*(dim-1))–3；
DataBits23＝Bits/3*2；
PaddingBits23＝Bits％3；
DataBits24＝Bits/4*2；
PaddingBits24＝Bits％4；
Wherein, Bits represents the number of data bits that code figure can carry;
When DataBits23 represents use 2to3 algorithm, the quantity of denotable valid data position;
When PaddingBits23 represents use 2to3 algorithm, the quantity of filling character;
When DataBits24 represents use 2to4 algorithm, the quantity of denotable valid data position;
When PaddingBits24 represents use 2to4 algorithm, the quantity of filling character.
Fill in module, for filling in version number in memory cache Ap successively, fill character and quantity, the type of sparse Processing Algorithm, block call number, data in content caching Tp2 in the quantity of valid data position and content caching Tp2;
Modular converter, for being binary data by the data transformations in memory cache Ap;
Data point implant module, for being implanted in binary data in the blank grid for implantation number strong point according to order from left to right and from top to bottom.
As shown in Figure 6, the invention provides a kind of antifalsification label, the matrix point diagram that this antifalsification label is greater than 9 by four dimensions forms.In four matrix point diagrams, point diagram based on label one, label two to label four is the matrix point diagram obtained after the basic point diagram of label one carries out Random-Rotation.
Be all comprise anchor point part and data point part in any one matrix point diagram of label one to label four, data point part comprises function digit part, data bit portion, School Affairs part and primitive character and extracts status sections.
Wherein, each matrix point diagram comprises anchor point part and data point part, and data point part comprises function digit part, data bit portion, School Affairs part and primitive character and extracts status sections.
Function digit part comprise version number's monumented point position for representing version number, for represent numerical digit sparse Processing Algorithm type Map algorithm types monumented point position, for represent valid data bit quantity density value monumented point position, for represent basic code figure quantity in antifalsification label block index mark point position, for represent antifalsification label cryptographic algorithm encryption algorithm type monumented point position and/or with the monumented point position of filling character for filling character.
Due to the antifalsification label in the present embodiment be by label one to label four totally four matrix dot matrix form, therefore, its memory data output is four times of the matrix point diagram in Fig. 1.
Only as described above, be only preferred embodiment of the present invention, such as professional who are familiar with this art.After understanding technological means of the present invention, natural energy, according to actual needs, is changed under the teachings of the present invention.Therefore all equal changes of doing according to the present patent application the scope of the claims and modification, once should still remain within the scope of the patent.
Claims (10)
1. a matrix point diagram, comprises anchor point part and data point part, it is characterized in that, described data point part comprises function digit part, data bit portion, School Affairs part and primitive character and extracts status sections;
Described function digit part comprise version number's monumented point position for representing version number, for represent numerical digit sparse Processing Algorithm type Map algorithm types monumented point position, for representing the density value monumented point position of valid data bit quantity, the block index mark point position for code figure quantity basic in representing matrix point diagram and the encryption algorithm type monumented point position for representing matrix point diagram cryptographic algorithm.
2. matrix point diagram according to claim 1, is characterized in that, also comprises the monumented point position of filling character for filling character in described function digit part.
3. generate a method for the point diagram of matrix described in claim 1, comprise the following steps:
Step 1, storage allocation buffer memory Ap, and calculate the size of this memory cache Ap and the quantity of data point institute's occupy-place in memory cache Ap:
Step 2, utilize the result of following formula input in memory cache Ap needed for the quantity of filling character and character information:
P＝(A-3)％4，
Wherein, P is the quantity of filling character;
Step 3, utilize following formula to distribute to deposit the quantity of valid data position in the content caching Tp at significant figure strong point:
Tn＝A-14，
Wherein, Tn is valid data bit quantity;
Step 4, after padding data, filled data to be arranged in content caching Tp, and in multiple cipher mode, choose a kind of cipher mode the data after arrangement are encrypted;
Step 5, in content caching Tp arrangement after data bit verify, and the data bit obtained after this verification is added to content caching Tp arrange after data after;
Step 6, sparse process is carried out to the data bit of content caching Tp, to obtain a content caching Tp2 with data and new significant figure strong point;
Step 7, content caching Tp2 to be calculated, with draw can carry in this content caching Tp2 number of data bits, valid data position quantity and the quantity of filling character;
Fill in version number successively in step 8, memory cache Ap, fill character and quantity, the type of sparse Processing Algorithm, block call number, data in content caching Tp2 in the quantity of valid data position and content caching Tp2;
Step 9, be after binary data by the data transformations in memory cache Ap, it be implanted in the blank grid for implantation number strong point according to order from left to right and from top to bottom, to form a matrix point diagram in antifalsification label or antifalsification label.
4. generation method according to claim 3, is characterized in that, in step 1, comprises following sub-step:
Step 11, distribution one section of memory cache Ap, and utilize following formula to calculate the size of this memory cache Ap:
A＝(dim-1)≠dim，
Wherein, A is the size of memory cache Ap, and dim is the size of dimension;
Step 12, following formula is utilized to calculate bit quantity shared by data point in memory cache Ap:
C＝(A-3)/≠2，
Wherein, C bit quantity shared by data point.
5. generation method according to claim 3, is characterized in that, in step 2, the numerical value obtained after this formulae discovery, comprises following two kinds of situations,
Situation one:
As P=0, show can not to produce in function digit the monumented point position of filling character that needs are filled character;
Situation two:
When P ≠ 0, show to produce the fill character monumented point position identical with filled character quantity in function digit, now, needs are inserted in each fills character monumented point position numeral 0.
6. generation method according to claim 3, is characterized in that, in step S4, comprises following sub-step:
Step 41, utilize following formula to distribute to deposit the quantity of valid data position in the content caching Tp at significant figure strong point:
Tn＝A-14，
Wherein, Tn is valid data bit quantity;
Step 42, utilize a kind of cryptographic algorithm of following formula stochastic generation:
staticconstuint8_t_MASK[16][8]＝{
{0x92,0x55,0x49,0x95,0xAA,0xA2,0x48,0x29},
{0xA4,0x62,0x2B,0xB9,0x7D,0x49,0xA7,0x91},
{0xB7,0xD2,0x7D,0xDD,0x7A,0x81,0x2A,0x8B},
{0x55,0x92,0x95,0x49,0xA2,0xAA,0x29,0x48},
{0x3C,0x9B,0x9A,0x5D,0x11,0xC4,0x46,0x15},
{0x18,0xDA,0x87,0xA9,0x2B,0x7A,0x1B,0x89},
{0xCD,0xB3,0x73,0xDC,0xB6,0xAA,0xA2,0x55},
{0x55,0x92,0x95,0x49,0xA2,0xAA,0x29,0x48},
}。
7. generation method according to claim 3, is characterized in that, in step S6, comprises selectable low-density algorithm and high density algorithm:
Low-density algorithm is the 2to4 algorithm for 2bit data being converted to 4bit data, and mapping table is as follows:
staticconstint8_tMAPALG_24[4][16]＝
{//0123456789A
{-1,0,1,-1,2,-1,-1,-1,3,-1,-1,-1,-1,-1,-1,-1},
{-1,1,0,-1,3,-1,-1,-1,2,-1,-1,-1,-1,-1,-1,-1},
{-1,2,3,-1,0,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1},
{-1,3,1,-1,2,-1,-1,-1,0,-1,-1,-1,-1,-1,-1,-1},
}；
High density algorithm is the 2to3 algorithm for 2bit data being converted to 3bit data, and mapping table is as follows
staticconstuint8_tMAPALG_23[4][4]＝{
{0x1,0x4,0x2,0x0},
{0x2,0x1,0x0,0x4},
{0x4,0x0,0x1,0x2},
{0x0,0x2,0x4,0x1},
}。
8. generation method according to claim 3, is characterized in that, in step S7, and the number of data bits utilizing following formula to draw respectively can to carry in yard figure, the quantity of valid data position and the quantity of filling character,
Bits＝(dim*(dim-1))–3；
DataBits23＝Bits/3*2；
PaddingBits23＝Bits％3；
DataBits24＝Bits/4*2；
PaddingBits24＝Bits％4；
Wherein, Bits represents the number of data bits that code figure can carry;
When DataBits23 represents use 2to3 algorithm, the quantity of denotable valid data position;
When PaddingBits23 represents use 2to3 algorithm, the quantity of filling character;
When DataBits24 represents use 2to4 algorithm, the quantity of denotable valid data position;
When PaddingBits24 represents use 2to4 algorithm, the quantity of filling character.
9. generate a system for the matrix point diagram described in claim 1, it is characterized in that, comprising:
Memory cache size computing module, the size of the memory cache arrived for utilizing following formula dispensed,
A＝(dim-1)≠dim，
Wherein, A is the size of memory cache, and dim is the size of dimension;
Bit quantity computing module shared by data point, calculates bit quantity shared by data point in memory cache Ap for utilizing following formula:
C＝(A-3)/4≠2，
Wherein, C bit quantity shared by data point;
To fill character number calculating section, for utilize the result of following formula input needed for the quantity of filling character and character information,
P＝(A-3)％4，
Wherein, P is the quantity of filling character;
Valid data bit quantity computing module, for utilizing following formula to distribute the quantity depositing valid data position in content caching Tp,
Tn＝A-14，
Wherein, Tn is valid data bit quantity;
Data arranging module, after padding data in content caching Tp, utilizes following formula to arrange filled data,
N＝E％4+4，
Wherein, N represents permutation algorithm exponent number, and E represents cryptographic algorithm;
Data encryption module, for choosing a kind of cipher mode by multiple cipher mode, is encrypted the data after arrangement in content caching Tp;
Data bit correction verification module, for verifying the data bit of the data after arrangement in content caching Tp, and adds to after the data in the content caching of significant figure strong point after arrangement by the data bit obtained after this verification;
Sparse processing module, carries out sparse process with to the data bit in the data after arrangement in content caching Tp, to obtain a content caching Tp2 with data and new significant figure strong point;
COMPREHENSIVE CALCULATING module, for calculating content caching Tp2, with draw can carry in this content caching Tp2 number of data bits, valid data position quantity and the quantity of filling character;
Fill in module, for filling in version number in memory cache Ap successively, fill character and quantity, the type of sparse Processing Algorithm, block call number, data in content caching Tp2 in the quantity of valid data position and content caching Tp2;
Modular converter, for being binary data by the data transformations in memory cache Ap;
Data point implant module, for being implanted in binary data in the blank grid for implantation number strong point according to order from left to right and from top to bottom.
10. one kind includes the antifalsification label of the point diagram of matrix described in claim 1, it is characterized in that, comprise the matrix point diagram group be made up of at least two matrix point diagrams, described matrix point diagram group comprise basis matrix point diagram, be arranged on the rotation matrix point diagram of its side;
Described basis matrix point diagram and institute's rotation matrix point diagram are all comprise anchor point part and data point part, and described data point part comprises function digit part, data bit portion, School Affairs part and primitive character and extracts status sections;
Described function digit part comprise version number's monumented point position for representing version number, for represent numerical digit sparse Processing Algorithm type Map algorithm types monumented point position, for representing the density value monumented point position of valid data bit quantity, the block index mark point position for code figure quantity basic in representing matrix point diagram and the encryption algorithm type monumented point position for representing matrix point diagram cryptographic algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510549699.1A CN105005806B (en) | 2015-08-31 | 2015-08-31 | A kind of matrix dot map logo, generates system and antifalsification label at generation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510549699.1A CN105005806B (en) | 2015-08-31 | 2015-08-31 | A kind of matrix dot map logo, generates system and antifalsification label at generation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105005806A true CN105005806A (en) | 2015-10-28 |
| CN105005806B CN105005806B (en) | 2018-10-30 |
Family
ID=54378470
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510549699.1A Expired - Fee Related CN105005806B (en) | 2015-08-31 | 2015-08-31 | A kind of matrix dot map logo, generates system and antifalsification label at generation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105005806B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105160380A (en) * | 2015-08-31 | 2015-12-16 | 立德高科(北京)数码科技有限责任公司 | Anti-counterfeit label, generation method and generation system |
| CN109344659A (en) * | 2018-08-10 | 2019-02-15 | 四川广聚其力电子科技有限公司 | A kind of construction project source code tamper resistant method |
| CN110909843A (en) * | 2019-11-21 | 2020-03-24 | 程烨 | Method, device, server and storage medium for modeling coded image |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1443452A2 (en) * | 2003-01-30 | 2004-08-04 | Denso Wave Incorporated | Two-dimensional code, methods and apparatuses for generating, displaying and reading same |
| CN103177281A (en) * | 2013-04-12 | 2013-06-26 | 江苏圆坤二维码研究院有限公司 | Two-dimensional code compiling method |
| CN104751342A (en) * | 2015-04-21 | 2015-07-01 | 张川 | Commodity information coding and decoding method for tracking commodities |
-
2015
- 2015-08-31 CN CN201510549699.1A patent/CN105005806B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1443452A2 (en) * | 2003-01-30 | 2004-08-04 | Denso Wave Incorporated | Two-dimensional code, methods and apparatuses for generating, displaying and reading same |
| CN103177281A (en) * | 2013-04-12 | 2013-06-26 | 江苏圆坤二维码研究院有限公司 | Two-dimensional code compiling method |
| CN104751342A (en) * | 2015-04-21 | 2015-07-01 | 张川 | Commodity information coding and decoding method for tracking commodities |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105160380A (en) * | 2015-08-31 | 2015-12-16 | 立德高科(北京)数码科技有限责任公司 | Anti-counterfeit label, generation method and generation system |
| CN109344659A (en) * | 2018-08-10 | 2019-02-15 | 四川广聚其力电子科技有限公司 | A kind of construction project source code tamper resistant method |
| CN110909843A (en) * | 2019-11-21 | 2020-03-24 | 程烨 | Method, device, server and storage medium for modeling coded image |
| CN110909843B (en) * | 2019-11-21 | 2021-05-14 | 程烨 | Method, device, server and storage medium for modeling coded image |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105005806B (en) | 2018-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108365947B (en) | A kind of image encryption method based on Feistel network Yu dynamic DNA encoding | |
| TWI750223B (en) | Blockchain encrypted radio frequency chip storage design method | |
| CN102664732B (en) | The anti-quantum computation attack of CPK public key system realize method and system | |
| CN102377566B (en) | Security processing device and system for electric meter data | |
| CN107508667B (en) | Ciphertext policy ABE base encryption method and its device of the fix duty without key escrow can be disclosed | |
| CN101540673B (en) | Public key encryption and decryption method and digital signature method thereof | |
| CN102769620B (en) | A kind of safely outsourced encryption method based on attribute | |
| CN105607865B (en) | Secure data storage device, system and its data write-in and read method | |
| CN116670673A (en) | Transferring cryptocurrency from a remote limited access wallet | |
| CN106357701A (en) | Integrity verification method for data in cloud storage | |
| CN102402670A (en) | File encryption and decryption method | |
| CN105005806A (en) | Matrix point diagram, generation method, generation system and anti-counterfeit label | |
| US7000110B1 (en) | One-way function generation method, one-way function value generation device, proving device, authentication method, and authentication device | |
| CN102970132B (en) | Protection method for preventing power analysis and electromagnetic radiation analysis on grouping algorithm | |
| CN105100083A (en) | Attribute-based encryption method and attribute-based encryption system capable of protecting privacy and supporting user Undo | |
| CN104135473A (en) | A method for realizing identity-based broadcast encryption by ciphertext-policy attribute-based encryption | |
| TW201141172A (en) | Methods, circuits, devices, and systems for provisioning of cryptographic data to one or more electronic devices | |
| CN101582760A (en) | Key encrypting and storing method based on tree structure | |
| CN105516340A (en) | Cloud storage data recoverability verification method and system | |
| CN104408379B (en) | A kind of multistage endorsement method of the electronic document based on workflow | |
| CN109951268A (en) | The encrypting and decrypting method and device with bit map are changed based on position | |
| CN102063587A (en) | Cloud storage data storage and retrieval method, device and system | |
| CN105160380A (en) | Anti-counterfeit label, generation method and generation system | |
| CN107292134A (en) | It is a kind of to prevent Android from applying by the application reinforcement means and system of decompiling | |
| CN105824602B (en) | Input-interdependent random number generating apparatus and its method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180918 Address after: 518000 A 402, Dongming science Road, Guangming New High tech Zone, Guangming New District, Shenzhen, Guangdong. Applicant after: Shenzhen Yun Wu Zhi Lian Technology Co., Ltd. Address before: 100081 room 803, Fuhai international port 17, Da Liu Shu Lu, Haidian District, Beijing. Applicant before: Leader Tech (Beijing) Digtal Technology Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181030 Termination date: 20190831 |