CN112149774A - Chinese character commodity anti-counterfeiting code generation method - Google Patents

Chinese character commodity anti-counterfeiting code generation method Download PDF

Info

Publication number
CN112149774A
CN112149774A CN202010972003.7A CN202010972003A CN112149774A CN 112149774 A CN112149774 A CN 112149774A CN 202010972003 A CN202010972003 A CN 202010972003A CN 112149774 A CN112149774 A CN 112149774A
Authority
CN
China
Prior art keywords
sequence
binary
chinese character
commodity
counterfeiting
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
Application number
CN202010972003.7A
Other languages
Chinese (zh)
Other versions
CN112149774B (en
Inventor
盛苏英
吴新华
张小美
陆国平
张振娟
高岩波
周磊
任洁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nantong University
Original Assignee
Nantong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nantong University filed Critical Nantong University
Priority to CN202010972003.7A priority Critical patent/CN112149774B/en
Publication of CN112149774A publication Critical patent/CN112149774A/en
Application granted granted Critical
Publication of CN112149774B publication Critical patent/CN112149774B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
    • G06K19/06046—Constructional details
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/018—Certifying business or products
    • G06Q30/0185—Product, service or business identity fraud
    • 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/001—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals

Landscapes

  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Finance (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Complex Calculations (AREA)

Abstract

The invention discloses a method for generating anti-counterfeiting codes of Chinese character commodities, which comprises the following steps: the Chinese character commodity identification code A representing the unique identity information of a certain commodity is subjected to numerical data and 8bits binary conversion and binary supplement operation to obtain a binary sequence
Figure DDA0002684420160000011
And
Figure DDA0002684420160000012
calculating to obtain initial values and parameters of the chaotic system, an extraction starting position and an extraction interval number, performing chaotic iteration to obtain chaotic sequences X1 and X2, and respectively performing binary sequence comparison on binary sequences by using position change rules before and after descending order of the sequences X1 and X2
Figure DDA0002684420160000013
And
Figure DDA0002684420160000014
scrambling is carried out to obtain a scrambled binary sequence
Figure DDA0002684420160000015
And
Figure DDA0002684420160000016
respectively combining binary sequences
Figure DDA0002684420160000017
And
Figure DDA0002684420160000018
the medium elements are grouped by taking 5 elements as units in the forward direction, and the odd-even grouping sequences are recombined respectively, so that the commodity anti-counterfeiting number is generated, and then the Chinese character commodity anti-counterfeiting code is generated by combination. The method for generating the anti-counterfeiting code of the Chinese character commodity is simple and feasible, has strong safety and is not easy to crack, and the generated anti-counterfeiting code of the Chinese character commodity has uniqueness and non-forgeability.

Description

Chinese character commodity anti-counterfeiting code generation method
Technical Field
The invention relates to the technical field of digital anti-counterfeiting, in particular to a method for generating anti-counterfeiting codes of Chinese character commodities.
Background
Counterfeit products are often not fresh, and it is necessary to take action to maintain the rights of the manufacturer and the consumer. Counterfeit products pose a serious threat to various industries, particularly luxuries such as pharmaceuticals, agricultural products, automotive parts, computer software, and expensive perfumes, cosmetics, jewelry, watches, and famous costumes. The geneva international business estimates that worldwide annual sales of counterfeit products amount to $ 6,500 billion. Counterfeit drugs and wine products are particularly problematic, not only are they counterfeits, but the actions made by counterfeiters seriously jeopardize the rights and interests of consumers: the counterfeit of the medicine delays or even aggravates the illness; the things of fake wine harm to people are more frequent, the reputation of merchants and the confidence of consumers are stricken heavily, and the good establishment of economic and social orders is greatly damaged. Therefore, numerous anti-counterfeiting means are created, such as: special packaging, designing complex icons, providing a thumbnail, etc. However, these measures often result in insufficient anti-counterfeiting performance due to lack of technology, and are easy for counterfeiters to drill blanks. With the progress of the times, the anti-counterfeiting technology has great breakthrough. Such as chip technology, biotechnology, etc., but the practical operability for many fields is not great due to the characteristics of high cost, rather limited inquiry terminal, etc. Since the digital anti-counterfeiting technology is brought to the market in the middle of the 90 th century, the digital anti-counterfeiting technology is unprecedented.
The digital anti-counterfeiting combines the characteristics of anti-counterfeiting printing and digital encryption technology, one-time use authority, randomness of generated passwords, invisibility and the like, so that the anti-counterfeiting of commodities is unprecedentedly guaranteed, meanwhile, the authenticity of products can be inquired in multiple ways, and the rampant of counterfeit and shoddy products can be effectively inhibited. Meanwhile, the chaotic signal is used as a natural password and is introduced into the generation process of the commodity anti-counterfeiting code, so that the safety is higher. Under the condition, a chaos cipher technology is utilized to provide a Chinese character commodity anti-counterfeiting code generation method so as to generate a Chinese character commodity anti-counterfeiting code with uniqueness and non-forgeability, and the method has good practical application and popularization values.
Disclosure of Invention
The purpose of the invention is as follows: the invention aims to solve the defects in the prior art and provides a method for generating anti-counterfeiting codes of Chinese character commodities, which generates chaotic signal sequences by chaotic mapping, scrambles 2 binary sequences converted from identification codes of the Chinese character commodities respectively, groups elements in the scrambled binary sequences, and performs different recombination operations according to the parity numbers of the grouped sequences, thereby generating commodity anti-counterfeiting numbers and further combining to generate the anti-counterfeiting codes of the Chinese character commodities.
The technical scheme is as follows: a Chinese character commodity anti-counterfeiting code generation method is characterized by comprising the following steps:
(1) transcoding
Firstly, Chinese character commodity identification code A representing unique identity information of a certain commodity is converted into numerical data [ P ] one by onei1,Pi2]To obtain a high-order numerical sequence P1 ═ { P ═ P11,P21,...,Pi1,....,PL1And a low order value sequence P2 ═ P12,P22,...,Pi2,....,PL2}，
Then, the high-order binary sequence P1 is converted into binary data of 8bits element by element, resulting in a high-order binary sequence PB1 ═ PB11,PB12,...,PB1i,....,PB18×LSimultaneously, the low-order value sequence P2 is converted into binary data of 8bits element by element, and a low-order binary sequence PB2 ═ PB2 is obtained1,PB22,...,PB2i,....,PB28×L}，
Finally, let LB ═ mod (5-mod (8 × L,5),5), add LB '0' binary bits to the end of the higher binary sequence PB1, and LB '1' binary bits to the end of the lower binary sequence PB2, to obtain a binary sequence
Figure BDA0002684420140000021
Figure BDA0002684420140000022
And binary sequence
Figure BDA0002684420140000023
Figure BDA0002684420140000024
The Chinese character commodity identification code A comprises Chinese punctuation marks in a GB2312 character set and Chinese characters of double-byte codes in the GB2312 character set, the length of the Chinese character commodity identification code A is represented by L, the lengths of numerical value sequences P1 and P2 are L, the lengths of binary sequences PB1 and PB2 are 8 xL, and the binary sequences
Figure BDA0002684420140000025
And
Figure BDA0002684420140000026
all have the length of
Figure BDA0002684420140000027
(2) Binary sequence
Figure BDA0002684420140000028
And
Figure BDA0002684420140000029
scrambling of
Firstly, an initial value x of the Logistic chaotic map is respectively calculated and obtained by utilizing a high-order numerical value sequence P1, a low-order numerical value sequence P2 and external keys alpha and beta according to the following formulas (1) - (5)1A sum parameter mu, an extraction start position m, and an extraction interval number n1、n2，
Order to
Figure BDA00026844201400000210
Then
x1＝0.00001+mod(α-kp1,0.99999) (1)
μ＝β+mod(kp1,4-β) (2)
Figure BDA00026844201400000211
Figure BDA00026844201400000212
Figure BDA00026844201400000213
Wherein the external key satisfies α ∈ (0,1), β ∈ (3.57,4),
then, the initial value x mapped by chaos1And an external key mu, iterating the Logistic chaotic mapping shown in the following formula (6), wherein k represents iteration times (k is 1, 2), xk+1Represents the chaotic signal obtained by the k-th iteration,
xk+1＝μ×xk×(1-xk) (6)
obtaining a chaotic signal sequence X ═ X1,x2,., spaced by n from the m-th element in the sequence X1Each element is 1 element to form a length of
Figure BDA00026844201400000214
Of the chaotic signal sequence
Figure BDA00026844201400000217
At the same time, the m-th element in the sequence X is sequentially spaced by n2Each element is 1 element to form a length of
Figure BDA00026844201400000215
Of the chaotic signal sequence
Figure BDA00026844201400000216
Finally, the chaotic signal sequence X1 is sorted in descending order, and the binary sequence is scrambled according to the position change scrambling rule before and after the chaotic signal sequence X1 is sorted
Figure BDA0002684420140000031
Scrambling is carried out to obtain a scrambled binary sequence
Figure BDA0002684420140000032
Simultaneously, the chaotic signal sequence X2 is sorted in a descending order, and the binary sequence is scrambled according to the position change scrambling rule before and after the chaotic signal sequence X2 is sorted
Figure BDA0002684420140000033
Scrambling is carried out to obtainTo scrambled binary sequences
Figure BDA0002684420140000034
(3) Scrambled binary sequence
Figure BDA0002684420140000035
And
Figure BDA0002684420140000036
grouping and recombining of
First, the scrambled binary sequence is decoded
Figure BDA0002684420140000037
The middle elements are sequentially and positively grouped by taking 5 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as
Figure BDA0002684420140000038
Simultaneously scrambling the binary sequences
Figure BDA0002684420140000039
The middle elements are sequentially and positively grouped by taking 5 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as
Figure BDA00026844201400000310
Wherein each of the binary packet sequences BF1{ i } and BF2{ i } includes 5 binary bits, and
Figure BDA00026844201400000311
then, each binary packet sequence BF1{ i } and BF2{ i }, wherein
Figure BDA00026844201400000312
The following recombination operations were performed in sequence:
if mod (i,2) ═ 1, the most forward binary sequence of packets BF1{ i } is added with binary '110', denoted as
Figure BDA00026844201400000313
While the top of the binary packet sequence BF2{ i } is padded with binary '101', denoted as
Figure BDA00026844201400000314
If mod (i,2) is 0, the elements in the binary grouping sequence BF1{ i } are firstly turned back and forth sequentially, and then binary '110' is added at the forefront of the elements to obtain a recombined binary grouping sequence
Figure BDA00026844201400000315
Is shown as
Figure BDA00026844201400000316
Simultaneously, the elements in the binary grouping sequence BF2{ i } are firstly turned over in the front-back order and then added with binary '101' at the forefront to obtain a recombined binary grouping sequence
Figure BDA00026844201400000317
Is shown as
Figure BDA00026844201400000318
Finally, each recombined binary grouping sequence is sequentially generated by using a bin2dec (-) function
Figure BDA00026844201400000319
Conversion into numerical data
Figure BDA00026844201400000320
Sequentially grouping each recombined binary sequence at the same time
Figure BDA00026844201400000321
Conversion into numerical data
Figure BDA00026844201400000322
Wherein
Figure BDA00026844201400000323
Thereby obtaining a numerical sequence
Figure BDA00026844201400000324
And
Figure BDA00026844201400000325
(4) transcoding: sequence of values
Figure BDA00026844201400000326
And
Figure BDA00026844201400000327
corresponding elements are combined in sequence and the numerical value and the Chinese character are converted to obtain a Chinese character sequence C, namely the commodity anti-counterfeiting number, wherein the length of the Chinese character sequence C is
Figure BDA00026844201400000328
And combining the Chinese character commodity identification code A and the commodity anti-counterfeiting number to generate the Chinese character commodity anti-counterfeiting code.
Further, the Chinese character commodity anti-counterfeiting code generation method converts the Chinese character commodity identification code A representing the unique identity information of a certain commodity into numerical data [ P ] one by one according to the Chinese characters in the step (1)i1,Pi2]It is to convert the Chinese characters in the Chinese character commodity identification code A into numerical data by adopting unicode2native (·) function one by one, namely [ Pi1,Pi2]＝unicode2native(Ai) So as to obtain a high-order numerical value sequence P1 ═ { P ═ P11,P21,...,Pi1,....,PL1And a low order value sequence P2 ═ P12,P22,...,Pi2,....,PL2}。
Further, the numerical sequence in the step (4) of the Chinese character commodity anti-counterfeiting code generation method
Figure BDA00026844201400000329
And
Figure BDA00026844201400000330
corresponding elementThe elements are combined in sequence and the conversion between numerical values and Chinese characters is carried out, which means that numerical value sequences are combined
Figure BDA0002684420140000041
And
Figure BDA0002684420140000042
each corresponding element in (a) is combined, i.e.
Figure BDA0002684420140000043
And the numerical data is converted into Chinese characters by adopting a native2unicode (·) function,
Figure BDA0002684420140000044
wherein
Figure BDA0002684420140000045
Further, the method for generating the Chinese character commodity anti-counterfeiting code combines the Chinese character commodity identification code A and the commodity anti-counterfeiting number in the step (4) to generate the commodity anti-counterfeiting code, and the method is a combination mode that the Chinese character commodity identification code A and the commodity anti-counterfeiting number are directly connected in sequence, or directly connected in reverse order, or connected in spaced insertion order.
Has the advantages that: the invention utilizes chaotic mapping to generate chaotic signal sequences, carries out scrambling on 2 binary sequences converted from Chinese character commodity identification codes respectively, groups elements in the scrambled binary sequences, and carries out different recombination operations according to the odd-even number of the grouped sequences, thereby generating commodity anti-counterfeiting numbers and further generating Chinese character commodity anti-counterfeiting codes in a combined manner.
Drawings
FIG. 1 is a schematic diagram of a process for generating anti-counterfeit codes for Chinese character commodities.
Detailed Description
The method for generating the anti-counterfeiting code of the Chinese character commodity as shown in figure 1 comprises the following steps:
(1) transcoding
Firstly, Chinese character commodity identification code A representing unique identity information of a certain commodity is converted into numerical data [ P ] one by onei1,Pi2]It is to convert the Chinese characters in the Chinese character commodity identification code A into numerical data by adopting unicode2native (·) function one by one, namely [ Pi1,Pi2]＝unicode2native(Ai) To obtain a high-order numerical sequence P1 ═ { P ═ P11,P21,...,Pi1,....,PL1And a low order value sequence P2 ═ P12,P22,...,Pi2,....,PL2}。
Then, the high-order binary sequence P1 is converted into binary data of 8bits element by element, resulting in a high-order binary sequence PB1 ═ PB11,PB12,...,PB1i,....,PB18×LSimultaneously, the low-order value sequence P2 is converted into binary data of 8bits element by element, and a low-order binary sequence PB2 ═ PB2 is obtained1,PB22,...,PB2i,....,PB28×L}，
Finally, let LB ═ mod (5-mod (8 × L,5),5), add LB '0' binary bits to the end of the higher binary sequence PB1, and LB '1' binary bits to the end of the lower binary sequence PB2, to obtain a binary sequence
Figure BDA0002684420140000046
Figure BDA0002684420140000047
And binary sequence
Figure BDA0002684420140000048
Figure BDA0002684420140000049
The Chinese character commodity identification code A comprises Chinese punctuation marks in a GB2312 character set and Chinese characters of double-byte codes in the GB2312 character set, the length of the Chinese character commodity identification code A is represented as L, and the lengths of numerical value sequences P1 and P2 are bothFor L, the binary sequences PB1 and PB2 are both 8 × L in length
Figure BDA00026844201400000410
And
Figure BDA00026844201400000411
all have the length of
Figure BDA00026844201400000412
(2) Binary sequence
Figure BDA0002684420140000051
And
Figure BDA0002684420140000052
scrambling of
Firstly, an initial value x of Logistic chaotic mapping is respectively calculated and obtained by utilizing a high-order numerical value sequence P1, a low-order numerical value sequence P2 and external keys alpha and beta according to the following formula1A sum parameter mu, an extraction start position m, and an extraction interval number n1、n2，
Order to
Figure BDA0002684420140000053
x1＝0.00001+mod(α-kp1,0.99999) (1)
μ＝β+mod(kp1,4-β) (2)
Figure BDA0002684420140000054
Figure BDA0002684420140000055
Figure BDA0002684420140000056
Wherein the external key satisfies α ∈ (0,1), β ∈ (3.57,4),
then, the initial value x mapped by chaos1And an external key mu, and iterating the Logistic chaotic mapping shown in the following formula, wherein k represents iteration times (k is 1,2, and.) and xk+1Represents the chaotic signal obtained by the k-th iteration,
xk+1＝μ×xk×(1-xk) (6)
obtaining a chaotic signal sequence X ═ X1,x2,., spaced by n from the m-th element in the sequence X1Each element is 1 element to form a length of
Figure BDA0002684420140000057
Of the chaotic signal sequence
Figure BDA00026844201400000520
At the same time, the m-th element in the sequence X is sequentially spaced by n2Each element is 1 element to form a length of
Figure BDA0002684420140000058
Of the chaotic signal sequence
Figure BDA0002684420140000059
Finally, the chaotic signal sequence X1 is sorted in descending order, and the binary sequence is scrambled according to the position change scrambling rule before and after the chaotic signal sequence X1 is sorted
Figure BDA00026844201400000510
Scrambling is carried out to obtain a scrambled binary sequence
Figure BDA00026844201400000511
Simultaneously, the chaotic signal sequence X2 is sorted in a descending order, and the binary sequence is scrambled according to the position change scrambling rule before and after the chaotic signal sequence X2 is sorted
Figure BDA00026844201400000512
Scrambling is carried out to obtain a scrambled binary sequence
Figure BDA00026844201400000513
(3) Scrambled binary sequence
Figure BDA00026844201400000514
And
Figure BDA00026844201400000515
grouping and recombining of
First, the scrambled binary sequence is decoded
Figure BDA00026844201400000516
The middle elements are sequentially and positively grouped by taking 5 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as
Figure BDA00026844201400000517
Simultaneously scrambling the binary sequences
Figure BDA00026844201400000518
The middle elements are sequentially and positively grouped by taking 5 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as
Figure BDA00026844201400000519
Wherein each of the binary packet sequences BF1{ i } and BF2{ i } includes 5 binary bits, and
Figure BDA0002684420140000061
then, each binary packet sequence BF1{ i } and BF2{ i }, wherein
Figure BDA0002684420140000062
The following recombination operations were performed in sequence:
if mod (i,2) ═ 1, the first of the sequence of binary packets BF1{ i }, thenThe faces are added with binary '110', denoted as
Figure BDA0002684420140000063
While the top of the binary packet sequence BF2{ i } is padded with binary '101', denoted as
Figure BDA0002684420140000064
If mod (i,2) is 0, the elements in the binary grouping sequence BF1{ i } are firstly turned back and forth sequentially, and then binary '110' is added at the forefront of the elements to obtain a recombined binary grouping sequence
Figure BDA0002684420140000065
Is shown as
Figure BDA0002684420140000066
Simultaneously, the elements in the binary grouping sequence BF2{ i } are firstly turned over in the front-back order and then added with binary '101' at the forefront to obtain a recombined binary grouping sequence
Figure BDA0002684420140000067
Is shown as
Figure BDA0002684420140000068
Finally, each recombined binary grouping sequence is sequentially generated by using a bin2dec (-) function
Figure BDA0002684420140000069
Conversion into numerical data
Figure BDA00026844201400000610
Sequentially grouping each recombined binary sequence at the same time
Figure BDA00026844201400000611
Conversion into numerical data
Figure BDA00026844201400000612
Wherein
Figure BDA00026844201400000613
Thereby obtaining a numerical sequence
Figure BDA00026844201400000614
And
Figure BDA00026844201400000615
(4) transcoding: sequence of values
Figure BDA00026844201400000616
And
Figure BDA00026844201400000617
corresponding elements are combined in sequence
Figure BDA00026844201400000618
And converting numerical data into Chinese characters by using native2unicode (·) function, i.e. converting numerical data into Chinese characters
Figure BDA00026844201400000619
Wherein
Figure BDA00026844201400000620
And combining the Chinese character commodity identification code A and the commodity anti-counterfeiting number in a combination mode of direct sequence connection, direct reverse sequence connection or interval insertion sequence connection to generate the Chinese character commodity anti-counterfeiting code.
The invention is further illustrated by the following specific examples:
example 1
The method for generating the anti-counterfeiting code of the Chinese character commodity comprises the following steps:
(1) firstly, the Chinese character commodity identification code A which represents the unique identification information of a certain commodity is converted into numerical data one by one according to the commodity production date 2020-02-01 production line 12 serial number 123456 so as to obtain a high-order value sequence P1 ═ 189,203,202,163,163,188,205,161,161,215,185,203,161,163,163,201,198,161,201,178,200,198,163,163,163,163,163,163,163,163,163,163,161,201,178,207,163,163,208,193,186,163,163,163,163,163,163 and a low-order value sequence P2 ═ 173,213,161,163,163,175,197,193,193,211,171,190,161,192,192,204,183,161,250,250,213,218,178,176,178,176,173,176,178,173,176,177,161,250,250,223,177,178,242,208,197,177,178,179,180,181,182.
Then, the high-order bit value sequence P1 is converted into binary data of 8bits element by element, so as to obtain a high-order binary sequence PB1, which is {1,0,1,1,1,1, 1,0,0,1,0,1,0,1,0, 0,0,0,1,1,1,0,1,1, 0,0,1,1,0,0,0,0, 1,1,1,1,1,0,0,0,1, 1,0,1,0,0,0,1,1,1,1, 1,0,1,0,0,0,1,1,1,0,1,0,1, 0,0,0,0,0,0,1,1,1,0,1,0,0,0,1,1,1,1,0,0,1,0,0,1,1,1,0,0,0,1,1,0,1,0,1,0,0,0,0,1,1,1,0,0,1,0,0,1,1,0,1,1,0,0,1,0,1,1,0,0,1,0,0,0,1,1,0,0,0,1,1,0,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0, 1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,0,1,1,1,0,0,1,0,0,1,1,0,1,1,0,0,1,0,1,1,0,0,1,1,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,1,0,1,0,0,0,0,1,1,0,0,0,0,0,1,1,0,1,1,1,0,1,0,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1}, and simultaneously converting the low-order bit value sequence P2 into binary data of 8bits one by one, to obtain a low-order binary sequence PB2, which is {1,0,1,0,1, 0,1,0,0,0,0, 0,1,0,1,0,1,1,1, 1,0,1,0,1,1,0,1,1,1,0, 0,0,1,1,0,1,0,1,0, 1,1,0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,1,1,0,0,1,0,1,1,0,1,1,1,1,0,1,0,0,0,0,1,1,1,1,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,0,1,0,1,0,1,1,1,0,1,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,0,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,0,0,1,0,1,0,1,1,0,1,1,0,1,1,0,0,0,0,1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,1,1,0,1,1,0,0,0,0,1,0,1,1,0,0,0,1,1,0,1,0,0,0,0,1,1,1,1,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,0,1,1,1,1,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,1,0,1,1,1,1,0,0,1,0,1,1,0,1,0,0,0,0,1,1,0,0,0,1,0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,1,1,0,1,1,0,1,1,0},
finally, let LB be mod (5-mod (8 × 47,5),5 be 4, add 4 '0' binary bits to the end of the higher binary sequence PB1, and add 4 '1' binary bits to the end of the lower binary sequence PB2, to obtain a binary sequence PB2
Figure BDA0002684420140000071
Figure BDA0002684420140000072
And binary sequence
Figure BDA0002684420140000073
Figure BDA0002684420140000074
Figure BDA0002684420140000081
The length of the Chinese character commodity identification code A is L-47, the length of each of the numerical sequence P1 and P2 is L-47, the length of each of the binary sequence PB1 and PB2 is 8 xL-376, and the length of each of the binary sequence PB1 and PB2 is 8 xL-376
Figure BDA0002684420140000082
And
Figure BDA0002684420140000083
all have the length of
Figure BDA0002684420140000084
(2) First, using the numerical value sequences P1 and P2 and the external keys α ═ 0.12345 and β ═ 3.75, the initial value x of the Logistic chaotic map is calculated according to the following formula1A sum parameter mu, an extraction start position m, and an extraction interval number n1、n2，
Order to
Figure BDA0002684420140000085
Then
x1＝0.00001+mod(0.12345-0.172389696730833,0.99999)＝0.951060303269167
μ＝3.75+mod(0.172389696730833,4-3.75)＝3.922389696730833
Figure BDA0002684420140000086
Figure BDA0002684420140000087
Figure BDA0002684420140000088
Then, the initial value x mapped by chaos10.951060303269167 and 3.922389696730833 of an external key mu, iterating the Logistic chaotic mapping to obtain a chaotic signal sequence X { X ═ X }1,x2,., taking 1 element at 22 elements in sequence starting from the 334 th element in the sequence X to form a chaotic signal sequence X1 with the length of 380 ═ X11,X12,...,X1380And simultaneously taking 1 element from the 334 th element in the sequence X at intervals of 24 elements to form a chaotic signal sequence X2 with the length of 380 (X2)1,X22,...,X2380}，
Finally, the chaotic signal sequence X1 is sorted in descending order, and the binary sequence is scrambled according to the position change scrambling rule before and after the chaotic signal sequence X1 is sorted
Figure BDA0002684420140000089
Scrambling is carried out to obtain a scrambled binary sequence
Figure BDA00026844201400000810
Figure BDA00026844201400000811
Figure BDA0002684420140000091
Figure BDA0002684420140000092
Simultaneously, the chaotic signal sequence X2 is sorted in a descending order, and the binary sequence is scrambled according to the position change scrambling rule before and after the chaotic signal sequence X2 is sorted
Figure BDA0002684420140000093
Figure BDA0002684420140000094
Obtaining a scrambled binary sequence
Figure BDA0002684420140000095
Figure BDA0002684420140000096
(3) First, the scrambled binary sequence is aligned
Figure BDA0002684420140000097
And
Figure BDA0002684420140000098
grouping the binary sequences separately
Figure BDA0002684420140000099
The middle elements are sequentially grouped by 5 elements in the forward direction from beginning to end to obtain a binary sequence after grouping, which is represented as BF1{1} {0,0,0,1,1}, BF1{2} {1,1,0, 0}, …, BF1{38} {0,0,1,0,0}, …, BF1{75} {0,0,1,1,1}, BF1{76} {0,0,1,1,0}, and the binary sequence is simultaneously grouped in the forward direction from beginning to end to represent the binary sequence as {0,0,0,1,1, 0}, and the binary sequence is also represented as BF
Figure BDA00026844201400000910
The middle elements are grouped by 5 elements in the forward direction from beginning to end to obtain a binary sequence after grouping, which is expressed as BF2{1} - {1,1,0,1,0}, BF2{2} - {0,0,0,0,1},…,BF2{38}＝{0,1,0,1,1}，…,BF2{75}＝{0,0,1,0,1}，BF2{76}＝{0,0,0,1,1}，
then, each binary packet sequence BF1{ i } and BF2{ i }, wherein
Figure BDA00026844201400000911
Sequentially carrying out recombination operation to obtain recombined binary grouping sequence expressed as
Figure BDA00026844201400000912
Figure BDA00026844201400000913
Figure BDA00026844201400000914
And BF2{1} - {1,0,1,1,1,0,1,0}, BF2{2} - {1,0,1,1,0,0,0,0}, …, BF2{38} - {1,0,1,0, 0}, …, BF2{75} - {1,0,1,0,0,1,0,1}, BF2{76} - {1,0,1,1,0,0, 0},
finally, each recombined binary grouping sequence is sequentially divided into groups by utilizing a bin2dec (-) function
Figure BDA00026844201400000915
Conversion into numerical data
Figure BDA00026844201400000916
Sequentially grouping each recombined binary sequence at the same time
Figure BDA00026844201400000917
Conversion into numerical data
Figure BDA00026844201400000918
Wherein i is 1,2, 3.., 76, thereby obtaining a sequence of values
Figure BDA00026844201400000919
Figure BDA00026844201400000920
Figure BDA00026844201400000921
And
Figure BDA00026844201400000922
Figure BDA00026844201400000923
Figure BDA0002684420140000101
(4) sequence of values
Figure BDA0002684420140000102
And
Figure BDA0002684420140000103
each element is combined and the numerical value and the Chinese character are converted, the Chinese character commodity anti-counterfeiting code is obtained as follows, wherein the Chinese character commodity anti-counterfeiting code is 'the coal majestic crab fasciculation weft department tsunami linkage hissing barrel morningglory pseudo hissing blanket yusi running cany crab azulene means either lean carbon and inferior mu coal unloading twitch uned in names of mythical beings exert oneself yellow jacket zhao shuang zhao amu Yingzhao amu best relation collapse salary special bags of willow branches, framed by bamboo, for building dykes yu tail hisyuyan tai water chestnut istian Yingpian Yishuang weft core frost-feeding chatting borer', the Chinese character commodity anti-counterfeiting code A and the commodity anti-counterfeiting code are combined in a direct sequence connection mode, or direct reverse sequence connection mode, or interval insertion connection mode,
direct sequential connection: "Jiangsu # # group x son company @ production line 12 serial number 123456 commercial production date 2020-02-01 production line 12 serial number 123456 coal seizing coupon latitude linkage hissing barrel glycoside yarn mildew fake hissing blanket Yulin Jiangxi post crab Yulin barren charcoal inferior sea grass rather than Yulin Jiang post crab azulene Yulin charcoal inferior sea grass unloading coal curtain yellow mu uned in names of mythical beings exert oneself Shushuang awl rescue Yizhen Yinyang frame good relation collapse salary special bags of willow branches, framed by bamboo, for building dykes whorl fiver Yinyang water chestnut isthmus piece Ying latitude core cream feeding talk,
direct reverse order connection: "talk about Han cream feeding core latitude Yingpian fxia water chestnut Feishi Ying Yuan Xuan Yuan special bags of willow branches, framed by bamboo, for building dykes Jian Yuan Jian Ying Sha Yuan Jian exert oneself uned in names of mythical beings Twen coal unloading Yuan Zhi Cao Xiao Zao Zhi Yuan Cao Yuan Yi Bian Yan Yi Fu Lin Yi Cao Yi Yuan Cao Yi Xuan Yao Jian coal 6521 # sequence 21 line produces 10-20-0202 day product Shangen Shi Gong Yi (Du prince x Yuan Jiang # # province Su Jiang #,
interval insertion connection: "Jiangsu maoyan province crab # baozhou jianyan jianggong barrel extract x howl x lianzi yangong extract a glycoside @ a mould commercial fake product hissing blanket production on the best stage of Yu Si is driven 2 salary 0 rolling 2 to 0 crab-azulene 0 means 2 water shield-poor 0 1 carbon sea producing mu line unloading 1 coal 2 sequence rose column uned in names of mythical beings No. exert oneself 1 shuang 2 shuang 3 cone 4 rescue 5 rescue 6 Tibet zhang frame through relation collapse salary special bags of willow branches, framed by bamboo, for building dykes zilian shanghai Yingsi fetus water chestnut Yingjiangxian latitude core feeding cream talk",
example 2
According to the method for generating the anti-counterfeiting code of the Chinese character commodity, the commodity identification code character string A of a certain commodity and the generation steps of the anti-counterfeiting code of the commodity are similar to those of the specific embodiment 1, and only a certain external secret key is slightly changed: 0.12345000000001; or beta-3.74999999999999, the result of the generation of the anti-counterfeiting code of the Chinese character commodity is shown in table 1. As can be seen from the following table: once the external secret key slightly changes, the generated commodity anti-counterfeiting number and the Chinese character commodity anti-counterfeiting code can greatly change, so that the Chinese character commodity anti-counterfeiting code generation method provided by the patent has secret key sensitivity.
TABLE 1 Generation result of anti-counterfeit code for Chinese character commodities when external secret key is slightly changed
Figure BDA0002684420140000104
Figure BDA0002684420140000111
Figure BDA0002684420140000121
Example 3
According to the above method for generating the anti-counterfeit code of the Chinese character product, the steps for generating the external secret key and the anti-counterfeit code are similar to those of the embodiment 1, only the character string A of the product identification code of a certain product (the product production date 2020-02-01 production line 12 serial No. 123456 in Jiangsu province # # group x. a subsidiary company @) is slightly changed: "Gang Suzhou # group x a company @ commercial production date 2020-02-01 production line 12 serial No. 123456"; or "Jiangsu province # # group x son company @ brand product production date 2020-12-01 production line 12 serial No. 123456"; or "Jiangsu province # # group x son company @ product production date 2020-02-01 production line 12 serial number 123459", the generation result of Chinese character commodity anti-counterfeiting code is shown in Table 2. As can be seen from the following table: once the commodity identification code character string representing the unique identification information of a certain commodity slightly changes, the generated commodity anti-counterfeiting number and the Chinese character commodity anti-counterfeiting code can greatly change, so that the Chinese character commodity anti-counterfeiting code generation method provided by the patent has sensitivity to the commodity identification information (namely the commodity identification code character string).
TABLE 2 Generation result of commodity anti-counterfeit code when commodity identification code is slightly changed
Figure BDA0002684420140000122
Figure BDA0002684420140000131
Figure BDA0002684420140000141
It can be seen from the above specific embodiments 2 and 3 that the anti-counterfeiting code generated by the anti-counterfeiting code generation method for Chinese character commodities provided by the present patent is not only closely related to an external secret key, but also depends on a commodity identification code character string representing unique identity information of a certain commodity, so that the anti-counterfeiting code generation method for Chinese character commodities provided by the present patent has strong security, can better resist known/selected plaintext attacks, is not easy to crack, and ensures that the generated anti-counterfeiting code for Chinese character commodities has "uniqueness" and "unforgeability".
Although the present invention has been described with reference to a preferred embodiment, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (4)

1. A Chinese character commodity anti-counterfeiting code generation method is characterized by comprising the following steps:
(1) transcoding:
firstly, Chinese character commodity identification code A representing unique identity information of a certain commodity is converted into numerical data [ P ] one by onei1,Pi2]To obtain a high-order numerical sequence P1 ═ { P ═ P11,P21,...,Pi1,....,PL1And a low order value sequence P2 ═ P12,P22,...,Pi2,....,PL2}，
Then, the high-order binary sequence P1 is converted into binary data of 8bits element by element, resulting in a high-order binary sequence PB1 ═ PB11,PB12,...,PB1i,....,PB18×LSimultaneously, the low-order value sequence P2 is converted into binary data of 8bits element by element, and a low-order binary sequence PB2 ═ PB2 is obtained1,PB22,...,PB2i,....,PB28×L}，
Finally, let LB ═ mod (5-mod (8 × L,5),5), add LB '0' binary bits to the end of the higher binary sequence PB1, and LB '1' binary bits to the end of the lower binary sequence PB2, to obtain a binary sequence
Figure FDA0002684420130000011
Figure FDA0002684420130000012
And binary sequence
Figure FDA0002684420130000013
Figure FDA0002684420130000014
The Chinese character commodity identification code A comprises Chinese punctuation marks in a GB2312 character set and double-byte coded Chinese characters in the GB2312 character set, the length of the Chinese character commodity identification code A is represented as L, the lengths of numerical value sequences P1 and P2 are L, the lengths of binary sequences PB1 and PB2 are 8 xL, and the lengths of the binary sequences are 8 xL
Figure FDA0002684420130000015
And
Figure FDA0002684420130000016
all have the length of
Figure FDA0002684420130000017
(2) Binary sequence
Figure FDA0002684420130000018
And
Figure FDA0002684420130000019
scrambling of (1):
firstly, an initial value x of the Logistic chaotic map is respectively calculated and obtained by utilizing a high-order numerical value sequence P1, a low-order numerical value sequence P2 and external keys alpha and beta according to the following formulas (1) - (5)1A sum parameter mu, an extraction start position m, and an extraction interval number n1、n2Let us order
Figure FDA00026844201300000110
Then
x1＝0.00001+mod(α-kp1,0.99999) (1)
μ＝β+mod(kp1,4-β) (2)
Figure FDA00026844201300000111
Figure FDA00026844201300000112
Figure FDA00026844201300000113
Wherein the external key satisfies α ∈ (0,1), β ∈ (3.57,4),
then, the initial value x mapped by chaos1And an external key mu, iterating the Logistic chaotic mapping shown in the following formula (6), wherein k represents iteration times (k is 1, 2), xk+1Represents the chaotic signal obtained by the k-th iteration,
xk+1＝μ×xk×(1-xk) (6)
obtaining a chaotic signal sequence X ═ X1,x2,., spaced by n from the m-th element in the sequence X1Each element is 1 element to form a length of
Figure FDA0002684420130000021
Of the chaotic signal sequence
Figure FDA0002684420130000022
At the same time, the m-th element in the sequence X is sequentially spaced by n2Each element is 1 element to form a length of
Figure FDA0002684420130000023
Of the chaotic signal sequence
Figure FDA0002684420130000024
Finally, the chaotic signal sequence X1 is sorted in descending order, and the binary sequence is scrambled according to the position change scrambling rule before and after the chaotic signal sequence X1 is sorted
Figure FDA0002684420130000025
Scrambling is carried out to obtain a scrambled binary sequence
Figure FDA0002684420130000026
Simultaneously, the chaotic signal sequence X2 is sorted in a descending order, and the binary sequence is scrambled according to the position change scrambling rule before and after the chaotic signal sequence X2 is sorted
Figure FDA0002684420130000027
Scrambling is carried out to obtain a scrambled binary sequence
Figure FDA0002684420130000028
(3) Scrambled binary sequence
Figure FDA0002684420130000029
And
Figure FDA00026844201300000210
grouping and recombining:
first, the scrambled binary sequence is decoded
Figure FDA00026844201300000211
The middle elements are sequentially and positively grouped by taking 5 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as
Figure FDA00026844201300000212
Simultaneously scrambling the binary sequences
Figure FDA00026844201300000213
The middle elements are sequentially and positively grouped by taking 5 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as
Figure FDA00026844201300000214
Wherein each of the binary packet sequences BF1{ i } and BF2{ i } includes 5 binary bits, and
Figure FDA00026844201300000215
then, each sequence of binary packets BF1{ i } and BF2{ i }, where i is 1,2, 3.,
Figure FDA00026844201300000216
the following recombination operations were performed in sequence:
if mod (i,2) ═ 1, the most forward binary sequence of packets BF1{ i } is added with binary '110', denoted as
Figure FDA00026844201300000217
While the top of the binary packet sequence BF2{ i } is padded with binary '101', denoted as
Figure FDA00026844201300000218
If mod (i,2) is 0, the elements in the binary grouping sequence BF1{ i } are firstly turned back and forth sequentially, and then binary '110' is added at the forefront of the elements to obtain a recombined binary grouping sequence
Figure FDA00026844201300000219
Is shown as
Figure FDA00026844201300000220
Simultaneously, the elements in the binary grouping sequence BF2{ i } are firstly turned over in the front-back order and then added with binary '101' at the forefront to obtain a recombined binary grouping sequence
Figure FDA00026844201300000221
Is shown as
Figure FDA00026844201300000222
Finally, each recombined binary grouping sequence is sequentially generated by using a bin2dec (-) function
Figure FDA00026844201300000223
Conversion into numerical data
Figure FDA00026844201300000224
Figure FDA00026844201300000225
Figure FDA00026844201300000226
Conversion into numerical data
Figure FDA00026844201300000227
Wherein i is 1,2, 3.,
Figure FDA00026844201300000228
thereby obtaining a numerical sequence
Figure FDA00026844201300000229
And
Figure FDA00026844201300000230
(4) transcoding:
sequence of values
Figure FDA00026844201300000231
And
Figure FDA00026844201300000232
corresponding elements in the groupCombining the numerical values and the Chinese characters to obtain a Chinese character sequence C, namely the commodity anti-counterfeiting number, wherein the length of the Chinese character sequence C is
Figure FDA00026844201300000233
And combining the Chinese character commodity identification code A and the commodity anti-counterfeiting number to generate the Chinese character commodity anti-counterfeiting code.
2. The method for generating anti-counterfeiting codes for Chinese character commodities as claimed in claim 1, wherein: the Chinese character commodity identification code A representing the unique identity information of a certain commodity in the step (1) is converted into numerical data [ P ] one by onei1,Pi2]It is to convert the Chinese characters in the Chinese character commodity identification code A into numerical data by adopting unicode2native (·) function one by one, namely [ Pi1,Pi2]＝unicode2native(Ai) So as to obtain a high-order numerical value sequence P1 ═ { P ═ P11,P21,...,Pi1,....,PL1And a low order value sequence P2 ═ P12,P22,...,Pi2,....,PL2}。
3. The method for generating anti-counterfeiting codes for Chinese character commodities as claimed in claim 1, wherein: the numerical sequence in step (4)
Figure FDA0002684420130000031
And
Figure FDA0002684420130000032
corresponding elements are combined in sequence and the conversion between numerical values and Chinese characters is carried out, which means that numerical value sequences are combined
Figure FDA0002684420130000033
And
Figure FDA0002684420130000034
in which corresponding elements are combined, i.e.
Figure FDA0002684420130000035
And converting numerical data into Chinese characters by using native2unicode (·) function, i.e. converting numerical data into Chinese characters
Figure FDA0002684420130000036
Wherein i is 1,2, 3.,
Figure FDA0002684420130000037
4. the method for generating anti-counterfeiting codes for Chinese character commodities as claimed in claim 1, wherein: the step (4) of combining the Chinese character commodity identification code A and the commodity anti-counterfeiting number to generate the commodity anti-counterfeiting code is to adopt a combination mode of directly connecting the Chinese character commodity identification code A and the commodity anti-counterfeiting number in sequence, or directly connecting the Chinese character commodity identification code A and the commodity anti-counterfeiting number in reverse sequence, or connecting the Chinese character commodity identification code A and the commodity anti-counterfeiting number in sequence at intervals.
CN202010972003.7A 2020-09-16 2020-09-16 Chinese character commodity anti-counterfeiting code generation method Active CN112149774B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010972003.7A CN112149774B (en) 2020-09-16 2020-09-16 Chinese character commodity anti-counterfeiting code generation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010972003.7A CN112149774B (en) 2020-09-16 2020-09-16 Chinese character commodity anti-counterfeiting code generation method

