CN108229194A - Method for Digital Image Scrambling based on multithreading model and multistage scramble - Google Patents
Method for Digital Image Scrambling based on multithreading model and multistage scramble Download PDFInfo
- Publication number
- CN108229194A CN108229194A CN201810063188.2A CN201810063188A CN108229194A CN 108229194 A CN108229194 A CN 108229194A CN 201810063188 A CN201810063188 A CN 201810063188A CN 108229194 A CN108229194 A CN 108229194A
- Authority
- CN
- China
- Prior art keywords
- scramble
- bit
- image
- level
- planes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention belongs to image encryption technical fields, are related to the digital image encryption method of multithreading model, Information hiding and multistage scramble.Make full use of Pixel-level and the advantage of bit-level scramble, different bit-level shuffle operations are placed in different threads and concurrently run, the characteristics of reducing the speed of service of bit-level scramble, and combining Pixel-level scramble, devises the digital Image Scrambling framework based on multithreading model and multistage scramble.This disorder method can be embedded in the scramble stage of any resume image.Compared to traditional disorder method, this method can significantly change the demographic information of plaintext in the scramble stage, and with the characteristics of safe, timeliness is preferable.
Description
Technical field
The invention belongs to image encryption technical fields, are related to the number of multithreading model, Information hiding and multistage scramble
Image encryption method.
Background technology
1997, American researcher Jiri Fridrich were put forward for the first time the scramble diffusion frame of digital image encryption,
That is Confusion-Diffusion frames.In this frame, digital image encryption algorithm is divided into two during execution
A relatively independent stage, i.e. scramble stage and diffusion phase.In the scramble stage, all pixels point of image is arranged again
Row, the relative position of pixel changes, and the value of pixel does not change.In diffusion phase, Encryption Algorithm system
Change the value of each pixel.In recent years, almost all of digital image encryption algorithm is based on scramble diffusion frame.
Scrambling algorithm as the core algorithm of Digital Image Encryption System, causes the wide of numerous researchers in recent years
General concern, and obtained significant progress.A series of scrambling algorithms are successively proposed, such as the ranks based on sequence exchange scramble
Algorithm, the scrambling algorithm based on various two-dimensional chaotic maps, scrambling algorithm based on three-dimensional invertible mapping etc..However these scrambles
Algorithm can not still solve that scramble is insufficient, can not change the problems such as plaintext demographic information and execution efficiency are slow.In order to
Solve the above problems, shuffle operation is introduced into bit-level matrix by researcher, i.e., by the variation of microcosmic upper bit position come
Change the value of macroscopically pixel.However, bit-level scramble being multiplied due to scramble plane, when needing more to run
Between.The location matrix of pixel can be encrypted in Pixel-level scramble, and bit-level scramble is intended to change pixel simultaneously
Position and value.Pixel-level scrambling algorithm can quickly perform shuffle operation, but its scrambling effect is poor, and can not change in plain text
Demographic information.Bit-level scramble can solve the problems, such as Pixel-level scramble, but implementation procedure is complex and operation is fast
Degree is slower.After different stage scramble is considered for the influence of ciphertext, the present invention proposes one and considers Pixel-level
With the scrambling algorithm of bit-level feature.
Multi-core CPU's popularizes the basis that hardware is provided for concurrent operation.The present invention has fully considered bottom in design
The characteristics of layer hardware platform, and devise the Digital Image Scrambling Algorithm based on multithreading model and multistage scramble.This algorithm can
To operate in different multithreading platforms, such as Windows SDK thread libraries and POSIX Thread thread libraries.
Invention content
In order to make full use of the advantage of Pixel-level and bit-level scramble, different bit-level shuffle operations are placed in different lines
The characteristics of concurrently being run in journey, reducing the speed of service of bit-level scramble, and combine Pixel-level scramble, devises based on multithreading
The digital Image Scrambling framework of model and multistage scramble.
The technical scheme is that：
Method for Digital Image Scrambling based on multithreading model and multistage scramble, includes the following steps：
Step 1 carries out a Three Channel Color image separation of Color Channel, obtains tri- single channel figures of B, G, R
Picture, then respectively these three single channel images are carried out with the division of bit-level, every width figure is divided into 8 bit-planes, is obtained
24 bianry images；
Step 2 distributes a thread for each bit-planes, enables each bit-planes independent on respective thread
Bit-level shuffle operation is performed, multiple threads concurrently perform；After the completion of the scrambling process, obtain the bit-level after 24 scrambles and put
Disorderly figure, first order scramble terminate；
Step 3, second level scramble are completed in pixel scale；Bit-level plane after 24 scrambles is reduced to as B, G, R
The single channel image of three components, and then Pixel-level scramble is carried out to three single channel images, Second-scrambling terminates at this time；
Three single channel images after scramble are merged into a Three Channel Color image by step 4, are obtained at this time final
Scramble image.
Further, in above-mentioned steps two, according to target image characteristics, the bit-planes of each single channel image are divided into
Just two groups；For higher bit plane, the mapping ruler in scramble is changed jointly by Two Dimensional Chaotic Systems and one-dimensional chaos system
In generation, obtains；For low bit plane, two-dimensional random mapping scramble is only carried out.
Above-mentioned Two Dimensional Chaotic Systems use cat map two dimension disorder methods；One-dimensional chaos system uses logistic
The one-dimensional disorder methods of map.
The above method further includes decrypting process, is the inverse process of scrambling encryption process：Color is carried out to ciphertext image first
Channel separation obtains tri- single channel images of B, G, R, then carries out the contrary operation of Pixel-level scramble, reduces two level at this time and puts
Disorderly；And then the division of bit-planes is carried out to B, G, R, obtain 24 bit-planes；A line is distributed for each bit-planes
Journey, each bit-planes independently perform scramble restoring operation on respective thread, and multiple threads concurrently perform；It obtains at this time
24 bit-planes are original bianry image, are merged, and 3 obtained channel images are the original graph after decrypting
Picture.
Beneficial effects of the present invention are, by considering the reapective features of Pixel-level scramble and bit-level scramble, we
Method devises a kind of multistage disorder method based on multithreading.This disorder method can be embedded in any resume image
The scramble stage.Compared to traditional disorder method, this method can significantly change the demographic information of plaintext, and have in the scramble stage
It is safe, the characteristics of timeliness is preferable.
Description of the drawings
Fig. 1 is 8 bit-planes of blue channel image, and (a)~(h) is from high to low.
Fig. 2 is 8 bit-planes of green channel images, and (a)~(h) is from high to low.
Fig. 3 is 8 bit-planes of red channel image, and (a)~(h) is from high to low.
Fig. 4 is the digital image encryption flow chart based on multithreading model and multistage scramble.
Fig. 5 is that the digital picture based on multithreading model and multistage scramble reduction decrypts flow chart.
Fig. 6 is scramble image histogram；(a) channel B, (b) G channels, (c) R channels.
Specific embodiment
1. General Implementing principle and detailed step
This method is based on multithreading model, for 24 bit-planes marked off by a Three Channel Color image, is
Each bit-planes distribute a thread, and each plane independently executes shuffle operation on respective thread, makes this few thread
It concurrently performs, to image Parallel Processing, to improve the efficiency of algorithm.
Step 1:The coloured image of 3 channels is read, Color Channel lock out operation is carried out to the image, obtains 3 lists
Channel image B, G, R, then this 3 single channel images are carried out with the division of bit-planes, obtain 24 bit-planes (i.e. 24 two
It is worth image).
Step 2:High 4 bit-planes for each single channel image distribute a thread, and each plane is in respective thread
On independently execute shuffle operation, multiple threads concurrently perform.Concrete operations are as follows：
(1) 12 threads are generated, are that high 4 bit-planes of each single channel image distribute a thread, 12 threads are simultaneously
Hair performs, while carries out shuffle operation to image；
(2) in each thread function, first the bit-planes is carried out with two-dimensional random mapping scramble, is used here
It is cat map two dimension disorder methods：The pixel value of bianry image is mapped to one by one in a two-dimensional array, utilizes two parameters
P and q (p, q<Image_size the destination locations of mapping) are determined, pixel are mapped to destination locations from original position, by changing
Become the relative position of pixel to achieve the effect that scramble.The two-dimensional array catmapArr after scramble is obtained at this timem(m is represented not
With bit-planes), the pixel value in the corresponding bianry image of each point in array；
(3) using one-dimensional random mapping scramble generate with the big array such as current bit plane, in array numerical values recited with
Machine, here using the one-dimensional scrambles of logistic map:Recurrence generates xiValue, initial value x0Value for secret key key；And then
Obtained one-dimensional random array is converted into corresponding two-dimensional array logisticArrm(with catmapArrmDeng big)；
(4) is by logisticArrmWith catmapArrmThe pixel value of corresponding position performs exclusive or behaviour in two two-dimensional arrays
Make, be as a result stored in two-dimensional array afterConfsuionmIn, the numerical value in the array is the pixel value of image after scramble.
afterConfsuionm(i, j)=logisticArrm(i,j)⊕catmapArrm(i,j)；
(5) by the two-dimensional array afterConfsuion in each thread functionmMiddle pixel value reverts to bianry image
The scramble to higher bit plane is completed in corresponding position at this time；
(6) after 12 parallel threads all perform, thread handle object is closed.
Step 3:Low 4 bit-planes for each single channel image distribute a thread, and each plane is in respective thread
On independently execute shuffle operation, multiple threads concurrently perform.Concrete operations are as follows：
(1) 12 threads are generated, are that low 4 bit-planes of each single channel image distribute a thread, 12 threads are simultaneously
Hair performs, while carries out shuffle operation to image；
(2) in each thread function, to the bit-planes carry out two-dimensional random mapping scramble, here using
Cat map two-dimensional randoms map disorder method, obtain the two-dimensional array low_catmapArr after scramblem；
(3) by the two-dimensional array low_catmapArr in each thread functionmIn pixel value revert to bianry image
Corresponding position, complete the scramble to low bit plane at this time；
(4) after 12 parallel threads all perform, thread handle object is closed；
At this point, level-one scramble terminates, the bit-planes after 24 scrambles are obtained.
Step 4:Bit-planes after 24 scrambles are merged into 3 single channel images, at this time based on three pixel fractions
Plane is measured, Second-scrambling is performed, using two-dimentional scramble sorting-based permutation methods.
Step 5:3 single channel images after Second-scrambling are merged into 3 channel images, and be written in file.
2. algorithm is analyzed by taking related coefficient as an example
Image after scrambling encryption is divided into 3 single channel images B, G, R, water is carried out to this 3 single channel images respectively
Flat correlation, vertical correlation and diagonal correlation analysis.
Image neighbor pixel relative coefficient after 1 scramble of table
It can be seen that by above-mentioned test result, the relative coefficient of the various aspects of image is all declined or even leveled off to
Zero, it can be inferred that：The multistage disorder method of the present invention has reached ideal effect, and multistage scramble causes the logic of image
Correlation is thoroughly disturbed.
3. algorithm is analyzed by taking block diagram as an example
Image after scrambling encryption is divided into 3 single channel images B, G, R, these three single channel images are drawn respectively
Block diagram is simultaneously analyzed
From the point of view of Fig. 6 histogram analysis, the number of each pixel value substantially in the same horizontal line, manage by scrambling effect
Think.
4. algorithm is analyzed by taking comentropy as an example
Image after scrambling encryption is divided into 3 single channel images B, G, R, letter is carried out to this 3 single channel images respectively
Cease the calculating of entropy
2 scramble figure of table thinks the Analysis of Entropy
| Channel B | G channels | R channels | |
| Comentropy | 7.957353520517321 | 7.987688899393857 | 7.965938174720284 |
Comentropy refers to the chaotic degree of information；Above-mentioned test data is observed, the letter of the image after scrambling encryption
Breath entropy dramatically increases, and for entropy close to ideal value 8, the effect of scramble is preferable.
5. algorithm is analyzed by taking the scrambling algorithm handling capacity as an example
Handling capacity according to program is：Throughput=142.513K/s.
In conclusion original scrambling algorithm has integrally carried out level-one scramble just for image.And the present invention by its from
Level-one scramble has risen to multistage scramble, considerably increases the safety of hiding information；And multithreading model is employed to realize,
The execution efficiency of algorithm is improved again.Therefore, this method can preferably be used for the Information hiding of information security field, encryption passes
The application processes such as defeated.
Claims (4)
1. the Method for Digital Image Scrambling based on multithreading model and multistage scramble, which is characterized in that include the following steps：
Step 1 carries out a Three Channel Color image separation of Color Channel, obtains tri- single channel images of B, G, R, then
Respectively these three single channel images are carried out with the division of bit-level, every width figure is divided into 8 bit-planes, is obtained 24 two
It is worth image；
Step 2 distributes a thread for each bit-planes, each bit-planes is enabled to be independently executed on respective thread
Bit-level shuffle operation, multiple threads concurrently perform；After the completion of the scrambling process, the bit-level scramble after 24 scrambles is obtained
Figure, first order scramble terminate；
Step 3, second level scramble are completed in pixel scale；Bit-level plane after 24 scrambles is reduced to as B, G, R tri-
The single channel image of component, and then Pixel-level scramble is carried out to three single channel images, Second-scrambling terminates at this time；
Three single channel images after scramble are merged into a Three Channel Color image, obtain final put at this time by step 4
Random image.
2. the Method for Digital Image Scrambling according to claim 1 based on multithreading model and multistage scramble, feature exist
In in step 2, according to target image characteristics, the bit-planes of each single channel image are divided into two groups of height；For high ratio
Special plane, the mapping ruler in scramble are obtained by Two Dimensional Chaotic Systems and one-dimensional chaos system common iterations；For low bit
Plane only carries out two-dimensional random mapping scramble.
3. the Method for Digital Image Scrambling according to claim 2 based on multithreading model and multistage scramble, feature exist
In the Two Dimensional Chaotic Systems use cat map two dimension disorder methods；One-dimensional chaos system is one-dimensional using logistic map
Disorder method.
4. the Method for Digital Image Scrambling based on multithreading model and multistage scramble according to claims 1 or 2 or 3,
It is characterized in that, further includes decrypting process, be the inverse process of scrambling encryption process：Color Channel point is carried out to ciphertext image first
From obtaining tri- single channel images of B, G, R, then carry out the contrary operation of Pixel-level scramble, reduce Second-scrambling at this time；And then
The division of bit-planes is carried out to B, G, R, obtains 24 bit-planes；A thread is distributed for each bit-planes, each
Bit-planes independently perform scramble restoring operation on respective thread, and multiple threads concurrently perform；24 ratios obtained at this time
Special plane is original bianry image, is merged, and 3 obtained channel images are the original image after decrypting.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810063188.2A CN108229194B (en) | 2018-01-18 | 2018-01-18 | Digital image scrambling method based on multi-thread model and multi-level scrambling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810063188.2A CN108229194B (en) | 2018-01-18 | 2018-01-18 | Digital image scrambling method based on multi-thread model and multi-level scrambling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108229194A true CN108229194A (en) | 2018-06-29 |
| CN108229194B CN108229194B (en) | 2019-12-17 |
Family
ID=62668545
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810063188.2A Expired - Fee Related CN108229194B (en) | 2018-01-18 | 2018-01-18 | Digital image scrambling method based on multi-thread model and multi-level scrambling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108229194B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109104544A (en) * | 2018-08-07 | 2018-12-28 | 东北大学 | A kind of New chaotic image encryption method synchronous based on complex network |
| CN111461951A (en) * | 2020-03-30 | 2020-07-28 | 三维通信股份有限公司 | Color image encryption method, device, computer equipment and readable storage medium |
| WO2021016923A1 (en) * | 2019-07-31 | 2021-02-04 | 东北大学 | Data enhancement method employing bit plane separation and recombination |
| CN113852456A (en) * | 2021-09-23 | 2021-12-28 | 安徽理工大学 | Image encryption system based on Matlab chaotic mapping and feature extraction |
| CN114119417A (en) * | 2021-11-26 | 2022-03-01 | 北京中电普华信息技术有限公司 | Image processing method, system and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060126890A1 (en) * | 2002-12-17 | 2006-06-15 | Yun-Qing Shi | Methods and apparatus for lossless data hiding |
| CN107563950A (en) * | 2017-09-08 | 2018-01-09 | 东北大学 | A kind of safe and efficient digital image encryption method |
-
2018
- 2018-01-18 CN CN201810063188.2A patent/CN108229194B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060126890A1 (en) * | 2002-12-17 | 2006-06-15 | Yun-Qing Shi | Methods and apparatus for lossless data hiding |
| CN107563950A (en) * | 2017-09-08 | 2018-01-09 | 东北大学 | A kind of safe and efficient digital image encryption method |
Non-Patent Citations (1)
| Title |
|---|
| ZHI-LIANG ZHU 等: "a chaos-based symmetric image scheme using a bit-level permutation", 《INFORMATION SCIENCES》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109104544A (en) * | 2018-08-07 | 2018-12-28 | 东北大学 | A kind of New chaotic image encryption method synchronous based on complex network |
| CN109104544B (en) * | 2018-08-07 | 2020-09-22 | 东北大学 | Chaotic image encryption method based on complex network synchronization |
| WO2021016923A1 (en) * | 2019-07-31 | 2021-02-04 | 东北大学 | Data enhancement method employing bit plane separation and recombination |
| CN111461951A (en) * | 2020-03-30 | 2020-07-28 | 三维通信股份有限公司 | Color image encryption method, device, computer equipment and readable storage medium |
| CN111461951B (en) * | 2020-03-30 | 2023-10-31 | 三维通信股份有限公司 | Color image encryption method, apparatus, computer device, and readable storage medium |
| CN113852456A (en) * | 2021-09-23 | 2021-12-28 | 安徽理工大学 | Image encryption system based on Matlab chaotic mapping and feature extraction |
| CN114119417A (en) * | 2021-11-26 | 2022-03-01 | 北京中电普华信息技术有限公司 | Image processing method, system and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108229194B (en) | 2019-12-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108229194A (en) | Method for Digital Image Scrambling based on multithreading model and multistage scramble | |
| Wang et al. | Fast image encryption algorithm based on parallel computing system | |
| Liu et al. | Reversible data-hiding in encrypted images by redundant space transfer | |
| Song et al. | A parallel image encryption algorithm using intra bitplane scrambling | |
| Zhu et al. | A chaos-based symmetric image encryption scheme using a bit-level permutation | |
| Chen et al. | A color image encryption algorithm based on 2D-CIMM chaotic map | |
| CN106296560A (en) | A kind of multicolor image encryption algorithm of complex cascade chaos | |
| CN103530571A (en) | Image encryption method based on sine mapping and Logistic chaos sequence | |
| CN103455971A (en) | Image encryption method combining three-dimensional Arnold transformation with chaotic sequence | |
| CN104008520A (en) | Color image encryption method based on SHA-384 function, spatiotemporal chaotic system, quantum chaotic system and neural network | |
| CN102779351A (en) | Interactive grayscale image colorizing method based on local linear model optimization | |
| CN106558015B (en) | Novel cross composite chaotic color image encryption algorithm | |
| Li et al. | A block-based quantum image scrambling for GNEQR | |
| CN111105338A (en) | Image encryption method based on GAN and chaotic system | |
| CN104050617B (en) | Image encryption method based on Liu chaos systems | |
| CN107590394A (en) | A kind of image encryption method based on chaotic maps and bit recombination | |
| Qin et al. | A novel steganography for spatial color images based on pixel vector cost | |
| CN107833174A (en) | A kind of image encryption method based on Logistic chaos system algorithms | |
| CN112800444A (en) | Color image encryption method based on two-dimensional chaotic mapping | |
| CN109286819A (en) | Combine explicit image encryption, decryption method and the device of compression | |
| CN105046632A (en) | Space-time efficient binary image binary logic operation method | |
| CN104881837A (en) | Hyper-chaotic system-based secret key dynamic selection image encryption algorithm | |
| Yi et al. | An algorithm of image encryption based on AES & Rossler hyperchaotic modeling | |
| Yu et al. | Multi-secret visual cryptography with deterministic contrast | |
| Tabash et al. | Image encryption algorithm based on chaotic map |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20191217 Termination date: 20210118 |