CN112183697B - A method for batch generation of two-dimensional codes for garbage classification - Google Patents

Abstract

The invention discloses a garbage classification two-dimensional code batch generation method, which comprises the following steps: extracting an identity code and a hidden code from certain garbage bag identity information, and respectively carrying out conversion and combination operation to obtain a combined binary matrix B and high and low combined binary sequences B1 and B2; generating chaotic signal sequences by relying on the identity codes and the hidden codes and utilizing chaotic mapping, and respectively scrambling, grouping and diffusing the high-order binary sequences B1 and the low-order binary sequences B2 to finish the uniform encryption of the identity hidden codes of a certain batch of garbage bags; the chaos signal sequence is generated by relying on the batch identity codes of the single garbage bags and utilizing chaos mapping, and the identity hidden code unified encryption result is respectively scrambled according to different rules according to garbage categories, so that garbage classification two-dimensional codes are generated in batches. The garbage classification two-dimensional code batch generation method is simple and feasible, has strong safety, and generates garbage classification codes with uniqueness, safety and garbage classification guiding performance.

Description

A method for batch generation of two-dimensional codes for garbage classification

technical field

The invention relates to the technical field of garbage classification, in particular to a method for batch generation of two-dimensional codes for garbage classification.

Background technique

With the rapid development of science and technology, economy and society, and the further advancement of the urbanization process, the current annual output of urban domestic waste in my country exceeds 100 million tons, and many cities are facing the severe situation of "garbage siege". The "garbage besieged city" has become a stumbling block for China's urban development. To solve the problem of "garbage siege", the first is to reduce the generation of urban domestic waste from the source, and secondly, the recycling of waste is also an indispensable key link, so the implementation of waste classification is imminent. As early as 1992, Yichang City in my country first proposed the implementation of "garbage bag classification", and for the first time proposed the formulation of special legislation to manage the classification of urban domestic waste. Subsequently, garbage classification was gradually carried out nationwide. Since the implementation of garbage classification in the 1990s, the theoretical research on urban garbage classification in my country has achieved obvious results. Due to the lack of knowledge of garbage classification and insufficient awareness of environmental protection among urban residents. , The enthusiasm for participating in activities is not high. In addition, the infrastructure of the garbage recycling station is too simple, the garbage recycling and transportation process is too extensive, and the residents are worried about the exposure of personal privacy information of garbage bags and are passive or even unwilling to participate. Obviously, the implementation of urban garbage classification in my country is positive. Faced with many difficulties and challenges. In view of the above problems, the most urgent task is to develop a safe and reliable method for generating garbage classification codes, which can ensure the generation of garbage classification codes with "uniqueness, security and guidance of garbage classification" from the source, and promote the effective development of garbage classification work.

SUMMARY OF THE INVENTION

Purpose of the invention: The purpose of the present invention is to solve the deficiencies in the prior art, and provide a method for batch generation of two-dimensional codes for garbage classification, which extracts the identity identification code and the identity hidden code from the unified identity code of a certain batch of garbage bags, and relies on The identity identification code and hidden code are used to generate chaotic signal sequence by chaotic mapping, and the high and low binary sequences converted and combined by the identity hidden code are scrambled, grouped and diffused respectively, and the unified encryption of the identity hidden code of a certain batch of garbage bags is completed. , relying on the batch identity code of a single garbage bag and using chaotic mapping to generate a chaotic signal sequence, and scrambling the unified encryption result of the identity hidden code according to the garbage category with different rules, and then generating garbage classification QR codes in batches. The method for batch generation of garbage classification two-dimensional codes provided by the present invention is simple and feasible, and has strong security, and the generated garbage classification codes have "uniqueness, security and guidance of garbage classification".

Technical solution: a method for batch generation of two-dimensional codes for garbage classification, characterized in that it includes the following steps:

(1) Encoding and transcoding

First, encode the identity information of a batch of garbage bags, including the unified identity code of a batch of garbage bags and the batch identity code of a single garbage bag, so as to generate a garbage bag with Chinese and English characters that is unique to a single garbage bag. Identity code, expressed as M ₁ M ₂ ... M _k M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p M _k+L+p+1 M _k+L+p+2 ...M _k+L+p+n M _k+L+p+n+1 M _{k+L+p+n+ 2} M _{k+L +p+n+3} M _k+L+p+n+4 , where M ₁ M ₂ ... M _k are provinces and municipalities, and M _k+1 M _k+2 ... M _k+L are specific residences Address, M _k+L+1 M _{k+L+ 2} ... M _k+L+p is the contact person and contact number, M _k+L+p+1 M _k+L+p+2 ... M _{k +L+p+n} is the code time (the format is year-month-day, where the last two digits M _k+L+p+n-1 M _k+L+p+n is the date), M _{k+L+ p+n+1} M _k+L+p+n+2 is the garbage classification color information (representing the garbage category), M _k+L+p+n+3 M _k+L+p+n+4 is the garbage classification serial number Information (representing the serial number of a certain type of garbage bags on a certain day), separated by English spaces, and the unified identity code of a corresponding batch of garbage bags is M ₁ M ₂ ... M _k M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ...M _k+L+p M _{k+L+p+ 1} M _k+L+p+2 ...M _{k+L+p+ n-3} M _k+L+p+n-2 , the batch ID code of the corresponding single garbage bag is M _k+L+p+n-1 M _k+L+p+n M _{k+L+p+n+ 1} M _k+L+p+n+2 M _k+L+p+n+3 M _k+L+p+n+4 ,

同时将身份隐藏码逐个字符转换成数值型数据[P_i1,P_i2]，得到高位数值序列P1＝{P1₁,P1₂,…,P1_L+p,P1_L+p+1}＝{P₁₁,P₂₁,…,P_(L+p)1,P_(L+p+1)1}和低位数值序列P2＝{P2₁,P2₂,…,P2_L+p,P2_L+p+1}＝{P₁₂,P₂₂,…,P_(L+p)2,P_(L+p+1)2}，Then, the identification code (M ₁ M ₂ ... M _k M _{k+L+p+ 1} M _k+L+p+2 ... M _{k+L+ p+n-2} ) and identity concealment codes (M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p ), and Convert the identification code into numerical data character by character to obtain the corresponding numerical sequence

At the same time, the identity hidden code is converted into numerical data [P _i1 ,P _i2 ] character by character, and the high-order numerical sequence P1={P1 ₁ ,P1 ₂ ,...,P1 _L+p ,P1 _L+p+1 }={P ₁₁ ,P ₂₁ ,…,P _(L+p)1 ,P _(L+p+1)1 } and the low-order numerical sequence P2={P2 ₁ ,P2 ₂ ,…,P2 _L+p ,P2 _{L+p+ 1} }={P ₁₂ ,P ₂₂ ,...,P _(L+p)2 ,P _(L+p+1)2 },

Finally, convert the elements Si in the numerical sequence S into 8- _{bit binary sequences {BS i1 ,} BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 } one by one, and convert the elements in the numerical sequence P1 into Convert P1 _i into a binary sequence of 8 bits one by one {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 }, convert the elements P2 _i in the numerical sequence P2 into a binary sequence of 8 bits one by one {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 , BP2 _i8 },

个二进制序列{BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8}进行组合，其中

从而得到组合二进制矩阵B，and will

Binary sequences {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 } are combined, where

Thus, the combined binary matrix B is obtained,

Simultaneously combine L+p+1 binary sequences {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 }, where i=1,2,...,L +p,L+p+1, so as to obtain the high-order combined binary sequence B1={B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 }={BP1 _{1 1} ,BP1 _{1 2} ,BP1 ₁₃ ,BP1 ₁₄ ,BP1 ₁₅ ,BP1 ₁₆ ,BP1 ₁₇ ,BP1 ₁₈ ,BP1 ₂₁ ,BP1 ₂₂ ,...,BP1 ₂₇ ,BP1 ₂₈ ,...,BP1 _i1 ,BP1 _i2 ,..., BP1 _i7 ,BP1 _i8 ,...,BP1 _L+p+11 ,BP1 _L+p+12 ,BP1 _L+p+13 ,BP1 _L+p+14 ,BP1 _L+p+15 ,BP1 _{L+p+ 1 6} , BP1 _{L+p+1 7} , BP1 _L+p+18 }, and convert L+p+1 binary sequences {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 ,BP2 _i8 }, where i=1,2,...,L+p,L+p+1, so as to obtain the low-order combined binary sequence B2={B2 ₁ ,B2 ₂ ,...,B2 _{8L+ 8p+7} ,B2 _8L+8p+8 }={BP2 ₁₁ ,BP2 ₁₂ ,BP2 ₁₃ ,BP2 ₁₄ ,BP2 ₁₅ ,BP2 ₁₆ ,BP2 ₁₇ ,BP2 ₁₈ ,BP2 ₂₁ ,BP2 ₂₂ ,...,BP2 ₂₇ , BP2 ₂₈ ,...,BP2 _i1 ,BP2 _i2 ,...,BP2 _i7 ,BP2 _i8 ,...,BP2 _L+p+11 ,BP2 _L+p+12 ,BP2 _L+p+13 ,BP2 _{L +p+14} , BP2 _{L+p+1 5} , BP2 _{L+p+1 6} , BP2 _L+p+17 , BP2 _L+p+18 },

数值序列P1、P2的长度为L+p+1，组合二进制矩阵B的大小为

组合二进制序列B1、B2的长度为8L+8p+8；Among them, the garbage bag identification code includes the double-byte encoded Chinese characters in the GB2312 character set and the visible characters with ASCLL code value ∈ [32,126]. The length of the garbage bag identification code is k+L+p+n+6, and the length of the numerical sequence S is

The length of the numerical sequences P1 and P2 is L+p+1, and the size of the combined binary matrix B is

The length of the combined binary sequence B1 and B2 is 8L+8p+8;

(2) The identity hidden codes of a certain batch of garbage bags are uniformly encrypted

The identity hidden code of a certain batch of garbage bags is uniformly encrypted, which means that the identity code (M ₁ M ₂ ... M _k M _{k+L+p+ 1} M _k+L+p+2 ... M _{k+L+p+n -2} ) Encrypt the identity hidden code (M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p ), a batch of The garbage bag needs and only needs to undergo a unified encryption operation of the identity hidden code.

