CN107896143A - Joint coding method based on high-dimension chaotic system and arithmetic coding - Google Patents

Joint coding method based on high-dimension chaotic system and arithmetic coding Download PDF

Info

Publication number
CN107896143A
CN107896143A CN201710946565.2A CN201710946565A CN107896143A CN 107896143 A CN107896143 A CN 107896143A CN 201710946565 A CN201710946565 A CN 201710946565A CN 107896143 A CN107896143 A CN 107896143A
Authority
CN
China
Prior art keywords
mrow
coding
msup
mtr
mtd
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
Application number
CN201710946565.2A
Other languages
Chinese (zh)
Other versions
CN107896143B (en
Inventor
张伟
张伟豪
朱志良
于海
赵玉丽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northeastern University China
Original Assignee
Northeastern University China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Northeastern University China filed Critical Northeastern University China
Priority to CN201710946565.2A priority Critical patent/CN107896143B/en
Publication of CN107896143A publication Critical patent/CN107896143A/en
Application granted granted Critical
Publication of CN107896143B publication Critical patent/CN107896143B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/001Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/60Network streaming of media packets

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Storage Device Security (AREA)

Abstract

A kind of joint coding method based on high-dimension chaotic system and arithmetic coding, the characteristics of combining Low-dimensional Chaotic Systems Logisitc map and high-dimension chaotic system Chen systems each, combine flooding mechanism between the generation of positive reverse bi-directional diffusion mechanism and cellular automaton.This algorithm has the features such as cipher round results are good, safe.Various digital multimedia terminals and server end are can be applied to, individual digital picture or batch digital picture are encrypted in real time.

Description

Joint coding method based on high-dimension chaotic system and arithmetic coding
Technical field
The invention mainly relates to the information protection in coding digital information field, data compression and encryption technology.Specifically It is related to a set of joint coding method based on high-dimension chaotic system and arithmetic coding.
Technical background
Entropy code is widely used in the source coding technique of different media formats as a kind of conventional compress technique means It is central.Entropy code mainly includes huffman coding and arithmetic coding.Huffman coding proposes first in nineteen fifty-two, is a kind of common Variable Length Code, it is after mature for many years, applied to JPEG digital image compressions standard and MPEG video image In compression standard.
Different from Huffman coding method, arithmetic coding technology is not that each character is carried out directly to compress and export to compile Code, but a monoblock information is compressed and exports a real number.Huffman encoding process depends on the construction of Hofman tree, And arithmetic coding then completes compression encoding process using the real number field section constantly shunk.Relative to huffman coding, arithmetic is compiled Code has higher compression ratio, and is more nearly optimal compression curve.At present arithmetic coding be applied to JPEG2000 and H.264 wait among the compression standard of new-generation digital image and video.
The probabilistic model that the compression ratio of arithmetic coding is depended in the probabilistic model and real information source that cataloged procedure uses Matching degree.Its general compression step includes reading character information, generating probability model from file, character is encoded And reduced domain, generation binary code stream, the write-in step such as file in an iterative manner.Although arithmetic coding is in an encoding process Quite preferable compression ratio can be provided, but it does not provide any security mechanisms.Existing such algorithm is all based on greatly The reverse iteration of chaology or the scramble based on data probabilistic model, having that security is weak or compression ratio reduces etc. asks Topic.Set forth herein a kind of lightweight encryption to compress joint coding method, it is intended to efficiently completes the message sink coding process of safety.
The content of the invention
Arithmetic coding technology is widely used in the algorithm of the message sink coding of all kinds of multimedia messages, for example, JPEG2000 and H.264 etc..However, traditional arithmetic coding does not provide the guarantee of the security in message sink coding.It is existing to be based on compression frame The ciphered compressed combined coding algorithm of structure has that compression ratio is low etc..For example, the safety calculation based on inverse Tent map iteration Number encoder algorithm is due to needing increase separation character to cause the reduction of compression ratio.
This method is using multi-dimension Chaos mapping Chen system, One Dimensional Chaotic Maps Logistic map as stochastic ordering Row generator, with reference to the scramble criterion based on Sort-Search, generation random scrambling rule, and this rule is applied to calculation In art cataloged procedure.This method aims to provide a kind of arithmetic coding of lightweight and encryption combined signal source coding method.
Multi-dimension Chaos mapping has more positive Liapunov exponents relative to low-dimensional mapping, i.e., has more in phase space Add the track dynamical system of chaos.Occurred in this method from three-dimensional Chen systems and Logistic map as random sequence Device.The definition of Chen systems is as shown in formula (1).
Wherein a, b and c are the parameter of Chen systems.Work as a=35, b=3, during c ∈ [20,28.4], Chen systems are chaos 's.Now, by using the differential equation above Euler methods or Runge-Kutta method iteration, three random sequences are obtained {xi},{yiAnd { zi}.Shown in Logistic map such as formula (2).
f(tn)=α × tn-1×(1-tn-1) (2)
When α ∈ [3.57,4], Logistic map are chaos.
Because Chen systems and Logistic map are not equally distributed in the range of its codomain.Therefore, in order to enter One step strengthens the randomness of chaos sequence, and in cataloged procedure, we use the coupling based on Chen systems and Logistic map Iteration system.
This paper presents a new digital image encryption method based on Chen systems and cellular automaton.Pass through combination Low-dimensional Chaotic Systems Logisitc map and high-dimension chaotic system Chen systems each the characteristics of, with reference to positive reverse directional diffusion Flooding mechanism between the generation of mechanism and cellular automaton so that this algorithm has the features such as cipher round results are good, safe.It can apply In various digital multimedia terminals and server end, individual digital picture or batch digital picture are encrypted in real time.
Embodiment
To assess the validity of this method, from data compression standard test file collection (The Standard Calgary Corpus), this document is concentrated and includes 14 files, i.e. bib, book1, book2, geo, news, obj1, obj2, paper1 altogether, Paper2, pic, progc, progl, progp and trans.
Test environment is:CPU:Intel Core 2.0GHz;Internal memory:8GB;Hard disk:240GB
Operating system:Windows 7Ultimate
Translation and compiling environment:Eclipse Neon, MinGW
Programming language:C++
Embodiment 1, encoded for file to be encoded, execution following steps:
The first step:File is read, corresponding ascii character is write into one-dimension array inputBuffer [i];
Second step:The number that kinds of characters occurs is counted, and is included in array, and writes file model.txt;3rd Step:With initial value x0=0.2563125463, y0=0.9586541236, z0=0.2135468574 couple of Chen system iteration n Secondary, n is the quantity of character in plaintext, obtains 3 random sequence { xi},{yiAnd { zi};4th step:3 random sequences are carried out Following computing;
Wherein g (x) is the fractional part for taking x.3 random sequence { x ' after being updatedi},{y’iAnd { z 'i};
5th step:With initial value t0=0.5241785963 pair of Logistic map iteration n times, obtains random sequence { ti};
6th step:By below equation to { x 'i},{y’i}{z’iAnd { tiCalculate coupled random sequence { rqi}
rqi=g (xi′+yi′+zi′)+ti
Wherein { rqiIt is the real number random sequence that codomain is (0,2).
7th step:By random sequence { rqiBe ranked up to obtain { rq 'i};
8th step:By searching each { rqiIn element in { rq 'iIn position, obtain Random Maps rule MapRule[i];
9th step:The order defined according to MapRule [i], input character enter that AC iteration encodes and will to export bit defeated Enter caching;
Tenth step:Cache contents are write into file, coding is completed.
Decoded portion is similar with coded portion, and obtained code stream and probabilistic model are inputted into standard AC decoding journeys first Sequence, obtained character array is write and cached.Key is utilized afterwards, and Chen systems and Logistic systems are iterated, it is raw Into corresponding mapping ruler, then original plaintext can be obtained.
Embodiment 2, algorithm is analyzed by taking coding rate as an example
Coding rate is to weigh the ageing important indicator of an algorithm.Set forth herein algorithm be directed to above-mentioned 14 standards The coding rate and handling capacity of test file are as shown in table 1.
Table 1 codes and decodes velocity analysis
As shown in table 1, this method reaches in the average throughput that compression encryption combined coding is performed to standard testing file 614KB/s。
Embodiment 3, by taking compressibility as an example to Algorithm Analysis
Compression ratio refers to the ratio of the size and original document size of the file after encoding.Generally, cryptographic operation meeting The compression ratio of coding method is had an impact.Table 2 lists test result of the method for standard testing file of text proposition, As a result show, set forth herein the method for compression encryption combined coding do not interfere with the compression ratios of data.
The compressibility of table 2 is analyzed
Embodiment 4, algorithm is analyzed by taking security as an example
For verification algorithm security, we contrast compressed file not after the arithmetic coding of encryption and this here The file obtained after the ciphered compressed combined coding that text proposes.
The security test of table 3
It can be seen from Table 3 that for 14 test files, the character stream after encryption is with being the character after being encoded with AC Stream has average 99.28% different rate, shows that this paper coding method provides enough securities.

Claims (1)

1. a kind of joint coding method based on high-dimension chaotic system and arithmetic coding, it is characterised in that select three-dimensional Chen systems System and Logistic map are as random sequence generator;The definition of Chen systems is as shown in formula (1);
<mrow> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msup> <mi>x</mi> <mo>&amp;prime;</mo> </msup> <mo>=</mo> <mi>a</mi> <mi>y</mi> <mo>-</mo> <mi>a</mi> <mi>x</mi> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msup> <mi>y</mi> <mo>&amp;prime;</mo> </msup> <mo>=</mo> <mi>c</mi> <mi>x</mi> <mo>-</mo> <mi>a</mi> <mi>x</mi> <mo>-</mo> <mi>x</mi> <mi>z</mi> <mo>+</mo> <mi>c</mi> <mi>y</mi> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msup> <mi>z</mi> <mo>&amp;prime;</mo> </msup> <mo>=</mo> <mi>x</mi> <mi>y</mi> <mo>-</mo> <mi>b</mi> <mi>z</mi> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow>
Wherein a, b and c are the parameter of Chen systems;Work as a=35, b=3, during c ∈ [20,28.4], Chen systems are chaos; Now, by using the differential equation above Euler methods or Runge-Kutta method iteration, three random sequence { x are obtainedi}, {yiAnd { zi};Shown in Logistic map such as formula (2)
f(tn)=α × tn-1×(1-tn-1) (2)
When α ∈ [3.57,4], Logistic map are chaos.
CN201710946565.2A 2017-10-12 2017-10-12 Joint coding method based on high-dimensional chaotic system and arithmetic coding Expired - Fee Related CN107896143B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710946565.2A CN107896143B (en) 2017-10-12 2017-10-12 Joint coding method based on high-dimensional chaotic system and arithmetic coding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710946565.2A CN107896143B (en) 2017-10-12 2017-10-12 Joint coding method based on high-dimensional chaotic system and arithmetic coding

Publications (2)

Publication Number Publication Date
CN107896143A true CN107896143A (en) 2018-04-10
CN107896143B CN107896143B (en) 2020-05-12

Family

ID=61802587

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710946565.2A Expired - Fee Related CN107896143B (en) 2017-10-12 2017-10-12 Joint coding method based on high-dimensional chaotic system and arithmetic coding

Country Status (1)

Country Link
CN (1) CN107896143B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108932691A (en) * 2018-08-14 2018-12-04 长春理工大学 More diffusion image encrypting and decrypting methods of quantum cellular neural chaos

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150086013A1 (en) * 2012-04-20 2015-03-26 The Board Of Regents Of The University Of Texas System Systems and methods for simultaneous compression and encryption
CN106023051A (en) * 2016-05-06 2016-10-12 武汉理工大学 DNA image encryption method based on cloud model and hyperchaotic system and system based on cloud model and hyperchaotic system
CN107886463A (en) * 2017-10-12 2018-04-06 东北大学 A kind of digital image encryption method based on Chen systems and cellular automaton

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150086013A1 (en) * 2012-04-20 2015-03-26 The Board Of Regents Of The University Of Texas System Systems and methods for simultaneous compression and encryption
CN106023051A (en) * 2016-05-06 2016-10-12 武汉理工大学 DNA image encryption method based on cloud model and hyperchaotic system and system based on cloud model and hyperchaotic system
CN107886463A (en) * 2017-10-12 2018-04-06 东北大学 A kind of digital image encryption method based on Chen systems and cellular automaton

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
余江妮: "《基于混沌理论的压缩感知研究》", 《中国优秀硕士学位论文全文数据库》 *
王静: "《混沌数字图像加密技术研究》", 《中国博士学位论文全文数据库》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108932691A (en) * 2018-08-14 2018-12-04 长春理工大学 More diffusion image encrypting and decrypting methods of quantum cellular neural chaos
CN108932691B (en) * 2018-08-14 2022-12-30 长春理工大学 Quantum cell neural network chaotic multi-diffusion image encryption and decryption method

Also Published As

Publication number Publication date
CN107896143B (en) 2020-05-12

Similar Documents

Publication Publication Date Title
US10785545B2 (en) Systems and methods for simultaneous compression and encryption
CN100576916C (en) Media data encoding device
CN104331448B (en) Ciphertext domain image search method based on jpeg image ac coefficient histogram
CN105471575A (en) Information encryption, decryption method and device
CN116582263B (en) Security protection system for enterprise digital management platform
CN101977319B (en) Method for generating and authenticating hidden video tags based on video characteristics and digital signatures
CN107578452A (en) A kind of jpeg image encryption method with compatible format and constant size
CN114157772B (en) Digital image encryption method based on space-time chaotic system and half tensor product compressed sensing
CN109889687A (en) The jpeg image bit stream encryption method changed based on exchange statistical nature
CN105812816A (en) Compression encryption authentication joint coding method
Yu et al. Reversible data hiding in encrypted images with secret sharing and hybrid coding
CN105357537B (en) A kind of multistage tree set partitioning coded image encryption method based on chaos
CN114422800A (en) Data encryption method and device and computing equipment
CN117708847A (en) 3C product leasing platform data processing method based on data compression and encryption
CN107896143A (en) Joint coding method based on high-dimension chaotic system and arithmetic coding
Cao et al. Separable Reversible Data Hiding in Encrypted VQ‐Encoded Images
Malik et al. A high capacity text steganography scheme based on huffman compression and color coding
CN116756758A (en) Data encryption and decryption method and device, computer equipment and storage medium
CN114866657B (en) JPEG image encryption method for selecting plaintext safety and reducing size of ciphertext image file
CN107819573A (en) High dimension safety arithmetic coding method
Sagheer et al. Ensure security of compressed data transmission
Ahmed et al. A hybrid medical image cryptosystem based on 4D-hyperchaotic S-boxes and logistic maps
Ahmad et al. Efficient jpeg encoding using bernoulli shift map for secure communication
Hua et al. Secure reversible data hiding in encrypted images using cipher-feedback secret sharing
Kadhem Text steganography method based on modified run length encoding

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

Granted publication date: 20200512