CN107507254B - Compression of images encryption method based on arithmetic coding - Google Patents
Compression of images encryption method based on arithmetic coding Download PDFInfo
- Publication number
- CN107507254B CN107507254B CN201710709712.4A CN201710709712A CN107507254B CN 107507254 B CN107507254 B CN 107507254B CN 201710709712 A CN201710709712 A CN 201710709712A CN 107507254 B CN107507254 B CN 107507254B
- Authority
- CN
- China
- Prior art keywords
- sequence
- pixel value
- probabilistic model
- image
- arithmetic coding
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000007906 compression Methods 0.000 title claims abstract description 28
- 230000006835 compression Effects 0.000 title claims abstract description 25
- 230000000739 chaotic effect Effects 0.000 claims abstract description 17
- 230000006837 decompression Effects 0.000 claims description 3
- 238000011549 displacement method Methods 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 230000009466 transformation Effects 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 238000013507 mapping Methods 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000002411 adverse Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
- G06T9/001—Model-based coding, e.g. wire frame
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Multimedia (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Facsimile Transmission Control (AREA)
Abstract
A kind of compression of images encryption method based on arithmetic coding, includes the following steps：A) use sequence as the first group key Chaotic Scrambling method and Arnold scramble method；B) probability interval for changing pixel value to be encoded accordingly is removed according to the chaos sequence of generation, and will generate the initial value of chaos sequence as the second group key；C) exchange of probability interval is carried out to probabilistic model；D) it is encoded, and regains the probabilistic model of next pixel value to be encoded；E) ciphertext of output is decrypted.Ciphertext security intensity is high and data volume is small, can not obtain and relevant information any in original document image from ciphertext.Detailed information error-free can be recovered, encryption and the effect decrypted are good, highly-safe.
Description
Technical field
The present invention relates to compression of images encryption technology fields, and in particular to a kind of compression of images encryption based on arithmetic coding
Method.
Background technique
With the progress of social science, multimedia technology, the rapid development of information storage technology and network popularity rate
It being promoted, more and more digital pictures are able in transmission over networks, and are gradually known as the main path that people obtain information, because
This, has higher requirement to the safe and secret and storage size of image.For example, the image data owner is on internet
When transmitting the image that he is possessed, in order to protect number one, it is necessary to the image of transmission by reliable encryption technology into
Row processing, while in order to transmit image faster and preferably using network flow, after the encryption that at this moment needs are transmitted
The occupied space of ciphertext can be the smaller the better.
Traditional encryption method has very much, and such as DES and AES, safety is based on computation complexity, carries out by turn to image
Encryption, speed is slow, wastes a large amount of memory spaces, be not able to satisfy nowadays this efficiently society demand.Existing image encryption
Algorithm, be mainly based upon scramble, diffusion, the xor operation of spatial domain and frequency domain.In adding for traditional combination compression of images
In decryption method, usually ciphering process and compression process are separately carried out, such way speed is slow, computationally intensive, also without
Method meets the needs of real-time.The method of joint compression and encryption refers to introduces image encryption in compression process, ensure that height
Effect property, enhances safety, can be good at the requirement for meeting present Digital Image Transmission.
Currently, common Standard of image compression includes JPEG, JPEG2000, they are utilized respectively discrete cosine transform
(Discrete Cosine Transform, DCT), wavelet transform (Discrete Wavelet Transform,
DWT image) is transformed from a spatial domain into frequency domain, this compression process that will lead to image is lossy compression.Arithmetic coding is one
The lossless compression algorithm of kind, compression efficiency are high.But it can not be encrypted.
Summary of the invention
To overcome the above deficiencies, the invention provides good, the highly-safe bases of a kind of encryption and decryption effect
In the compression of images encryption method of arithmetic coding.
The present invention overcomes the technical solution used by its technical problem to be：
A kind of compression of images encryption method based on arithmetic coding, includes the following steps：
A) pixel permutation is carried out using image of the computer to input, Chaotic Scrambling method and Arnold scramble method is selected to distinguish
Pixel permutation is carried out, by use sequentially as the first group key for Chaotic Scrambling method and Arnold scramble method；
B) arithmetic coding is carried out using pixel value of the computer to the image after shuffle operation, in the probability mould of arithmetic coding
Chaos sequence is generated using chaos system in type, the probability interval for changing pixel value to be encoded is removed according to the chaos sequence of generation,
As the second group key, encrypted probabilistic model is obtained；
C) new chaos system is used to generate new chaos sequence in encrypted probabilistic model in step b), the sequence
Random number between 0-1, setting threshold values are 0.5, when the current value of new chaos sequence is more than or equal to 0.5, to probability mould
Type carries out the exchange of probability interval, if when the current value of new chaos sequence is less than 0.5, to probabilistic model without any
Operation；
D) pixel value in step b) and the encrypted probabilistic model of step c) is carried out arithmetic coding by computer, has been encoded
Cheng Hou repeats step b) and step c), obtain it is corresponding remaining will encoded pixel values probabilistic model, it is compiled later
Code, obtains new probabilistic model, until completing to encode to all pixels；
E) in new probabilistic model decrypting process, the first group key for being generated in first input step a) and step b) and the
Decompression operation is decrypted in two group keys, the pixel value of the image after step a) scramble is obtained after decryption, then input step a)
In the first group key, finally obtain original image.
It further include following steps：
A-1) in the step a) to the image of input using chaotic model generate chaos sequence, the 1000th of chaos sequence the
It is intercepted to 1029 numerical value, setting threshold values is 0.5；
A-2) the 1000th numerical value in the sequence of interception is compared with threshold values 0.5, it is right when it is more than or equal to 0.5
The pixel value of image carries out Arnold scramble, when less than 0.5, carries out Chaotic Scrambling to pixel value；
A-3) by the in the sequence of interception the 1001st to 1029 totally 29 numerical value respectively repeat steps a-2）, complete to set for 30 times
Disorderly；
A-4) according to the two for the Chaotic Scrambling and Arnold scramble for selecting the 1000th to 1029 numerical value in chaos sequence
Using order difference, use sequence as the first group key scrambling algorithm.
Step b）The value of middle chaos sequence, the probabilistic model of random change pixel value to be encoded.
The mode of the exchange of probability interval in step c) is center displacement method, will be corresponding from 0-255 pixel value in image
Probability interval overturn on the basis of horizontal centre, formed pixel value be the corresponding probability interval of 255-0.
The beneficial effects of the invention are as follows：By being compressed based on the compression of images encryption method of arithmetic coding to image
Encryption, ciphertext security intensity is high and data volume is small, can not obtain and relevant information any in original document image from ciphertext.
Detailed information error-free can be recovered, encryption and the effect decrypted are good, highly-safe.
Detailed description of the invention
Fig. 1 is the comparison diagram of the transformation of probability interval；
A is the schematic diagram before transformation in Fig. 1, and b is transformed schematic diagram.
Fig. 2 is the comparison diagram of the exchange of probability interval；
A is the schematic diagram before exchange in Fig. 2, and b is the schematic diagram after exchange.
Specific embodiment
The present invention will be further described below.
A kind of compression of images encryption method based on arithmetic coding, includes the following steps：
A) pixel permutation is carried out using image of the computer to input, selects Chaotic Scrambling method and Arnold scramble method point
Not carry out pixel permutation, use sequence as the first group key Chaotic Scrambling method and Arnold scramble method.It is set using chaos
Random process is to generate chaos sequence by logistic chaotic model first, and be ranked up to obtained sequence, wherein obtaining
To sequence serial number be exactly to pixel value carry out scramble sequence, decryption when, it is only necessary to generated using same key
Chaos sequence obtains the sequence serial number of initial scramble, so that it may restore original pixels sequence.Chaos is selected to set according to chaos sequence
Disorderly and Arnold scramble, the two use order different, and final scramble result also will appear very big difference, and therefore, we will
Scrambling algorithm uses sequence as the first group key.
B) arithmetic coding is carried out using pixel value of the computer to the image after shuffle operation, in the probability of arithmetic coding
Chaos sequence is generated using chaos system in model, the Probability Region for changing pixel value to be encoded is gone to according to the chaos sequence of generation
Between, as the second group key, obtain encrypted probabilistic model.One feature of Arithmetic Coding algorithm is exactly coding and general
Rate model be it is separated, therefore, this feature to realize compression while carry out encryption provides possibility.For grayscale image,
256 gray levels are shared, therefore when initialization probability model, it is only necessary to which 256 storage units are for storing each ash
Spend the probability that grade occurs.The probability for initializing each pixel value is 1/256, we are according to the chaos series of generation (due to sequence
Value is 0-1, and greater than the probability of each pixel of initialization, therefore, obtained sequential value all divided by 1000, is allowed to meet by we
The requirement of probability interval), come determine symbol probability bound change size, to achieve the effect that encryption, it is evident that when
We are changed probability interval, in decryption, if going to decode also according to original probabilistic model, are bound to out
Mistake, and with continuous decoding, the mistake accumulation of appearance is increasing, and it is increasingly severe, until can not decode, certainly, I
It should be noted that since the bound of probability interval is bounded, for initially and the character of most end its probability
Have occurred small change, but because of only two characters of variation, and remaining character probabilities is there is no variation, because
This influence of this problem to total system compression efficiency is acceptable.
C) new chaos system is used to generate new chaos sequence in encrypted probabilistic model in step b), the sequence
The random number being classified as between 0-1, setting threshold values are 0.5, when the current value of new chaos sequence is more than or equal to 0.5, to probability
Model carries out the exchange of probability interval, if when the current value of new chaos sequence is less than 0.5, to probabilistic model without appointing
What is operated.
D) pixel value in step b) and the encrypted probabilistic model of step c) is carried out arithmetic coding, coding by computer
After the completion, step b) and step c) are repeated, obtain it is corresponding remaining will encoded pixel values probabilistic model, it is carried out later
Coding, obtains new probabilistic model, until completing to encode to all pixels.In other words, the arithmetic that this Encryption Algorithm uses is compiled
Code be it is adaptive, can further improve compression efficiency in this way；System constantly repeats update probabilistic model and cataloged procedure, most
The encryption and squeeze operation to entire image are completed eventually and export ciphertext.
E) in ciphertext decrypting process, the second group key and third group of first input step a) and the middle generation of step b) are close
Decompression operation is decrypted in key, the pixel value of the image after step a) scramble is obtained after decryption, then in input step a)
One group key, finally obtains original image.Since Arithmetic Coding algorithm is lossless compression, moreover, pixel permutation algorithm will not
Change the size of each pixel, therefore, this system being capable of error-free recovery original image.
Compression encryption, ciphertext security intensity are carried out to image by the compression of images encryption method based on arithmetic coding
High and data volume is small, can not obtain and relevant information any in original document image from ciphertext.It error-free can recover
The effect of detailed information, encryption and decryption is good, highly-safe.
It further include following steps：A-1 chaos sequence) is generated using chaotic model to the image of input in the step a),
1000th to 1029 numerical value of chaos sequence is intercepted, and setting threshold values is 0.5；A-2) by the 1000th number in the sequence of interception
Value is compared with threshold values 0.5, when it is more than or equal to 0.5, Arnold scramble is carried out to the pixel value of image, when less than 0.5
When, Chaotic Scrambling is carried out to pixel value；A-3) by the in the sequence of interception the 1001st to 1029 totally 29 numerical value respectively repeat steps
a-2）, complete 30 scrambles；A-4) Chaotic Scrambling of the 1000th to 1029 numerical value and Arnold is selected to set according in chaos sequence
Random the two uses order different, uses sequence as the first group key scrambling algorithm.The number of pixel value scramble is
Can be taking human as decision, in the present invention, the random scrambling number that we select is 30 times.
The transformation of probability interval, according to the chaos value that chaos system generates, is determined based on chaos system in step b)
To the knots modification in current probability section.If Fig. 1, a are original probabilistic models, b is the probabilistic model after interval mapping.
It can be seen that there is no variations for the corresponding probability gap size of median pixel value, only at first after interval mapping
Small change occurs with the last one probability interval.
The mode of the exchange of probability interval in step c) is center displacement method, will be corresponding from 0-255 pixel value in image
Probability interval overturn on the basis of horizontal centre, formed pixel value be the corresponding probability interval of 255-0.It can by Fig. 1
To find out when decryption, if the probabilistic model still according to script goes decryption to decompress, it may appear that mistake, because
Variation is had occurred that at this moment probabilistic model.Possibility it should be noted that general grayscale image, between adjacent pixel value
Probability transformation be it is smaller, if simply selection adjacent-symbol probability interval replaced if, can be to the encryption of system
Effect has adverse effect on, therefore in order to avoid similar problem, and the substitute mode that we select is central symmetry displacement, this
Sample can largely improve the encryption performance of system.
Claims (4)
1. a kind of compression of images encryption method based on arithmetic coding, which is characterized in that include the following steps：
A) pixel permutation is carried out using image of the computer to input, Chaotic Scrambling method is selected to carry out respectively with Arnold scramble method
Chaotic Scrambling method and Arnold scramble method are used sequence as the first group key by pixel permutation；
B) arithmetic coding is carried out using pixel value of the computer to the image after shuffle operation, in the probabilistic model of arithmetic coding
Chaos sequence is generated using chaos system, the probability interval for changing pixel value to be encoded is removed according to the chaos sequence of generation, will be led to
The probability interval of the pixel value to be encoded of chaos sequence change is crossed as the second group key, obtains encrypted probabilistic model；
C) new chaos system is used to generate new chaos sequence in encrypted probabilistic model in step b), which is 0-
Random number between 1, setting threshold values be 0.5, when the current value of new chaos sequence be more than or equal to 0.5 when, to probabilistic model into
The exchange of row probability interval, if when the current value of new chaos sequence is less than 0.5, to probabilistic model without any behaviour
Make；
D) pixel value in step b) and the encrypted probabilistic model of step c) is carried out arithmetic coding by computer, and coding is completed
Afterwards, step b) and step c) are repeated, obtain corresponding rest of pixels will encoded pixel values probabilistic model, it is carried out later
Coding, obtains new probabilistic model, until completing to encode to all pixels；
E) to the first group key generated in first input step a) and step b) in new probabilistic model decrypting process and second group
Decompression operation is decrypted in key, the pixel value of the image after step a) scramble is obtained after decryption, then in input step a)
First group key, finally obtains original image.
2. the compression of images encryption method according to claim 1 based on arithmetic coding, which is characterized in that further include as follows
Step：
A-1) in the step a) to the image of input using chaotic model generate chaos sequence, chaos sequence the 1000th to
1029 numerical value are intercepted, and setting threshold values is 0.5；
A-2) the 1000th numerical value in the sequence of interception is compared with threshold values 0.5, when it is more than or equal to 0.5, to image
Pixel value carry out Arnold scramble, when less than 0.5, to pixel value carry out Chaotic Scrambling；
A-3) by the in the sequence of interception the 1001st to 1029 totally 29 numerical value respectively repeat steps a-2）, complete 30 scrambles；
A-4) according to the use of the two for the Chaotic Scrambling and Arnold scramble for selecting the 1000th to 1029 numerical value in chaos sequence
Order is different, uses sequence as the first group key scrambling algorithm.
3. the compression of images encryption method according to claim 1 based on arithmetic coding, it is characterised in that：Step b）In mix
The value of ignorant sequence, the probabilistic model of random change pixel value to be encoded.
4. the compression of images encryption method according to claim 1 based on arithmetic coding, it is characterised in that：In step c)
The mode of the exchange of probability interval is center displacement method, by image from 0-255 pixel value corresponding probability interval in level
It is overturn on the basis of the heart, forming pixel value is the corresponding probability interval of 255-0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710709712.4A CN107507254B (en) | 2017-08-18 | 2017-08-18 | Compression of images encryption method based on arithmetic coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710709712.4A CN107507254B (en) | 2017-08-18 | 2017-08-18 | Compression of images encryption method based on arithmetic coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107507254A CN107507254A (en) | 2017-12-22 |
| CN107507254B true CN107507254B (en) | 2018-11-23 |
Family
ID=60691291
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710709712.4A Expired - Fee Related CN107507254B (en) | 2017-08-18 | 2017-08-18 | Compression of images encryption method based on arithmetic coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107507254B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111651774B (en) * | 2019-03-04 | 2022-04-26 | 北京大学 | Universal method for converting generated probability model into encoder and encryption method |
| CN110635807B (en) * | 2019-08-05 | 2022-10-21 | 湖南遥昇通信技术有限公司 | Data coding method and decoding method |
| CN115623159B (en) * | 2022-12-05 | 2023-03-14 | 深圳码隆智能科技有限公司 | Intelligent transmission method for monitoring data of intelligent experiment operation examination |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105488426A (en) * | 2015-11-30 | 2016-04-13 | 西安闻泰电子科技有限公司 | Mobile platform image encryption method |
| CN106407824A (en) * | 2016-09-28 | 2017-02-15 | 重庆第二师范学院 | Image encryption method and device |
| CN106485742A (en) * | 2016-07-26 | 2017-03-08 | 上海海洋大学 | A kind of remote sensing images based on Arnold chaotic maps encrypt search method |
| CN106504180A (en) * | 2016-11-03 | 2017-03-15 | 大连大学 | Image encryption error correction method based on DNA encoding |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101848390B (en) * | 2010-05-10 | 2011-11-16 | 西南交通大学 | Image compression secure coding method based on multidirectional sparse representation |
| MX2013014976A (en) * | 2012-05-25 | 2014-04-02 | Panasonic Corp | Image encoding method, image encoding device, image decoding method, image decoding device, and image encoding/decoding device. |
| CN106230578B (en) * | 2016-09-08 | 2019-09-27 | 哈尔滨工程大学 | A kind of safe arithmetic coding method of binary system of the three-dimensional Lorenz mapping control based on weighting processing |
-
2017
- 2017-08-18 CN CN201710709712.4A patent/CN107507254B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105488426A (en) * | 2015-11-30 | 2016-04-13 | 西安闻泰电子科技有限公司 | Mobile platform image encryption method |
| CN106485742A (en) * | 2016-07-26 | 2017-03-08 | 上海海洋大学 | A kind of remote sensing images based on Arnold chaotic maps encrypt search method |
| CN106407824A (en) * | 2016-09-28 | 2017-02-15 | 重庆第二师范学院 | Image encryption method and device |
| CN106504180A (en) * | 2016-11-03 | 2017-03-15 | 大连大学 | Image encryption error correction method based on DNA encoding |
Non-Patent Citations (1)
| Title |
|---|
| 基于算术编码的图像加密算法研究;段黎力;《中国优秀硕士学位论文全文数据库信息科技辑》;20110715;第1-51页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107507254A (en) | 2017-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lin et al. | Invertible secret image sharing with steganography | |
| US10785545B2 (en) | Systems and methods for simultaneous compression and encryption | |
| Zhang et al. | Chaos-based partial encryption of SPIHT coded color images | |
| CN107292184B (en) | Image encryption method, device and key stream generating method and key stream generator | |
| CN107507254B (en) | Compression of images encryption method based on arithmetic coding | |
| CN109168033B (en) | Video privacy data protection system and method | |
| CN104093029A (en) | Video encryption algorithm based on new spatiotemporal chaos system | |
| CN112769545B (en) | Image encryption method based on adjacent pixel Joseph transformation and Mealy state machine | |
| CN114579993A (en) | Image encryption method based on quantum key distribution and pixel scrambling | |
| Srinivasan et al. | A novel approach for color image, steganography using nubasi and randomized, secret sharing algorithm | |
| Tiken et al. | A comprehensive review about image encryption methods | |
| CN111031191B (en) | Image encryption method based on controlled alternate quantum walking and DNA sequence operation | |
| CN101409830B (en) | Method and apparatus for judging DCT coefficient block similarity, and encrypting and deciphering image | |
| Hajizadeh et al. | A new high capacity and EMD-based image steganography scheme in spatial domain | |
| Roy et al. | A novel 3–4 image secret sharing scheme | |
| CN116827509A (en) | Image encryption method based on five-dimensional conserved hyperchaotic system and bit plane segmentation diffusion | |
| CN113344762B (en) | Double scrambling image encryption method based on AFD adaptive decomposition | |
| CN115134471A (en) | Image encryption and decryption method and related equipment | |
| CN105704499B (en) | A kind of selective satellite image compression encryption method based on ChaCha20 and CCSDS | |
| Yang et al. | A lossless compression and encryption scheme for sequence images based on 2D-CTCCM, MDFSM and STP | |
| Hasan et al. | A Novel Compressed Domain Technique of Reversible Steganography | |
| CN106998471B (en) | Video hiding method and video extracting method for modifying prediction mode | |
| Jiang et al. | Meaningful secret image sharing for JPEG images with arbitrary quality factors | |
| Vig et al. | An efficient and secured data sharing approach through image transmission | |
| Yadav et al. | A fast and efficient data hiding scheme in binary images |
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: 20181123 |