First, using the numerical sequence S and the binary matrix B converted into it, the binary sequences B1 and B2 converted from the numerical sequences P1 and P2, and the external keys α and β, they are calculated according to the following formulas (1)-(5) respectively. The initial value x ₁ and parameter μ of the Logistic chaotic map, the extraction start position m, and the number of extraction intervals n ₁ and n ₂ ,

make

则

but

x ₁ =α+mod(α+kp, 1-α), (1)

μ=β+mod(β+1.5×kp, 4-β), (2)

Among them, <B _1,i ,B _2,i ,B _3,i ,B _4,i ,B _5,i ,B _6,i ,B _7,i ,B _8,i >represents the i-th column of binary matrix B Or the number of binary bits '1' in the binary sequence {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 }, <B1 ₁ , B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 >represents the number of binary bits '1' in the binary sequence {B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 } ,B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+8p+8 > represents the binary sequence {B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+8p The number of binary bits '1' in ₊₈ }, the external key satisfies α∈(0,1), β∈(3.57,4),

From the initial value x ₁ of the chaotic map and the external key μ, the Logistic chaotic map shown in the following formula (6) is iterated, where k represents the number of iterations (k=1, 2,...), x _k+1 represents the chaotic signal obtained at the kth iteration,

x _k+1 = μ×x _k ×(1-x _k ) (6)

同时从序列X中第m个元素开始依次间隔n₂个元素取1个元素以形成长度为8L+8p+8的混沌信号序列Z＝{Z₁,Z₂,...,Z_8L+8p+7,Z_8L+8p+8}，The chaotic signal sequence X={x ₁ , x ₂ ,...} is obtained, and starting from the mth element in the sequence X, one element is taken at intervals of n ₁ elements to form a chaotic signal sequence with a length of 8L+8p+8

At the same time, starting from the mth element in the sequence X, 1 element is taken at intervals of n ₂ elements to form a chaotic signal sequence with a length of 8L+8p+8 Z={Z ₁ , Z ₂ ,...,Z _{8L+8p +7} ,Z _8L+8p+8 },

同时将混沌信号序列Z按降序排序，根据混沌信号序列Z排序前、后的位置变化置乱规则，对低位组合二进制序列B2进行置乱，得到置乱后低位二进制序列

Then, sort the chaotic signal sequence Y in descending order, and scramble the high-order combined binary sequence B1 according to the scrambling rules of the position change before and after the chaotic signal sequence Y is sorted to obtain the scrambled high-order binary sequence

At the same time, sort the chaotic signal sequence Z in descending order, and scrambling the low-order combined binary sequence B2 according to the scrambling rules of the position change before and after the chaotic signal sequence Z is sorted to obtain the scrambled low-order binary sequence

的末尾添加LB个二进制位‘0’，将置乱后低位二进制序列

的末尾添加LB个二进制位‘1’，得到二进制序列

和二进制序列

其中

Next, let LB=mod(6-mod(8L+8p+8,6),6), the scrambled high-order binary sequence

Add LB binary bits '0' at the end, which will scramble the low-order binary sequence

Add LB binary bits '1' at the end to get the binary sequence

and binary sequence

in

和

分别进行分组，将二进制序列

中元素从头到尾依次正向以6个元素为单位进行分组，得到分组后的二进制序列，表示为

同时将二进制序列

中元素从头到尾依次正向以6个元素为单位进行分组，得到分组后的二进制序列，表示为

其中每一个二进制分组序列均包含6个二进制位，且

pair binary sequence

and

grouped separately, the binary sequence

The elements in the middle are grouped forward in units of 6 elements from the beginning to the end, and the binary sequence after the grouping is obtained, which is expressed as

Simultaneously convert the binary sequence

The elements in the middle are grouped forward in units of 6 elements from the beginning to the end, and the binary sequence after the grouping is obtained, which is expressed as

where each binary block sequence contains 6 binary bits, and

Finally, each binary grouping sequence BF1{i}, BF2{i} is subjected to the following diffusion operations in turn:

S0: let i=1, and

k1_switch=mod(3×<B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 >+2×(8L+8p+8-<B1 ₁ ,B1 ₂ ,.. .,B1 _8L+8p+7 ,B1 _8L+8p+8 >),8),

k2_switch=mod(3×<B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+8p+8 >-2×(8L+8p+8-<B2 ₁ ,B2 ₂ ,.. .,B2 _8L+8p+7 ,B2 _8L+8p+8 >),25),

S1: Calculate the binary grouping sequences BF1{i} and BF2{i} according to the following formulas (7) and (8),

CP1 _i =bin2dec(BF1{i})+176+k1_switch, (7)

CP2 _i =bin2dec(BF2{i})+161+k2_switch, (8)

则转入步骤S1，否则转入步骤S3，S2: The numerical data CP1 _i calculated by using the binary block sequence BF1{i}, and the numerical data CP2 _i calculated by the binary block sequence BF2{i}, calculate k1_switch=mod(CP1 _i +2×CP2 _i +3×k1_switch,8), k2_switch=mod(CP2 _i +2×CP1 _i +3×k2_switch,25), and let i=i+1, then judge the size of i, if

Then go to step S1, otherwise go to step S3,

S3: End the diffusion operation of the binary packet sequence, so as to obtain the diffused numerical sequences CP1 and CP2, that is, the encrypted information of the identity hidden code of a certain batch of garbage bags, expressed as

(3) Batch generation of garbage classification numbers for a certain batch of garbage bags

According to the difference in the batch identity code (code date of each garbage classification code, garbage category, garbage classification serial number information) of a single garbage bag in the batch of garbage bags, the steps of generating a single garbage classification number are performed respectively, and the batch of garbage bags can be realized. The garbage classification numbers are generated in batches, and the steps for generating the garbage classification numbers for a single garbage bag are described as follows:

First, extract the code date of the garbage classification code (M _k+L+p+n-1 M _k+L+p+n ), the garbage category (M _{k+L+p+n+ 1} M _k+L+p+n+2 ), garbage classification serial number information (M _k+L+p+n+3 M _k+L+p+n+4 ), use bin2dec() to make code date character by character The function is converted into numerical data, and the numerical sequence R={R ₁ , R ₂ } is obtained, and the garbage classification serial number information is converted into numerical data character by character using the bin2dec() function to obtain the numerical sequence F={F ₁ , F ₂ } ,

和参数

Then, according to the following formulas (9) and (10), the initial value of the Logistic chaotic map is calculated respectively

and parameters

则make

but

和外部密钥

对如下公式(11)所示Logistic混沌映射进行迭代，式中k表示迭代次数(k＝1,2,...)、

表示第k次迭代得到的混沌信号，Initial value mapped by chaos

and external key

Iterate the Logistic chaotic map shown in the following formula (11), where k represents the number of iterations (k=1, 2,...),

represents the chaotic signal obtained at the kth iteration,

从序列

中第m个元素开始依次间隔n₁个元素取1个元素以形成长度为

的混沌信号序列

同时从序列

中第m个元素开始依次间隔n₂个元素取1个元素以形成长度为

的混沌信号序列

get chaotic signal sequence

from the sequence

The mth element in the middle starts to take 1 element at an interval of n ₁ elements to form a length of

chaotic signal sequence of

Simultaneously from the sequence

The mth element in the middle starts to take 1 element at an interval of n ₂ elements to form a length of

chaotic signal sequence of

Next, according to the garbage category (M _k+L+p+n+1 M _k+L+p+n+2 ), the identity hidden code encryption information of a certain batch of garbage bags is performed, and the numerical sequences CP1 and CP2 take the following operations:

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时将混沌信号序列

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

If M _k+L+p+n+1 M _k+L+p+n+2 ="01", then the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时将混沌信号序列

按降序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

If M _k+L+p+n+1 M _k+L+p+n+2 = "02", then the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

重组，得重组后的混沌信号序列

再将混沌信号序列

按降序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时将混沌信号序列

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

If M _k+L+p+n+1 M _k+L+p+n+2 = "03", then the chaotic signal sequence

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

则先将混沌信号序列

重组，得重组后的混沌信号序列

再将混沌信号序列

按降序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时先将混沌信号序列

重组，得重组后的混沌信号序列

再将混沌信号序列

按降序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

if

Then the chaotic signal sequence is first

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence is first

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

运算表示得到一个不大于

的整数，in,

operation means to obtain a value not greater than

the integer,

逐个元素组合并转换为汉字字符，得到汉字序列

即为垃圾分类号，其中汉字序列C的长度为

Finally, the numerical sequence

Element-by-element combination and conversion to Chinese characters to get the Chinese character sequence

is the garbage classification number, where the length of the Chinese character sequence C is

According to the generation process of a single garbage classification number in the batch of garbage bags, the generation of each garbage classification number of the batch of garbage bags is performed in sequence;

(4) Combination of garbage classification codes for a certain batch of garbage bags and generation of garbage classification QR codes

垃圾类别(M_k+L+p+n+1M_k+L+p+n+2)、垃圾分类序号信息(M_k+L+p+n+3M_k+L+p+n+4)进行组合，生成该批垃圾袋中单个垃圾分类码，接着生成QR Code，即垃圾分类二维码，按此规则可批量组合生成该批垃圾袋的垃圾分类二维码。Put the garbage bag identification code (M ₁ M ₂ ... M _k M _k+L+p+1 M _k+L+p+2 ... M _k+L+p+n-2 ), the date of making the code (M _{k+L+p+n- 1} M _k+L+p+n ), garbage classification number

Garbage category (M _k+L+p+n+1 M _k+L+p+n+2 ), garbage classification serial number information (M _k+L+p+n+3 M _k+L+p+n+4 ) to generate a single garbage classification code in the batch of garbage bags, and then generate a QR Code, that is, a garbage classification two-dimensional code. According to this rule, the garbage classification two-dimensional code of the batch of garbage bags can be generated by batch combination.

Further, converting the identity code into numerical data character by character as described in step (1) in a method for batch generation of two-dimensional codes for garbage classification means that the identity code is character-by-character using the unicode2native() function to convert the ASCII code. The visible characters whose value belongs to [32,126] are converted into a single numeric data, or the Chinese characters encoded by the double-byte encoding in the GB2312 character set are converted into two numeric data, so as to obtain the corresponding numeric sequence

