A Multi-Image Diffusion Method Based on Russian Nesting Dolls and Differential Coding

By constructing a Russian nesting doll structure and a multi-image diffusion method using differential coding, the problems of low image encryption efficiency and insufficient security in existing technologies are solved, and an efficient and secure image encryption and decryption process is achieved.

CN117319570BActive Publication Date: 2026-11-17CHINA UNIV OF MINING & TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202311412613.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-10-30
Publication Date
2026-11-17
Estimated Expiration
2043-10-30

AI Technical Summary

Technical Problem

Existing image diffusion methods have low encryption efficiency or insufficient security, and cannot effectively protect the security of images during network transmission and storage.

Method used

A multi-image diffusion method based on Russian nesting dolls and differential coding is adopted. By constructing a Russian nesting doll structure, the plaintext image is converted into a one-dimensional vector layer by layer for differential coding to generate a diffusion image. Chaotic sequences are then used for encryption and decryption.

Benefits of technology

It improves the security and efficiency of image encryption, achieves secure network transmission and storage of image information, and has a good dissemination effect.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117319570B_ABST
    Figure CN117319570B_ABST
Patent Text Reader

Abstract

This invention proposes a multi-image diffusion method based on Russian nesting dolls and differential coding, belonging to the field of information encryption. With the rapid development of network technology, network information transmission security issues are becoming increasingly serious. To address the security problems of network transmission and storage of image content, this invention proposes an image diffusion method based on Russian nesting dolls and differential coding. First, multiple plaintext images are constructed into Russian nesting dolls; second, the six faces of each layer of the Russian nesting doll are sequentially converted into one-dimensional vectors for differential coding to generate an encrypted image; finally, experimental results show that this method has strong security, good and efficient diffusion effect, and can ensure that image information is not stolen during network transmission.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This method relates to an information encryption technique, and in particular to an image diffusion method. Background Technology

[0002] With the rapid development of internet technology, images are gradually becoming an important information carrier in social communication. They are characterized by their intuitiveness, vividness, and large information content, and are widely used in fields such as communications, military, and medicine. However, due to the openness of network platforms, solving the problem of image information leakage and decryption during transmission has become a significant challenge. Therefore, to prevent images from being accessed without authorization or maliciously attacked, leading to information leakage, researching secure and efficient image encryption methods is particularly important.

[0003] To protect the security of image network transmission and storage, a multi-image diffusion method based on the Russian nesting doll structure and differential coding is proposed. This method constructs the plaintext image into a Russian nesting doll, then sequentially converts the six faces of each layer of the doll into one-dimensional vectors for differential coding, fully diffusing the plaintext image. This lays the foundation for further image encryption and improves the security and efficiency of image encryption. Summary of the Invention

[0004] The purpose of this invention is to address the problems of insufficient encryption and low encryption efficiency in current image diffusion methods by proposing a multi-image diffusion method based on Russian nesting dolls and differential coding.

