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

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：To each pixel chronological order number in two-dimensional video image；Build the serial number after the scrambling encryption of video pixel position：Using video pixel position scrambling encryption Algorithm mapping table, it 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 video secure communication method based on high-dimensional mixed pure mapping

Technical field

[0001] The present invention relates to a video secure communication method, specifically a high-dimensional chaotic mapping video secure communication method.

Background technique

[0002] In 1989, British mathematician Mattllews first proposed a text encryption scheme based on one-dimensional Logistic mapping. Since then, chaotic encryption has become a research hotspot. The chaotic system is applied to image encryption. It was first proposed by Fridrich in 1997. The two-dimensional Baker map and the Cat map were used to transform the pixel position. However, the key space of the two-dimensional Cat map was too small and limited to square-sized images. encryption. On the basis of Fridrich, Chen and Mao extended the two-dimensional Baker mapping and the two-dimensional Cat mapping to three-dimensional, and respectively proposed a fast image encryption scheme using three-dimensional mapping. Feng et al. proposed a line map image encryption algorithm based on the principle of chaotic stretching and folding, and then used the idea of ​​image segmentation to propose a chaotic map image encryption algorithm. In recent years, two-dimensional chaotic mapping has been extended to three-dimensional space for image encryption, such as the 3D Baker map image encryption algorithm proposed by Mao et al., and the 3D Catmap image encryption algorithm proposed by Chen G.

[0003] The State Intellectual Property Office published on December 19, 2012, the publication number CN102831569A, and the patent name is an invention patent document for a mobile phone service-oriented digital image selection encryption method. The patent document includes the fractional wavelet low frequency to be encrypted. The selection of subbands, the determination of the image chaotic encryption key, the image encryption operation and the evaluation of encryption quality; among them, the determination of the image chaotic encryption key requires the following parameters to be determined in order to realize the fractional wavelet transform and chaotic encryption:

[0004] (1) The control parameter a of the chaotic sequence is given by the user;

[0005] (2) The scale team of the image wavelet transform is given by the user;

[0006] ⑶ The fractional order y of the fractional wavelet transform, and satisfies 〇<y<2, given by the user;

[0007] ⑷The initial value of the chaotic sequence X⑼, its determination process is as follows:

[0008] Step 1. Assuming that the original image is m-bit, choose 5 pixels P1, P2, P3, P4, P5 from the selected subband, and obtain the subband from the pixel values ​​of these 5 points The initial value of the chaotic sequence;

[0009] Step 2. Calculate the initial value of the chaotic sequence of the selected wavelet subband according to the following formula:

[0010] The above-mentioned four parameters a, ¢, Y, x⑼ constitute the key of the selected sub-band image encryption;

[0011] The image encryption operation is as follows: Step 1. For the selected wavelet low-frequency sub-band, set the size of the sub-band to be N1 X N2, use this fractional wavelet low-frequency sub-band to generate a series of initial values ​​X (〇), according to The chaotic sequence is generated by the following mapping: X (n+1) = cos (a • arccos (X (n))⑷, where c[ is the control parameter, and X (n) G [-1, 1], at this time The generated sequence is chaotic. Since this chaotic sequence is bipolar, it is transformed into a unipolar sequence in [0,1] according to the following transformation: the length of this sequence is taken as N1 X N2, and this N1 X N2 values ​​are converted into a chaotic matrix with N1 rows and N2 columns, denoted as U;

[0012] Step 2. Encrypt the selected fractional wavelet low-frequency subband, and the encryption is calculated according to the following formula: Among them, is the XOR operation, ValueNew (i, j) and Value01d (i, j) are the selected fractional wavelet low-frequency, respectively After sub-band encryption, the low-frequency sub-band fractional wavelet coefficients in the i-th row and j-th column of the encrypted target U;

[0013] Step 3. After replacing the encrypted fractional wavelet low-frequency sub-band with the encrypted fractional wavelet low-frequency sub-band, perform inverse wavelet transform to obtain the initial encrypted image;

[0014] Step 4. Divide the obtained initial encrypted image into four sub-images of the same size, and then rotate the four sub-images in a clockwise direction, and the obtained image is the final encrypted image.

[0015] The technical solution of the above-mentioned patent is completely different from the technical solution of this patent.

Summary of the invention

[0016] The object of the present invention is to provide a video secure communication method of high-dimensional hybrid mapping with strong confidentiality and high degree of encryption restoration. U

[0017] In order to achieve the above objective, the technical solution adopted by the present invention is:

[0018] A high-dimensional chaotic mapping video secure communication method, including the following steps:

[0019] A. Establish the dynamic equation of the 8-dimensional discrete chaotic map: ::¾. dimension.=.: visit&amp;成4铁"::light pain 2¾¾ ten:'-:, method. is A,*, .2 :)

[0020] Mie is 2¾ jealous. For production) Yi 8 Le: 1; Iron is .1: High gray step is a botan; 2, 丨..: Yu...+为8气1^.:窆:.:8 )