Further, converting the identity hidden code into numerical data [P _i1 , P _i2 ] character by character as described in step (1) in a method for batch generation of two-dimensional codes for garbage classification means that the identity hidden code is used character by character. The unicode2native() function converts the visible characters whose ASCII code value belongs to [32,126] into a single numeric data and reorganizes them, expressed as [P _i1 ,P _i2 ]=[0,unicode2native(M _i )], or the GB2312 character set The double-byte encoded Chinese characters are converted into two numerical data, which are expressed as [P _i1 ,P _i2 ]=unicode2native(M _i ), so as to obtain the high-order numerical sequence P1={P1 ₁ ,P1 ₂ ,...,P1 _L+p ,P1 _L+p+1 }={P ₁₁ ,P ₂₁ ,…,P _(L+p)1 ,P _(L+p+1)1 } and the low-order numerical sequence P2={P2 ₁ ,P2 ₂ ,… , P2 _L+p , P2 _L+p+1 }={P ₁₂ , P ₂₂ ,...,P _(L+p)2 ,P _(L+p+1)2 }.

Further, the step (1) in a method for batch generation of two-dimensional codes for garbage classification converts the elements S _i in the numerical sequence S into 8-bit binary sequences {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 }, which means that the binary sequence {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS is obtained by using the dec2bin(S _i , 8) function _i8 }.

Further, as described in step (1) in a method for batch generation of two-dimensional codes for garbage classification, the elements P1 _i in the numerical sequence P1 are converted one by one into a binary sequence of 8 bits {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 }, which means that the binary sequence {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 is obtained by using the dec2bin(P1 _i , 8) function _i8 }.

Further, as described in step (1) in a method for batch generation of two-dimensional codes for garbage classification, the elements P2 _i in the numerical sequence P2 are converted one by one into a binary sequence of 8 bits {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 , BP2 _i8 }, which means that the binary sequence {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 , BP2 is obtained by using the dec2bin(P2 _i , 8) function _i8 }.

逐个元素组合并转换为汉字字符，是指先逐个元素组合[CP1_i,CP2_i]，然后再转换为汉字字符，即C_i＝native2unicode([CP1_i,CP2_i])。Further, the numerical sequence described in step (3) in a method for batch generation of two-dimensional codes for garbage classification

Combining elements one by one and converting them into Chinese characters refers to combining [CP1 _i , CP2 _i ] element by element and then converting them into Chinese characters, that is, C _i =native2unicode([CP1 _i ,CP2 _i ]).

垃圾类别(M_k+L+p+n+1M_k+L+p+n+2)、垃圾分类序号信息(M_k+L+p+n+3M_k+L+p+n+4)进行组合，生成该批垃圾袋中单个垃圾分类码，是指采用将垃圾袋身份标识码、制码日期、垃圾分类号、垃圾类别和垃圾分类序号信息插入连接的组合方式，生成该批垃圾袋中单个垃圾分类码，表示为

其中M₁M₂...M_k、

M_k+L+p+1M_k+L+p+2...M_k+L+p+n-2M_k+L+p+n-1M_k+L+p+n、M_k+L+p+n+1M_k+L+p+n+2与M_k+L+p+n+3M_k+L+p+n+4之间相互用英文空格间隔。Further, in step (4) in a method for batch generation of two-dimensional codes for garbage classification, the garbage bag identification codes (M ₁ M ₂ ... M _k M _k+L+p+1 M _{k+L +p+2} ...M _k+L+p+n-2 ), code date (M _k+L+p+n-1 M _k+L+p+n ), garbage classification number

Garbage category (M _k+L+p+n+1 M _k+L+p+n+2 ), garbage classification serial number information (M _k+L+p+n+3 M _k+L+p+n+4 ) to generate a single garbage classification code in the batch of garbage bags, which refers to the combination method of inserting the garbage bag identification code, code production date, garbage classification number, garbage category and garbage classification serial number information into the connection to generate the batch of garbage. A single garbage classification code in the bag, expressed as

where M ₁ M ₂ ... M _k ,

M _k+L+p+1 M _k+L+p+2 ...M _k+L+p+n-2 M _k+L+p+n-1 M _k+L+p+n , M _{k +L+p+n+1} M _k+L+p+n+2 and M _k+L+p+n+3 M _k+L+p+n+4 are separated by English spaces.

Beneficial effect: the present invention relies on the identity identification code and hidden code extracted from the garbage bag identity code and uses chaotic mapping to generate a chaotic signal sequence, and scrambling and grouping the high and low binary sequences formed by the conversion and combination of the identity hidden code respectively. and diffusion, complete the unified encryption of the identity hidden codes of a certain batch of garbage bags, rely on the batch identity codes of a single garbage bag and use chaotic mapping to generate chaotic signal sequences, and perform different rules on the unified encryption results of the identity hidden codes according to the garbage category. Scrambling, thereby generating garbage classification two-dimensional codes in batches, so as to ensure that the proposed method for batch generation of garbage classification two-dimensional codes is simple and feasible, has strong security, and is not easy to crack. The garbage classification codes generated in batches have "uniqueness" , safety and guidance on waste sorting”.

Description of drawings

Fig. 1 is a schematic diagram of the batch generation process of a garbage classification two-dimensional code according to the present invention;

Fig. 2 is a schematic diagram of a two-dimensional code for garbage classification according to the present invention, with a "recyclable" green background mark in the middle.

Detailed ways

As shown in Figure 1, a method for batch generation of two-dimensional codes for garbage classification includes the following steps:

(1) Encoding and transcoding

First, encode the identity information of a batch of garbage bags, including the unified identity code of a batch of garbage bags and the batch identity code of a single garbage bag, so as to generate a garbage bag with Chinese and English characters that is unique to a single garbage bag. Identity code, expressed as M ₁ M ₂ ... M _k M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p M _k+L+p+1 M _k+L+p+2 ...M _k+L+p+n M _k+L+p+n+1 M _{k+L+p+n+ 2} M _{k+L +p+n+3} M _k+L+p+n+4 , where M ₁ M ₂ ... M _k are provinces and municipalities, and M _k+1 M _k+2 ... M _k+L are specific residences Address, M _k+L+1 M _{k+L+ 2} ... M _k+L+p is the contact person and contact number, M _k+L+p+1 M _k+L+p+2 ... M _{k +L+p+n} is the code time (the format is year-month-day, where the last two digits M _k+L+p+n-1 M _k+L+p+n is the date), M _{k+L+ p+n+1} M _k+L+p+n+2 is the garbage classification color information (representing the garbage category), M _k+L+p+n+3 M _k+L+p+n+4 is the garbage classification serial number Information (representing the serial number of a certain type of garbage bags on a certain day), separated by English spaces, and the unified identity code of a corresponding batch of garbage bags is M ₁ M ₂ ... M _k M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ...M _k+L+p M _{k+L+p+ 1} M _k+L+p+2 ...M _{k+L+p+ n-3} M _k+L+p+n-2 , the batch ID code of a single garbage bag is M _k+L+p+n-1 M _k+L+p+n M _{k+L+p+n+ 1} M _{k+L+p+n+ 2} M _k+L+p+n+3 M _k+L+p+n+4 ,

同时将身份隐藏码逐个字符采用unicode2native()函数将ASCII码值属于[32,126]的可见字符转换为单个数值型数据并进行重组，表示为[P_i1,P_i2]＝[0,unicode2native(M_i)]，或将GB2312字符集中双字节编码的汉字转换为两个数值型数据，表示为[P_i1,P_i2]＝unicode2native(M_i)，从而得到高位数值序列P1＝{P1₁,P1₂,…,P1_L+p,P1_L+p+1}＝{P₁₁,P₂₁,…,P_(L+p)1,P_(L+p+1)1}和低位数值序列P2＝{P2₁,P2₂,…,P2_L+p,P2_L+p+1}＝{P₁₂,P₂₂,…,P_(L+p)2,P_(L+p+1)2}，Then, the identification code (M ₁ M ₂ ... M _k M _{k+L+p+ 1} M _k+L+p+2 ... M _{k+L+ p+n-2} ) and identity concealment codes (M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p ), and Use the unicode2native() function to convert the visible characters whose ASCII code value belongs to [32,126] into single numeric data, or convert the double-byte encoded Chinese characters in the GB2312 character set into two numeric data, thereby obtaining Corresponding numeric sequence

At the same time, the unicode2native() function is used to convert the visible characters whose ASCII code value belongs to [32, 126] into a single numerical data and recombine them by using the unicode2native() function, which is expressed as [P _i1 ,P _i2 ]=[0,unicode2native(M _i )], or convert the double-byte encoded Chinese characters in the GB2312 character set into two numerical data, expressed as [P _i1 ,P _i2 ]=unicode2native(M _i ), so as to obtain the high-order numerical sequence P1={P1 ₁ ,P1 ₂ ,...,P1 _L+p ,P1 _L+p+1 }={P ₁₁ ,P ₂₁ ,...,P _(L+p)1 ,P _(L+p+1)1 } and the low-order numerical sequence P2= {P2 ₁ ,P2 ₂ ,…,P2 _L+p ,P2 _L+p+1 }={P ₁₂ ,P ₂₂ ,…,P _(L+p)2 ,P _(L+p+1)2 },

Finally, the elements Si in the numerical sequence S are sequentially converted into binary sequences of _{8 bits {BS i1 ,} BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS by using the _dec2bin (Si , 8) function one by one _i8 }. Convert the elements P1 _i in the numerical sequence P1 into a binary sequence of 8 bits using the dec2bin(P1 _i , 8) function one by one {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 }. Convert the elements P2 _i in the numerical sequence P2 one by one using the dec2bin(P2 _i , 8) function into a binary sequence of 8 bits {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 , BP2 _i8 },

个二进制序列{BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8}进行组合，其中

从而得到组合二进制矩阵B，and will

Binary sequences {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 } are combined, where

Thus, the combined binary matrix B is obtained,

Simultaneously combine L+p+1 binary sequences {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 }, where i=1,2,...,L +p,L+p+1, so as to obtain the high-order combined binary sequence B1={B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 }={BP1 _{1 1} ,BP1 _{1 2} ,BP1 ₁₃ ,BP1 ₁₄ ,BP1 ₁₅ ,BP1 ₁₆ ,BP1 ₁₇ ,BP1 ₁₈ ,BP1 ₂₁ ,BP1 ₂₂ ,...,BP1 ₂₇ ,BP1 ₂₈ ,...,BP1 _i1 ,BP1 _i2 ,..., BP1 _i7 ,BP1 _i8 ,...,BP1 _L+p+11 ,BP1 _L+p+12 ,BP1 _L+p+13 ,BP1 _L+p+14 ,BP1 _L+p+15 ,BP1 _{L+p+ 1 6} , BP1 _{L+p+1 7} , BP1 _L+p+18 }, and convert L+p+1 binary sequences {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 ,BP2 _i8 }, where i=1,2,...,L+p,L+p+1, so as to obtain the low-order combined binary sequence B2={B2 ₁ ,B2 ₂ ,...,B2 _{8L+ 8p+7} ,B2 _8L+8p+8 }={BP2 ₁₁ ,BP2 ₁₂ ,BP2 ₁₃ ,BP2 ₁₄ ,BP2 ₁₅ ,BP2 ₁₆ ,BP2 ₁₇ ,BP2 ₁₈ ,BP2 ₂₁ ,BP2 ₂₂ ,...,BP2 ₂₇ , BP2 ₂₈ ,...,BP2 _i1 ,BP2 _i2 ,...,BP2 _i7 ,BP2 _i8 ,...,BP2 _L+p+11 ,BP2 _L+p+12 ,BP2 _L+p+13 ,BP2 _{L +p+14} , BP2 _L+p+15 , BP2 _L+p+16 , BP2 _L+p+17 , BP2 _L+p+18 },

数值序列P1、P2的长度为L+p+1，组合二进制矩阵B的大小为

组合二进制序列B1、B2的长度为8L+8p+8；Among them, the garbage bag identification code includes the double-byte encoded Chinese characters in the GB2312 character set and the visible characters with ASCLL code value ∈ [32,126]. The length of the garbage bag identification code is k+L+p+n+6, and the length of the numerical sequence S is

The length of the numerical sequences P1 and P2 is L+p+1, and the size of the combined binary matrix B is

The length of the combined binary sequence B1 and B2 is 8L+8p+8;

(2) The identity hidden codes of a certain batch of garbage bags are uniformly encrypted

The identity hidden code of a certain batch of garbage bags is uniformly encrypted, which means that the identity code (M ₁ M ₂ ... M _k M _{k+L+p+ 1} M _k+L+p+2 ... M _{k+L+p+n -2} ) Encrypt the identity hidden code (M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p ), a batch of The garbage bag needs and only needs to undergo a unified encryption operation of the identity hidden code.

First, using the numerical sequence S and the binary matrix B converted into it, the binary sequences B1 and B2 converted from the numerical sequences P1 and P2, and the external keys α and β, respectively, according to the following formulas, the initial calculation of the Logistic chaotic mapping is obtained. the value x ₁ and the parameter μ, the decimation start position m, and the decimation interval numbers n ₁ , n ₂ ,

make

则

but

x ₁ =α+mod(α+kp,1-α),

μ=β+mod(β+1.5×kp,4-β),

Among them, <B _1,i ,B _2,i ,B _3,i ,B _4,i ,B _5,i ,B _6,i ,B _7,i ,B _8,i >represents the i-th column of binary matrix B Or the number of binary bits '1' in the binary sequence {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 }, <B1 ₁ , B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 represents the number of binary bits '1' in the binary sequence {B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 }, <B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+8p+8 >represents the binary sequence {B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+8p The number of binary bits '1' in ₊₈ }, the external key satisfies α∈(0,1), β∈(3.57,4),

From the initial value x ₁ of the chaotic map and the external key μ, iterate the Logistic chaotic map shown in the following formula, where k represents the number of iterations (k=1, 2,...), and x _k+1 represents the kth The chaotic signal obtained by the second iteration,

x _k+1 = μ×x _k ×(1-x _k )

同时从序列X中第m个元素开始依次间隔n₂个元素取1个元素以形成长度为8L+8p+8的混沌信号序列Z＝{Z₁,Z₂,...,Z_8L+8p+7,Z_8L+8p+8}，The chaotic signal sequence X={x ₁ , x ₂ ,...} is obtained, and starting from the mth element in the sequence X, one element is taken at intervals of n ₁ elements to form a chaotic signal sequence with a length of 8L+8p+8

At the same time, starting from the mth element in the sequence X, 1 element is taken at intervals of n ₂ elements to form a chaotic signal sequence with a length of 8L+8p+8 Z={Z ₁ , Z ₂ ,...,Z _{8L+8p +7} ,Z _8L+8p+8 },

同时将混沌信号序列Z按降序排序，根据混沌信号序列Z排序前、后的位置变化置乱规则，对低位组合二进制序列B2进行置乱，得到置乱后低位二进制序列

Then, sort the chaotic signal sequence Y in descending order, and scramble the high-order combined binary sequence B1 according to the scrambling rules of the position change before and after the chaotic signal sequence Y is sorted to obtain the scrambled high-order binary sequence

At the same time, sort the chaotic signal sequence Z in descending order, and scrambling the low-order combined binary sequence B2 according to the scrambling rules of the position change before and after the chaotic signal sequence Z is sorted to obtain the scrambled low-order binary sequence

的末尾添加LB个二进制位‘0’，将置乱后低位二进制序列

的末尾添加LB个二进制位‘1’，得到二进制序列

和二进制序列

其中

Next, let LB=mod(6-mod(8L+8p+8,6),6), the scrambled high-order binary sequence

Add LB binary bits '0' at the end, which will scramble the low-order binary sequence

Add LB binary bits '1' at the end to get the binary sequence

and binary sequence

in

和

分别进行分组，将二进制序列

中元素从头到尾依次正向以6个元素为单位进行分组，得到分组后的二进制序列，表示为

同时将二进制序列

中元素从头到尾依次正向以6个元素为单位进行分组，得到分组后的二进制序列，表示为

其中每一个二进制分组序列均包含6个二进制位，且

pair binary sequence

and

grouped separately, the binary sequence

The elements in the middle are grouped forward in units of 6 elements from the beginning to the end, and the binary sequence after the grouping is obtained, which is expressed as

Simultaneously convert the binary sequence

The elements in the middle are grouped forward in units of 6 elements from the beginning to the end, and the binary sequence after the grouping is obtained, which is expressed as

where each binary block sequence contains 6 binary bits, and

Finally, each binary grouping sequence BF1{i}, BF2{i} is subjected to the following diffusion operations in turn:

S0: let i=1, and

k1_switch=mod(3×<B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 >+2×(8L+8p+8-<B1 ₁ ,B1 ₂ ,.. .,B1 _8L+8p+7 ,B1 _8L+8p+8 >),8),

k2_switch=mod(3×<B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+8p+8 >-2×(8L+8p+8-<B2 ₁ ,B2 ₂ ,.. .,B2 _8L+8p+7 ,B2 _8L+8p+8 >),25),

S1: Calculate the binary grouping sequence BF1{i}, BF2{i} according to the following formula,

CP1 _i =bin2dec(BF1{i})+176+k1_switch,

CP2 _i =bin2dec(BF2{i})+161+k2_switch,

则转入步骤S1，否则转入步骤S3，S2: The numerical data CP1 _i calculated by using the binary block sequence BF1{i}, and the numerical data CP2 _i calculated by the binary block sequence BF2{i}, calculate k1_switch=mod(CP1 _i +2×CP2 _i +3×k1_switch,8), k2_switch=mod(CP2 _i +2×CP1 _i +3×k2_switch,25), and let i=i+1, then judge the size of i, if

Then go to step S1, otherwise go to step S3,

S3: End the diffusion operation of the binary packet sequence, so as to obtain the diffused numerical sequences CP1 and CP2, that is, the encrypted information of the identity hidden code of a certain batch of garbage bags, expressed as

(3) Batch generation of garbage classification numbers for a certain batch of garbage bags

According to the difference in the batch identity code (code date of each garbage classification code, garbage category, garbage classification serial number information) of a single garbage bag in the batch of garbage bags, the steps of generating a single garbage classification number are performed respectively, and the batch of garbage bags can be realized. The garbage classification numbers are generated in batches, and the steps for generating the garbage classification numbers for a single garbage bag are described as follows:

First, extract the code date of the garbage classification code (M _k+L+p+n-1 M _k+L+p+n ), the garbage category (M _{k+L+p+n+ 1} M _k+L+p+n+2 ), garbage classification serial number information (M _k+L+p+n+3 M _k+L+p+n+4 ), use bin2dec() to make code date character by character The function is converted into numerical data, and the numerical sequence R={R ₁ , R ₂ } is obtained, and the garbage classification serial number information is converted into numerical data character by character using the bin2dec() function to obtain the numerical sequence F={F ₁ , F ₂ } ,

和参数

Then, according to the following formulas, the initial values of the Logistic chaotic map are calculated respectively.

and parameters

则make

but

和外部密钥

对如下公式所示Logistic混沌映射进行迭代，式中k表示迭代次数(k＝1,2,...)、

表示第k次迭代得到的混沌信号，Initial value mapped by chaos

and external key

Iterate the Logistic chaotic map shown in the following formula, where k represents the number of iterations (k=1, 2,...),

represents the chaotic signal obtained at the kth iteration,

从序列

中第m个元素开始依次间隔n₁个元素取1个元素以形成长度为

的混沌信号序列

同时从序列

中第m个元素开始依次间隔n₂个元素取1个元素以形成长度为

的混沌信号序列

get chaotic signal sequence

from the sequence

The mth element in the middle starts to take 1 element at an interval of n ₁ elements to form a length of

chaotic signal sequence of

Simultaneously from the sequence

The mth element in the middle starts to take 1 element at an interval of n ₂ elements to form a length of

chaotic signal sequence of

Next, according to the garbage category (M _k+L+p+n+1 M _k+L+p+n+2 ), the identity hidden code encryption information of a certain batch of garbage bags is performed, and the numerical sequences CP1 and CP2 take the following operations:

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时将混沌信号序列

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

If M _k+L+p+n+1 M _k+L+p+n+2 ="01", then the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时将混沌信号序列

按降序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

If M _k+L+p+n+1 M _k+L+p+n+2 = "02", then the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

重组，得重组后的混沌信号序列

再将混沌信号序列

按降序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时将混沌信号序列

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

If M _k+L+p+n+1 M _k+L+p+n+2 = "03", then the chaotic signal sequence

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

重组，得重组后的混沌信号序列

再将混沌信号序列

按降序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时先将混沌信号序列

重组，得重组后的混沌信号序列

再将混沌信号序列

按降序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

If M _k+L+p+n+1 M _k+L+p+n+2 = "04", then the chaotic signal sequence

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence is first

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

运算表示得到一个不大于

的整数，in,

operation means to obtain a value not greater than

the integer,

先逐个元素组合[CP1_i,CP2_i]，然后再转换为汉字字符，即C_i＝native2unicode([CP1_i,CP2_i])，得到汉字序列

即为垃圾分类号，其中汉字序列C的长度为

Finally, the numerical sequence

First combine [CP1 _i , CP2 _i ] element by element, and then convert them into Chinese characters, that is, C _i =native2unicode([CP1 _i ,CP2 _i ]), get the Chinese character sequence

is the garbage classification number, where the length of the Chinese character sequence C is

According to the generation process of a single garbage classification number in the batch of garbage bags, the generation of each garbage classification number of the batch of garbage bags is performed in sequence;

(4) Combination of garbage classification codes for a certain batch of garbage bags and generation of garbage classification QR codes

垃圾类别(M_k+L+p+n+1M_k+L+p+n+2)、垃圾分类序号信息(M_k+L+p+n+3M_k+L+p+n+4)采用插入连接的组合方式，生成该批垃圾袋中单个垃圾分类码，表示为

其中M₁M₂...M_k、

M_k+L+p+1M_k+L+p+2...M_k+L+p+n-2M_k+L+p+n-1M_k+L+p+n、M_k+L+p+n+1M_k+L+p+n+2与M_k+L+p+n+3M_k+L+p+n+4之间相互用英文空格间隔，生成该批垃圾袋中单个垃圾分类码，接着生成QR Code，即垃圾分类二维码，按此规则可批量组合生成该批垃圾袋的垃圾分类二维码。Put the garbage bag identification code (M ₁ M ₂ ... M _k M _k+L+p+1 M _k+L+p+2 ... M _k+L+p+n-2 ), the date of making the code (M _{k+L+p+n- 1} M _k+L+p+n ), garbage classification number

Garbage category (M _k+L+p+n+1 M _k+L+p+n+2 ), garbage classification serial number information (M _k+L+p+n+3 M _k+L+p+n+4 ) adopts the combination of inserting and connecting to generate a single garbage classification code in the batch of garbage bags, which is expressed as

where M ₁ M ₂ ... M _k ,

M _k+L+p+1 M _k+L+p+2 ...M _k+L+p+n-2 M _k+L+p+n-1 M _k+L+p+n , M _{k +L+p+n+1} M _k+L+p+n+2 and M _k+L+p+n+3 M _k+L+p+n+4 are separated by English spaces to generate the batch A single garbage classification code in the garbage bag, and then generate a QR Code, that is, a garbage classification two-dimensional code. According to this rule, the garbage classification two-dimensional code of the batch of garbage bags can be generated in batches.

Below in conjunction with specific embodiment, the present invention will be further described:

Example 1

According to the above-mentioned method for batch generation of QR codes for garbage classification, the steps are as follows:

(1) Encoding and transcoding

Encode the identity information of a batch of garbage bags, including the unified identity code of a batch of garbage bags and the batch identity code of a single garbage bag, and generate the unique Chinese and English character garbage bag identity code of a single garbage bag of a batch of garbage bags: "Jiangsu Province-Nantong City-Haimen District Zhongnan Century City-12#1201 Li Xiaoqiang 15005709999 2020-08-02 01 03", the length is k+L+p+n+9=11+13+14+10+9=57 , among which "Jiangsu Province-Nantong City-Chongchuan District" is the provincial and urban area, "Central South Century City-12#1201" is the specific residential address (such as the community-house number), "Li Xiaoqiang 15005709999" is the contact person and telephone number, " 2020-08-02" is the code production time, "01" is the color information of garbage classification (such as green recyclable garbage), and "03" is the information of the garbage classification serial number. Correspondingly, the unified identity code of a batch of garbage bags is " Jiangsu Province - Nantong City - Zhongnan Century City, Haimen District - 12#1201 Li Xiaoqiang 15005709999 2020-08-", the batch ID code for a single garbage bag is "02 01 03",

数值序列P1、P2的长度为L+p+1＝13+14+1＝28，Then, extract the identity code (Jiangsu Province-Nantong City-Haimen District 2020-08-) and the identity hidden code (Central South Century City-12#1201 Li Xiaoqiang 15005709999) from the unified identity code of a certain batch of garbage bags, and set the The identification code is converted into numerical data character by character using the unicode2native() function to obtain the corresponding numerical sequence S={189,173,203,213,202,161,45,196,207,205,168,202,208,45,186,163,195,197,199,248,32,50,48,50,5,8,45,48} Convert the identity hidden code character by character into numerical data to obtain the corresponding high-order numerical sequence P1={214,196,202,188,179,0,0,0,0,0,0,0,0,0,192,207,199,0,0,0,0,0 ,0,0,0,0,0,0} and low-order numerical sequence P2={208,207,192,205,199,45,49,50,35,49,50,48,49,32,238,254,191,49,53,48,48,53, 55,48,57,57,57,57}, where the length of the numerical sequence S is

The length of the numerical sequences P1 and P2 is L+p+1=13+14+1=28,

Finally, convert the elements S _i in the numerical sequence S into a binary sequence of 8 bits one by one, convert the elements P1 _i in the numerical sequence P1 into a binary sequence of 8 bits one by one, and convert the elements P2 _i in the numerical sequence P2 into a binary sequence of 8 bits one by one ,

and combine 29 binary sequences {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 } to obtain a combined binary matrix B,

At the same time, 28 binary sequences {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 } are combined to obtain the high-order combined binary sequence B1={B1 ₁ ,B1 ₂ ,. ..,B1 ₂₂₃ ,B1 ₂₂₄ }={1,1,0,1,0,1,1,0,1,1,0,0,0,1,0,0,1,1,0,0 ,1,0,1,0,1,0,1,1,1,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0 ,1,1,0,0,1,1,1,1,1,1,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ,0,0,0,0},

Combine 28 binary sequences {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 , BP2 _i8 } to obtain the low-order combined binary sequence B2={B2 ₁ , B2 ₂ , .. .,B2 ₂₂₃ ,B2 ₂₂₄ }={1,1,0,1,0,0,0,0,1,1,0,0,1,1,1,1,1,1,0,0, 0,0,0,0,1,1,0,0,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,0,1, 1,0,1,0,0,1,1,0,0,0,1,0,0,1,1,0,0,1,0,0,0,1,0,0,0, 1,1,0,0,1,1,0,0,0,1,0,0,1,1,0,0,1,0,0,0,1,1,0,0,0, 0,0,0,1,1,0,0,0,1,0,0,1,0,0,0,0,0,1,1,1,0,1,1,1,0, 1,1,1,1,1,1,1,0,1,0,1,1,1,1,1,1,0,0,1,1,0,0,0,1,0, 0,1,1,0,1,0,1,0,0,1,1,0,0,0,0,0,01,1,0,0,0,0,0,0,1, 1,0,1,0,1,0,0,1,1,0,1,1,1,0,0,1,1,0,0,0,0,0,0,1,1, 1,0,0,1,0,0,1,1,1,0,0,1,0,0,1,1,1,0,0,1,0,0,1,1,1, 0,0,1};

(2) The identity hidden codes of a certain batch of garbage bags are uniformly encrypted

The identity hidden codes of a certain batch of garbage bags are uniformly encrypted, which means that the identity hidden codes (Central South Century City-12#1201 Li Xiaoqiang 15005709999) are encrypted with the identity code (Jiangsu Province-Nantong City-Haimen District 2020-08-), and a batch of The garbage bag needs and only needs to undergo a unified encryption operation of the identity hidden code.

First, using the numerical sequence S and the binary matrix B converted into it, the binary sequences B1 and B2 converted from the numerical sequences P1 and P2, and the external keys α=0.12345 and β=3.75, Logistic is calculated according to the following formulas respectively. The initial value x ₁ of the chaotic map, the parameter μ, the extraction start position m, and the number of extraction intervals n ₁ , n ₂ ,

则make

but

x ₁ =0.12345+mod(0.12345+0.527325318380424,1-0.12345)=0.774225318380424,

μ=3.75+mod(3.75+1.5×0.527325318380424,4-3.75)=3.790987977570636,

m=987+mod(13295951060,67)=1037,

n ₁ =1+mod(13295951060,57)=18,

n ₂ =1+mod(13295951060,47)=36,

From the initial value x ₁ of the chaotic map and the external key μ, iterate the Logistic chaotic map shown in the following formula, where k represents the number of iterations (k=1, 2,...), and x _k+1 represents the kth The chaotic signal obtained by the second iteration,

x _k+1 = μ×x _k ×(1-x _k )

The chaotic signal sequence X={x ₁ , x ₂ ,...} is obtained, starting from the 1037th element in the sequence X and taking 1 element at an interval of 18 elements to form a chaotic signal sequence of length 224 Y={Y ₁ ,Y ₂ ,...,Y ₂₂₃ ,Y ₂₂₄ }, and at the same time, starting from the 1037th element in the sequence X, one element is taken at an interval of 36 elements to form a chaotic signal sequence of length 224 Z={Z ₁ ,Z ₂ ,...,Z ₂₂₃ ,Z ₂₂₄ },

0,0,1,1,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,1,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0，1，1，0，0，0，0，1，0，0，0，0，1，0，0，0，0}，同时将混沌信号序列Z按降序排序，根据混沌信号序列Z排序前、后的位置变化置乱规则，对低位组合二进制序列B2进行置乱，得到置乱后低位二进制序列

Then, sort the chaotic signal sequence Y in descending order, and scramble the high-order combined binary sequence B1 according to the scrambling rules of the position change before and after the chaotic signal sequence Y is sorted to obtain the scrambled high-order binary sequence

0,0,1,1,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,1,0,0,0, 0,0,0,0,1,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0, 1,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,1,0, 0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,1, 1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0} , at the same time sort the chaotic signal sequence Z in descending order, according to the scrambling rules of the position change before and after the sorting of the chaotic signal sequence Z, scramble the low-order combined binary sequence B2, and obtain the scrambled low-order binary sequence

的末尾添加4个二进制位‘0’，将置乱后低位二进制序列

的末尾添加4个二进制位‘1’，得到二进制序列

和二进制序列

其中二进制序列

的长度为

Next, let LB=mod(6-mod(224,6),6)=4, and scramble the high-order binary sequence

Add 4 binary bits '0' at the end, which will scramble the low-order binary sequence

Add 4 binary bits '1' at the end to get the binary sequence

and binary sequence

where binary sequence

length is

中元素从头到尾依次正向以6个元素为单位进行分组，得到分组后的二进制序列，BF1{1}＝{1,1,0,0,0,0}，BF1{2}＝{0,0,0,0,0,0}，…，BF1{19}＝{0,1,0,0,0,0}，…，BF1{37}＝{0,0,0,1,0,0}，BF1{38}＝{0,0,0,0,0,0}，同时将二进制序列

中元素从头到尾依次正向以6个元素为单位进行分组，得到分组后的二进制序列，BF2{1}＝{0,0,1,0,1,1}，BF2{2}＝{1,0,1,0,0,0}，…，BF2{19}＝{1,1,0,0,0,1}，…，BF2{37}＝{1,0,0,0,1,1}，BF2{38}＝{1,1,1,1,1,1}，binary sequence

The elements in the middle are grouped in units of 6 elements from the beginning to the end, and the binary sequence after the grouping is obtained, BF1{1}={1,1,0,0,0,0}, BF1{2}={0 ,0,0,0,0,0},…,BF1{19}={0,1,0,0,0,0},…,BF1{37}={0,0,0,1,0 ,0}, BF1{38}={0,0,0,0,0,0}, while converting the binary sequence

The elements in the middle are grouped in units of 6 elements from the beginning to the end, and the binary sequence after the grouping is obtained, BF2{1}={0,0,1,0,1,1}, BF2{2}={1 ,0,1,0,0,0},…,BF2{19}={1,1,0,0,0,1},…,BF2{37}={1,0,0,0,1 ,1}, BF2{38}={1,1,1,1,1,1},

最后，将每一个二进制分组序列BF1{i}、BF2{i}依次进行扩散操作，从而得到扩散后的数值序列，即某批垃圾袋的身份隐藏码的加密信息，CP1＝{227,176,182,184,188,206,180,182,178,182,176,234,178,213,178,177,182,178,194,197,190,181,176,186,217,179,178,178,178,190,184,178,178,182,181,185,184,180}和CP2 ＝{194,215,175,195,177,204,241,237,235,200,178,202,220,206,178,202,162,177,230,218,212,166,225,223,192,222,184,193,222,174,228,229,191,189,190,195,212,227}；

(3) Batch generation of garbage classification numbers for a certain batch of garbage bags

According to the difference in the batch identity code (code date of each garbage classification code, garbage category, garbage classification serial number information) of a single garbage bag in the batch of garbage bags, the steps of generating a single garbage classification number are performed respectively, and the batch of garbage bags can be realized. The garbage classification numbers are generated in batches, and the steps for generating the garbage classification numbers for a single garbage bag are described as follows:

First, extract the garbage classification code date "02", garbage category "01", and garbage classification serial number information "03" from the garbage bag identity code, and convert the code date into numerical data character by character using the bin2dec() function. , obtain the numerical sequence R={48,50}, convert the garbage classification serial number information into numerical data character by character using the bin2dec() function, and obtain the numerical sequence F={48,51},

则Then, let

but

和外部密钥

对Logistic混沌映射进行迭代，式中k表示迭代次数(k＝1,2,...)、

表示第k次迭代得到的混沌信号，Initial value mapped by chaos

and external key

Iterate the Logistic chaotic map, where k represents the number of iterations (k=1, 2,...),

represents the chaotic signal obtained at the kth iteration,

从序列

中第1037个元素开始依次间隔18个元素取1个元素以形成长度为38的混沌信号序列

同时从序列

中第1037个元素开始依次间隔36个元素取1个元素以形成长度为38的混沌信号序列

get chaotic signal sequence

from the sequence

The 1037th element in the middle starts to take 1 element at an interval of 18 elements to form a chaotic signal sequence with a length of 38

Simultaneously from the sequence

The 1037th element starts to take 1 element at intervals of 36 elements to form a chaotic signal sequence of length 38

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对数值序列CP1进行置乱，得到置乱后的数值序列

同时将混沌信号序列

按升序排序，根据混沌信号序列

排序前、后的位置变化置乱规则，对低位组合二进制序列CP2进行置乱，得到置乱后的数值序列

Then, according to the garbage category "01", the identity hidden code encryption information of a certain batch of garbage bags is performed, and the numerical sequences CP1 and CP2 take the following operations: the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

先逐个元素组合再转换为汉字字符，得到汉字序列，即垃圾分类号为“静佘脖翠裁步案淀玖袄脖彩辎孤闶府舵搞晨疮嫁拨尾哆涸呸卞岗短霸柴册等码睹蹲站参”，Finally, the numerical sequence

First combine the elements one by one and then convert them into Chinese characters to get the sequence of Chinese characters, that is, the garbage classification number is "Jingshe Neck Cui Cui Step Case Dian Jiu Ao Neck Cai Y Gu Yu Fu Rudder Engaged in Morning Sore Marry Tail Duo Bian Gang Short Ba Chai Book and other codes see squatting and standing.”,

According to the generation process of a single garbage classification number in the batch of garbage bags, the generation of each garbage classification number of the batch of garbage bags is performed in sequence;

(4) Combination of garbage classification codes for a certain batch of garbage bags and generation of garbage classification QR codes

The identification code of the garbage bag ("Jiangsu Province-Nantong City-Haimen District 2020-08-"), the date of making the code ("02"), the garbage classification number ("Jingshe Neck Cui Cui Step Case Dian Jiu Ao Neck Cai Ying") The rudder of Gujiafu is engaged in morning sore, marriage, tail, duo dry, Biangang, short bar, firewood, etc. "), garbage category ("01"), garbage classification serial number information ("03") using a combination of plug-in connections method, the single garbage classification code in the batch of garbage bags is generated as "Jiangsu Province-Nantong City-Haimen District Jingshe Neck Cuisin Step Case Dian Jiu Ao Neck Cai Yi Gu Gu Fu Rui Engage in Morning Sore Marry the Tail Duo Dry Bian Gang" Codes such as Dianba Chai Book and other codes see squatting station refer to 2020-08-02 01 03” to generate a single garbage classification code in the batch of garbage bags, and then generate a QR Code, that is, a two-dimensional code for garbage classification. QR code for garbage classification of batch garbage bags.

Example 2

According to the above-mentioned method for generating a batch of two-dimensional codes for garbage classification, the steps for generating a two-dimensional code for garbage classification of a batch of single garbage bags, as well as the external key, code production date, garbage category, and garbage classification serial number information are similar to those in the specific embodiment 1, For garbage bag identification code ("Jiangsu Province - Nantong City - Haimen District 2020-08-", or "Industry Jiangsu Province - Nantong City - Haimen District 2020-08-", or "Jiangsu Province - Nantong City - Haimen District" 2020-08-", or "Jiangsu Province-Nantong City-Haimen District 2020-09-"), only the identity hidden code in the identity information of the original garbage bag ("Central South Century City-12#1201 Li Xiaoqiang 15005709999") changed slightly : "Zhongnan Century City-12#1201 Li Xiaoqiang 15005709999"; or "Central South Century City-12#1211 Li Xiaoqiang 1500570999"; or "Central South Century City-12#1201 Li Xiaoqiang 15005709998", the QR code for garbage classification of a garbage bag The generated results are shown in Table 1. It can be seen from the table below that a slight change in the identity hidden code of a single batch of garbage bags will cause a great change in the QR code for garbage classification. It can be seen that the batch generation method of the QR code for garbage classification proposed in this patent is effective for garbage classification. The hidden part of the bag identity information (that is, the garbage bag identity hidden code) is sensitive.

Table 1 When the identity hidden code of a batch of single garbage bags changes slightly, the generation results of the QR code for garbage classification

Example 3

According to the above-mentioned method for generating a batch of two-dimensional codes for garbage classification, the steps for generating a two-dimensional code for garbage classification of a batch of single garbage bags, and the information of the identity hidden code of the garbage bags, the date of making the code, the garbage category, the garbage classification serial number, and the specific embodiment 1 Similarly, for the identification code of garbage bags ("Jiangsu Province-Nantong City-Haimen District 2020-08-", or "Industry Jiangsu Province-Nantong City-Haimen District 2020-08-", or "Jiangsu Province-Nantong City-Haimen District 2020-08-" Our District 2020-08-", or "Jiangsu Province-Nantong City-Haimen District 2020-09-"), only the external key (α=0.12345, β=3.75) changes slightly: α=0.123450000000001; or β= 3.750000000000001, the generation results of the garbage classification QR code for a batch of single garbage bags are shown in Table 2. It can be seen from the following table: once the external key changes even slightly, that is, "missing a tiny bit", the generated QR code for garbage classification will be "a thousand miles away". It can be seen that the batch of QR code for garbage classification proposed in this patent is in batches. The generation method is key sensitive.

Table 2 The generation results of the QR code for garbage classification when the external key changes slightly

Example 4

According to the above-mentioned method for generating a batch of two-dimensional codes for garbage classification, the steps for generating a two-dimensional code for garbage classification of a batch of single garbage bags, as well as the garbage bag identification code, the garbage bag identity hidden code, and the external key are similar to those in the specific embodiment 1, The garbage classification color information of a certain batch of garbage bags is "01", "02", "03", "04"; or the code date of a certain batch of garbage bags is "02", "06", "12", "16", "22", "26"; or the garbage classification serial number information of a certain batch of garbage bags is "01", "02", "03", "04", "05", "06", the corresponding The three batches of garbage classification QR code generation results are shown in Table 3. It can be seen from the table below that the sequential changes of the garbage sorting color information, code production date, and garbage sorting serial number information of a certain batch of garbage bags can generate the garbage sorting QR code of a certain batch of garbage bags in batches. The dimensional code batch generation method is sensitive to the garbage classification color information, code production date and garbage classification serial number information in the garbage bag identity information.

Table 3 Batch generation results of QR codes for garbage classification

From the analysis of the above-mentioned specific embodiments 1-4, it can be seen that the garbage classification codes generated in batches by the method for batch generation of garbage classification codes proposed in this patent are not only closely related to the external key, but also depend on the identity information of garbage bags (a certain batch of garbage bags). Therefore, the method for batch generation of garbage classification codes proposed in this patent has strong security, so as to ensure that the garbage classification codes generated in batches are “unique, safe and secure”. Sexuality and Waste Sorting Guidance".

The above are only preferred embodiments of the present invention, and do not limit the present invention in any form. Although the present invention has been disclosed above with preferred embodiments, it is not intended to limit the present invention. Technical personnel, within the scope of the technical solution of the present invention, can make some changes or modifications to equivalent embodiments of equivalent changes by using the technical content disclosed above, but any content that does not depart from the technical solution of the present invention, according to the present invention Any simple modifications, equivalent changes and modifications made to the above embodiments still fall within the scope of the technical solutions of the present invention.

Claims (8)

1. a method for generating garbage classification two-dimensional codes in batches, is characterized in that, comprises the following steps: (1) Encoding and transcoding First, encode the identity information of a batch of garbage bags, including the unified identity code of a batch of garbage bags and the batch identity code of a single garbage bag, so as to generate a garbage bag with unique Chinese and English characters for a single garbage bag. Identity code, expressed as M ₁ M ₂ ... M _k M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p M _k+L+p+1 M _k+L+p+2 ...M _k+L+p+n M _k+L+p+n+1 M _{k+L+p+n+ 2} M _{k+L +p+n+3} M _k+L+p+n+4 , where M ₁ M ₂ ... M _k are provinces and municipalities, and M _k+1 M _k+2 ... M _k+L are specific residences Address, M _k+L+1 M _{k+L+ 2} ... M _k+L+p is the contact person and contact number, M _k+L+p+1 M _k+L+p+2 ... M _{k +L+p+n} is the code time (the format is year-month-day, where the last two digits M _k+L+p+n-1 M _k+L+p+n is the date), M _{k+L+ p+n+1} M _k+L+p+n+2 is the garbage classification color information (representing the garbage category), M _k+L+p+n+3 M _k+L+p+n+4 is the garbage classification serial number Information (representing the serial number of a certain type of garbage bags on a certain day), separated by English spaces, and the unified identity code of a corresponding batch of garbage bags is M ₁ M ₂ ... M _k M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ...M _k+L+p M _{k+L+p+ 1} M _k+L+p+2 ...M _{k+L+p+ n-3} M _k+L+p+n-2 , the batch ID code of the corresponding single garbage bag is M _k+L+p+n-1 M _k+L+p+n M _{k+L+p+n+ 1} M _k+L+p+n+2 M _k+L+p+n+3 M _k+L+p+n+4 , Then, extract the identity code (M ₁ M ₂ ... M _k M _k+L+p+1 M _{k+L+p+ 2} ... M _{k+L+ p+n-2} ) and identity concealment codes (M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p ), and Convert the identification code into numerical data character by character to obtain the corresponding numerical sequence

At the same time, the identity hidden code is converted into numerical data [P _i1 ,P _i2 ] character by character, and the high-order numerical sequence P1={P1 ₁ ,P1 ₂ ,...,P1 _L+p ,P1 _L+p+1 }= {P ₁₁ ,P ₂₁ ,...,P _(L+p)1 ,P _(L+p+1)1 } and low-order value sequence P2={P2 ₁ ,P2 ₂ ,...,P2 _L+p ,P2 _L+p+1 }={P ₁₂ ,P ₂₂ ,...,P _(L+p)2 ,P _(L+p+1)2 }, Finally, convert the elements Si in the numerical sequence S into 8- _{bit binary sequences {BS i1 ,} BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 } one by one, and convert the elements in the numerical sequence P1 into Convert P1 _i into a binary sequence of 8 bits one by one {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 }, convert the elements P2 _i in the numerical sequence P2 into a binary sequence of 8 bits one by one {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 , BP2 _i8 }, and will

binary sequences {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 }, where i=1,2,...,

Thus, the combined binary matrix B is obtained,

Simultaneously combine L+p+1 binary sequences {BP1 _i1 , BP1 _i2 , BP1 _i3 , BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 }, where i=1,2,...,L +p,L+p+1, so as to obtain the high-order combined binary sequence B1={B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 }={BP1 ₁₁ ,BP1 ₁₂ , BP1 ₁₃ ,BP1 ₁₄ ,BP1 ₁₅ ,BP1 ₁₆ ,BP1 ₁₇ ,BP1 ₁₈ ,BP1 ₂₁ ,BP1 ₂₂ ,...,BP1 ₂₇ ,BP1 ₂₈ ,...,BP1 _i1 ,BP1 _i2 ,...,BP1 _i7 ,BP1 _i8 ,...,BP1 _L+p+11 ,BP1 _L+p+12 ,BP1 _L+p+13 ,BP1 _L+p+14 ,BP1 _L+p+15 ,BP1 _L+p+16 , BP1 _L+p+17 , BP1 _L+p+18 }, and convert L+p+1 binary sequences {BP2 _i1 , BP2 _i2 , BP2 _i3 , BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 , BP2 _i8 } Combine, where i=1,2,...,L+p,L+p+1, so as to obtain the low-order combined binary sequence B2={B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 , B2 _8L+8p+8 }={BP2 ₁₁ ,BP2 ₁₂ ,BP2 ₁₃ ,BP2 ₁₄ ,BP2 ₁₅ ,BP2 ₁₆ ,BP2 ₁₇ ,BP2 ₁₈ ,BP2 ₂₁ ,BP2 ₂₂ ,...,BP2 ₂₇ ,BP2 ₂₈ ,. ..,BP2 _i1 ,BP2 _i2 ,...,BP2 _i7 ,BP2 _i8 ,...,BP2 _L+p+11 ,BP2 _L+p+12 ,BP2 _L+p+13 ,BP2 _L+p+14 , BP2 _L+p+15 , BP2 _L+p+16 , BP2 _L+p+17 , BP2 _L+p+18 }, Among them, the garbage bag identification code includes the double-byte encoded Chinese characters in the GB2312 character set and the visible characters with ASCLL code value ∈ [32,126]. The length of the garbage bag identification code is k+L+p+n+6, and the length of the numerical sequence S is

The length of the numerical sequences P1 and P2 is L+p+1, and the size of the combined binary matrix B is

The length of the combined binary sequence B1 and B2 is 8L+8p+8; (2) The identity hidden codes of a certain batch of garbage bags are uniformly encrypted The identity hidden code of a certain batch of garbage bags is uniformly encrypted, indicating that the identity code (M ₁ M ₂ ... M _k M _k+L+p+1 M _{k+L+p+ 2} ... M _{k+L+p +n-2} ) encrypts the identity concealment code (M _k+1 M _k+2 ... M _k+L M _k+L+1 M _k+L+2 ... M _k+L+p ), A certain batch of garbage bags needs and only needs to undergo a unified encryption operation of the identity hidden code. First, using the numerical sequence S and the binary matrix B converted into it, the binary sequences B1 and B2 converted from the numerical sequences P1 and P2, and the external keys α and β, they are calculated according to the following formulas (1)-(5) respectively. The initial value x ₁ and parameter μ of the Logistic chaotic map, the extraction start position m, and the number of extraction intervals n ₁ and n ₂ , make

but x ₁ =α+mod(α+kp,1-α), (1) μ=β+mod(β+1.5×kp,4-β), (2)

Among them, <B _1,i ,B _2,i ,B _3,i ,B _4,i ,B _5,i ,B _6,i ,B _7,i ,B _8,i >represents the i-th column of binary matrix B Or the number of binary bits '1' in the binary sequence {BS _i1 , BS _i2 , BS _i3 , BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 }, <B1 ₁ , B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 >represents the number of binary bits '1' in the binary sequence {B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 } , <B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+8p+8 >represents the binary sequence {B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+ The number of binary bits '1' in _8p+8 }, the external key satisfies α∈(0,1), β∈(3.57,4), From the initial value x ₁ of the chaotic map and the external key μ, the Logistic chaotic map shown in the following formula (6) is iterated, where k represents the number of iterations (k=1, 2,...), x _k+1 represents the chaotic signal obtained at the kth iteration, x _k+1 = μ×x _k ×(1-x _k ) (6) The chaotic signal sequence X={x ₁ , x ₂ ,...} is obtained, and starting from the mth element in the sequence X, one element is taken at intervals of n ₁ elements to form a chaotic signal sequence with a length of 8L+8p+8

At the same time, starting from the mth element in the sequence X, 1 element is taken at intervals of n ₂ elements to form a chaotic signal sequence with a length of 8L+8p+8 Z={Z ₁ , Z ₂ ,...,Z _{8L+8p +7} ,Z _8L+8p+8 }, Then, sort the chaotic signal sequence Y in descending order, and scramble the high-order combined binary sequence B1 according to the scrambling rules of the position change before and after the chaotic signal sequence Y is sorted to obtain the scrambled high-order binary sequence

At the same time, sort the chaotic signal sequence Z in descending order, and scrambling the low-order combined binary sequence B2 according to the scrambling rules of the position change before and after the chaotic signal sequence Z is sorted to obtain the scrambled low-order binary sequence

Next, let LB=mod(6-mod(8L+8p+8,6),6), the scrambled high-order binary sequence

Add LB binary bits '0' at the end, which will scramble the low-order binary sequence

Add LB binary bits '1' at the end to get the binary sequence

and binary sequence

in

pair binary sequence

and

grouped separately, the binary sequence

The elements in the middle are grouped forward in units of 6 elements from the beginning to the end, and the binary sequence after the grouping is obtained, which is expressed as BF1{1},BF1{2},...,BF1{i},...

Simultaneously convert the binary sequence

The elements in the middle are sequentially grouped in units of 6 elements from the beginning to the end, and the binary sequence after grouping is obtained, which is expressed as BF2{1},BF2{2},...,BF2{i},...

where each binary block sequence contains 6 binary bits, and

Finally, each binary grouping sequence BF1{i}, BF2{i} is subjected to the following diffusion operations in turn: S0: let i=1, and k1_switch=mod(3×<B1 ₁ ,B1 ₂ ,...,B1 _8L+8p+7 ,B1 _8L+8p+8 >+2×(8L+8p+8-<B1 ₁ ,B1 ₂ ,.. .,B1 _8L+8p+7 ,B1 _8L+8p+8 >),8), k2_switch=mod(3×<B2 ₁ ,B2 ₂ ,...,B2 _8L+8p+7 ,B2 _8L+8p+8 >-2×(8L+8p+8-<B2 ₁ ,B2 ₂ ,.. .,B2 _8L+8p+7 ,B2 _8L+8p+8 >),25), S1: Calculate the binary grouping sequences BF1{i} and BF2{i} according to the following formulas (7) and (8), CP1 _i =bin2dec(BF1{i})+176+k1_switch, (7) CP2 _i =bin2dec(BF2{i})+161+k2_switch, (8) S2: The numerical data CP1 _i calculated by using the binary block sequence BF1{i}, and the numerical data CP2 _i calculated by the binary block sequence BF2{i}, calculate k1_switch=mod(CP1 _i +2×CP2 _i +3×k1_switch,8), k2_switch=mod(CP2 _i +2×CP1 _i +3×k2_switch,25), and let i=i+1, then judge the size of i, if

Then go to step S1, otherwise go to step S3, S3: End the diffusion operation of the binary packet sequence, so as to obtain the diffused numerical sequences CP1 and CP2, that is, the encrypted information of the identity hidden code of a certain batch of garbage bags, expressed as

(3) Batch generation of garbage classification numbers for a certain batch of garbage bags According to the difference in the batch identity code (code date of each garbage classification code, garbage category, garbage classification serial number information) of a single garbage bag in the batch of garbage bags, the steps of generating a single garbage classification number are performed respectively, and the batch of garbage bags can be realized. The garbage classification numbers are generated in batches, and the steps for generating the garbage classification numbers for a single garbage bag are described as follows: First, extract the code date of the garbage classification code (M _k+L+p+n-1 M _k+L+p+n ), the garbage category (M _{k+L+p+n+ 1} M _k+L+p+n+2 ), garbage classification serial number information (M _k+L+p+n+3 M _k+L+p+n+4 ), use bin2dec() to make code date character by character The function is converted into numerical data, and the numerical sequence R={R ₁ , R ₂ } is obtained, and the garbage classification serial number information is converted into numerical data character by character using the bin2dec() function to obtain the numerical sequence F={F ₁ , F ₂ } , Then, according to the following formulas (9) and (10), the initial value of the Logistic chaotic map is calculated respectively

and parameters

make

but

Initial value mapped by chaos

and external key

Iterate the Logistic chaotic map shown in the following formula (11), where k represents the number of iterations (k=1, 2,...),

represents the chaotic signal obtained at the kth iteration,

get chaotic signal sequence

from the sequence

The mth element in the middle starts to take 1 element at an interval of n ₁ elements to form a length of

chaotic signal sequence of

Simultaneously from the sequence

The mth element in the middle starts to take 1 element at an interval of n ₂ elements to form a length of

chaotic signal sequence of

Next, according to the garbage category (M _k+L+p+n+1 M _k+L+p+n+2 ), the identity hidden code encryption information of a certain batch of garbage bags is performed, and the numerical sequences CP1 and CP2 take the following operations: If M _k+L+p+n+1 M _k+L+p+n+2 ="01", then the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

If M _k+L+p+n+1 M _k+L+p+n+2 = "02", then the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

If M _k+L+p+n+1 M _k+L+p+n+2 = "03", then the chaotic signal sequence

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence

Sort in ascending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

If M _k+L+p+n+1 M _k+L+p+n+2 = "04", then the chaotic signal sequence

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the numerical sequence CP1, and obtaining the scrambled numerical sequence

At the same time, the chaotic signal sequence is first

Recombination, get the reorganized chaotic signal sequence

Then the chaotic signal sequence

Sort in descending order, according to the chaotic signal sequence

The position change scrambling rules before and after sorting, scrambling the low-order combination binary sequence CP2, and obtaining the scrambled numerical sequence

in,

operation means to obtain a value not greater than

the integer, Finally, the numerical sequence

Element-by-element combination and conversion to Chinese characters to get the Chinese character sequence

is the garbage classification number, where the length of the Chinese character sequence C is

According to the generation process of a single garbage classification number in the batch of garbage bags, the generation of each garbage classification number of the batch of garbage bags is performed in sequence; (4) Combination of garbage classification codes for a certain batch of garbage bags and generation of garbage classification QR codes Put the garbage bag identification code (M ₁ M ₂ ... M _k M _k+L+p+1 M _k+L+p+2 ... M _k+L+p+n-2 ), the date of making the code (M _{k+L+p+n- 1} M _k+L+p+n ), garbage classification number

Garbage category (M _k+L+p+n+1 M _k+L+p+n+2 ), garbage classification serial number information (M _k+L+p+n+3 M _k+L+p+n+4 ) to generate a single garbage classification code in the batch of garbage bags, and then generate a QR Code, that is, a garbage classification two-dimensional code. According to this rule, the garbage classification two-dimensional code of the batch of garbage bags can be generated by batch combination. 2. a kind of garbage classification two-dimensional code batch generation method according to claim 1, is characterized in that: described in step (1), the identity code is converted into numerical data character by character, refers to the identity code Use the unicode2native() function to convert the visible characters whose ASCII code value belongs to [32,126] into a single numeric data character by character, or convert the double-byte encoded Chinese characters in the GB2312 character set into two numeric data, so as to obtain the corresponding numeric sequence

3. a kind of garbage classification two-dimensional code batch generation method according to claim 1 is characterized in that: described in step (1), the identity hidden code is converted into numerical data [P _i1 , P _i2 ] character by character , refers to converting the visible characters whose ASCII code value belongs to [32,126] into a single numerical data and recombining them by using the unicode2native() function to convert the identity hidden code character by character, expressed as [P _i1 ,P _i2 ]=[0,unicode2native( M _i )], or convert the double-byte encoded Chinese characters in the GB2312 character set into two numerical data, expressed as [P _i1 , P _i2 ]=unicode2native(M _i ), so as to obtain the high-order numerical sequence P1={P1 ₁ ,P1 ₂ ,...,P1 _L+p ,P1 _L+p+1 }={P ₁₁ ,P ₂₁ ,...,P _(L+p)1 ,P _(L+p+1)1 } and low-order value sequence P2={P2 ₁ ,P2 ₂ ,...,P2 _L+p ,P2 _L+p+1 }={P ₁₂ ,P ₂₂ ,...,P _(L+p)2 ,P _(L+p+1)2 }. 4. a kind of garbage classification two-dimensional code batch generation method according to claim 1, is characterized in that: described in step (1), element S _i in numerical sequence S is converted into the binary sequence {BS _i1 of 8bits one by one ,BS _i2 ,BS _i3 ,BS _i4 ,BS _i5 ,BS _i6 ,BS _i7 ,BS _i8 }, which means _{that the binary sequence {BS i1 ,} BS _i2 ,BS _i3 ,BS _i4 , BS _i5 , BS _i6 , BS _i7 , BS _i8 }. 5. a kind of garbage classification two-dimensional code batch generation method according to claim 1, is characterized in that: described in step (1), the element P1 _i in the numerical sequence P1 is converted into the binary sequence {BP1 _i1 of 8bits one by one ,BP1 _i2 ,BP1 _i3 ,BP1 _i4 ,BP1 _i5 ,BP1 _i6 ,BP1 _i7 ,BP1 _i8 }, which means _{that the binary sequence {BP1 i1 ,} BP1 _i2 ,BP1 _i3 ,BP1 _i4 , BP1 _i5 , BP1 _i6 , BP1 _i7 , BP1 _i8 }. 6. a kind of garbage classification two-dimensional code batch generation method according to claim 1, is characterized in that: described in step (1), element P2 _i in numerical sequence P2 is converted into the binary sequence {BP2 _i1 of 8bits one by one ,BP2 _i2 ,BP2 _i3 ,BP2 _i4 ,BP2 _i5 ,BP2 _i6 ,BP2 _i7 ,BP2 _i8 }, which means _{that the binary sequence {BP2 i1 ,} BP2 _i2 ,BP2 _i3 ,BP2 _i4 , BP2 _i5 , BP2 _i6 , BP2 _i7 , BP2 _i8 }. 7. a kind of garbage classification two-dimensional code batch generation method according to claim 1 is characterized in that: the numerical sequence described in step (3)

Combining elements one by one and converting them into Chinese characters refers to combining [CP1 _i , CP2 _i ] element by element and then converting them into Chinese characters, that is, C _i =native2unicode([CP1 _i ,CP2 _i ]). 8. The method for batch generation of two-dimensional codes for garbage classification according to claim 1, characterized in that: in step (4), the garbage bag identification codes (M ₁ M ₂ ... M _k M _{k +L+p+1} M _k+L+p+2 ...M _k+L+p+n-2 ), code date (M _{k+L+p+n- 1} M _{k+L+p+ n} ), garbage classification number

Garbage category (M _k+L+p+n+1 M _k+L+p+n+2 ), garbage classification serial number information (M _k+L+p+n+3 M _k+L+p+n+4 ) to generate a single garbage classification code in the batch of garbage bags, which refers to the combination method of inserting the garbage bag identification code, code production date, garbage classification number, garbage category and garbage classification serial number information into the connection to generate the batch of garbage. A single garbage classification code in the bag, expressed as M ₁ M ₂ ... M _k

M _k+L+p+1 M _k+L+p+2 ...M _{k+L+p+n- 2} M _k+L+p+n-1 M _k+L+p+n M _{k+ L+p+n+1} M _k+L+p+n+2 M _k+L+p+n+3 M _k+L+p+n+4 , where M ₁ M ₂ ... M _k ,

M _{k+L+p+ 1} M _k+L+p+2 ...M _k+L+p+n-2 M _k+L+p+n-1 M _k+L+p+n , M _{k+ L+p+n+1} M _k+L+p+n+2 and M _k+L+p+n+3 M _k+L+p+n+4 are separated by English spaces.

Images