[0005] The technical solution of this invention: To achieve the above-mentioned objective, the technical solution adopted is a multi-image diffusion method based on Russian nesting dolls and differential coding, where the sender is Alice and the receiver is Bob; Alice's diffusion steps are detailed below: Step 1: Constructing Russian nesting dolls: t The original image is I 1 1 , I 2 1 , …, I t 1 Their sizes are all m × n ,Will I 1 1 , I 2 1 , …, I t 1 Construct into a size of m × n × t 3D matrix E 1 ,BundleE 1 Imagine it as a Russian nesting doll composed of the numbers 0, 1, ... 255; Step 2: Calculate the number of layers in a Russian nesting doll: E 1 The outermost layer, consisting of six faces composed of the numbers 0, 1, ... 255, is called the first layer of a Russian nesting doll. R 1 , E 1 The outermost layer, consisting of six faces composed of values ​​0, 1, ... 255, is called the second layer of a Russian nesting doll. R 1=2 ..., progressing step by step, until... E 1 The innermost layer, known as the Russian nesting doll, is the third layer. g layer R g The total number of layers in a Russian nesting doll g for: g = floor ( min ( m , n , t )÷2), (1) in, floor (·) is the floor function. min (·) is the minimum value function; Step 3: Generate chaotic sequences: The Logistic mapping is defined as: x n+1 = u × x n ×(1- x n ), (2) Among them, the iteration value x n ∈(0, 1), control parameters u ∈(3.57, 4]; Randomly select the control parameters for the Logistic mapping. u and initial value x 0, iterate formula (2) 1000+ times m × n × t After discarding the first 1000 iterations, a length of [length missing] is obtained. m × n × t chaotic sequence X ; Step 4: Integerization of the chaotic sequence: Using formula (3) to convert the chaotic sequence into integers. XConverting to an integer chaotic sequence yields a sequence of length... m × n × t chaotic sequence Y , Y = round (mod( X ×10 10 , 256)), (3) in, round The · operator is a rounding function that takes the nearest integer. mod (·) is the modulo function; Step 5: Segment the chaotic sequence: Segment the chaotic sequence Y Divided into g The subsequences are as follows: Y 1 , Y 2 , …, Y g ,forward g -1 length of subsequence l i The length of the last subsequence is calculated using formula (4). l g Calculated using formula (5); l i =(( m -2× i +2)×( n -2× i +2)+( t -2× i )×( n -2× i +2)+( t -2× i )×( n -2× i ))×2, (4) Where i = 1, 2, …, g ; l g =(( m -2× g +2)×( n -2× g +2))×2; (5) Step 6: Differential coding: [The text abruptly ends here, likely due to an incomplete sentence or a formatting error.] R 1 , R 2 , …, Rg Convert the numerical value to g There are n one-dimensional vectors, namely: V 1 , V 2 ,…, V g Using formula (6) to sequentially V 1 , V 2 , …, V g Differential encoding is performed, resulting in a one-dimensional vector. S 1 , S 2 , …, S g And sequentially form a size of m × n × t Russian nesting dolls E 2 , s i j = s i j-1 ⊕ v i j ⊕ y i j , (6) in, i =1, 2, …, g ; j =2, 3, …, l i ; s i j ∈ S i , v i j ∈ V i , y i j ∈ Y i ⊕ is the XOR operator; Step 7: Generate diffusion image: E 2 Split into t The size is m × n Image I1 2 , I 2 2 , …, I t 2 That is t Aspect-diffusion image.

[0006] During the decryption process, the same chaotic sequence is used to decrypt the image. I 1 2 , I 2 2 , …, I t 2 By performing the operation, the original image can be recovered. I 1 1 , I 2 1 , …, I t 1 Bob's decryption process is the reverse of Alice's diffusion process.

[0007] Beneficial effects: This invention addresses the shortcomings of existing image diffusion methods, such as low encryption efficiency or weak security, by proposing a multi-image diffusion method based on Russian nesting dolls and differential coding. The main contributions are: (1) constructing multiple images into Russian nesting dolls; (2) performing differential coding on the six faces of each layer of Russian nesting dolls sequentially, which is simple to operate and has a good diffusion effect; (3) combining the Russian nesting doll structure, proposing a multi-image diffusion method based on Russian nesting dolls and differential coding, which is highly secure and efficient, has a good diffusion effect, and can realize the secure network transmission and storage of image information. Attached Figure Description

[0008] Figure 1 Diffusion flowchart; Figure 2 Original image; Figure 3 Original image; Figure 4 Original image; Figure 5 Original image; Figure 6 : Diffusion image; Figure 7 : Diffusion image; Figure 8 : Diffusion image; Figure 9 : Diffusion image. Detailed Implementation

[0009] The implementation process of the present invention will be further described in detail below with reference to specific accompanying drawings and examples.

[0010] Figure 1 This is the diffusion flowchart of this method.

[0011] The programming software used is Matlab R2022b. Figure 2 , Figure 3 , Figure 4 and Figure 5 The four 512×512 grayscale images shown are used as the original images. Alice details the diffusion process of the original images using the proposed multi-image diffusion method based on Russian nesting dolls and differential coding, as follows.

[0012] Step 1: Constructing a Russian nesting doll: Let the four original images be... I 1 1 , I 2 1 , …, I 4 1 Their sizes are all 512×512. I 1 1 , I 2 1 , …, I 4 1 Construct a three-dimensional matrix of size 512×512×4. E 1 ,Bundle E 1 Imagine it as a Russian nesting doll composed of the values ​​0, 1, ... 255.

[0013] Step 2: Calculate the number of layers of the Russian nesting doll: The total number of layers of the Russian nesting doll can be calculated using formula (1). g The value is 2.

[0014] Step 3: Generate a chaotic sequence: Randomly select an initial value of 0.3967 and a control parameter of 3.9802, and iterate according to formula (2) 1000+1048576 times. Discard the first 1000 iterations to obtain a chaotic sequence of length 1048576. X .

[0015] Step 4: Integerization of the chaotic sequence: Using formula (3) to convert the chaotic sequence into integers. X Converting to an integer chaotic sequence yields a chaotic sequence of length 1048576. Y .

