CN108573465A - A kind of two-dimensional map group image scrambling method - Google Patents
A kind of two-dimensional map group image scrambling method Download PDFInfo
- Publication number
- CN108573465A CN108573465A CN201710153484.7A CN201710153484A CN108573465A CN 108573465 A CN108573465 A CN 108573465A CN 201710153484 A CN201710153484 A CN 201710153484A CN 108573465 A CN108573465 A CN 108573465A
- Authority
- CN
- China
- Prior art keywords
- mapping
- formula
- image
- folds
- stretches
- 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.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0051—Embedding of the watermark in the spatial domain
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Facsimile Transmission Control (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Storage Device Security (AREA)
Abstract
The present invention provides a kind of two-dimensional map group image scrambling method, belongs to information security field.Main thought is to realize image encryption using the combination of different mappings group come scramble location of pixels.It is first against length and widthNSide figure propose 2 stretching modes:It is diagonally opposed from 2, each row pixel is sequentially inserted between corresponding adjacent row pixel.It is repeatedly inserted into, is sequentially connected, artwork is drawn as growingN 2Straight line.Then it is folded to obtain close figure by 6 folding modes.12 two-dimensional maps can be obtained.Key uses 6 10 system numbers when encryption, according to Selection Strategy, using corresponding two-dimensional map group come scramble image.Inventive algorithm is simple, enciphering rate is fast, can apply in network image encryption, can also be used as other Encryption Algorithm component parts, realize complex encryption.
Description
Technical field
The present invention relates to a kind of two-dimensional map group image scrambling methods, belong to information security field.
Background technology
With the fast development of Internet technology, using portable equipment such as mobile phone, shooting, transmission image are more and more convenient.
For people while frequent use, contact image, hacker is more and more to the malicious attack event of image.Some public figures'
Privacy picture leaks, and puts the cat among the canaries on the net.For ordinary people, how safety of image is ensured, prevent privacy from getting compromised,
Diffusion and particularly significant problem.
The method of traditional protection information is all based on text message design.They are in national economy, social life, national defence
The fields such as military affairs have played important function.But image and text message have the difference of essence, have data volume big, related between pixel
The strong feature of property.Using text encryption technology secrecy image, some objective reality problems can be encountered, as encryption has ignored image
Feature, enciphering rate are slow etc..
Many people use two-dimensional chaotic map encrypted image now.But due to map feature problem, cause key space not
Greatly, cipher round results are affected.The present invention realizes image scrambling using two-dimensional map group, has key space big, safety is higher
The features such as.
Invention content
In view of the above-mentioned problems, the present invention provides a kind of two-dimensional map group image scrambling method.2 stretching sides are described first
Formula.Two from square-shaped image are diagonally opposed, between row pixel is successively sequentially inserted into two pixels of corresponding row, to draw
Stretch image.The process repeatedly, is sequentially connected, and original image is drawn into long for oneN 2Straight line.Then in conjunction with 6 Foldable squares
Formula devises 12 different two-dimensional maps.The a certain number of each mapping corresponding 0 ~ 11.Finally, key designs are based on, are carried
Encryption Algorithm is gone out.Key uses 6 10 system numbers.The sum of 6 numbers are calculated first;Then use key in each digit divided by
Should and, obtained result takes 2 bit flag positions of foremost.According to the numerical value and specific Selection Strategy, corresponding two dimension is selected
Mapping, successively to image into line shuffle.
Wheni=0,…, N-1, j=0,…, N-1, k=0,…,N 2- 1,A(i, j) indicate original image,B(i, j) table
Show encrypted image,L(k) indicate pixel column when, the formula of 12 two-dimensional maps can be expressed as:
Mapping 1 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 1 folds formula:。
Mapping 2 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 2 folds formula:
Mapping 3 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 3 folds formula:
Mapping 4 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 4 folds formula:
Mapping 5 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 5 folds formula:Wheni+j<NWhen,, otherwise
。
Mapping 6 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 6 folds formula:Wheni+j<NWhen,, otherwise
。
Mapping 7 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 7 folds formula:。
Mapping 8 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 8 folds formula:
Mapping 9 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 9 folds formula:
Mapping 10 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 10 folds formula:
Mapping 11 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 11 folds formula:Wheni+j<NWhen,, otherwise
。
Mapping 12 stretches formula:
When, When,
When, When
When, When,
When, When,
Mapping 12 folds formula:Wheni+j<NWhen,, otherwise
。
Encryption Algorithm key (key) use 6 10 system numbers.The sum of 6 numbers are calculated first;Then it uses every in key
One digit number divided by should and, obtained result takes 2 bit flag positions of foremost.According to the numerical value (key') and Selection Strategy, selection
Corresponding two-dimensional map, successively to image into line shuffle.
Mapping Selection Strategy is:
Work as keykey' first indicates that digit is decimal numbernWhen, mapping 1 correspond to number be "n- 1 ", 2 correspondence number of mapping is
“n", mapping 3 correspond to numbers be "n+ 1 ", mapping 4 correspond to numbers be "n+ 2 ", mapping 5 correspond to numbers be "n+ 3 orn- 9 ", mapping 6 corresponds to number
For "n+ 4 orn- 8 ", mapping 7 correspond to numbers be "n+ 5 orn- 7 ", mapping 8 correspond to numbers be "n+ 6 orn- 6 ", mapping 9 correspond to numbers be "n+
7 orn- 5 ", mapping 10 correspond to numbers be "n+ 8 orn- 4 ", mapping 11 correspond to numbers be "n+ 9 orn- 3 ", mapping 12 correspond to numbers be "n-
2”。
Such as primary keykeyFor " 123456 ", the sum of 6 numbers are 21,key' it is " 479514192328 ".First mark
Digit is 4, then it is " 3 " to map 1 to correspond to number, and it is " 4 " that mapping 2, which corresponds to number, and so on.Therefore ciphering process is:Mapping 2, mapping
5, mapping 7, mapping 3, mapping 11, mapping 2, mapping 11, mapping 7, mapping 12, mapping 1, mapping 12, mapping 6.
Decrypting process and ciphering process are symmetrical, and decruption key and encryption key are consistent.
Two-dimensional map group's image scrambling method that the present invention designs is mapped the method for number by increase, increases key
Space enhances the ability for resisting attack.It can apply and encrypt occasion in the network image for having certain security requirement, it can also
As the organic component of other Encryption Algorithm, image scrambling is realized.
Description of the drawings
Fig. 1 two-dimensional map principles;
The example of Fig. 2 two-dimensional maps;
6 kinds of different method for folding of Fig. 3;
Fig. 4 encryption principle figures;
Fig. 5 cipher round results figures;
Fig. 6 adjacent pixel dependency graphs.
Specific implementation mode
Two-dimensional map principle and example are as shown in Figure 1, 2.Regard image as an array, the principle of mapping is from two sides
To between image column pixel is successively sequentially inserted into two pixels of corresponding row, being stretched to image.The process repeatedly,
It is sequentially connected, original image is drawn into long for oneN 2Straight line.
Fig. 2 is by taking one 4 × 4 figure as an example.The pixel of first row from left to right is inserted into the first row from top to bottom first
Pixel between, such as (1,0) be inserted into (0,0), between (0,1), (2,0) be inserted into (0,1), between (0,2), (3,0) are inserted into
(0,2), between (0,3), between the pixel of first row from right to left is then inserted into the pixel of the first row from top to bottom, i.e.,
(2,3) are inserted between (3,2) and (3,3), and (1,3) is inserted into (3,1), between (3,2) ....It repeats the above process, it is former
Image is drawn into as a pixel column straight line:(0,0)、(1,0)、(0,1)、(2,0)、(0,2)、(3,0)、(0,3)…(3,
1)、(1,3)、(3,2)、(2,3)、(3,3).According to the difference in direction, 2 different pixel column drawing process can be constituted.
Folding operation is carried out to pixel column using the method for folding of Fig. 3.Such as Fig. 3 (a) is used to fold epimere example, just obtained
Fig. 2.Due to there is 2 kinds of different drawing process, in addition 6 kinds of different method for folding, therefore 12 differences can be constituted altogether
Two-dimensional map.Its calculation formula is obtained, as mentioned before.
Encryption principle is as shown in Figure 4.Using this 12 two-dimensional map scramble image pixels, encryption key is correspondence mappings
Map number.
Scrambling encryption is carried out to image using mapping, cipher round results are as shown in Figure 5.Fig. 5 (a) is original image, this is one
The lena of 256 × 256 8 gray scales schemes.Fig. 5 (b) be key be " 123456 " when cipher round results.It can be seen that image is
It can not recognize.The procedure simulation being not optimised shows algorithm for encryption and decryption speed in 1MB/S or so (CPU Intel ' s
Core i5 1.6Ghz memory 4G operating systems are Windows 10)).
Its safety is theoretically analyzed again.Adjacent pixel dependency graph when Fig. 6 is artwork and key is " 123456 ".
It can be seen that by encryption, the correlation between image adjacent pixel has obtained thorough destruction.Calculation shows that between adjacent pixel
(explanation of numerical value 1 is perfectly correlated to related coefficient, and the explanation of numerical value 0 is complete uncorrelated pass, therebetween, phase is got over closer to 1
Close), horizontal direction becomes 0.0001 from 0.9442, vertically becomes 0.0043 to from 0.9711, and diagonal is from 0.9187
Become 0.0041.
Another indexr-mCorrelation, as shown in the table:
It can be seen that after encryption, the degree of correlation of pixel reduces 70% or so in pixel adjacent area.Illustrate image scrambling
Effect is good, and original feature is evenly distributed on Mi Tuzhong.
Claims (2)
1. a kind of two-dimensional map group image scrambling method, it is characterised in that:Thought is folded and stretched using image, devises 12
Different two-dimensional maps.Wheni=0, ..., N-1, j=0, ..., N-1, k=0,...,N 2- 1,A(i, j) indicate original graph
Picture,B(i, j) indicate encrypted image,L(k) indicate pixel column when, the formula of each two-dimensional map can be expressed as:
Mapping 1 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 1 folds formula:
Mapping 2 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 2 folds formula:
Mapping 3 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 3 folds formula:
Mapping 4 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 4 folds formula:
Mapping 5 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 5 folds formula:Wheni+j<NWhen,, otherwise
。
Mapping 6 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 6 folds formula:Wheni+j<NWhen,, otherwise
Mapping 7 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 7 folds formula:
Mapping 8 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 8 folds formula:
Mapping 9 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 9 folds formula:
Mapping 10 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 10 folds formula:
Mapping 11 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 11 folds formula:Wheni+j<NWhen,, otherwise
Mapping 12 stretches formula:
Wheni+j<N, i>jWhen,
Wheni+j<N, i≤jWhen,
Wheni+j≥N, i<jWhen,
Wheni+j≥N, i≥jWhen,
Mapping 12 folds formula:Wheni+j<NWhen,, otherwise
。
2. a kind of two-dimensional map group image scrambling method according to claim 1, it is characterised in that:Key uses 6 10
System number.The sum of 6 numbers are calculated first;Then use key in each digit divided by should and, obtained result takes the 2 of foremost
Bit flag position.According to the numerical value and specific Selection Strategy, selects corresponding two-dimensional map group to close, image pixel is set
Disorderly.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710153484.7A CN108573465A (en) | 2017-03-15 | 2017-03-15 | A kind of two-dimensional map group image scrambling method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710153484.7A CN108573465A (en) | 2017-03-15 | 2017-03-15 | A kind of two-dimensional map group image scrambling method |
Publications (1)
Publication Number | Publication Date |
---|---|
CN108573465A true CN108573465A (en) | 2018-09-25 |
Family
ID=63575750
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710153484.7A Withdrawn CN108573465A (en) | 2017-03-15 | 2017-03-15 | A kind of two-dimensional map group image scrambling method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108573465A (en) |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101604439A (en) * | 2008-06-13 | 2009-12-16 | 西北工业大学 | A kind of color image encrypting method based on multi-chaos system |
CN104680475A (en) * | 2015-02-27 | 2015-06-03 | 柳州职业技术学院 | Image hybrid encrypting method based on hyperchaotic system |
US20160350891A1 (en) * | 2015-05-28 | 2016-12-01 | The Boeing Company | Concealing Data Within Images |
CN106339976A (en) * | 2016-08-16 | 2017-01-18 | 广东工业大学 | Encryption method |
-
2017
- 2017-03-15 CN CN201710153484.7A patent/CN108573465A/en not_active Withdrawn
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101604439A (en) * | 2008-06-13 | 2009-12-16 | 西北工业大学 | A kind of color image encrypting method based on multi-chaos system |
CN104680475A (en) * | 2015-02-27 | 2015-06-03 | 柳州职业技术学院 | Image hybrid encrypting method based on hyperchaotic system |
US20160350891A1 (en) * | 2015-05-28 | 2016-12-01 | The Boeing Company | Concealing Data Within Images |
CN106339976A (en) * | 2016-08-16 | 2017-01-18 | 广东工业大学 | Encryption method |
Non-Patent Citations (2)
Title |
---|
李娟,冯勇,杨旭强, 黄峰: "可逆映射集合的图像加密算法", 《光电子 激光》 * |
黄峰,冯勇: "一种对角线拉伸的混沌映射图像加密算法", 《光电子 激光》 * |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Laskar et al. | High Capacity data hiding using LSB Steganography and Encryption | |
Fu et al. | A novel chaos-based bit-level permutation scheme for digital image encryption | |
Chen et al. | Cryptanalysis and improvement in an image encryption scheme using combination of the 1D chaotic map | |
CN107274457B (en) | The encryption method of double color images based on DNA sequence dna operation and Coupling Deformation image grid | |
CN104680476B (en) | The lossless encryption method of coloured image based on two-dimensional discrete wavelet conversion and space-time chaos | |
Yu et al. | Differential cryptanalysis of image cipher using block-based scrambling and image filtering | |
CN102982499A (en) | Color image encryption and decryption method based on multiple-fractional-order chaotic systems | |
Seth et al. | Security enhancement: combining cryptography and steganography | |
CN103167213A (en) | Digital image encryption method based on Cat mapping and hyper-chaos Lorenz system | |
Rajput et al. | Towards the growth of image encryption and authentication schemes | |
Zhang | Plaintext related image encryption scheme using chaotic map | |
Kaur et al. | Image encryption techniques: a selected review | |
CN107911572A (en) | The image encryption method of logistic chaos system is improved based on fractional fourier transform | |
Hussain et al. | A novel algorithm for thermal image encryption | |
Qaid et al. | Encryption and Decryption of Digital Image Using Color Signal | |
Kumar et al. | Image encryption using simplified data encryption standard (S-DES) | |
Auyporn et al. | A robust image encryption method based on bit plane decomposition and multiple chaotic maps | |
Shraida et al. | An Efficient Color-Image Encryption Method Using DNA Sequence and Chaos Cipher | |
CN108573465A (en) | A kind of two-dimensional map group image scrambling method | |
Adedokun et al. | A secure chaotic framework for medical image encryption using a 3D logistic map | |
Chen et al. | Selective region medical image encryption algorithm based on cascade chaos and two-dimensional Joseph traversal | |
CN108629724B (en) | Novel three-dimensional mapping image encryption method | |
Gunasekaran et al. | Encrypting and decrypting image using computer visualization techniques | |
Jagadeesh et al. | A new image scrambling scheme through chaotic permutation and geometric grid based noise induction | |
Zhang | Encryption speed improvement on “an improvement over an image encryption method based on total shuffling” |
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 | ||
WW01 | Invention patent application withdrawn after publication | ||
WW01 | Invention patent application withdrawn after publication |
Application publication date: 20180925 |