CN104135669B - A kind of video secret communication method of multi-dimension Chaos mapping - Google Patents

A kind of video secret communication method of multi-dimension Chaos mapping Download PDF

Info

Publication number
CN104135669B
CN104135669B CN201410336408.6A CN201410336408A CN104135669B CN 104135669 B CN104135669 B CN 104135669B CN 201410336408 A CN201410336408 A CN 201410336408A CN 104135669 B CN104135669 B CN 104135669B
Authority
CN
China
Prior art keywords
msub
mrow
mtd
mtr
msup
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.)
Active
Application number
CN201410336408.6A
Other languages
Chinese (zh)
Other versions
CN104135669A (en
CN104135669B8 (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.)
Guangdong University of Technology
Original Assignee
Guangdong University of Technology
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 Guangdong University of Technology filed Critical Guangdong University of Technology
Priority to CN201410336408.6A priority Critical patent/CN104135669B8/en
Publication of CN104135669A publication Critical patent/CN104135669A/en
Publication of CN104135669B publication Critical patent/CN104135669B/en
Application granted granted Critical
Publication of CN104135669B8 publication Critical patent/CN104135669B8/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses a kind of video secret communication method of multi-dimension Chaos mapping, comprise the following steps：Set up the kinetics equation of 8 dimension Discrete Chaotic Maps；Circulated by above-mentioned 8 from 0 to 3 nesting, cycle-index is, it is equal with the pixel of a two field picture, according to above formula, obtain the mapping table of video pixel position scrambling encryption algorithm；Cryptographic calculation：1. each pixel chronological order number given in two-dimensional video image；2. the serial number after the scrambling encryption of video pixel position is built：3. video pixel position scrambling encryption Algorithm mapping table is utilized, is by origin-locationThe pixel value at place is mapped to positionPlace, thus obtains the ciphertext value of a two field picture；Information transmission；Client carries out anti-Mapping implementation decryption using the mapping table produced in the same fashion to ciphertext value.As a result of above-mentioned method, compared with congenic method, with strong security, the characteristics of reduction degree is high is encrypted.

Description

A kind of video secret communication method of multi-dimension Chaos mapping
Technical field
The present invention relates to video secret communication method, specifically a kind of video secret communication method of multi-dimension Chaos mapping.
Background technology
British mathematician Mattllews in 1989 proposes a kind of text password based on 1 dimensional Logistic Map first Scheme.Turn into the focus of research from this chaos encryption.Chaos system is applied to image encryption, first by Fridrich in 1997 Propose, the conversion of location of pixels has been carried out using the Baker mappings and Cat mappings of two dimension, but the key of two dimension Cat mappings is empty Between it is too small, while be confined to square sized images encrypt.Chen and Mao are on the basis of Fridrich, by two-dimentional Baker Map and two dimension Cat mapped extensions are to three-dimensional, and be utilized respectively three-dimensional mapping and propose a quick Image Encryption Scheme. The think of that Feng etc. is proposed after line mapping resume images using the principle that chaos is stretched and is folded and split using image Want to propose a kind of chaotic maps resume image.Two-dimensional chaotic map is extended to three dimensions progress image and added in recent years It is close, the 3D Baker map resume images that such as Mao et al. is proposed, the 3D Catmap resume images that Chen G are proposed.
State Intellectual Property Office disclosed Publication No. CN102831569A on December 19th, 2012, and patent name is one The digital picture planted towards cellular service selects the patent of invention document of encryption method, the patent document：Including fraction ciphertext to be added Selection, the determination of Image Chaos encryption key, the cryptographic operation of image and the closed quality of wavelet low frequency subband evaluate four parts； Wherein, the determination of Image Chaos encryption key, will realize fraction wavelet transformation and chaos encryption it needs to be determined that following parameter：
(1) the control parameter α of chaos sequence, is provided by user；
(2) the yardstick β of image wavelet transform, is provided by user；
(3) the fractional order γ of fraction wavelet transformation, and meet 0<γ<2, provided by user；
(4) chaos sequence initial value X (0), its determination process is as follows：
It is m bits that step 1., which sets original image, optional 5 pixels P1, P2, P3, P4 from selected subband, P5, the chaos sequence initial value of the subband is obtained by the pixel value of this 5 points；
Step 2. calculates the chaos sequence initial value of selected wavelet sub-band according to the following formula：
Aforementioned four parameter alpha, beta, gamma, X (0) constitutes the key of selected sub-band images encryption；
The cryptographic operation of image is as follows：Step 1. is for selected wavelet low frequency subband, if the size of the subband is N1 × N2, the series of starting values X (0) generated using this fraction wavelet low frequency subband, chaos sequence is generated according to following mapping：X (n+1)=cos (α arccos (X (n)) (4), wherein, α is control parameter, and X (n) ∈ [- 1,1], the sequence now generated Row are chaos, because this chaos sequence is ambipolar, according to following unipolarity sequences for converting and converting it into [0,1] Row：The length of this sequence is taken as N1 × N2, and this N1 × N2 numerical value is converted into the chaos matrix of N1 rows N2 row, is designated as U；
Selected fraction wavelet low frequency subband is encrypted step 2., and encryption is calculated as follows：Wherein, it is XOR operation, ValueNew (i, j), ValueOld (i, j) be respectively after the encryption of selected fraction wavelet low frequency subband with before encryption The low frequency sub-band fraction wavelet coefficient arranged in the i-th row jth；
Step 3. is replaced with the fraction wavelet low frequency subband after encryption after the fraction wavelet low frequency subband before encryption, is carried out Wavelet inverse transformation, obtains initial encryption image；
The initial encryption image obtained is divided into 4 width size identical subgraphs by step 4., afterwards to this 4 width subgraph As being done according to clockwise direction after rotation processing, the image obtained is exactly final encrypted image.
The technical scheme of above-mentioned patent and the technical scheme of this patent are entirely different.
The content of the invention
It is an object of the invention to provide a kind of video secrecy of the high multi-dimension Chaos mapping of strong security, encryption reduction degree Communication means.
To achieve the above object, the technical solution adopted in the present invention is：
A kind of video secret communication method of multi-dimension Chaos mapping, comprises the following steps：
A. the kinetics equation of 8 dimension Discrete Chaotic Maps is set up：
N in formulai(i=1,2 ..., 8)=2, A8=(Aij)8×8The building method of (i, j=1,2 ..., 8) isWherein：
Subscript sequence Oi,j, wherein i, the condition that j value should be met is
Select a kind of subscript sequence O thereini,jFor：
Oi,j=78,13,14,15,16,45,18,23,24,25,57,27,28,34,35,36,37,38,17,46,47, 48,56,26,58,67,68,12 corresponding transformation matrix A8For TijProduct, obtain
Obtaining video pixel position scrambling encryption algorithm is
The second row in formula and last column join together to represent that 8 circulate from 0 to 3 nested；
B. circulated by above-mentioned 8 from 0 to 3 nesting, cycle-index is 216, it is equal with the pixel of a two field picture, according to Above formula, the mapping table for obtaining video pixel position scrambling encryption algorithm is as shown in the table：
Because the modulo operation in the scrambling encryption algorithm of video pixel position is the computing of mould 4, therefore each single item E in mapping table (S can only i) have 0,1,2,3 four kind of possible value, i.e.,
E(S,i)∈{0,1,2,3}
S=0,1,2 in formula ..., 216- 1, i=1,2 ..., 8；
C. cryptographic calculation：
1. each pixel chronological order number given in two-dimensional video image：By a width size before location of pixels scrambling encryption For 256 × 256 two-dimensional video image pixel positional representation into one-dimension array, 65536 pixels are had, to should be one-dimensional The length of array is 65536, before location of pixels scrambling encryption, and each pixel one serial number of correspondence, serial number S is each Arranged by the order of increase by 1 and meet 0≤S≤216- 1, S (S=0,1,2 ..., 216- 1) size is
2. the serial number after the scrambling encryption of video pixel position is built：Using in mapping table per a line corresponding 8 E (S, I) (i=1,2 ..., 8), constructs the serial number after a video pixel position scrambling encryption, then the size for corresponding to serial number is
E (S)=E (S, α1)×214+E(S,α2)×212+E(S,α3)×210+E(S,α4)×28+
E(S,α5)×26+E(S,α6)×24+E(S,α7)×22+E(S,α8)×20
α in formulai(i=1,2 ..., 8) ∈ { 1,2 ..., 8 }, α1≠α2≠…≠αn.According to above formula, because S and E (S) is It is man-to-man, therefore E (S) also has 65536 kinds of different values；
3. video pixel position scrambling encryption Algorithm mapping table is utilized, origin-location is mapped in place for the pixel value at S E (S) place is set to, the ciphertext value p (k) of a two field picture is thus obtained；
D. information transmission：Server end sends the ciphertext value p (k) of a two field picture to clients by Ethernet simultaneously；
E. client carries out anti-Mapping implementation decryption using the mapping table produced in the same fashion to ciphertext value p (k).
Further, the step in the step C 3. in specific method it is as follows：
First, the two-dimensional coordinate before setting video location of pixels scrambling encryption is (x, y), the then two-dimensional coordinate before encrypting (x, y) and one-dimension array serial number S (S=0,1,2 ..., 216- 1) relation between is
Floor represents to round downwards in formula, and mod is modular function；
Secondly, the two-dimensional coordinate after setting video location of pixels scrambling encryption is (xe,ye), then the two-dimensional coordinate after encrypting (xe,ye) relation between one-dimension array serial number E (S) is
If the video pixel value of correspondence two-dimensional coordinate (x, y) is V (x, y) before the scrambling encryption of position, then position scramble Correspondence two-dimensional coordinate (x after encryptione,ye) video pixel value be Ve(xe,ye), carry out the replacement operator computing shown in following formula
Ve(xe,ye)=V (x, y)
The encryption of the position scramble of video pixel is then realized, the ciphertext value p (k) of a two field picture is finally obtained.
Further, the specific decryption method in the step E is as follows：Decryption is the inverse operation of encryption, if right after decryption The mathematic(al) representation for answering pixel order number is
D (S)=D (S, α1)×214+D(S,α2)×212+D(S,α3)×210+D(S,α4)×28+D(S,α5)×26+D(S, α6)×24+D(S,α7)×22+D(S,α8)×20
Two-dimensional coordinate after the decryption of setting video pixel is (xd,yd), then two-dimensional coordinate (xd,yd) and one-dimension array serial number D (S) relation is
Floor represents to round downwards in formula, and mod is modular function；
According to above formula, if correspondence two-dimensional coordinate (x after decryptiond,yd) video pixel value be Ve(xd,yd), if to realize The decryption of video image, only need to carry out the replacement operator computing V shown in following formulad(x, y)=Ve(xd,yd), by pixel pair after encryption The one-dimension array serial number answered be reduced into S (S=0,1,2 ..., 216- 1), realize and the decryption that reflection is penetrated is carried out to ciphertext value p (k).
Beneficial effects of the present invention：As a result of above-mentioned method, compared with congenic method, with strong security, add The characteristics of close reduction degree is high.
Brief description of the drawings
Fig. 1 is the composition frame chart for the video secret signalling that multi-dimension Chaos map；
Fig. 2 is Client ends workflow diagram；
Fig. 3 is Server ends workflow diagram.
Embodiment
As shown in Figure 1, 2, 3, to the hardware configuration of video multi-dimension Chaos mapping encrypting：With two pieces of Super 4412 ARM Plate sets up a Server-Client model, sets up the respective socket of Server and Client, is used as the base of intercommunication Plinth.Image real-time acquisition, the ARM development boards of multi-dimension Chaos mapping encrypting as Client ends, by camera, V4L2 drivings, Jpeg decompression contracting, H.264 chaos encryption, compression, trawl performance, ethernet port, eight part compositions of LCDs, pass through Chaos encryption and H.264 compress after video data transmitted through Ethernet.The ARM development board conducts of multi-dimension Chaos mapping decryption Server ends, the cipher-text information that responsible reception is transmitted.Ethernet port, trawl performance, H.264 decompression, chaos decryption, The part of LCDs five is constituted, its at Client ends and Server ends, be all run on Cortex-A9 type processors it is embedding Enter formula (SuSE) Linux OS, the function of above-mentioned corresponding part is programmed to by C++.The video exported due to USB camera View data is the JPEG compression form after hardware encoding, therefore, it is necessary first to will carry out jpeg decompression contracting per frame jpeg image Afterwards, corresponding RGB three primary colours video format can just be obtained.In addition, local area network communication is programmed using socket, using towards connection , reliably Transmission Control Protocol.
Using above-mentioned hardware configuration, video secret communication, a kind of video secret communication side of multi-dimension Chaos mapping are realized Method, comprises the following steps：
A. the kinetics equation of 8 dimension Discrete Chaotic Maps is set up：
N in formulai(i=1,2 ..., 8)=2, A8=(Aij)8×8The building method of (i, j=1,2 ..., 8) isWherein：
Subscript sequence Oi,j, wherein i, the condition that j value should be met is
Select a kind of subscript sequence O thereini,jFor：
Oi,j=78,13,14,15,16,45,18,23,24,25,57,27,28,34,35,36,37,38,17,46,47, 48,56,26,58,67,68,12 corresponding transformation matrix A8For TijProduct, obtain
Obtaining video pixel position scrambling encryption algorithm is
The second row in formula and last column join together to represent that 8 circulate from 0 to 3 nested；
B. circulated by above-mentioned 8 from 0 to 3 nesting, cycle-index is 216, it is equal with the pixel of a two field picture, according to Above formula, the mapping table for obtaining video pixel position scrambling encryption algorithm is as shown in the table：
Because the modulo operation in the scrambling encryption algorithm of video pixel position is the computing of mould 4, therefore each single item E in mapping table (S can only i) have 0,1,2,3 four kind of possible value, i.e.,
E(S,i)∈{0,1,2,3}
S=0,1,2 in formula ..., 216- 1, i=1,2 ..., 8；
C. cryptographic calculation：
1. each pixel chronological order number given in two-dimensional video image：By a width size before location of pixels scrambling encryption For 256 × 256 two-dimensional video image pixel positional representation into one-dimension array, 65536 pixels are had, to should be one-dimensional The length of array is 65536, before location of pixels scrambling encryption, and each pixel one serial number of correspondence, serial number S is each Arranged by the order of increase by 1 and meet 0≤S≤216- 1, S (S=0,1,2 ..., 216- 1) size is
2. the serial number after the scrambling encryption of video pixel position is built：Using in mapping table per a line corresponding 8 E (S, I) (i=1,2 ..., 8), constructs the serial number after a video pixel position scrambling encryption, then the size for corresponding to serial number is
E (S)=E (S, α1)×214+E(S,α2)×212+E(S,α3)×210+E(S,α4)×28+
E(S,α5)×26+E(S,α6)×24+E(S,α7)×22+E(S,α8)×20
α in formulai(i=1,2 ..., 8) ∈ { 1,2 ..., 8 }, α1≠α2≠…≠αn.According to above formula, because S and E (S) is It is man-to-man, therefore E (S) also has 65536 kinds of different values；
3. video pixel position scrambling encryption Algorithm mapping table is utilized, origin-location is mapped in place for the pixel value at S E (S) place is set to, the ciphertext value p (k) of a two field picture is thus obtained, specific method is as follows：
First, the two-dimensional coordinate before setting video location of pixels scrambling encryption is (x, y), the then two-dimensional coordinate before encrypting (x, y) and one-dimension array serial number S (S=0,1,2 ..., 216- 1) relation between is
Floor represents to round downwards in formula, and mod is modular function；
Secondly, the two-dimensional coordinate after setting video location of pixels scrambling encryption is (xe,ye), then the two-dimensional coordinate after encrypting (xe,ye) relation between one-dimension array serial number E (S) is
If the video pixel value of correspondence two-dimensional coordinate (x, y) is V (x, y) before the scrambling encryption of position, then position scramble Correspondence two-dimensional coordinate (x after encryptione,ye) video pixel value be Ve(xe,ye), then, we carry out the displacement shown in following formula Operation
Ve(xe,ye)=V (x, y)
The encryption of the position scramble of video pixel is then realized, the ciphertext value p (k) of a two field picture is finally obtained.
D. information transmission：Server end sends the ciphertext value p (k) of a two field picture to clients by Ethernet simultaneously；
E. client carries out anti-Mapping implementation decryption using the mapping table produced in the same fashion to ciphertext value p (k).
Decryption is the inverse operation of encryption, if the mathematic(al) representation of respective pixel serial number is after decryption
D (S)=D (S, α1)×214+D(S,α2)×212+D(S,α3)×210+D(S,α4)×28+
D(S,α5)×26+D(S,α6)×24+D(S,α7)×22+D(S,α8)×20
Two-dimensional coordinate after the decryption of setting video pixel is (xd,yd), then two-dimensional coordinate (xd,yd) and one-dimension array serial number D (S) relation is
Floor represents to round downwards in formula, and mod is modular function；
According to above formula, if correspondence two-dimensional coordinate (x after decryptiond,yd) video pixel value be Ve(xd,yd), if to realize The decryption of video image, then, we only need to carry out the replacement operator computing V shown in following formulad(x, y)=Ve(xd,yd), it will add The corresponding one-dimension array serial number of close rear pixel be reduced into S (S=0,1,2 ..., 216- 1), realize and ciphertext value p (k) is carried out instead The decryption of mapping.
Decryption is in two kinds of situation：Transmitting terminal is identical with the parameter and key of receiving terminal, D (S)=E (S), V (x, y)=Vd (x, y), receiving terminal can correctly decrypt original video image；Transmitting terminal is different from the parameter and key of receiving terminal, D (S) ≠ E (S), V(x,y)≠Vd(x, y), receiving terminal can not correctly decrypt original video image.
Notice when being realized with ARM, on the one hand, need to consider video requirement of real-time, from speed in terms of, encrypt Algorithm can not be excessively complicated and time-consuming, and close wheel number can not be excessive.Generally in hardware experiments, it is 1 to choose encryption round number.Obtain ARM When realizing, the conservative estimation value of key space size is
KS=(8 × 7)/2)！×8！=1.2293 × 1034。
Described above is the preferred embodiment of the present invention, can not limit the right model of the present invention with this certainly Enclose, it is noted that for those skilled in the art, technical scheme is modified or waited With replacing, without departure from the protection domain of technical solution of the present invention.

Claims (3)

1. a kind of video secret communication method of multi-dimension Chaos mapping, it is characterised in that comprise the following steps：
A. the kinetics equation of 8 dimension Discrete Chaotic Maps is set up：
<mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <mi>mod</mi> <mo>(</mo> <msub> <mi>A</mi> <mn>11</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>12</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <mo>...</mo> <mo>+</mo> <msub> <mi>A</mi> <mn>18</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <msup> <mn>2</mn> <msub> <mi>N</mi> <mn>1</mn> </msub> </msup> <mo>)</mo> </mtd> </mtr> <mtr> <mtd> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <mi>mod</mi> <mo>(</mo> <msub> <mi>A</mi> <mn>21</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>22</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <mo>...</mo> <mo>+</mo> <msub> <mi>A</mi> <mn>28</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <msup> <mn>2</mn> <msub> <mi>N</mi> <mn>2</mn> </msub> </msup> <mo>)</mo> </mtd> </mtr> <mtr> <mtd> <mo>...</mo> </mtd> </mtr> <mtr> <mtd> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <mi>mod</mi> <mo>(</mo> <msub> <mi>A</mi> <mn>81</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>82</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <mo>...</mo> <mo>+</mo> <msub> <mi>A</mi> <mn>88</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <msup> <mn>2</mn> <msub> <mi>N</mi> <mn>8</mn> </msub> </msup> <mo>)</mo> </mtd> </mtr> </mtable> </mfenced>
N in formulai(i=1,2 ..., 8)=2, A8=(Aij)8×8The building method of (i, j=1,2 ..., 8) isIts In：
Subscript sequence Oi,j, wherein i, the condition that j value should be met is
<mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>...</mo> <mo>,</mo> <mn>7</mn> </mtd> </mtr> <mtr> <mtd> <mi>j</mi> <mo>=</mo> <mi>i</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <mi>i</mi> <mo>+</mo> <mn>2</mn> <mo>,</mo> <mo>...</mo> <mo>,</mo> <mn>8</mn> </mtd> </mtr> <mtr> <mtd> <mi>j</mi> <mo>&gt;</mo> <mi>i</mi> </mtd> </mtr> </mtable> </mfenced>
Select a kind of subscript sequence O thereini,jFor：
Oi,j=78,13,14,15,16,45,18,23,24,25,57,27,28,34,35,36,37,38,17,46,47,48, 56,26,58,67,68,12
Then corresponding transformation matrix A8For TijProduct, obtain
<mrow> <msub> <mi>A</mi> <mn>8</mn> </msub> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <msub> <mi>A</mi> <mn>11</mn> </msub> </mtd> <mtd> <msub> <mi>A</mi> <mn>12</mn> </msub> </mtd> <mtd> <mn>...</mn> </mtd> <mtd> <msub> <mi>A</mi> <mn>18</mn> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>A</mi> <mn>21</mn> </msub> </mtd> <mtd> <msub> <mi>A</mi> <mn>22</mn> </msub> </mtd> <mtd> <mn>...</mn> </mtd> <mtd> <msub> <mi>A</mi> <mn>28</mn> </msub> </mtd> </mtr> <mtr> <mtd> <mn>...</mn> </mtd> <mtd> <mn>...</mn> </mtd> <mtd> <mn>...</mn> </mtd> <mtd> <mn>...</mn> </mtd> </mtr> <mtr> <mtd> <msub> <mi>A</mi> <mn>81</mn> </msub> </mtd> <mtd> <msub> <mi>A</mi> <mn>82</mn> </msub> </mtd> <mtd> <mn>...</mn> </mtd> <mtd> <msub> <mi>A</mi> <mn>88</mn> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mn>5990537</mn> </mtd> <mtd> <mn>9868413</mn> </mtd> <mtd> <mn>226236</mn> </mtd> <mtd> <mn>4794846</mn> </mtd> <mtd> <mn>22802340</mn> </mtd> <mtd> <mn>143956428</mn> </mtd> <mtd> <mn>24265311</mn> </mtd> <mtd> <mn>234878586</mn> </mtd> </mtr> <mtr> <mtd> <mn>103377</mn> </mtd> <mtd> <mn>170555</mn> </mtd> <mtd> <mn>3300</mn> </mtd> <mtd> <mn>72240</mn> </mtd> <mtd> <mn>345054</mn> </mtd> <mtd> <mn>2207175</mn> </mtd> <mtd> <mn>389517</mn> </mtd> <mtd> <mn>3597285</mn> </mtd> </mtr> <mtr> <mtd> <mn>9064191</mn> </mtd> <mtd> <mn>14931951</mn> </mtd> <mtd> <mn>341837</mn> </mtd> <mtd> <mn>7246707</mn> </mtd> <mtd> <mn>34463589</mn> </mtd> <mtd> <mn>217599315</mn> </mtd> <mtd> <mn>36692373</mn> </mtd> <mtd> <mn>355030845</mn> </mtd> </mtr> <mtr> <mtd> <mn>4251336</mn> </mtd> <mtd> <mn>7002429</mn> </mtd> <mtd> <mn>162735</mn> </mtd> <mtd> <mn>3440882</mn> </mtd> <mtd> <mn>16357935</mn> </mtd> <mtd> <mn>103167336</mn> </mtd> <mtd> <mn>17326695</mn> </mtd> <mtd> <mn>168341529</mn> </mtd> </mtr> <mtr> <mtd> <mn>1743033</mn> </mtd> <mtd> <mn>2870931</mn> </mtd> <mtd> <mn>66858</mn> </mtd> <mtd> <mn>1412607</mn> </mtd> <mtd> <mn>6715337</mn> </mtd> <mtd> <mn>42346893</mn> </mtd> <mtd> <mn>7108446</mn> </mtd> <mtd> <mn>69099612</mn> </mtd> </mtr> <mtr> <mtd> <mn>6081</mn> </mtd> <mtd> <mn>10086</mn> </mtd> <mtd> <mn>195</mn> </mtd> <mtd> <mn>2703</mn> </mtd> <mtd> <mn>13386</mn> </mtd> <mtd> <mn>88019</mn> </mtd> <mtd> <mn>16818</mn> </mtd> <mtd> <mn>143121</mn> </mtd> </mtr> <mtr> <mtd> <mn>15774</mn> </mtd> <mtd> <mn>25926</mn> </mtd> <mtd> <mn>939</mn> </mtd> <mtd> <mn>16023</mn> </mtd> <mtd> <mn>76080</mn> </mtd> <mtd> <mn>467016</mn> </mtd> <mtd> <mn>70400</mn> </mtd> <mtd> <mn>763779</mn> </mtd> </mtr> <mtr> <mtd> <mn>23712</mn> </mtd> <mtd> <mn>38973</mn> </mtd> <mtd> <mn>1446</mn> </mtd> <mtd> <mn>24249</mn> </mtd> <mtd> <mn>115179</mn> </mtd> <mtd> <mn>706044</mn> </mtd> <mtd> <mn>105780</mn> </mtd> <mtd> <mn>1154831</mn> </mtd> </mtr> </mtable> </mfenced> </mrow>
Obtaining video pixel position scrambling encryption algorithm is
<mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <mi>S</mi> <mo>=</mo> <mn>0</mn> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>f</mi> <mi>o</mi> <mi>r</mi> <mi> </mi> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>3</mn> <mo>;</mo> <mi>f</mi> <mi>o</mi> <mi>r</mi> <mi> </mi> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>3</mn> <mo>;</mo> <mi>f</mi> <mi>o</mi> <mi>r</mi> <mi> </mi> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>3</mn> <mo>;</mo> <mi>f</mi> <mi>o</mi> <mi>r</mi> <mi> </mi> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>3</mn> <mo>;</mo> <mi>f</mi> <mi>o</mi> <mi>r</mi> <mi> </mi> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>3</mn> <mo>;</mo> <mi>f</mi> <mi>o</mi> <mi>r</mi> <mi> </mi> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>3</mn> <mo>;</mo> <mi>f</mi> <mi>o</mi> <mi>r</mi> <mi> </mi> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>3</mn> <mo>;</mo> <mi>f</mi> <mi>o</mi> <mi>r</mi> <mi> </mi> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>3</mn> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mn>11</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>12</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>13</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>14</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>15</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>16</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>17</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>18</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>2</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mn>21</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>22</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>23</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>24</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>25</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>26</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>27</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>28</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>3</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mn>31</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>32</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>33</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>34</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>35</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>36</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>37</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>38</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mn>41</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>42</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>43</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>44</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>45</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>46</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>47</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>48</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>5</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mn>51</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>52</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>53</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>54</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>55</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>56</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>57</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>58</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>6</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mn>61</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>62</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>63</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>64</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>65</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>66</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>67</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>68</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>7</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mn>71</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>72</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>73</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>74</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>75</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>76</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>77</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>78</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>8</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mn>81</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>82</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>83</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>84</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>85</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>86</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>87</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>A</mi> <mn>88</mn> </msub> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>S</mi> <mo>&amp;LeftArrow;</mo> <mi>S</mi> <mo>+</mo> <mn>1</mn> <mo>;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>e</mi> <mi>n</mi> <mi>d</mi> <mo>;</mo> <mi>e</mi> <mi>n</mi> <mi>d</mi> <mo>;</mo> <mi>e</mi> <mi>n</mi> <mi>d</mi> <mo>;</mo> <mi>e</mi> <mi>n</mi> <mi>d</mi> <mo>;</mo> <mi>e</mi> <mi>n</mi> <mi>d</mi> <mo>;</mo> <mi>e</mi> <mi>n</mi> <mi>d</mi> <mo>;</mo> <mi>e</mi> <mi>n</mi> <mi>d</mi> <mo>;</mo> <mi>e</mi> <mi>n</mi> <mi>d</mi> <mo>;</mo> </mrow> </mtd> </mtr> </mtable> </mfenced>
The second row in formula and last column join together to represent that 8 circulate from 0 to 3 nested；
B. circulated by above-mentioned 8 from 0 to 3 nesting, cycle-index is 216, it is equal with the pixel of a two field picture, according to above formula, The mapping table for obtaining video pixel position scrambling encryption algorithm is as shown in the table：
Because the modulo operation in the video pixel position scrambling encryption algorithm is the computing of mould 4, therefore each single item E in mapping table (S can only i) have 0,1,2,3 four kind of possible value, i.e.,
E(S,i)∈{0,1,2,3}
S=0,1,2 in formula ..., 216- 1, i=1,2 ..., 8；
C. cryptographic calculation：
1. each pixel chronological order number given in two-dimensional video image：It is by a width size before location of pixels scrambling encryption The positional representation of 256 × 256 two-dimensional video image pixel has 65536 pixels into one-dimension array, to should one-dimensional number The length of group is 65536, before location of pixels scrambling encryption, and each pixel one serial number of correspondence, serial number S is pressed every time The order of increase by 1 arranges and meets 0≤S≤216- 1, S (S=0,1,2 ..., 216- 1) size is
<mrow> <mtable> <mtr> <mtd> <mrow> <mi>S</mi> <mo>=</mo> <msub> <mi>x</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>&amp;times;</mo> <msup> <mn>2</mn> <mn>14</mn> </msup> <mo>+</mo> <msub> <mi>x</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>&amp;times;</mo> <msup> <mn>2</mn> <mn>12</mn> </msup> <mo>+</mo> <msub> <mi>x</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>&amp;times;</mo> <msup> <mn>2</mn> <mn>10</mn> </msup> <mo>+</mo> <msub> <mi>x</mi> <mrow> <mn>4</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>&amp;times;</mo> <msup> <mn>2</mn> <mn>8</mn> </msup> <mo>+</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>x</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>&amp;times;</mo> <msup> <mn>2</mn> <mn>6</mn> </msup> <mo>+</mo> <msub> <mi>x</mi> <mrow> <mn>6</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>&amp;times;</mo> <msup> <mn>2</mn> <mn>4</mn> </msup> <mo>+</mo> <msub> <mi>x</mi> <mrow> <mn>7</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>&amp;times;</mo> <msup> <mn>2</mn> <mn>2</mn> </msup> <mo>+</mo> <msub> <mi>x</mi> <mrow> <mn>8</mn> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mo>&amp;times;</mo> <msup> <mn>2</mn> <mn>0</mn> </msup> </mrow> </mtd> </mtr> </mtable> <mo>;</mo> </mrow>
2. the serial number after the scrambling encryption of video pixel position is built：Utilize every a line corresponding 8 E (S, i) (i in mapping table =1,2 ..., 8) serial number after a video pixel position scrambling encryption, is constructed, then the size for corresponding to serial number is
E (S)=E (S, α1)×214+E(S,α2)×212+E(S,α3)×210+E(S,α4)×28+
E(S,α5)×26+E(S,α6)×24+E(S,α7)×22+E(S,α8)×20
α in formulai(i=1,2 ..., 8) ∈ { 1,2 ..., 8 }, α1≠α2≠…≠αn, according to above formula, because S and E (S) is one-to-one , therefore E (S) also has 65536 kinds of different values；
3. video pixel position scrambling encryption Algorithm mapping table is utilized, is that to be mapped to position be E for pixel value at S by origin-location (S) place, thus obtains the ciphertext value p (k) of a two field picture；
D. information transmission：Server end sends the ciphertext value p (k) of a two field picture to clients by Ethernet simultaneously；
E. client carries out anti-Mapping implementation decryption using the mapping table produced in the same fashion to ciphertext value p (k).
2. a kind of video secret communication method of multi-dimension Chaos mapping according to claim 1, it is characterised in that：The step Step in rapid C 3. in specific method it is as follows：
First, the two-dimensional coordinate before setting video location of pixels scrambling encryption be (x, y), then encrypt before two-dimensional coordinate (x, Y) with one-dimension array serial number S (S=0,1,2 ..., 216- 1) relation between is
<mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mi>x</mi> <mo>=</mo> <mi>f</mi> <mi>l</mi> <mi>o</mi> <mi>o</mi> <mi>r</mi> <mo>(</mo> <mi>S</mi> <mo>/</mo> <mn>256</mn> <mo>)</mo> <mo>+</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mi>y</mi> <mo>=</mo> <mi>mod</mi> <mo>(</mo> <mi>S</mi> <mo>,</mo> <mn>256</mn> <mo>)</mo> <mo>+</mo> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced>
Floor represents to round downwards in formula, and mod is modular function；
Secondly, the two-dimensional coordinate after setting video location of pixels scrambling encryption is (xe,ye), then two-dimensional coordinate (the x after encryptinge,ye) Relation between one-dimension array serial number E (S) is
<mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <msub> <mi>x</mi> <mi>e</mi> </msub> <mo>=</mo> <mi>f</mi> <mi>l</mi> <mi>o</mi> <mi>o</mi> <mi>r</mi> <mo>&amp;lsqb;</mo> <mi>E</mi> <mo>(</mo> <mi>S</mi> <mo>)</mo> <mo>/</mo> <mn>256</mn> <mo>&amp;rsqb;</mo> <mo>+</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <msub> <mi>y</mi> <mi>e</mi> </msub> <mo>=</mo> <mi>mod</mi> <mo>&amp;lsqb;</mo> <mi>E</mi> <mo>(</mo> <mi>S</mi> <mo>)</mo> <mo>,</mo> <mn>256</mn> <mo>&amp;rsqb;</mo> <mo>+</mo> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced>
If the video pixel value of correspondence two-dimensional coordinate (x, y) is V (x, y) before the scrambling encryption of position, then position scrambling encryption Two-dimensional coordinate (x is corresponded to afterwardse,ye) video pixel value be Ve(xe,ye), carry out the replacement operator computing shown in following formula
Ve(xe,ye)=V (x, y)
The encryption of the position scramble of video pixel is then realized, the ciphertext value p (k) of a two field picture is finally obtained.
3. a kind of video secret communication method of multi-dimension Chaos mapping according to claim 1, it is characterised in that：The step Specific decryption method in rapid E is as follows：Decryption be encryption inverse operation, if decryption after respective pixel serial number mathematic(al) representation For
D (S)=D (S, α1)×214+D(S,α2)×212+D(S,α3)×210+D(S,α4)×28+
D(S,α5)×26+D(S,α6)×24+D(S,α7)×22+D(S,α8)×20
Two-dimensional coordinate after the decryption of setting video pixel is (xd,yd), then two-dimensional coordinate (xd,yd) with one-dimension array serial number D's (S) Relation is
<mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <msub> <mi>x</mi> <mi>d</mi> </msub> <mo>=</mo> <mi>f</mi> <mi>l</mi> <mi>o</mi> <mi>o</mi> <mi>r</mi> <mo>&amp;lsqb;</mo> <mi>D</mi> <mo>(</mo> <mi>S</mi> <mo>)</mo> <mo>/</mo> <mn>256</mn> <mo>&amp;rsqb;</mo> <mo>+</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <msub> <mi>y</mi> <mi>d</mi> </msub> <mo>=</mo> <mi>mod</mi> <mo>&amp;lsqb;</mo> <mi>D</mi> <mo>(</mo> <mi>S</mi> <mo>)</mo> <mo>,</mo> <mn>256</mn> <mo>&amp;rsqb;</mo> <mo>+</mo> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced>
Floor represents to round downwards in formula, and mod is modular function；
According to above formula, if correspondence two-dimensional coordinate (x after decryptiond,yd) video pixel value be Ve(xd,yd), if to realize video The decryption of image, only need to carry out the replacement operator computing V shown in following formulad(x, y)=Ve(xd,yd), pixel after encryption is corresponding One-dimension array serial number be reduced into S (S=0,1,2 ..., 216- 1), realize and the decryption that reflection is penetrated is carried out to ciphertext value p (k).
CN201410336408.6A 2014-07-16 2014-07-16 A kind of video secret communication method of multi-dimension Chaos mapping Active CN104135669B8 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410336408.6A CN104135669B8 (en) 2014-07-16 2014-07-16 A kind of video secret communication method of multi-dimension Chaos mapping

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410336408.6A CN104135669B8 (en) 2014-07-16 2014-07-16 A kind of video secret communication method of multi-dimension Chaos mapping

Publications (3)

Publication Number Publication Date
CN104135669A CN104135669A (en) 2014-11-05
CN104135669B true CN104135669B (en) 2017-08-25
CN104135669B8 CN104135669B8 (en) 2017-10-10

Family

ID=51808179

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410336408.6A Active CN104135669B8 (en) 2014-07-16 2014-07-16 A kind of video secret communication method of multi-dimension Chaos mapping

Country Status (1)

Country Link
CN (1) CN104135669B8 (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105049877A (en) * 2015-06-02 2015-11-11 阔地教育科技有限公司 Encryption method and device for live and recorded broadcast interaction system
CN105744294B (en) * 2016-02-04 2017-11-17 广东工业大学 The video Development of Chaotic Secure Communication Method that a kind of mobile phone is realized
CN108900868B (en) * 2018-08-14 2020-11-13 苏州科达科技股份有限公司 Video transmission method, device and storage medium based on H.264
CN109788299A (en) * 2019-03-12 2019-05-21 广东工业大学 Video transmission method, system, equipment and computer media between a kind of mobile device

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101431400A (en) * 2008-12-06 2009-05-13 华中科技大学 Encryption/decryption method and system based on chaos hybrid self-synchronizing method
CN102263636A (en) * 2011-05-24 2011-11-30 浙江工业大学 Stream cipher key control method for fusing neural network with chaotic mappings
CN102831569A (en) * 2012-08-17 2012-12-19 华中师范大学 Mobile-service-oriented digital image selective encryption method
CN103473784A (en) * 2013-09-29 2013-12-25 河海大学常州校区 Blurred image self-adaptation recovering method based on high-dimensional space geometry informatics
CN103856786A (en) * 2012-12-04 2014-06-11 中山大学深圳研究院 Streaming media video encryption method and device based on H.264
CN103888637A (en) * 2014-04-08 2014-06-25 广东工业大学 Method for chaotic encryption of multi-path image digital information

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101431400A (en) * 2008-12-06 2009-05-13 华中科技大学 Encryption/decryption method and system based on chaos hybrid self-synchronizing method
CN102263636A (en) * 2011-05-24 2011-11-30 浙江工业大学 Stream cipher key control method for fusing neural network with chaotic mappings
CN102831569A (en) * 2012-08-17 2012-12-19 华中师范大学 Mobile-service-oriented digital image selective encryption method
CN103856786A (en) * 2012-12-04 2014-06-11 中山大学深圳研究院 Streaming media video encryption method and device based on H.264
CN103473784A (en) * 2013-09-29 2013-12-25 河海大学常州校区 Blurred image self-adaptation recovering method based on high-dimensional space geometry informatics
CN103888637A (en) * 2014-04-08 2014-06-25 广东工业大学 Method for chaotic encryption of multi-path image digital information

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于局域网的混沌视频加密研究与实现;禹思敏 李黎明;《电子世界》;20140515(第9期);1-138 *
基于混沌理论的信息加密技术研究;宋春艳;《中国博士学位论文全文数据库》;20130101;1-125 *

Also Published As

Publication number Publication date
CN104135669A (en) 2014-11-05
CN104135669B8 (en) 2017-10-10

Similar Documents

Publication Publication Date Title
EP2791855B1 (en) Preserving image privacy when manipulated by cloud services
CN104135669B (en) A kind of video secret communication method of multi-dimension Chaos mapping
CN103888637B (en) The method of multiway images digital information chaos encryption
CN101894359B (en) Image scrambling encryption method
CN111031193B (en) Image encryption method based on three-dimensional composite scrambling model and chaos
CN106296560A (en) A kind of multicolor image encryption algorithm of complex cascade chaos
CN109660696A (en) A kind of new image encryption method
Soleymani et al. A novel public key image encryption based on elliptic curves over prime group field
CN106558015B (en) Novel cross composite chaotic color image encryption algorithm
CN104883580B (en) Video security convolution computing system and method based on homomorphic encryption
Anbarasi et al. Secured secret color image sharing with steganography
SaiChandana et al. A new visual cryptography scheme for color images
CN106791882A (en) A kind of coding encrypting method and device of image
CN110348229A (en) Data encryption method and device and data decryption method and device
CN106599703A (en) Mixed primitive and chaos-based multi-image encryption method
Sharma et al. Visual cryptographic techniques for secret image sharing: a review
CN105744294B (en) The video Development of Chaotic Secure Communication Method that a kind of mobile phone is realized
Dhingra et al. A novel Sine–Tangent–Sine chaotic map and dynamic S-box-based video encryption scheme
Gupta et al. Efficient hybrid image cryptosystem using ECC and chaotic map
Shahana A secure DCT image steganography based on public-key cryptography
CN110062129B (en) Image real-keeping encryption method and system
KR101909284B1 (en) Encryption apparatus and method for protecting digital contents on the basis of chaos map
Tabash et al. Image encryption algorithm based on chaotic map
Chen et al. On the design of a two-decoding-option image secret sharing scheme
Singh et al. DIP using image encryption and XOR operation affine transform

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information

Inventor after: Lin Zhuosheng

Inventor after: Yu Simin

Inventor after: Lv Jinhu

Inventor before: Lin Zhuosheng

Inventor before: Yu Simin

COR Change of bibliographic data
GR01 Patent grant
GR01 Patent grant
CI03 Correction of invention patent

Correction item: Inventor

Correct: Lin Zhuosheng|Yu Simin|Lv Jinhu

False: Lin Zhuosheng|Yu Simin

Number: 34-02

Volume: 33

Correction item: Inventor

Correct: Lin Zhuosheng|Yu Simin|Lv Jinhu

False: Lin Zhuosheng|Yu Simin

Number: 34-02

Page: Fei Ye

Volume: 33

CI03 Correction of invention patent