[0016] Step 5: Segment the chaotic sequence: Segment the chaotic sequence Y Divide into 2 subsequences, respectively Y 1 , Y 2 , Y1 The length is calculated using formula (4). Y 2 The length is calculated using formula (5).

[0017] Step 6: Differential coding: [The text abruptly ends here, likely due to an incomplete sentence or a formatting error.] R 1 , R 2 The numerical values ​​are converted into two one-dimensional vectors, namely: V 1 , V 2 Using formula (6) to sequentially V 1 , V 2 Differential encoding is performed, resulting in a one-dimensional vector. S 1 , S 2 They are then arranged in sequence to form a Russian nesting doll measuring 512×512×4. E 2 .

[0018] Step 7: Generate diffusion image: E 2 Split into 4 images of size 512×512 I 1 2 , I 2 2 , …, I 4 2 That is, 4 diffusion images, such as Figure 6 , Figure 7 , Figure 8 and Figure 9 As shown.

[0019] During the decryption process, the same chaotic sequence is used to manipulate the diffused image to obtain the original image, such as... Figure 2 , Figure 3 , Figure 4 and Figure 5 As shown, Bob's decryption process is the reverse of Alice's diffusion process.

Claims

1. A multi-image diffusion method based on Russian nesting dolls and differential coding, characterized in that, The diffusion process includes the following steps: Step 1: Constructing Russian nesting dolls: t The original image is I 1 1 , I 2 1 , …, I t 1 Their sizes are all m × n ,Will I 1 1 , I 2 1 , …, I t 1 Construct into a size of m × n × t 3D matrix E 1 ,Bundle E 1 Imagine it as a Russian nesting doll composed of the numbers 0, 1, ... 255; Step 2: Calculate the number of layers in a Russian nesting doll: E 1 The outermost layer, consisting of six faces composed of the numbers 0, 1, ... 255, is called the first layer of a Russian nesting doll. R 1 , E 1 The outermost layer, consisting of six faces composed of values ​​0, 1, ... 255, is called the second layer of a Russian nesting doll. R 1=2 ..., progressing step by step, until... E 1 The innermost layer, known as the Russian nesting doll, is the third layer. g layer R g The total number of layers in a Russian nesting doll g for: g = floor ( min ( m , n , t )÷2), (1) in, floor (·) is the floor function. min (·) is the minimum value function; Step 3: Generate chaotic sequences: The Logistic mapping is defined as: x n+1 = u × x n ×(1- x n ), (2) Among them, the iteration value x n ∈(0, 1), control parameters u ∈(3.57, 4]; Randomly select the control parameters for the Logistic mapping. u and initial value x 0, iterate formula (2) 1000+ times m × n × t After discarding the first 1000 iterations, a length of [length missing] is obtained. m × n × t chaotic sequence X ; Step 4: Integerization of the chaotic sequence: Using formula (3) to convert the chaotic sequence into integers. X Converting to an integer chaotic sequence yields a sequence of length... m × n × t chaotic sequence Y , Y = round (against( X ×10 10 , 256)), (3) in, round The · operator is a rounding function that takes the nearest integer. mod (·) is the modulo function; Step 5: Segment the chaotic sequence: Segment the chaotic sequence Y Divided into g The subsequences are as follows: Y 1 , Y 2 , …, Y g ,forward g -1 length of subsequence l i The length of the last subsequence is calculated using formula (4). l g Calculated using formula (5); l i =(( m -2× i +2)×( n -2× i +2)+( t -2× i )×( n -2× i +2)+( t -2× i )×( n -2× i ))×2, (4) Where i = 1, 2, …, g ; l g =(( m -2× g +2)×( n -2× g +2))×2; (5) Step 6: Differential coding: [The text abruptly ends here, likely due to an incomplete sentence or a formatting error.] R 1 , R 2 , …, R g Convert the numerical value to g There are n one-dimensional vectors, namely: V 1 , V 2 ,…, V g Using formula (6) to sequentially V 1 , V 2 , …, V g Differential encoding is performed, resulting in a one-dimensional vector. S 1 , S 2 , …, S g And sequentially form a size of m × n × t Russian nesting dolls E 2 , s i j = s i j-1 ⊕ v i j ⊕ y i j , (6) in, i =1, 2, …, g ; j =2, 3, …, l i ; s i j ∈ S i , v i j ∈ V i , y i j ∈ Y i ⊕ is the XOR operator; Step 7: Generate diffusion image: E 2 Split into t The size is m × n Image I 1 2 , I 2 2 , …, I t 2 That is t Aspect-diffusion image.