Publications (2)

Publication Number Publication Date
CN112149774A true CN112149774A (en) 2020-12-29
CN112149774B CN112149774B (en) 2021-11-30

Family

ID=73892896

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010972003.7A Active CN112149774B (en) 2020-09-16 2020-09-16 Chinese character commodity anti-counterfeiting code generation method

Country Status (1)

Country Link
CN (1) CN112149774B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112884104A (en) * 2021-03-24 2021-06-01 南通大学 Commodity anti-counterfeiting two-dimensional code generation method based on chaotic encryption
CN113255860A (en) * 2021-03-26 2021-08-13 南通大学 Commodity anti-counterfeiting two-dimensional code generation method based on layered encryption
CN113343639A (en) * 2021-05-19 2021-09-03 网易（杭州）网络有限公司 Product identification code image generation and information query method based on product identification code image

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104680220A (en) * 2015-03-24 2015-06-03 南通大学 Commodity anti-counterfeiting code batch generation method
CN105354717A (en) * 2015-11-30 2016-02-24 南通大学 Colorful commodity anti-counterfeiting code generating method
CN107425956A (en) * 2017-07-27 2017-12-01 南通大学 A kind of character type commodity counterfeit prevention code generating method
CN111382820A (en) * 2020-02-25 2020-07-07 南通大学 Four-lattice pure-color commodity anti-counterfeiting code generation method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104680220A (en) * 2015-03-24 2015-06-03 南通大学 Commodity anti-counterfeiting code batch generation method
CN105354717A (en) * 2015-11-30 2016-02-24 南通大学 Colorful commodity anti-counterfeiting code generating method
CN107425956A (en) * 2017-07-27 2017-12-01 南通大学 A kind of character type commodity counterfeit prevention code generating method
CN111382820A (en) * 2020-02-25 2020-07-07 南通大学 Four-lattice pure-color commodity anti-counterfeiting code generation method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
吴新华: "基于混沌密码的数码防伪追溯系统设计", 《计算机与数字工程》 *
盛苏英等: "基于混沌的数码防伪系统研究与实现", 《微电子学与计算机》 *
盛苏英等: "混沌密码技术在数码防伪中的应用研究", 《信息技术》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112884104A (en) * 2021-03-24 2021-06-01 南通大学 Commodity anti-counterfeiting two-dimensional code generation method based on chaotic encryption
CN112884104B (en) * 2021-03-24 2022-07-05 南通大学 Commodity anti-counterfeiting two-dimensional code generation method based on chaotic encryption
CN113255860A (en) * 2021-03-26 2021-08-13 南通大学 Commodity anti-counterfeiting two-dimensional code generation method based on layered encryption
CN113255860B (en) * 2021-03-26 2022-08-02 南通大学 Commodity anti-counterfeiting two-dimensional code generation method based on layered encryption
CN113343639A (en) * 2021-05-19 2021-09-03 网易（杭州）网络有限公司 Product identification code image generation and information query method based on product identification code image
CN113343639B (en) * 2021-05-19 2023-10-03 网易（杭州）网络有限公司 Product identification code diagram generation and information query method based on product identification code diagram