[0021] In the formula, Ni (i = 1, 2,..., 8) = 2, A8 = (Aij) 8x8 (i, j = i, 2, "., 8) The construction method is where: \ /=: +i contains "i hairpin", 0 1 — 0 Gou^ 0 ：：,.：：〇：：：：0 0 0 1 0 •, 0 0

[0022] 〇: q: 〇... :t: •>: 〇〇〇Cif 0 (j 1':〇. 靖0' _:0 0:... Magic 〇: ii 〇: 〇: i,

[0023] The subscript order 〇i, j, where the value of i, j should meet the conditions 2.---, 7

[0024] = / + 2/.,,1

[0025] One of the subscript sorts is selected as:

[0026] 〇i,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, the corresponding transformation matrix A8 is the product of Tij, which is 3990517 9sha 8413 226236 4794X46 22802340 143956428 2426531 I 23-shaped 78586,; 103377 170555 3300 72240 3450S4 2207175 389517 3597285 (Aa A, — such as 64191 丨4931951 341X37 7246707 M4635 or 217599315 36692J73 355<): 5()个45

[0027] 4: '4'~ ... 4251336 7002429 162735 3440882 16357955 103167336 17326695 168341529 "...... 1743033 28709: U 66858 1412607 6715337 42346893 7108446 69099612 \4i: - 4a y 6081 10086 195 2703 133M 88019 leslS 143121 157々4: .:259^6 939 16023 76080: 46t016 70400 辉3々difficult, 23712": mm 1446 24249 :1::151 treatment 70; 6Q44 t〇57_:1:|:5483; 1:. :/

[0028] The video pixel position scrambling encryption algorithm is f S=0 to^=0:3; fors=0:3; fe, =0.3; feh=〇:3; te^=〇:3; fel=0 :3;fcrM^3_M:_3; ECS, 1) = mod (4,xu + AI2xu + 4,.tj,4 + A,Aa + 4^s,t + + + ^8¾.^ ^ E(S, 2) = mod(4,x, 4 +,A,x%, + A23x{J + ^4¾.* + ^si + + Ar<x^ 4 4>*:: machine?, 3)=脑d ( 'J31xu + person + 4,¾ + +¾ * + 4A* + + + is A” 4>; r ^ I 啦4) = mod (为和+ ,4A, + 4A〆心4 i + 4和+ + 4*〆〆4A*'You: L ”EiS 5) = mod <4,x, (+ 4^,,^ + + ^ i + ^ <+ <+ + ^1, 4)" E(S, 6 ) = mod (4,.xu + A^2x2> + + A>x> * + + ^x〇1 + ^^7-* + '4), £(5; 7>= mod (4,¾ + For/to + 43xw + to 〆+ for A* + for 〇xw + for Aw + '4)' £(•?, 8> = mod(.Vu + for ~+] 4¾ + for + + Vw' 4) ; s<-s-\ke shout etirt; Lang Chuxiong_

[0030] The second line and the last line in the formula jointly represent 8 nested loops from 0 to 3;

[0031] B • Through the above 8 nested loops from 0 to 3, the number of loops is 216, which is equal to the pixels of a frame of image. According to the above formula, the mapping table of the video pixel position scrambling encryption algorithm is shown in the following table : Easy £'(5,1) £ (5,2) E (5,3): •,. Ming働)

[0032] 0 £-((),1) £-(0,2) Ei〇M clothing service. 1 .._:1., .1.): :(1,2;):: j: (w):丨… ••，霉'1 ^.(1,:1):.五1¾¾: :... 桗顚)

[0033] 1 ：; ：：-丨, ::k__^__ 2¾ ^(21(>-1,1) £(^6AA ^ 颜释6巧身

[0034] Since the modulo operation in the video pixel position scrambling encryption algorithm is a modulo 4 operation, each item E (S, i) in the mapping table can only have four possible selections: 0, 1, 2, and 3. Value, i.e.

[0035] E(S,i) e {〇,1,2,3}

[0036] where S = 0, 1, 2, ..., 216_l, i = 1, 2, ..., 8;

[0037] C. Encryption operation: _ _

[0038] ① Arrange a sequence number for each pixel in the two-dimensional video image: before the pixel position is scrambled and encrypted, the pixel position of a two-dimensional video image with a size of 256X256 is expressed as a one-dimensional array, with a total of 65536 pixels. The length of the one-dimensional array should be 65536. Before the pixel position is scrambled and encrypted, each pixel corresponds to a sequence number. The sequence number 3 is arranged in the order of increasing by 1 each time and satisfies 〇彡s<216-1, S (S = The size of 0,1,2,…，216-1) is ~ xitk x + x7,kx 2 2 + x 2 + x4 kx 2 :'+. ^

[0039] x 26 + x 24 + a.7J x 22 + x 2°

[0040] ②Construct the sequence number of the video pixel position scrambled and encrypted: use 8 E(S, i) (i=1, 2,..., 8) corresponding to each row in the mapping table to construct a video pixel position The sequence number after random encryption, the size of the corresponding sequence number is

[0041] E(S)=E(S,ai) X214+E(S,a2) X212+E(S,a3) X210+E(S,a4) X28+

[0042] E (S, a5) X 26+E (S, a6) X 24+E (S, a7) X 22+E (S, a8) X 2

[0043] In the formula, ai (i = l, 2,••., 8)e{l, 2,..., 8}, cllテa2 is off...off an. According to the above formula, since S and E⑸ are one-to-one, E⑸ also has 65,536 different values; &amp;

[0044] ③Using the video pixel position scrambling encryption algorithm mapping table, map the pixel value at the original position S to the position E⑸, thereby obtaining the ciphertext value p⑹ of a frame of image; &amp;

[0045] D. Information transmission: the server simultaneously transmits the ciphertext value P (k) of a frame of image to the client via Ethernet;

[0046] E. The client uses the mapping table generated in the same way to reverse-map the ciphertext value P (k) to achieve decryption.

[0047] Further, the specific method in step ③ in step C is as follows: _一

[0048] First, suppose the two-dimensional coordinates of the video pixel position before scrambling and encryption are (x, y), then the two-dimensional coordinates (x, y) before encryption and the one-dimensional array sequence number S (S = 0, 1, 2. The relationship between …, 216-1) is 1^: == ：floor(S: / 256) H-;l [0049] 啦，256)_

[0050] In the formula, floor represents rounding down, and mod is a modular function; 、

[0051] Secondly, assuming that the two-dimensional coordinates of the video pixel position scrambled and encrypted are (x6, h), the relationship between the encrypted two-dimensional coordinates (Xe, ye) and the sequence number E⑸ of the one-dimensional array is "00521 ^ ^ 2561+1 ]_凡=modl£(S), 256 div 1.

[0053] If the video pixel value corresponding to the two-dimensional coordinates (x, y) before the position scrambling and encryption is V(x, y), then the video pixel value corresponding to the two-dimensional coordinates (Xe, ye) after the position scrambling and encryption is w (x6, ye), perform the permutation operation shown in the following formula

[0054] Ve (xe,ye) =V (x,y)

[0055] The encryption of the position scrambling of the video pixels is realized, and the ciphertext value P(k) of a frame of image is finally obtained.

[0056] Further, the specific decryption method in step E is as follows: decryption is the inverse operation of encryption, and the mathematical expression corresponding to the pixel sequence number after decryption is

[0057] D(S)=D(S,ai) X214+D(S,a2) X212+D(S,a3) X210+D(S,a4) X28+D(S,a5) X26+D( S, a6) X24+D(S,a7) X22+D(S,a8) X2°

[0058] Assuming that the two-dimensional coordinates of the decrypted video pixels are (Xd, yd), the relationship between the two-dimensional coordinates (xd, yd) and the sequence number D (S) of the one-dimensional array is "Q=flooi'l />( $) / 2561 +1

[0059] "''. '= Mod| D(S)? 2561 + 1

[0060] In the formula, floor is not rounded down, and mod is a function;

[0061] According to the above formula, it is assumed that the video pixel value corresponding to the two-dimensional coordinates (xd, yd) after decryption is (xd, yd). If you want to decrypt the video image, you only need to perform the replacement operation shown in the following formula% (x, y) =Ve (Xd, yd), restore the sequence number of the one-dimensional array corresponding to the encrypted pixel to S (S = 0,1,2,...,216-1), and realize the ciphertext value P ( k) Decryption of the reverse mapping.

[0062] The beneficial effects of the present invention: due to the adoption of the above method, compared with similar methods, it has the characteristics of strong confidentiality and high encryption reduction.

Description of the drawings

[0063] FIG. 1 is a block diagram of a video secure communication system based on high-dimensional chaotic mapping;

[0064] FIG. 2 is a working flow chart of the Client side;

[0065] FIG. 3 is a working flow chart of the Server side.

Detailed ways

[0066] As shown in Figures 1, 2, and 3, the hardware configuration of the video high-dimensional chaotic map encryption: use two Super 4412 ARM boards to establish a Server-Client model, and establish the respective sockets of the Server and the Client as communication between the two parties. The basics. The ARM development board with real-time image acquisition and high-dimensional chaotic mapping encryption is used as the client side. It consists of eight parts: camera, V4L2 driver, JPEG decompression, chaotic encryption, H.264 compression, network card driver, Ethernet port, and LCD screen. The video data after chaos encryption and H.264 compression is transmitted via Ethernet. The ARM development board for high-dimensional chaotic map decryption serves as the server side and is responsible for receiving the transmitted ciphertext information. The Ethernet port, network card driver, H.264 decompression, chaos decryption, and LCD display are composed of five parts. Both the Cl ient and Server sides run the embedded Linux operating system on the Cortex-A9 processor. The functions of the above corresponding parts are realized through C++ programming. Since the video image data output by the USB camera is a hardware-encoded JPEG compression format, it is necessary to decompress each frame of JPEG image with JPEG before the corresponding RGB three-color video format can be obtained. In addition, the LAN communication adopts socket programming, and adopts connection-oriented and reliable TCP protocol.

[0067] Using the above hardware configuration to realize video secure communication, a high-dimensional chaotic mapping video secure communication method includes the following steps:

[0068] A • Establish the dynamic equation of the 8-dimensional discrete chaotic map: • VUM + 2 ')

[0069] <~+1=mod(为，¾ +42义" +..' + 4sx8i, 2A'> ,XS./t+1 +为2又'2_4 +...+ 2 s)

[0070] Where (1 = 1, 2, "., 8) = 2, six 8 = to.) 8><8 (1, "=1, 2, "., 8) is constructed as =ni,g,':, where: ii::〇i. ft 0: …Uf:i:〇:g::〇: :ij::;:;

[0071] 0 p -v: i 〇. ::〇; 0::: Order: \ Q: (i -:• 〇ii om «- 〇:-: 〇m I. i〇'

[0072] The subscript order Oi, j, where the value of i, j should meet the conditions ^ ~ 1»2, • * •,?

[0073] -1=/ + 1,/ + 2.---, 8.m

[0074] One of the subscript order 0ij is selected as:

[0075] 〇ij=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, and 12 are the product of the corresponding transformation matrix A^Tij, and get '5990537 986M13 226236 4794846 22802340 143956428 2426531J 23487K586" touch 377 170555 3300 72240 345054 2207175 389517 35972B5:'Volume: 4», 4s , 9064191 14931951 341837 7246707 34463589 2175^9315 36692373 355030845 1 4n 4s 4251336 7002429 l〇2735 3440SB2 l〇357935 10316^336 17326695 168341529 L〇〇" ,：>：： ,,•： ^ 1712607 4243033 2870931 6685S 1412607 6715446337690346893 , Today is 2: two 60S1 10086 195 2703 13386 88019 16818 143121 15774 259.26 939 L6023 76080 467016 704^)0 763779 ,23712 3973 1446 24249 115179 7〇MM 105780 1154^1 j,

[0077] The video pixel position scrambling encryption algorithm is ^ = 0; for xu = 0:3; for X, A * 0:3; for x^k = 0:3; for x4 A = 0: 3; foi A-0:3; for x^k = 0:3; for ,t7 A = 0 • J; for ^ = 0:3; 1.) HlD.d + "t" ^ 4)r £(5; 2 ) = mod + is 2xw + is, 3〆44x4i + 4¾.+. is 6.~:..+ 4: 7'A +4); E(S, 3) = mod (4,.yu + A3Zxu 4 Jryxu 4 J``xu + + A^k + 4); 1 ^(5, 4) = mod H- A42x2 k + A4^ k -t Ai4x4 k + A45x5 k + A46x6 i + A41xiik +, 4); E( S\ 5)=: taod.p5,^. + + + ^); E{S, 6)-: mod + %%:: + .+A&amp;\k^ 4)i E(S, 7) + A12X1X +vi7jX3^ +-^4¾^ A5Xu + AAk + + ^78^8,ft> 4)> :S): = ^p4^^ + 4^fi: # 44¾.+ AsS, i: &amp; + 4y ^7 s + 4sa. a ^ 4): SS + J; end; end; end; end; end; end; end; end;

[0079] The second and last lines in the formula combine to represent 8 nested loops from 0 to 3;

[0080] B. Through the above 8 nested loops from 0 to 3, the number of loops is 2, and according to the above formula with the pixels of a frame of image, the mapping table of the video pixel position scrambling encryption algorithm is shown in the following table: __: $ £(5,1) £(5,2) ^(with 3);... Li Bao is about 0 £(0,1) E(0,2)石(〇,3)... State (明1 # (1,1) Hui J> Secret_… Entangled: (full

[0081] ................. ::..... ...... …一^—---.....一———— —— 1 M: tMf late (¾¾ £(2,3)… E (2,8) ：：： :: ... .:., .. ；•• ♦.. ........ .+—.... +.. 2:16-1 丨...五(2叱1，,

[0082] Due to the modulo operation and modulo 4 operation in the video image scrambling encryption algorithm, each (S, i) in the mapping table can only have four possible values ​​of 0, 1, 2, 3 ,Right now

[0083] E(S,i) e {0,1,2,3}

[0084] where S = 0,1,2,...,2^-1,1 = 1,2,...,8;

[0085] C • Encryption operation: one to one, one to one

[0086] ① Arrange a sequence number for each pixel in the two-dimensional video image: scrambling the position of the marrow, and not to express the position of the two-dimensional video image with a size of 256 X 256 as a one-dimensional array, with a total of 65536 Pixel points, the length of the corresponding one-dimensional array is 65536. Before the pixel position is scrambled and encrypted, each pixel corresponds to a sequence number. The sequence number S is arranged in the order of increasing by 1 each time and satisfies 〇≦3≦216-1 , The size of 5 (5 = 0, 1, 2, "_, ​​216-1) is 0 = x 214: + x2j; x 2U + x} kx 2UI + ,r4 A. x 25 + ^

[0087] x5 A x 26 + x61 x + A x 2J + xgt x 2°

[0088] ②Construct the sequence number of the video pixel position scrambled and encrypted: use 8 E(S, i) (i=1, 2, ~, 8) corresponding to each row in the mapping table to construct a video pixel position The sequence number after random encryption, the size of the corresponding sequence number is

[0089] E ⑸ Two already dagger~) X214+E(S, a2) X212+E(S, a3) X210+E(S, a4) X28+

[0090] E (S, a5) X 26+E (S, a6) X 24+E (S, a7) X 22+E (S, a8) X 20

[0091] In the formula, ai (i = 1, 2,..., 8) G {1,2,...,8} close... close an. According to the above formula, since S and E⑸ are one-to-one, E (S) also has 65,536 different values;

[0092] ③Using the video pixel position scrambling encryption algorithm mapping table, map the pixel value at the original position S to the position E⑸, thereby obtaining the ciphertext value p⑹ of a frame of image, the specific method is as follows:

[0093] First, suppose the two-dimensional coordinates of the video pixel position before scrambling and encryption are (x, y), then the two-dimensional coordinates (x, y) before encryption and the one-dimensional array sequence number s (S=0, 1, 2. The relationship between …, 216-1) is rn fx--= tW(5/256) + 1

[0094] [). = -.1(5. 256)+1

[0095] In the formula, floor is not rounded down, and mod is a modular function;

[0096] Secondly, assuming that the two-dimensional coordinates of the video pixel position scrambled and encrypted are (xe, ye), the relationship between the encrypted two-dimensional coordinates (Xe, ye) and the sequence number E (S) of the one-dimensional array Is "0097] f- =^^[£(S) 25(,1 + 1 [ve =mod|/T(.S')! 256|+1

[0098] If the video pixel value corresponding to the two-dimensional coordinates (x, y) before the position scrambling and encryption is V (x, y), then the video pixel value SVe corresponding to the two-dimensional coordinates (xe, ye) after the position scrambling and encryption is (xe, ye), then, we perform the permutation operation shown in the following formula

[0099] Ve (xe,ye) =V (x,y)

[0100] The encryption of the position scrambling of the video pixels is realized, and the ciphertext value P 〇〇 of a frame of image is finally obtained.

[0101] D. Information transmission: the server simultaneously transmits the ciphertext value P(k) of a frame of image to the client via Ethernet;

[0102] E. The client uses the mapping table generated in the same way to reverse-map the ciphertext value P(k) to achieve decryption.

[0103] Decryption is the inverse operation of encryption. Suppose the mathematical expression of the pixel sequence number after decryption is

[0104] D(S)=D(S,〇i) X214+D(S,a2) X212+D(S,a3) X 210+D (S,a4) X 28+

[0105] D(S,a5) X26+D(S,a6) X24+D(S,a7) X22+D(S,a8) X20

[0i06] Assuming that the two-dimensional coordinates of the decrypted video pixels are (Xd, yd), the relationship between the two-dimensional coordinates (xd, yd) and the one-dimensional array sequence number D (S) is \x, =n〇〇iiDC. S)/256|+1 [0107] 4 '1 = mod| 0(.¾ 256 卜1

[0108] In the formula, floor represents rounding down, and mod is a modular function;

[0109] According to the above formula, suppose the video pixel value corresponding to the two-dimensional coordinates (xd, yd) after decryption is Mxd, yd). If the decryption of the video image is to be realized, then we only need to perform the replacement operation shown in the following formula Operation Vd (X, y) = (Xd, yd), restore the sequence number of the one-dimensional array corresponding to the encrypted pixel to S (S-2 0, 1, 2, ..., 216-1), and realize the ciphertext value P (k) Decryption of the reverse mapping.

[0110] There are two cases of decryption: the parameters and keys of the sending end and the receiving end are the same, D(s) = E(S), V(x, y) = Vd (x, y), and the receiving end can decrypt correctly Original video image; the parameters and keys of the sending end and the receiving end are different, D⑸#E(S), V(x,y) #Vd (x,y), the receiving end cannot decrypt the original video image correctly.

[0111] Note that when implemented with ARM, on the one hand, it is necessary to consider the real-time requirements of the video. From the perspective of speed, the encryption algorithm cannot be too complicated and time-consuming, and the number of dense rounds cannot be too many. Usually in hardware experiments, the number of encryption rounds is selected as i. When implemented by ARM, the conservative estimate of the key space size is [0112] Ks= (8 X 7) /2)! X 8! = 1.2293 X 1034.

[0113] The above are the preferred embodiments of the present invention. Of course, it cannot be used to limit the scope of rights of the present invention. The equivalent replacement does not depart from the protection scope of the technical solution of the present invention.

Claims (3)

1. A high-dimensional chaotic mapping video secure communication method, which is characterized in that it includes the following steps: A. Establishing the dynamic equation of the 8-dimensional discrete chaotic mapping: Qi iv_ Xiong Qi table: +为为.2: Flag .A^c^^-2 ^, XS,jU1 -+ is 2¾^ + …+ is s-^a:, 2) where Ni(i二1,2,…,8) =2, A8= ( ^) The construction method of shape 8(1,"=1,2,._,8) is 4=so!!1,,., its (=1 ^ f=Sl+1 / middle: '1: ); >〇: ::i:. _,,:. 〇A:: :¾ ….〇o: No. 5.: 〇:&amp;: (3:: .¾ 1 …:(3:: .:0: : 0 .0 …:.::i: .¾ 1^' ：：〇〇,,, ：(j' ：：MQ;： 〇> :¾. l o': \ :丨丨:..0 1 y subscript order Oi, j, where the value of i, j should satisfy the condition <./-/ + 1,/ + 2,'.:, J choose one of the subscript order Oij as: 〇i ,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 is the product of the corresponding transformation matrix A8*Tij, which is ^5990537 9868413 226236 4794846 22802340 143956428 24265311 234878586^ 103377 170555 5300 72240 345054 2207175 389517 3597285 An 9064191 1493J951 34J837 7246707 34463 2175993J5 36692373355030707 32 4$ ^ 4251336 7002429 162735 34408.82 16357935 103167336 17326695 168341529 ... 1743033 287093] 6685S 1412607 6715337 42346893 7108446 69099612 4a $sj 6081 10086 195 2703 13386 88019 16818 14_bismuth丨15774 25926 939 16023 76080 4670] 6 70400:, drop: ,23712 38973 1446 24249 115179 706044 105 780 |i: 54831 y The video pixel position scrambling encryption algorithm is \s=o; forx A-0.3, f〇r^2 A =0:3; tbrx,^ -0:3; tbrx4fc-〇:3; f〇r.x5 A =〇: 3; tbrx6i =0:3; f〇rx7j[ = 0:¾¾¾ ^ E(S, l) = mod(4,.\: M +4, xm +44x4iA +45x5iA + ^,6xw + ^,7x7jt-h 48%s, 4); £ (乂2> = mod (4,¾! 42x2 A + 44xv + 毛X'〆 is ~ + + j2sXu, 4), £(S, 3) = mod (Ai)xU/l + + Aasxm 4 +A5x-s,k + k ^ Anx^kh: 4); and 4 卜脑W儿a; +」42;r2, + + +办~ "Zhao~, 4); 5) = m〇d (for 1 Qi 4-忒 2'A + 4¾ + 44-\A +-46Ta + "57X to 4" VYS "4); £'(5f>6 ) = modf4>1vu+-4: t2^ + f i6A64 4 47r7, n ^6SrM; 4>, EiS, 7) =mod (4,x, A + A12xXk + A12xi k + Aax^ + + + + 4); ^(5, 8) ^ mod (4,^ + 42x2 A + 4^-3 A + 44x4 ft + + ^6x6; + 4?.^ A + ^Xsk, 4); :Sf 射1; end; end ; end: end; exingeiid; tank; Lai; The second and last lines in the formula combine to represent 8 nested loops from 0 to 3; B. Through the above 8 nested loops from 0 to 3 , The number of cycles is 2i6, which is equal to the pixels of a frame of image. According to the above formula, the mapping table of the video pixel position scrambling encryption algorithm is shown in the following table: SE(s,l) £(5,2) j £(5 ,3) ••• £(5,8) §; f(0,l) ^(0,2) £(〇,3)-^(0,8) 1 ^(1,1) 观1，_ With 1, respect...; Five (1 should 2 丨 core(2,:1) E:UM \ #:(2,;|)… 丽尽8) ;丨: • 丨一，:. ••. •: 216-1 £(216-1,1) E(216-l,2) £(2!6-1,3) “'^(2,6-1,8) Encrypted due to the scrambling of the video pixel position The modulo operation in the algorithm is a modulo 4 operation, so each item in the mapping table E (S, i) There can only be four possible values ​​of 0, 1, 2, 3, namely E(S,i) e {0,1,2,3} where S=0,l,2,...,216- l, i two 1,2,..., 8; C. Encryption operation: ① Arrange a sequence number for each pixel in the two-dimensional video image: before the pixel position is scrambled and encrypted, a 256X256 two-dimensional video image pixel The position of is expressed as a one-dimensional array, with a total of 65536 pixels. The length of the corresponding one-dimensional array is 65536. Before the pixel position is scrambled and encrypted, each pixel corresponds to a sequence number, and the sequence number S is arranged in the order of increasing 1 each time And satisfy 0≦S≦216-1, the size of S (S = 0,1,2,...,216-1) is S = x^x2l4+ xl lc x 2'2 +: a^tx 210 + x 28 + x 26 +% x 2? + ～x#: '② Construct the sequence number of the video pixel position scrambled and encrypted: use 8 E (S, i) (i =1, 2,..., 8) Construct a sequence number after scrambling and encrypting the position of the video pixel, then the size of the corresponding sequence number is E(S) =E(S,a!) X214+E(S,a2) X212+E(S,a3 ) X210+E(S,a4) X28+ E(S,a5) X26+E(S,a6) X24+E(S,a7) X22+E(S,a8) X2° where ai(i = l, 2,…, 8) E {1, 2,…, 8} is called ancient Yiguan…guanan. According to the above formula, since S and E⑸ are one-to-one, E⑸ also has 65,536 different values; ③Use The video pixel position scrambling encryption algorithm mapping table maps the pixel value at the original position S to the position E (s), thereby obtaining the ciphertext value P GO of a frame of image; D. Information transmission: server side at the same time The ciphertext value p⑹ of a frame of image is transmitted to the client via Ethernet; E. The client uses the mapping table generated in the same way to reverse the ciphertext value p(k) to achieve decryption. 2. A high-dimensional chaotic mapping video secure communication method according to claim 1, characterized in that: the specific method in step ③ in step C is as follows: First, set the video pixel position to scramble before encryption The two-dimensional coordinates are (x, y), then the relationship between the two-dimensional coordinates (x, y) before encryption and the one-dimensional array sequence number S (S = 0, 1, 2, ..., 216-1) is | ,T = f1ooitS-256) + 1 j two mod(>S, 256) + 1 where floor means rounding down, and mod is a modulus function; secondly, set the two-dimensional coordinates of the video pixel position scrambled and encrypted as (xe,^), the relationship between the encrypted two-dimensional coordinates (xe, h) and the one-dimensional array sequence number E is [r = £100^(5) 256] + 3 =mod[£(5j. 256J+1 If the video pixel value corresponding to the two-dimensional coordinates (X, y) before the position scrambling and encryption is V (X, y), then the video pixel value corresponding to the two-dimensional coordinates (Xe, ye) after the position scrambling and encryption is Ve (Xe, ye), perform the replacement operation shown in the following formula. Ve (xe, ye) = V (x, y) realizes the encryption of the position scrambling of the video pixels, and finally obtains the ciphertext value of a frame of image P (k). 3. A high-dimensional chaotic mapping video secure communication method according to claim 1, characterized in that: the specific decryption method in step E is as follows: decryption is the inverse operation of encryption, and the corresponding pixel sequence number after decryption is assumed The mathematical expression of is D (S) = D (S, ai) X 214+D (S, a2) X 212+D (S, a3) X 210+D (S, a4) X 28+ D(S, a5) X26+D(S,a6) X24+D(S,a7) X22+D(S,a8) X2° Assuming that the two-dimensional coordinates of the video pixel after decryption are (xd,yd), then the two-dimensional coordinates (xd ,yd) and the one-dimensional array sequence number D (S) relationship is [a;, = floor[Z)(.S') 256]+L | \(( =niodfD(.V), 256] + l The floor means rounding down, and m〇d is the modulus function; according to the above formula, the video pixel value corresponding to the two-dimensional coordinates (Xd, yd) after decryption is set to Ve (xd, yd), if you want to achieve the decryption of the video image , Only need to perform the replacement operation Vd(x,y) =Ve(Xd,yd) as shown in the following formula, and restore the one-dimensional array sequence number corresponding to the encrypted pixel to S (S = 0,1,2,... , 216-1), to realize the decryption of the reverse mapping of the ciphertext value P⑹.