CN106651734A - Binary two-dimensional code image encryption and decryption method and device - Google Patents
Binary two-dimensional code image encryption and decryption method and device Download PDFInfo
- Publication number
- CN106651734A CN106651734A CN201510727690.5A CN201510727690A CN106651734A CN 106651734 A CN106651734 A CN 106651734A CN 201510727690 A CN201510727690 A CN 201510727690A CN 106651734 A CN106651734 A CN 106651734A
- Authority
- CN
- China
- Prior art keywords
- key
- matrix
- value
- sequence
- dimentional
- 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.)
- Pending
Links
Landscapes
- Facsimile Transmission Control (AREA)
- Storage Device Security (AREA)
Abstract
The invention relates to a binary two-dimensional code image encryption method. The method includes obtaining a two-dimensional image, and generating a binary matrix according to the two-dimensional code image; obtaining a secret key which includes an initial value Z and a starting parameter, wherein the initial value Z is larger than 1, and the starting parameter is between 0 and 1; adopting a Z mapping algorithm to generate a two-dimensional secret key matrix according to the secret key; and performing XOR on elements of the binary matrix and elements of the two-dimensional secret key matrix in one-to-one correspondence to obtain an encrypted two-dimensional code image, decryption difficulty is increased, and security of two-dimensional code information is improved. In addition, a binary two-dimensional code image encryption device and binary two-dimensional code image decryption method and device are also provided.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind of two-value image in 2 D code encryption, decryption
Method and apparatus.
Background technology
With the development of computer technology, Quick Response Code is generally accorded with using chequered with black and white two-value figure record data
Number information, due to its can easily carrying information get a lot of applications in every field, such as pass through Quick Response Code
Carry out data storage, log-on webpage, mobile-phone payment etc..In order to avoid the important information quilt that Quick Response Code is included
Steal and change, before its transmission and storing, need to be encrypted it, to guarantee that Quick Response Code is carried
The security and validity of information.
The method AES complexity of existing two-dimentional code encryption is low and known degree is high, it is easy to be cracked,
Security is low.
The content of the invention
Based on this, it is necessary to for above-mentioned technical problem, there is provided a kind of two-value image in 2 D code encryption, decryption
Method and apparatus, improve 2 D code information security.
A kind of method of two-value image in 2 D code encryption, methods described includes：
Image in 2 D code is obtained, two values matrix is generated according to the image in 2 D code；
Key is obtained, the key includes initial value Z and initial parameters, and wherein initial value Z is more than 1, starting
Parameter is between zero and one；
The two-dimentional cipher key matrix matched with the two values matrix is generated using Z mapping algorithms according to the key；
The element one-to-one corresponding of the element of the two values matrix and two-dimentional cipher key matrix is carried out into XOR to be encrypted
Image in 2 D code afterwards.
A kind of device of two-value image in 2 D code encryption, described device includes：
Processing module, for obtaining image in 2 D code, according to the image in 2 D code two values matrix is generated, and is obtained
Key is taken, the key includes initial value Z and initial parameters, and wherein initial value Z is more than 1, and initial parameters exist
Between 0 and 1；
Two-dimentional cipher key matrix generation module, for being generated and described two using Z mapping algorithms according to the key
The two-dimentional cipher key matrix of value matrix matching；
Encrypting module, for by the element of the element of the two values matrix and two-dimentional cipher key matrix correspond into
Row XOR encrypted after image in 2 D code.
The method and apparatus of above-mentioned two-value image in 2 D code encryption, by obtaining image in 2 D code, according to two dimension
Code image generates two values matrix, obtains key, including initial value Z and initial parameters, and wherein initial value Z is more than
1, initial parameters between zero and one, two matched with two values matrix are generated according to key using Z mapping algorithms
Dimension cipher key matrix, carries out the element one-to-one corresponding of the element of two values matrix and two-dimentional cipher key matrix XOR and obtains
Image in 2 D code after encryption, the computation complexity of Z mapping algorithms is high, and has with initial parameters to initial value
Very high sensitiveness, increases decryption difficulty, improves the security of 2 D code information.
A kind of method of two-value image in 2 D code decryption, methods described includes：
The image in 2 D code of encryption is obtained, encryption two values matrix is generated according to the image in 2 D code of the encryption；
The key of the image in 2 D code matching of the encryption is obtained, the key includes initial value Z and starting ginseng
Number, wherein initial value Z is more than 1, and initial parameters are between zero and one；
The two-dimentional key square matched with the encryption two values matrix is generated using Z mapping algorithms according to the key
Battle array；
The element one-to-one corresponding of the element of the encryption two values matrix and two-dimentional cipher key matrix is carried out into XOR to obtain
Image in 2 D code after decryption.
A kind of device of two-value image in 2 D code decryption, described device includes：
Decryption processing module, for obtaining the image in 2 D code of encryption, according to the image in 2 D code of the encryption
Encryption two values matrix is generated, the key of the image in 2 D code matching of the encryption is obtained, the key is included just
Initial value Z and initial parameters, wherein initial value Z are more than 1, and initial parameters are between zero and one；
The two-dimentional cipher key matrix generation module of decryption, for adopting Z mapping algorithms to generate and institute according to the key
State the two-dimentional cipher key matrix of encryption two values matrix matching；
Deciphering module, for by a pair of the element 1 of the element of the encryption two values matrix and two-dimentional cipher key matrix
The image in 2 D code after XOR is decrypted should be carried out.
The method and apparatus of above-mentioned two-value image in 2 D code decryption, by the image in 2 D code for obtaining encryption, root
Encryption two values matrix is generated according to the image in 2 D code of encryption, the key of the image in 2 D code matching of encryption is obtained,
Key includes initial value Z and initial parameters, and wherein initial value Z is more than 1, initial parameters between zero and one,
The two-dimentional cipher key matrix matched with encryption two values matrix is generated using Z mapping algorithms according to key, two will be encrypted
The element of the element of value matrix and two-dimentional cipher key matrix is corresponded and carries out the Quick Response Code figure after XOR is decrypted
Picture, only obtaining the key matched with the image in 2 D code of encryption just can be decrypted, and when decrypting only
There is the concrete formula ability successful decryption that specify that Z mapping algorithms, due to Z mapping algorithms complexity height, and
There is very high sensitiveness to the initial value and initial parameters of key, increase decryption difficulty, improve Quick Response Code
The security of information.
Description of the drawings
Fig. 1 is the encryption of two-value image in 2 D code, the applied environment figure of the method for decryption in one embodiment；
Fig. 2 is the cut-away view of server in Fig. 1 in one embodiment；
Fig. 3 is the cut-away view of terminal in Fig. 2 in one embodiment；
Fig. 4 is the flow chart of the method for two-value image in 2 D code encryption in one embodiment；
Fig. 5 is the flow chart that two-dimentional cipher key matrix is generated in one embodiment；
Fig. 6 is unencrypted Quick Response Code schematic diagram in one embodiment；
Fig. 7 is the Quick Response Code schematic diagram after encrypting in one embodiment；
Fig. 8 is the flow chart of the method for two-value image in 2 D code decryption in one embodiment；
Fig. 9 is the flow chart that two-dimentional cipher key matrix is generated in one embodiment；
Figure 10 is the Quick Response Code schematic diagram after decrypting in one embodiment；
Figure 11 is using the Quick Response Code schematic diagram after decrypting after the initial value different from encryption in one embodiment；
Figure 12 is to be illustrated using the Quick Response Code after decrypting after another initial value different from encryption in one embodiment
Figure；
Figure 13 is to be illustrated using the Quick Response Code after decrypting after another initial value different from encryption in one embodiment
Figure；
Figure 14 is the structured flowchart of the device of two-value image in 2 D code encryption in one embodiment；
Figure 15 is the structured flowchart of two-dimentional cipher key matrix generation module in one embodiment；
Figure 16 is the structured flowchart of the device of two-value image in 2 D code decryption in one embodiment；
Figure 17 is the structured flowchart of the two-dimentional cipher key matrix generation module of decryption in one embodiment.
Specific embodiment
Fig. 1 is two-value image in 2 D code encryption in one embodiment, the applied environment figure of the method operation of decryption.
As shown in figure 1, the applied environment includes terminal 110, server 120, wherein terminal 110 and server 120 is logical
Cross network to be communicated.
Terminal 110 can be for smart mobile phone, panel computer, notebook computer, desktop computer etc., but not
It is confined to this.The Quick Response Code of encryption can be sent between terminal 110 and server 120 by network.Two-value two
Tie up code image encryption, the device of decryption can be in the terminal, it is also possible in the server.
In one embodiment, the internal structure of the server 120 in Fig. 1 is as shown in Fig. 2 the server
120 include the processor, storage medium, internal memory and the network interface that connect by system bus.Wherein, the clothes
Business device 120 storage medium be stored with operating system, database and two-value image in 2 D code encryption and/or decrypt
Device, database is used for data storage, such as subscriber data, the encryption of two-value image in 2 D code and/or decrypts
Device be used for the side for realizing a kind of two-value image in 2 D code encryption suitable for server 120 and/or decrypting
Method.The processor of the server 120 is used to provide calculating and control ability, supports whole server 120
Operation.The two-value image in 2 D code encryption in storage medium and/or the dress decrypted are saved as in the server 120
The operation put provides environment.The network interface of the server 120 is used to pass through network with outside terminal 110
The two-value image in 2 D code of the encryption that connection communication, such as receiving terminal 110 send and to 110, terminal
Send two-value image in 2 D code of encryption etc..
In one embodiment, the internal structure of the terminal 110 in Fig. 1 is as shown in figure 3, the terminal 110
Including the processor, GPU, storage medium, internal memory, network interface connected by system bus,
Display screen and input equipment.Wherein, the storage medium of terminal 110 is stored with operating system, also including two
The encryption of value image in 2 D code and/or the device decrypted, the device is used to realize a kind of two-value two suitable for terminal
Dimension code image encryption and/or the method for decryption.The processor is used to provide calculating and control ability, supports whole
The operation of terminal 110.GPU in terminal 110 is used to provide at the drafting energy of display interface
Power, the operation for inside saving as the information display device in storage medium provides environment, and network interface is used for and service
Device 120 carries out network service, such as sends the two-value image in 2 D code of encryption to server 120.Display screen
Curtain such as shows picture, information on application interface for showing application interface etc., and input equipment is used to connect
Receive order or data of user input etc..For the terminal 110 with touch-screen, display screen and input equipment can
For touch-screen.
As shown in figure 4, in one embodiment, there is provided a kind of method of two-value image in 2 D code encryption,
Server or terminal in be applied to above-mentioned applied environment, comprises the steps：
Step S210, obtains image in 2 D code, and according to image in 2 D code two values matrix is generated.
Specifically, the method for two-value image in 2 D code encryption is only applicable to the figure that image in 2 D code has two-value
Picture, such as QR codes.The request sent according to the information text or terminal of input generates the two-value two of the information that carries
Dimension code image, the logging request for such as being sent according to terminal generates the two-value two with subscriber data for logging in
Dimension code image.Two-value image in 2 D code only has two kinds of colourities, such as black and white.Two values matrix is by two kinds
The matrix of numerical value composition, the such as matrix of 0 and 1 composition.Two kinds of colourities of image are corresponded into two kinds of numerical value,
Corresponding two values matrix is generated according to each pixel of image in 2 D code, such as the pixel of black 0 is corresponded into,
The pixel of white corresponds to 1.For the two-value image in 2 D code for having gray scale, dedusting degree regeneration can be first carried out
Into two values matrix.
Step S220, obtains key, and key includes initial value Z and initial parameters, and wherein initial value Z is more than 1,
Initial parameters are between zero and one.
Specifically, key determines the algorithm complex of encryption, and the algorithm complex of encryption is initial with key
The increase of value Z and initial parameters digit and increase.Because Z mapping algorithms belong to chaos system algorithm, it is necessary to
Initial value Z is met more than 1, the system just enters chaos state, and has very high to initial value and initial parameters
Sensitiveness, i.e. encryption key and decruption key also results in decryption failure if there is JND, this kind of
Characteristic determines the reliability and security of Z mapping algorithm encryption and decryption.Conjunction can be randomly selected when being encrypted
The initial value Z of right position number and initial parameters, because the selection range of initial value Z and initial parameters is very big, lead
Cause the difficulty of decryption very big.Simultaneously initial parameters are between zero and one and Z mapping algorithms codomain is 0 and 1
Between, it is ensured that can quickly and easily divide and generate key sequence.
Step S230, the two-dimentional cipher key matrix matched with two values matrix is generated according to key using Z mapping algorithms.
Specifically, Z mapping algorithms are that Z maps one-dimensional nonlinear dynamical system, and its definition isWherein x0For initial parameters, x is can customizenTurning and two-dimentional cipher key matrix between
Change relation, such as using auxiliary array record xnAnd the position relationship between two-dimentional cipher key matrix, pass throughIt is calculated each xnAfter value, target x is chosen according to custom conditionn, further according to
Auxiliary array obtains each target xnIn the position of two-dimentional cipher key matrix, further according to custom algorithm each is converted
Target xnFor the value in the range of qualified two-value.Choosing target xnWhen, although xnComputation sequence be from
From small to large recursive calculation is obtained n values, but is choosing the x for encryptionnWhen can with the selection of intermittent,
Algorithm adjustment x is can customize after selectionnOrder.Two-dimentional cipher key matrix is equally the matrix with two-value,
Two-value therein is identical with the two-value scope in the two values matrix in step S210, such as two in step S210
Value matrix is the matrix of 0 and 1 composition, then two-dimentional cipher key matrix is equally the matrix of 0 and 1 composition, and
Two-dimentional cipher key matrix is identical with the length and width of two values matrix, because the length and width of two values matrix depends on
In the size of image in 2 D code, so image in 2 D code is bigger, two-dimentional cipher key matrix is bigger, generates two dimension close
The complexity of key matrix is higher, and the time is longer.
Step S240, carries out the element one-to-one corresponding of the element of two values matrix and two-dimentional cipher key matrix XOR and obtains
Image in 2 D code to after encryption.
Specifically, each corresponding element of each element of two values matrix and two-dimentional cipher key matrix is carried out
Scrambled matrix is obtained after XOR, the bianry image that scrambled matrix is converted into picture format is used to store, transmit.
Such as the image of bmp or jpg forms.When stored, half-tone information can be increased and generates the binary map with gray scale
Picture.In one embodiment, the key that terminal or server will be used when the image in 2 D code of encryption and encryption
Send to server or terminal, the server or terminal of the image in 2 D code for being easy to receive after encryption are according to connecing
The key for receiving is decrypted.Before sending, the key used during encryption can be encrypted, or when sending
Using safe passage.In one embodiment, terminal and server two ends are given birth to using the key of agreement
Into mode, so that key need not be transmitted can also carry out after the image in 2 D code of the encryption for receiving
Decryption.In one embodiment, terminal and server two ends using the mapping relations of agreement will map data with
Key is corresponding so that only transmit mapping data, and reception is convenient can be according to the mapping relations of agreement according to mapping
Data obtain key so as to be decrypted.In one embodiment, method two-value image in 2 D code encrypted
Be applied to safety insert, install safety insert by way of, internet service end to image in 2 D code
Encryption, is then decrypted, it is ensured that two using mounted plug-in unit in client to the image in 2 D code encrypted
The security of dimension code information.
In the present embodiment, by obtaining image in 2 D code, two values matrix is generated according to image in 2 D code, obtained
Key, including initial value Z and initial parameters, wherein initial value Z be more than 1, initial parameters between zero and one,
The two-dimentional cipher key matrix matched with two values matrix is generated using Z mapping algorithms according to key, by two values matrix
The element of element and two-dimentional cipher key matrix is corresponded and carries out the image in 2 D code after XOR is encrypted, Z mappings
The computation complexity of algorithm is high, and has very high sensitiveness to initial value and initial parameters, increases decryption
Difficulty, improves the security of 2 D code information.
In one embodiment, as shown in figure 5, step S230 includes：
Step S231, chaotic key sequence is generated according to key using Z mapping algorithms.
Specifically, chaotic key sequence is one-dimensional sequence, will be according to initial value Z and x0Given birth to using Z mapping algorithms
Into each xnTarget x is chosen in valuenAnd generate chaotic key sequence according to preset order sequence.Now only need to
Record each target xnWith the position relationship between one-dimensional chaotic key sequence, than record target xnWith two dimension
Position relationship between matrix is more convenient.The number phase of the length of chaotic key sequence and element in two values matrix
Together, if the dimension of two values matrix is M × N, then the length of chaotic key sequence is M × N.
Step S232, chaotic key is Sequence Transformed for one-dimensional two-value key sequence.
Specifically, by each target x in chaotic key sequencenIt is transformed to according to custom algorithm eligible
Two-value in the range of value, parallel transformation can be carried out according to conversion number during conversion, raising is converted into one-dimensional two
The speed of value key sequence.
Step S233, by one-dimensional two-value key sequence two-dimentional cipher key matrix is converted into.
Specifically, first application one preserves two dimension with the two-dimensional array of two values matrix equal length and width
The two-dimensional array of cipher key matrix, such as M × N, the element for then sequentially reading one-dimensional two-value key sequence is saved in
In two-dimensional array, whenever M element has been preserved, just line feed continues to preserve, until the element of one-dimension array
All preserve into the two-dimensional array of M × N, then this two-dimensional array is two-dimentional cipher key matrix.Due in step
Target x in S231nIt is to generate chaotic key sequence according to preset order sequence, so now only needing order to read
Take, it is not necessary to record the position relationship of element between one-dimensional two-value key sequence and two-dimentional cipher key matrix.
It is understood that a position conversion array can also be arranged again, do not press when two-dimentional cipher key matrix is generated
Order reads the element in one-dimensional two-value key sequence, but the order for converting array according to position reads.
In the present embodiment, one-dimensional sequence is first generated, then one-dimensional sequence is converted into two-dimensional matrix so that record
It is more convenient during position relationship between element and matrix, two-dimentional cipher key matrix can be quickly generated.
In one embodiment, step S231 includes：According to formulaWith key meter
Calculation is obtained by xnChaotic key sequence [the x of compositionb,xb+1…xb+M×N-1], wherein x0For the initial parameters,
B≤n≤b+M × N-1,0≤b, M are the length of the two values matrix, and N is the width of the two values matrix.
Specifically, according to initial value Z and initial parameters x0Each x for generatingnChoose in value and generated by computation sequence
Continuous N × N number of target xnAnd chaotic key sequence is generated according to computation sequence sequence, due to the length of QR codes
Degree and width are typically identical, so the length and width of the two values matrix of QR codes is also identical, for QR codes one
As M=N.Due to being to arrange each target x according to computation sequencen, it is not necessary to record each target xnWith it is one-dimensional
Chaotic key sequence between position relationship, it is only necessary to record start target xnStart sequence number n, more
It is convenient.
Step S232 includes：According to formulaWherein 0 ＜ a ＜ 1, by the chaotic key
Sequence [xb,xb+1…xb+M×N-1] it is converted into one-dimensional two-value key sequence [yb,yb+1…yb+M×N-1]。
Specifically, by each target xnAccording to its size according to formula0 or 1 is converted into,
So as to generate the two-value key sequence [y being made up of 0 and 1b,yb+1…yb+M×N-1], preferential a values are 0.5.
Step S233 includes：According to default transformation rule by the one-dimensional two-value key sequence
[yb,yb+1…yb+M×N-1] it is converted into the two-dimentional cipher key matrix of M × N.
Specifically, one-dimensional two-value key sequence [y can be in order successively readb,yb+1…yb+M×N-1] in each yuan
Element generates the two-dimentional cipher key matrix of M × N, position conversion array is may also set up, when two-dimentional cipher key matrix is generated
The element in one-dimensional two-value key sequence is read out of order, but the order for converting array according to position reads.
In one embodiment, the number of bits of initial value Z be more than the first predetermined threshold value, initial parameters it is little
Several digits are more than the second predetermined threshold value.
Specifically, the first predetermined threshold value and the second predetermined threshold value can be self-defined as needed, and the first default threshold
Value and/or the second predetermined threshold value can be adjusted according to the disposal ability of image in 2 D code and/or terminal.Preferential, the
One predetermined threshold value is 5, and the second predetermined threshold value is 5, and the number of bits that can arrange initial value Z is even
Number, initial parameters x0Scale be easy to according to formula for even numberCarry out evolution
Computing and Computer Storage.As selection Z=1111111111, x0=0.1111111111 be initial value, chaotic key
Sequence [xb,xb+1…xb+M×N-1] in b=0, byWithFormula is produced
Chaotic key sequence pair QR codes as shown in Figure 6, the content that wherein QR codes are carried is Test, and pixel is
181 × 181, the ciphering two-dimension code figure generated after being encrypted is as shown in Figure 7.
In one embodiment, as shown in Figure 8, there is provided a kind of method of two-value image in 2 D code decryption,
Comprise the steps：
Step S310, obtains the image in 2 D code of encryption, is generated according to the image in 2 D code of the encryption and is encrypted
Two values matrix.
Specifically, the image in 2 D code of encryption is the image with two-value, such as QR codes.Two-value Quick Response Code figure
As only two kinds colourities, such as black and white.The matrix that two values matrix is made up of two kinds of numerical value, such as 0 and 1
The matrix of composition.Two kinds of colourities of image are corresponded into two kinds of numerical value, according to each pixel of image in 2 D code
Corresponding two values matrix is generated, such as the pixel of black 0 is corresponded into, the pixel of white corresponds to 1.It is right
In the two-value image in 2 D code of the encryption for having gray scale, dedusting degree regeneration encryption two values matrix can be first carried out.
Step S320, obtains the key of the image in 2 D code matching of the encryption, and the key includes initial value Z
And initial parameters, more than 1, initial parameters are between zero and one for wherein initial value Z.
Specifically, the identical key used when the key of matching is referred to and encrypted with image in 2 D code, can by with
Encryption side carries out agreement and obtains, and the key that also can be sent by receiving encryption side is obtained, if encryption side is sent out
The key sent is the key of encryption, then first carry out decoding and obtain key.Key determines that the algorithm of decryption is answered
Miscellaneous degree, the algorithm complex of decryption increases with the increase of key initial value Z and initial parameters digit.Due to
Z mapping algorithms belong to chaos system algorithm, have very high sensitiveness to initial value and initial parameters, that is, encrypt close
Key and decruption key also result in decryption failure if there is JND, and this kind of characteristic determines that Z mappings are calculated
The reliability and security of method encryption and decryption.The initial value Z of suitable digit can be randomly selected when being encrypted and is risen
Beginning parameter x0, due to initial value Z and initial parameters x0Selection range it is very big, cause decrypt difficulty very
Greatly.For Z mapping algorithms are in Z ＞ 1, the system enters chaos state, while the ＜ x of initial parameters 00＜ 1, and
Z mapping algorithms codomain is between zero and one, it is ensured that can quickly and easily divide and generate key sequence.Due to solution
Key is consistent with encryption key, so the Z and initial parameters x of decruption key0Scope and encryption key phase
Together, all it is the ＜ x of Z ＞ 1,00＜ 1.Can be according to Z and x0Scope judge whether decruption key malfunctions.
Step S330, the two-dimentional key matched with encryption two values matrix is generated according to key using Z mapping algorithms
Matrix.
Specifically, Z mapping algorithms are that Z maps one-dimensional nonlinear dynamical system, and its definition isWherein x0For initial parameters, x is can customizenTurning and two-dimentional cipher key matrix between
Change relation, such as using auxiliary array record xnAnd the position relationship between two-dimentional cipher key matrix, pass throughIt is calculated each xnAfter value, target x is chosen according to custom conditionn, further according to
Auxiliary array obtains each target xnIn the position of two-dimentional cipher key matrix, further according to custom algorithm each is converted
Target xnFor the value in the range of qualified two-value.Choosing target xnWhen, although xnComputation sequence be from
From small to large recursive calculation is obtained n values, but is choosing the x for encryptionnWhen can with the selection of intermittent,
Algorithm adjustment x is can customize after selectionnOrder.Two-dimentional cipher key matrix is equally the matrix with two-value,
Two-value therein is identical with the two-value scope in encryption two values matrix, and such as encryption two values matrix is 0 and 1 composition
Matrix, then two-dimentional cipher key matrix is equally the matrix of 0 and 1 composition, and two-dimentional cipher key matrix and encryption
The length and width of two values matrix is identical, because the length and width for encrypting two values matrix depends on the two of encryption
The size of dimension code image, so the image in 2 D code of encryption is bigger, two-dimentional cipher key matrix is bigger, generates two dimension
The complexity of cipher key matrix is higher, and decryption time is longer.
Step S340, the element one-to-one corresponding of the element of encryption two values matrix and two-dimentional cipher key matrix is carried out different
Or the image in 2 D code after being decrypted.
Specifically, by each element of encryption two values matrix and each corresponding element of two-dimentional cipher key matrix
Carry out obtaining decrypting matrix after XOR, due to decrypting the two values matrix that matrix is made up of 0 and 1, will solve
When close matrix is converted into bianry image, can be carried out turning according to the two-value scope of two values matrix and bianry image itself
Change.Decryption matrix is converted into the image in 2 D code after the bianry image of picture format is decrypted, for depositing
Storage, such as transmission, the image of bmp or jpg forms.
In the present embodiment, by the image in 2 D code for obtaining encryption, generated according to the image in 2 D code of encryption and added
Close two values matrix, obtains the key of the image in 2 D code matching of encryption, and key includes initial value Z and initial parameters,
Wherein initial value Z be more than 1, initial parameters between zero and one, according to key using Z mapping algorithms generate with
The two-dimentional cipher key matrix of encryption two values matrix matching, by the element of encryption two values matrix and two-dimentional cipher key matrix
Element is corresponded and carries out the image in 2 D code after XOR is decrypted, and only obtains the Quick Response Code with encryption
The key of images match just can be decrypted, and the concrete formula of Z mapping algorithms is only specify that when decrypting
Ability successful decryption, because Z mapping algorithms complexity height, and the initial value and initial parameters to key have very
High sensitiveness, increases decryption difficulty, improves the security of 2 D code information.
In one embodiment, as shown in figure 9, step S330 includes：
Step S331, chaotic key sequence is generated according to key using Z mapping algorithms.
Specifically, chaotic key sequence is one-dimensional sequence, will be according to initial value Z and initial parameters x0Using Z
Each x that mapping algorithm is generatednTarget x is chosen in valuenAnd generate chaotic key sequence according to preset order sequence.
Now only need to record each target xnWith the position relationship between one-dimensional chaotic key sequence, than record mesh
Mark xnAnd the position relationship between the matrix of two dimension is more convenient.The length of chaotic key sequence and encryption two-value square
The number of element is identical in battle array, and the dimension of such as encryption two values matrix is M × N, then the length of chaotic key sequence
For M × N.
Step S332, chaotic key is Sequence Transformed for one-dimensional two-value key sequence.
Specifically, by each target x in chaotic key sequencenIt is transformed to according to custom algorithm eligible
Two-value in the range of value, parallel transformation can be carried out according to conversion number during conversion, raising is converted into one-dimensional two
The speed of value key sequence.
Step S333, by one-dimensional two-value key sequence two-dimentional cipher key matrix is converted into.
Specifically, first application one is preserved with the two-dimensional array of encryption two values matrix equal length and width
The two-dimensional array of two-dimentional cipher key matrix, such as M × N, the element for then sequentially reading one-dimensional two-value key sequence is protected
In being stored to two-dimensional array, whenever M element has been preserved, just line feed continues to preserve, until one-dimension array
Element is all preserved into the two-dimensional array of M × N, then this two-dimensional array is two-dimentional cipher key matrix.Due in step
Target x in rapid S231nIt is to generate chaotic key sequence according to preset order sequence, so now only needing order
Read, it is not necessary to record the position relationship of element between one-dimensional two-value key sequence and two-dimentional cipher key matrix.
It is understood that a position conversion array can also be arranged again, do not press when two-dimentional cipher key matrix is generated
Order reads the element in one-dimensional two-value key sequence, but the order for converting array according to position reads.
In the present embodiment, one-dimensional sequence is first generated, then one-dimensional sequence is converted into two-dimensional matrix so that record
It is more convenient during position relationship between element and matrix, two-dimentional cipher key matrix can be quickly generated.
In one embodiment, step S331 includes：According to formulaWith key meter
Calculation is obtained by xnChaotic key sequence [the x of compositionb,xb+1…xb+M×N-1], wherein x0For initial parameters,
B≤n≤b+M × N-1,0≤b, M are the length of the two values matrix, and N is the width of the two values matrix.
Specifically, according to initial value Z and initial parameters x0Each x for generatingnChoose in value and generated by computation sequence
Continuous N × N number of target xnAnd chaotic key sequence is generated according to computation sequence sequence, due to the length of QR codes
Degree and width are typically identical, so the length and width of the two values matrix of QR codes is also identical, for QR codes one
As M=N..Due to being to arrange each target x according to computation sequencen, it is not necessary to record each target xnWith it is one-dimensional
Chaotic key sequence between position relationship, it is only necessary to record start target xnStart sequence number n, more
It is convenient.
Step S332 includes：According to formulaWherein 0 ＜ a ＜ 1, by chaotic key sequence
[xb,xb+1…xb+M×N-1] it is converted into one-dimensional two-value key sequence [yb,yb+1…yb+M×N-1]。
Specifically, by each target xnAccording to its size according to formula0 or 1 is converted into,
So as to generate the two-value key sequence [y being made up of 0 and 1b,yb+1…yb+M×N-1], preferential a values are 0.5.
Step S333 includes：According to default transformation rule by one-dimensional two-value key sequence [yb,yb+1…yb+M×N-1] turn
Turn to the two-dimentional cipher key matrix of M × N.
Specifically, one-dimensional two-value key sequence [y can be in order successively readb,yb+1…yb+M×N-1] in each element
The two-dimentional cipher key matrix of M × N is generated, position conversion array is may also set up, when two-dimentional cipher key matrix is generated not
The element in one-dimensional two-value key sequence is read in order, but the order for converting array according to position reads.
In one embodiment, the number of bits of initial value Z is more than the first predetermined threshold value, initial parameters
Scale is more than the second predetermined threshold value.
Specifically, the first predetermined threshold value and the second predetermined threshold value can be self-defined as needed, and the first default threshold
Value and/or the second predetermined threshold value can be adjusted according to the disposal ability of image in 2 D code and/or terminal.Preferential, the
One predetermined threshold value is 5, and the second predetermined threshold value is 5, and the number of bits that can arrange initial value Z is even
Number, initial parameters x0Scale be easy to according to formula for even numberCarry out evolution
Computing and Computer Storage.As illustrated, for selection Z=1111111111, x0=0.1111111111 is first
Value, chaotic key sequence [xb,xb+1…xb+M×N-1] in b=0, byWithThe chaotic key sequence pair QR codes as shown in Figure 6 that formula is produced, wherein QR codes
The content of carrying is Test, and pixel is 181 × 181, the ciphering two-dimension as shown in Figure 7 generated after being encrypted
Code figure obtains the image in 2 D code after decryption as shown in Figure 10 after being decrypted.Understood in initial value by control
Correctly, correct decoding image has been obtained in the case of decipherment algorithm is correct, with original unencrypted Quick Response Code
Image is identical.
In addition, by choosing different initial values encryption and decryption performance is analyzed with initial parameters, even if
The JND of encryption key and decruption key also results in decryption failure, it was demonstrated that two-value image in 2 D code adds
The reliability and security of close method.When encryption initial value is Z=1111111111, x0=0.1111111111；
Decryption initial value is Z=1111111112, x0=0.1111111111, when decrypt the such as Figure 11 of the design sketch after Fig. 7.
When encryption initial value is Z=1111111111, x0=0.1111111111, decryption initial value is Z=1111111111,
x0The such as Figure 12 of the design sketch after Fig. 7 is decrypted when=0.1111111112.And as encryption initial value Z=1111111111,
x0=0.1111111111, decryption initial value is Z=1111111110, x0Decrypt after Fig. 7 when=0.1111111112
Design sketch such as Figure 13, it is seen that the minute differences of initial value also result in the image in 2 D code and original image for decrypting
It is different.
In addition, the time efficiency of encryption and decryption is counted, using Z and x0The key of 10 is, plus
Ciphertext is Test, and the average time that the QR codes of selection different editions are carried out after encryption and decryption is as shown in table 1：
Table 1
As can be seen from Table 1, using Z mapping carry out QR code encryption and decryption time it is essentially identical, encryption and decryption when
Between with the incremental and elongated of QR code versions.The encryption and decryption time of maximum version, i.e. Version40 is most long, because
There are 177 × 177 black and white color lumps for Version40, generating two values matrix can spend bigger cost.Conventional
QR codes version is Version7, although only 45 × 45 black and white color lumps, but can meet information
Transmission, the average encryption and decryption time only has about 0.3S, so the practicality of the encipher-decipher method is also very strong.For
The time complexity for cracking the enciphering and deciphering algorithm is analyzed, and chooses the QR of minimal version Version1 version
Code, removes the pixel for localization function module, is also required to attempt about by the way of Brute Force
2220× 0.028 second, about 3.2 × 1059My god, even and if QR codes employ error correcting code, and decryption difficulty is still very big.
And key that 2 initial value length is 10 is cracked to being also required to about 1020× 0.004 second, about 4.3 × 1012It when
Between, the security that can be seen that the method by breaking cryptographic keys time complexity is very high.
In one embodiment, as shown in figure 14, there is provided a kind of device of two-value image in 2 D code encryption,
Including：
Processing module 410, for obtaining image in 2 D code, according to image in 2 D code two values matrix is generated, and is obtained
Key, key includes initial value Z and initial parameters, and wherein initial value Z is more than 1, and initial parameters are 0 and 1
Between.
Two-dimentional cipher key matrix generation module 420, for adopting Z mapping algorithms to generate and two values matrix according to key
The two-dimentional cipher key matrix of matching.
Encrypting module 430, is carried out for the element of the element of two values matrix and two-dimentional cipher key matrix to be corresponded
XOR encrypted after image in 2 D code.
In one embodiment, as shown in figure 15, two-dimentional cipher key matrix generation module 420 includes：
Chaotic key sequence generating unit 421, for generating chaotic key sequence using Z mapping algorithms according to key
Row.
One-dimensional two-value key sequence signal generating unit 422, for chaotic key is Sequence Transformed for one-dimensional two-value key
Sequence.
Two-dimentional cipher key matrix signal generating unit 423, for one-dimensional two-value key sequence to be converted into two-dimentional key square
Battle array.
In one embodiment, chaotic key sequence generating unit 421 is additionally operable to according to formulaObtain by x with cipher key calculationnChaotic key sequence [the x of compositionb,xb+1…xb+M×N-1],
Wherein x0For the initial parameters, b≤n≤b+M × N-1,0≤b, M are the length of the two values matrix, N
For the width of the two values matrix.
One-dimensional two-value key sequence signal generating unit 422 is additionally operable to according to formulaWherein
0 ＜ a ＜ 1, by chaotic key sequence [xb,xb+1…xb+M×N-1] it is converted into one-dimensional two-value key sequence
[yb,yb+1…yb+M×N-1]。
Two-dimentional cipher key matrix signal generating unit 423 is additionally operable to the default transformation rule of basis by one-dimensional two-value key sequence
[yb,yb+1…yb+M×N-1] it is converted into the two-dimentional cipher key matrix of M × N.
In one embodiment, the number of bits of initial value Z is more than the first predetermined threshold value, initial parameters
Scale is more than the second predetermined threshold value.
In one embodiment, as shown in figure 16, there is provided a kind of device of two-value image in 2 D code decryption,
Including：
Decryption processing module 510, for obtaining the image in 2 D code of encryption, according to the Quick Response Code figure of the encryption
As generate encryption two values matrix, obtain encryption image in 2 D code matching key, key include initial value Z and
Initial parameters, wherein initial value Z are more than 1, and initial parameters are between zero and one.
The two-dimentional cipher key matrix generation module 520 of decryption, for being generated and encryption using Z mapping algorithms according to key
The two-dimentional cipher key matrix of two values matrix matching.
Deciphering module 530, for the element of the element of encryption two values matrix and two-dimentional cipher key matrix to be corresponded
Carry out the image in 2 D code after XOR is decrypted.
In one embodiment, as shown in figure 17, decrypting two-dimentional cipher key matrix generation module 520 includes：
Decryption chaotic key sequence generating unit 521, it is close for generating chaos using Z mapping algorithms according to key
Key sequence.
One-dimensional two-value key sequence signal generating unit 522 is decrypted, for chaotic key is Sequence Transformed for one-dimensional two-value
Key sequence.
The two-dimentional cipher key matrix signal generating unit 523 of decryption, for one-dimensional two-value key sequence to be converted into two-dimentional key
Matrix.
In one embodiment, decrypt chaotic key sequence generating unit 521 to be additionally operable to according to formulaObtain by x with cipher key calculationnChaotic key sequence [the x of compositionb,xb+1…xb+M×N-1],
Wherein x0For initial parameters, b≤n≤b+M × N-1,0≤b, M is the length of two values matrix, and N is two-value
The width of matrix.
Decrypt one-dimensional two-value key sequence signal generating unit 522 to be additionally operable to according to formulaWherein
0 ＜ a ＜ 1, by the chaotic key sequence [xb,xb+1…xb+M×N-1] it is converted into one-dimensional two-value key sequence
[yb,yb+1…yb+M×N-1]。
The two-dimentional cipher key matrix signal generating unit 523 of decryption is additionally operable to the default transformation rule of basis by the one-dimensional two-value
Key sequence [yb,yb+1…yb+M×N-1] it is converted into the two-dimentional cipher key matrix of M × N.
In one embodiment, the number of bits of initial value Z is more than the first predetermined threshold value, initial parameters
Scale is more than the second predetermined threshold value.
One of ordinary skill in the art will appreciate that all or part of flow process in above-described embodiment method is realized,
Computer program be can be by instruct the hardware of correlation to complete, described program can be stored in a computer
In read/write memory medium, such as in the embodiment of the present invention, the program can be stored in the storage of computer system and be situated between
In matter, and by least one of computer system computing device, to realize including such as above-mentioned each method
Embodiment flow process.Wherein, the storage medium can be magnetic disc, CD, read-only memory
(Read-Only Memory, ROM) or random access memory (Random Access Memory, RAM)
Deng.
Each technical characteristic of embodiment described above can be combined arbitrarily, not right to make description succinct
The all possible combination of each technical characteristic in above-described embodiment is all described, as long as however, these skills
There is no contradiction in the combination of art feature, be all considered to be the scope of this specification record.
Embodiment described above only expresses the several embodiments of the present invention, and its description is more concrete and detailed,
But can not therefore be construed as limiting the scope of the patent.It should be pointed out that for this area
For those of ordinary skill, without departing from the inventive concept of the premise, some deformations can also be made and changed
Enter, these belong to protection scope of the present invention.Therefore, the protection domain of patent of the present invention should be with appended power
Profit requires to be defined.
Claims (16)
1. a kind of method that two-value image in 2 D code is encrypted, methods described includes：
Image in 2 D code is obtained, two values matrix is generated according to the image in 2 D code；
Key is obtained, the key includes initial value Z and initial parameters, and wherein initial value Z is more than 1, starting
Parameter is between zero and one；
The two-dimentional cipher key matrix matched with the two values matrix is generated using Z mapping algorithms according to the key；
The element one-to-one corresponding of the element of the two values matrix and two-dimentional cipher key matrix is carried out into XOR to be encrypted
Image in 2 D code afterwards.
2. method according to claim 1, it is characterised in that described to be reflected using Z according to the key
Penetrating the step of algorithm generates the two-dimentional cipher key matrix matched with the two values matrix includes：
Chaotic key sequence is generated using Z mapping algorithms according to the key；
The chaotic key is Sequence Transformed for one-dimensional two-value key sequence；
The one-dimensional two-value key sequence is converted into the two-dimentional cipher key matrix.
3. method according to claim 2, it is characterised in that described to be reflected using Z according to the key
Penetrating the step of algorithm generates chaotic key sequence includes：
According to formulaObtain by x with cipher key calculationnThe chaotic key sequence of composition
[xb,xb+1…xb+M×N-1], wherein x0For the initial parameters, b≤n≤b+M × N-1,0≤b, M are described
The length of two values matrix, N is the width of the two values matrix；
It is described by the chaotic key it is Sequence Transformed for one-dimensional two-value key sequence the step of include：
According to formula Wherein 0 ＜ a ＜ 1, by the chaotic key sequence [xb,xb+1…xb+M×N-1]
It is converted into one-dimensional two-value key sequence [yb,yb+1…yb+M×N-1]；
It is described to be the step of the one-dimensional two-value key sequence is converted into the two-dimentional cipher key matrix：According to pre-
If transformation rule is by the one-dimensional two-value key sequence [yb,yb+1…yb+M×N-1] it is converted into the two-dimentional key of M × N
Matrix.
4. method according to claim 1, it is characterised in that the number of bits of the initial value Z
More than the first predetermined threshold value, the scale of the initial parameters is more than the second predetermined threshold value.
5. a kind of method that two-value image in 2 D code is decrypted, methods described includes：
The image in 2 D code of encryption is obtained, encryption two values matrix is generated according to the image in 2 D code of the encryption；
The key of the image in 2 D code matching of the encryption is obtained, the key includes initial value Z and starting ginseng
Number, wherein initial value Z is more than 1, and initial parameters are between zero and one；
The two-dimentional key square matched with the encryption two values matrix is generated using Z mapping algorithms according to the key
Battle array；
The element one-to-one corresponding of the element of the encryption two values matrix and two-dimentional cipher key matrix is carried out into XOR to obtain
Image in 2 D code after decryption.
6. method according to claim 5, it is characterised in that described to be reflected using Z according to the key
Penetrating the step of algorithm generates the two-dimentional cipher key matrix matched with the encryption two values matrix includes：
Chaotic key sequence is generated using Z mapping algorithms according to the key；
The chaotic key is Sequence Transformed for one-dimensional two-value key sequence；
The one-dimensional two-value key sequence is converted into the two-dimentional cipher key matrix.
7. method according to claim 6, it is characterised in that described to be reflected using Z according to the key
Penetrating the step of algorithm generates chaotic key sequence includes：
According to formulaObtain by x with cipher key calculationnThe chaotic key sequence of composition
[xb,xb+1…xb+M×N-1], wherein x0For the initial parameters, b≤n≤b+M × N-1,0≤b, M are described
The length of two values matrix, N is the width of the two values matrix；
It is described by the chaotic key it is Sequence Transformed for one-dimensional two-value key sequence the step of include：
According to formula Wherein 0 ＜ a ＜ 1, by the chaotic key sequence [xb,xb+1…xb+M×N-1]
It is converted into one-dimensional two-value key sequence [yb,yb+1…yb+M×N-1]；
It is described to be the step of the one-dimensional two-value key sequence is converted into the two-dimentional cipher key matrix：According to pre-
If transformation rule is by the one-dimensional two-value key sequence [yb,yb+1…yb+M×N-1] it is converted into the two-dimentional key of M × N
Matrix.
8. method according to claim 5, it is characterised in that the number of bits of the initial value Z
More than the first predetermined threshold value, the scale of the initial parameters is more than the second predetermined threshold value.
9. the device that a kind of two-value image in 2 D code is encrypted, it is characterised in that described device includes：
Processing module, for obtaining image in 2 D code, according to the image in 2 D code two values matrix is generated, and is obtained
Key is taken, the key includes initial value Z and initial parameters, and wherein initial value Z is more than 1, and initial parameters exist
Between 0 and 1；
Two-dimentional cipher key matrix generation module, for being generated and described two using Z mapping algorithms according to the key
The two-dimentional cipher key matrix of value matrix matching；
Encrypting module, for by the element of the element of the two values matrix and two-dimentional cipher key matrix correspond into
Row XOR encrypted after image in 2 D code.
10. device according to claim 9, it is characterised in that the two-dimentional cipher key matrix generates mould
Block includes：
Chaotic key sequence generating unit, for generating chaotic key using Z mapping algorithms according to the key
Sequence；
One-dimensional two-value key sequence signal generating unit, for by the chaotic key it is Sequence Transformed for one-dimensional two-value it is close
Key sequence；
Two-dimentional cipher key matrix signal generating unit, it is close for the one-dimensional two-value key sequence to be converted into the two dimension
Key matrix.
11. devices according to claim 10, it is characterised in that the chaotic key sequence generates single
Unit is additionally operable to according to formulaObtain by x with cipher key calculationnThe chaotic key sequence of composition
Row [xb,xb+1…xb+M×N-1], wherein x0For the initial parameters, b≤n≤b+M × N-1,0≤b, M are institute
The length of two values matrix is stated, N is the width of the two values matrix；
The one-dimensional two-value key sequence signal generating unit is additionally operable to according to formula Wherein
0 ＜ a ＜ 1, by the chaotic key sequence [xb,xb+1…xb+M×N-1] it is converted into one-dimensional two-value key sequence
[yb,yb+1…yb+M×N-1]；
The two-dimentional cipher key matrix signal generating unit is additionally operable to the default transformation rule of basis by the one-dimensional two-value key
Sequence [yb,yb+1…yb+M×N-1] it is converted into the two-dimentional cipher key matrix of M × N.
12. devices according to claim 9, it is characterised in that the number of bits of the initial value Z
More than the first predetermined threshold value, the scale of the initial parameters is more than the second predetermined threshold value.
13. a kind of devices of two-value image in 2 D code decryption, it is characterised in that described device includes：
Decryption processing module, for obtaining the image in 2 D code of encryption, according to the image in 2 D code of the encryption
Encryption two values matrix is generated, the key of the image in 2 D code matching of the encryption is obtained, the key is included just
Initial value Z and initial parameters, wherein initial value Z are more than 1, and initial parameters are between zero and one；
The two-dimentional cipher key matrix generation module of decryption, for adopting Z mapping algorithms to generate and institute according to the key
State the two-dimentional cipher key matrix of encryption two values matrix matching；
Deciphering module, for by a pair of the element 1 of the element of the encryption two values matrix and two-dimentional cipher key matrix
The image in 2 D code after XOR is decrypted should be carried out.
14. devices according to claim 13, it is characterised in that the decryption two dimension cipher key matrix life
Include into module：
Decryption chaotic key sequence generating unit, for generating chaos using Z mapping algorithms according to the key
Key sequence；
One-dimensional two-value key sequence signal generating unit is decrypted, for the chaotic key is Sequence Transformed for one-dimensional two
Value key sequence；
The two-dimentional cipher key matrix signal generating unit of decryption, for the one-dimensional two-value key sequence to be converted into described two
Dimension cipher key matrix.
15. devices according to claim 14, it is characterised in that the decryption chaotic key sequence life
It is additionally operable to according to formula into unitObtain by x with cipher key calculationnThe chaos of composition is close
Key sequence [xb,xb+1…xb+M×N-1], wherein x0For the initial parameters, b≤n≤b+M × N-1,0≤b, M are
The length of the two values matrix, N is the width of the two values matrix；
The one-dimensional two-value key sequence signal generating unit of the decryption is additionally operable to according to formula Wherein
0 ＜ a ＜ 1, by the chaotic key sequence [xb,xb+1…xb+M×N-1] it is converted into one-dimensional two-value key sequence
[yb,yb+1…yb+M×N-1]；
The decryption two dimension cipher key matrix signal generating unit is additionally operable to the default transformation rule of basis by the one-dimensional two-value
Key sequence [yb,yb+1…yb+M×N-1] it is converted into the two-dimentional cipher key matrix of M × N.
16. devices according to claim 13, it is characterised in that the binary digit of the initial value Z
Number is more than the first predetermined threshold value, and the scale of the initial parameters is more than the second predetermined threshold value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510727690.5A CN106651734A (en) | 2015-10-30 | 2015-10-30 | Binary two-dimensional code image encryption and decryption method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510727690.5A CN106651734A (en) | 2015-10-30 | 2015-10-30 | Binary two-dimensional code image encryption and decryption method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106651734A true CN106651734A (en) | 2017-05-10 |
Family
ID=58809240
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510727690.5A Pending CN106651734A (en) | 2015-10-30 | 2015-10-30 | Binary two-dimensional code image encryption and decryption method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106651734A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107944527A (en) * | 2017-11-06 | 2018-04-20 | 中国东方电气集团有限公司 | A kind of encryption of anti-fake two-dimension code and coding/decoding method |
| CN109886008A (en) * | 2017-12-06 | 2019-06-14 | 英业达科技有限公司 | Two-dimensional bar code encryption and decryption method |
| CN109981917A (en) * | 2019-01-25 | 2019-07-05 | 佛山市顺德区中山大学研究院 | A kind of image in 2 D code optical encryption method and its system, device, storage medium |
| CN110414243A (en) * | 2018-04-26 | 2019-11-05 | 杭州海康威视数字技术股份有限公司 | A kind of two dimensional code encryption method, device and two dimensional code decryption method, device |
| CN111598197A (en) * | 2020-05-18 | 2020-08-28 | 燕山大学 | QR code encryption and decryption method and system based on wavelet and magic square transformation |
| CN112884104A (en) * | 2021-03-24 | 2021-06-01 | 南通大学 | Commodity anti-counterfeiting two-dimensional code generation method based on chaotic encryption |
| CN113377351A (en) * | 2021-07-05 | 2021-09-10 | 重庆市规划和自然资源信息中心 | Model construction work system for large-scale government affair business |
| US11263416B2 (en) | 2018-02-07 | 2022-03-01 | Beijing Sankuai Online Technology Co., Ltd | Two-dimensional code generation and identification |
| CN114139665A (en) * | 2021-10-14 | 2022-03-04 | 珠海丹德图像技术有限公司 | Anti-counterfeiting embedding method and identification method of negotiable securities, anti-counterfeiting device and negotiable securities |
| CN116776301A (en) * | 2023-08-18 | 2023-09-19 | 北京点聚信息技术有限公司 | Quick traceability management method for electronic seal |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103177281A (en) * | 2013-04-12 | 2013-06-26 | 江苏圆坤二维码研究院有限公司 | Two-dimensional code compiling method |
| CN103310407A (en) * | 2013-06-25 | 2013-09-18 | 兰州交通大学 | Vector geographic space data totally blind watermarking method based on QR code |
| CN103414549A (en) * | 2013-07-16 | 2013-11-27 | 广东工业大学 | QR two-dimensional code binary image partition-based key varying chaotic encryption method |
-
2015
- 2015-10-30 CN CN201510727690.5A patent/CN106651734A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103177281A (en) * | 2013-04-12 | 2013-06-26 | 江苏圆坤二维码研究院有限公司 | Two-dimensional code compiling method |
| CN103310407A (en) * | 2013-06-25 | 2013-09-18 | 兰州交通大学 | Vector geographic space data totally blind watermarking method based on QR code |
| CN103414549A (en) * | 2013-07-16 | 2013-11-27 | 广东工业大学 | QR two-dimensional code binary image partition-based key varying chaotic encryption method |
Non-Patent Citations (4)
| Title |
|---|
| YU XIAOYANG 等: "Research and achievement of QR code encryption based on cellular automata", 《PROCEEDINGS OF 2013 2ND INTERNATIONAL CONFERENCE ON MEASUREMENT, INFORMATION AND CONTROL》 * |
| 周庆 等: "基于Ising模型的QR码加密算法", 《计算机应用》 * |
| 张定会 等: "QR码二值图像混沌加密与解密", 《移动通信》 * |
| 茅耀斌: "基于混沌的图像加密与数字水印技术研究", 《万方数据库-学位论文库》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107944527A (en) * | 2017-11-06 | 2018-04-20 | 中国东方电气集团有限公司 | A kind of encryption of anti-fake two-dimension code and coding/decoding method |
| CN109886008A (en) * | 2017-12-06 | 2019-06-14 | 英业达科技有限公司 | Two-dimensional bar code encryption and decryption method |
| US11263416B2 (en) | 2018-02-07 | 2022-03-01 | Beijing Sankuai Online Technology Co., Ltd | Two-dimensional code generation and identification |
| CN110414243A (en) * | 2018-04-26 | 2019-11-05 | 杭州海康威视数字技术股份有限公司 | A kind of two dimensional code encryption method, device and two dimensional code decryption method, device |
| CN110414243B (en) * | 2018-04-26 | 2020-12-25 | 杭州海康威视数字技术股份有限公司 | Two-dimensional code encryption method and device and two-dimensional code decryption method and device |
| CN109981917B (en) * | 2019-01-25 | 2021-04-06 | 佛山市顺德区中山大学研究院 | Two-dimensional code image optical encryption method and system, device and storage medium thereof |
| CN109981917A (en) * | 2019-01-25 | 2019-07-05 | 佛山市顺德区中山大学研究院 | A kind of image in 2 D code optical encryption method and its system, device, storage medium |
| CN111598197A (en) * | 2020-05-18 | 2020-08-28 | 燕山大学 | QR code encryption and decryption method and system based on wavelet and magic square transformation |
| 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 |
| CN113377351A (en) * | 2021-07-05 | 2021-09-10 | 重庆市规划和自然资源信息中心 | Model construction work system for large-scale government affair business |
| CN114139665A (en) * | 2021-10-14 | 2022-03-04 | 珠海丹德图像技术有限公司 | Anti-counterfeiting embedding method and identification method of negotiable securities, anti-counterfeiting device and negotiable securities |
| CN116776301A (en) * | 2023-08-18 | 2023-09-19 | 北京点聚信息技术有限公司 | Quick traceability management method for electronic seal |
| CN116776301B (en) * | 2023-08-18 | 2023-10-20 | 北京点聚信息技术有限公司 | Quick traceability management method for electronic seal |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106651734A (en) | Binary two-dimensional code image encryption and decryption method and device | |
| Fu et al. | A new chaos‐based color image encryption scheme with an efficient substitution keystream generation strategy | |
| Kang et al. | Color image encryption using pixel scrambling operator and reality-preserving MPFRHT | |
| US10650373B2 (en) | Method and apparatus for validating a transaction between a plurality of machines | |
| US8180048B2 (en) | Method and system for computational transformation | |
| US8533493B1 (en) | Method of securing transmission data | |
| CN107425971A (en) | Terminal and its data method for encryption/decryption and device without certificate | |
| US20020159588A1 (en) | Cryptography with unconditional security for the internet, commercial intranets, and data storage | |
| Zheng et al. | An image encryption algorithm based on multichaotic system and DNA coding | |
| Abdul Hussien et al. | [Retracted] A Secure Environment Using a New Lightweight AES Encryption Algorithm for E‐Commerce Websites | |
| Mohan et al. | Secure visual cryptography scheme with meaningful shares | |
| CN114443718A (en) | Data query method and system | |
| Slimane et al. | Hash key-based image cryptosystem using chaotic maps and cellular automata | |
| Wang et al. | Image encryption algorithm based on bit-level permutation and dynamic overlap diffusion | |
| Mehta et al. | DieRoll: A unique key generation and encryption technique | |
| Ramírez-Torres et al. | Fpga implementation of a reconfigurable image encryption system | |
| US11276138B2 (en) | Image data encryption and rendering system | |
| Abanda et al. | Image encryption with fusion of two maps | |
| CN114257402B (en) | Encryption algorithm determining method, device, computer equipment and storage medium | |
| Li et al. | A novel image protection cryptosystem with only permutation stage: multi-shuffling process | |
| CN107241185A (en) | Data transmitting and receiving method and transmission and reception device | |
| Ahuja et al. | Dual layer secured password manager using Blowfish and LSB | |
| JP2003304237A (en) | Method for creating common key, encryption method using the common key, method for managing common key, method for authentifying solid by solid number of terminal, program for executing these methods, and application software including the program | |
| Rajput et al. | An improved cryptographic technique to encrypt images using extended hill cipher | |
| Hamsanandhini et al. | Securing Data in the Image Using SHA & ECC |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170510 |
|
| RJ01 | Rejection of invention patent application after publication |