Also Published As

Publication number Publication date
CN112149774B (en) 2021-11-30

Similar Documents

Publication Publication Date Title
CN112149774B (en) Chinese character commodity anti-counterfeiting code generation method
CN109472338B (en) Batch generation method of commodity anti-counterfeiting two-dimensional codes
CN109284803B (en) Commodity anti-counterfeiting two-dimensional code generation method
CN112149773B (en) Commodity anti-counterfeiting code generation method based on Chinese character encryption
CN104486073B (en) A kind of encryption and decryption method of character type data
CN112163230B (en) Commodity anti-counterfeiting code generation method based on Chinese character encryption
CN111985591B (en) Commodity anti-counterfeiting code generation method based on character string encryption
CN112884104B (en) Commodity anti-counterfeiting two-dimensional code generation method based on chaotic encryption
CN112001468B (en) Character type commodity anti-counterfeiting code generation and identification method
CN103310255B (en) A kind of coding method of color character and its coding/decoding method
CN109995504B (en) Encryption and decryption method for character string
CN104680220A (en) Commodity anti-counterfeiting code batch generation method
CN105354717B (en) A kind of colour commodity counterfeit prevention code generating method
CN112001467B (en) Commodity anti-counterfeiting code generation and identification method based on picture encryption and decryption
CN111382820B (en) Four-lattice pure-color commodity anti-counterfeiting code generation method
CN112217627B (en) Layered encrypted commodity anti-counterfeiting code generation method
CN106375083A (en) Encryption-decryption method based on Base64 and device thereof
CN111353166A (en) Encryption method for converting picture into Chinese character
CN107425956A (en) A kind of character type commodity counterfeit prevention code generating method
CN113255860B (en) Commodity anti-counterfeiting two-dimensional code generation method based on layered encryption
CN103824197B (en) Security code generating means
CN107423797B (en) Anti-counterfeiting code information generation method
CN104598801A (en) Dynamic two-dimension code generation method based on algorithm reconstruction
CN113935345B (en) Commodity anti-counterfeiting code batch generation method based on character string-to-picture encryption
CN114707165A (en) Character string encryption method based on hierarchical scrambling

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant