A globally coupled privacy image encryption method and storage medium with infinite interval spatiotemporal chaos

Abstract

The present invention provides a globally coupled privacy image encryption method and storage medium using infinite-interval spatiotemporal chaos. The method comprises: establishing an improved sinusoidal dynamic non-adjacent coupled mapping lattice to enhance cryptographic characteristics; employing globally coupled encryption technology to first identify the privacy regions of an image, then coupledly encrypting the privacy regions and non-privacy regions, leveraging the interaction of pixel values ​​in the privacy and non-privacy regions to ensure the timeliness of one-time encryption. Simultaneously, pathological dynamic diffusion is introduced into the privacy region, avoiding repeated encryption of the privacy region while ensuring the security of privacy information. The technical solution of the present invention addresses the shortcomings of existing spatiotemporal chaotic systems, such as short chaotic intervals, long window periods, and uneven pseudo-random number distribution, which pose security risks to image encryption.

Description

Technical Field

[0001] The present invention relates to the field of image encryption technology, and in particular to a globally coupled privacy image encryption method and storage medium with infinite interval spatiotemporal chaos. Background Art

[0002] In the information age, with the rapid development of networks and communications equipment, data is intensively transmitted between different people and organizations. However, data leaks have caused numerous major security incidents, including personal privacy, commercial disputes, and wars. Data, as the primary means of information transmission, takes various forms, including sound, text, images, and video. Because digital images are richer than text and more convenient than video, they have become the most commonly used form of communication. To prevent the leakage of digital image information, scholars have developed numerous image encryption techniques, using methods such as image watermarking and chaos. Chaos primarily studies the time evolution of nonlinear systems and has a profound connection to fractals. Many properties of chaotic systems, such as random similarity, sensitivity to initial values, and iteration, can enhance the security of encrypted images. Consequently, many scholars have combined chaos theory with image encryption.

[0003] After Kaneko first studied and designed the coupled map lattice (CML), many researchers have refined and supplemented it. Classic spatiotemporal chaos systems include the global nonlocal collapsible map lattice (GNCML), the tent map coupled chaotic map lattice (CML-UD), and the non-adjacent coupled map lattice (NCML). However, existing spatiotemporal chaotic systems suffer from shortcomings such as short chaotic intervals, long window periods, and uneven pseudo-random number distribution, posing security risks to image encryption.

[0004] Most current image encryption methods operate on the entire image and are based on a scrambled diffusion structure. The introduction of a detection algorithm can quickly identify private information, perform specialized encryption on it, and then quickly encrypt the entire image. This approach is equivalent to double encryption of the private region. While the security of the private region is guaranteed, its timeliness is compromised to a certain extent. Summary of the Invention

[0005] Based on the aforementioned technical issues raised by existing spatiotemporal chaos systems, such as short chaotic intervals, long window periods, and uneven pseudo-random number distribution, which pose security risks to image encryption, a globally coupled privacy image encryption method with infinite-interval spatiotemporal chaos is provided. This invention establishes an improved sinusoidal dynamic non-adjacent coupled mapping lattice to enhance cryptographic characteristics. It employs a globally coupled encryption technique to first identify the privacy region of an image, then couple the privacy region and non-privacy region for encryption. Simultaneously, pathological dynamic diffusion is introduced into the privacy region, avoiding repeated encryption of the privacy region while ensuring the security of private information.

[0006] The technical means adopted in the present invention are as follows:

[0007] A globally coupled privacy image encryption method with infinite interval spatiotemporal chaos, comprising:

[0008] Establish an improved sinusoidal dynamic non-adjacent coupled mapping lattice model;

[0009] Based on plaintext image P , determine the location of private information;

[0010] Grid marking the binary processed image and calculating the information rate of the image to determine the location of private information;

[0011] Generate a key based on the determined location of the private information and the variance of the original image K ;

[0012] Convert the private information area into an array AH 1. Convert the non-privacy area into an array AH 2;

[0013] Generate key stream array using the established spatiotemporal chaos model SH , and fill the key stream array with 0 SH and AH 1 or AH 2 have the same length;

[0014] right SH Sort the values ​​to get the index array SHS ,right AH 1 and AH 2. Circular scrambling to obtain private and non-private coupled scrambled arrays Sd ;

[0015] Coupled scrambling of private and non-private arrays Sd Perform pathological dynamic diffusion on it to obtain the encrypted array q ;

[0016] The encrypted array q Reshape into a rectangular matrix Q , fill the blank part with 0 and perform pathological dynamic diffusion on the blank part to obtain the final encrypted image C .

[0017] Furthermore, the established improved sinusoidal dynamic non-adjacent coupled mapping lattice model is specifically:

[0018]

[0019] In the above formula, represents the improved one-dimensional sinusoidal chaotic map, Represents the parameters of the mapping, represents the chaotic sequence of the mapping, Indicates the operation of modulo 1; 、 and Indicates different grids, and Represents cat mapping parameters; Indicates modulo L Operation, L Indicates the number of grids; represents the improved one-dimensional sinusoidal chaotic map, Represents the parameters of the mapping, Represents the chaotic sequence of the mapping; represents the generated spatiotemporal chaotic sequence, Indicates that the current time series is n Time i The value of a grid.

[0020] Furthermore, the plaintext image-based P , determine the location of private information, including:

[0021] The plaintext image P Perform binary processing to convert into 0-1 image BW ;

[0022] Use grid blocks to mark the binary processed image BW ;

[0023] Calculate the proportion of black pixels in the combined images of different blocks to obtain the preselected position Q i ( a i , b i , w i , h i ), select the maximum value from Q max , which is the location of the private information Q ( a , b , w , h ).

[0024] Furthermore, the key is generated based on the determined location of the private information and the original image variance. K , specifically:

[0025]

[0026] Among them, the keyK Depend on K 1 and K 2 components, K 1( a , b , w , h ) contains private information, in K 1, ( a , b ) represents the starting position, w Represents the width, h Represents height; K 2 is made up of eight numbers k i ( i = 1, 2, …, 8), k 1 to k 7 is a positive number randomly given by the user, k 8 is the variance of the original image.

[0027] Furthermore, the key stream array is generated by using the established spatiotemporal chaos model SH , and fill the key stream array with 0 SH and AH 1 or AH 2 have the same length, specifically including:

[0028] Based on the uncertainty of the size of private information, it is divided into the following two cases:

[0029] Case 1: If w×h <( M×N ) / 2, then the iterative ISDNCML system ( M×Nw×h ) / 4 +w + N times, before giving up w times to eliminate the initial impact and convert the iterative data into a one-dimensional array S , intercepting a sequence of length M×N and coming from a one-dimensional array S of w × h As a keystream array SH , add 0 to AH 1. Make the key stream array SH and AH 2 are the same length;

[0030] Case 2: If w×h ≥ ( M×N ) / 2, then the iterative ISDNCML system ( w×h ) / 4+ h + N times, before giving up h times, to obtain a one-dimensional arrayS , from a one-dimensional array S Cut length w×h Sequence, get the key stream array SH , add 0 to AH 2. Make the key stream array SH and AH 1Same length.

[0031] Furthermore, the SH Sort the values ​​to get the index array SHS ,right AH 1 and AH 2. Circular scrambling to obtain private and non-private coupled scrambled arrays Sd , specifically including:

[0032] right AH 1 and AH 2 Perform the following operations:

[0033]

[0034] In the above formula, Indicates SHS General j Shift the bits right, and then AHS 2 Insert AHS 1 interval to generate a queue Sd .

[0035] The privacy and non-privacy coupled scrambled array Sd Perform pathological dynamic diffusion on it to obtain the encrypted array q , specifically including:

[0036] Coupled scrambling of private and non-private arrays Sd Perform pathological dynamic diffusion on:

[0037]

[0038] In the above formula, and represents the assisted diffusion sequence; Indicates that the value in the brackets is rounded down;

[0039] if i Is an odd number, then:

[0040]

[0041] In the above formula, represents the first generated value of the improved one-dimensional sinusoidal chaotic map, Indicates the i A value is generated, Indicates thei Generate values, Indicates the first value of the mapping parameter; Indicates the first i values; The first output of the ill-conditioned matrix i values, The second output of the ill-conditioned matrix i values;

[0042] if i is an even number, then:

[0043] .

[0044] The present invention also provides a storage medium, which includes a stored program, wherein when the program is run, the global coupled privacy image encryption method with infinite interval spatiotemporal chaos is executed.

[0045] Compared with the prior art, the present invention has the following advantages:

[0046] 1. The globally coupled privacy image encryption method with infinite interval spatiotemporal chaos provided by the present invention introduces a high-performance internal drive system, expands the range of the spatiotemporal chaos system, reduces the chaotic window period, and is more in line with cryptographic characteristics.

[0047] 2. The global coupled privacy image encryption method with infinite interval spatiotemporal chaos provided by the present invention uses an image recognition algorithm to extract private information and effectively classify and identify important information.

[0048] 3. The global coupled privacy image encryption method with infinite interval spatiotemporal chaos provided by the present invention adopts privacy-non-privacy area coupled scrambling encryption to avoid repeated encryption of the privacy area.

[0049] 4. The global coupled private image encryption method with infinite interval spatiotemporal chaos provided by the present invention introduces an ill-conditioned matrix into the dynamic diffusion of private information, further ensuring the security of private information.

[0050] 5. The globally coupled privacy image encryption method with infinite interval spatiotemporal chaos provided by the present invention has better dynamic behavior while ensuring the security of privacy information. It can be applied in engineering fields such as image encryption and has important value. In addition, the model is conducive to the demonstration and teaching of chaos phenomena.

[0051] Based on the above reasons, the present invention can be widely promoted in fields such as image encryption. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0053] Figure 1 Flow chart of the method of the present invention.

[0054] Figure 2 This is a Kolmogorov-Sinai entropy analysis diagram provided by an embodiment of the present invention.

[0055] Figure 2 Middle: (a) h of CML; (b) hu of CML; (c) h of ISDNCML; (d) hu of ISDNCML.

[0056] Figure 3 Bifurcation diagrams of CML and ISDNCML under different parameters provided by the embodiment of the present invention.

[0057] Figure 3 Middle: (a) Bifurcation diagram of the CML system when the parameter e = 0.28; (b) Bifurcation diagram of the CML system when the parameter e = 0.68; (c) Bifurcation diagram of the ISDNCML system when the parameter e = 0.28; (d) Bifurcation diagram of the ISDNCML system when the parameter e = 0.28; (e) Bifurcation diagram of the ISDNCML system in the interval [0, 3.5] when the parameter e = 0.88; (f) Bifurcation diagram of the ISDNCML system in the interval [4, 11] when the parameter e = 0.89.

[0058] Figure 4 This is a flowchart of the privacy information location provided by an embodiment of the present invention.

[0059] Figure 4 Middle: (a), initial image; (b), rasterized image; (c), binarized image; (d), calculation and positioning of privacy areas.

[0060] Figure 5 This diagram illustrates an example of privacy- and non-privacy-coupled scrambling provided by an embodiment of the present invention.

[0061] Figure 6 This is a simulation result diagram provided for an embodiment of the present invention.

[0062] Figure 6 Middle: (a) plaintext image; (b) ciphertext image; (c) decrypted image. DETAILED DESCRIPTION

[0063] In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the embodiments described are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of the present invention.

[0064] It should be noted that the terms "first", "second", etc. in the description and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0065] like Figure 1 As shown, the present invention provides a globally coupled privacy image encryption method with infinite interval spatiotemporal chaos, comprising:

[0066] S1. Establish an improved sinusoidal dynamic non-adjacent coupled mapping lattice model;

[0067] S2, based on plaintext image P , determine the location of private information;

[0068] S3, grid-marks the binary processed image and calculates the information rate of the image to determine the location of the private information;

[0069] S4. Generate a key based on the determined location of the private information and the variance of the original image K ;

[0070] S5. Convert the private information area into an array AH 1. Convert the non-privacy area into an array AH 2;

[0071] S6. Generate key stream array using the established spatiotemporal chaos model SH , and fill the key stream array with 0 SH and AH 1 or AH 2 have the same length;

[0072] S7, yes SH Sort the values ​​to get the index array SHS ,right AH 1 and AH 2. Circular scrambling to obtain private and non-private coupled scrambled arrays Sd ;

[0073] S8. Coupled scrambling of private and non-private arrays Sd Perform pathological dynamic diffusion on it to obtain the encrypted array q ;

[0074] S9, encrypt the array q Reshape into a rectangular matrix Q , fill the blank part with 0 and perform pathological dynamic diffusion on the blank part to obtain the final encrypted image C .

[0075] In specific implementation, as a preferred embodiment of the present invention, in step S1, the improved sinusoidal dynamic non-adjacent coupling mapping lattice model established is specifically:

[0076]

[0077] In the above formula, represents the improved one-dimensional sinusoidal chaotic map, Represents the parameters of the mapping, represents the chaotic sequence of the mapping, Indicates the operation of modulo 1; 、 and Indicates different grids, and Represents cat mapping parameters; Indicates modulo L Operation, L Indicates the number of grids; represents the improved one-dimensional sinusoidal chaotic map, Represents the parameters of the mapping, Represents the chaotic sequence of the mapping; represents the generated spatiotemporal chaotic sequence, Indicates that the current time series is n Time i In this model, the coupling coefficient e quilt h ( x ) replacement, which gives ISDNCML a wider parameter range and fewer period windows. Arnold mapping is used to break the grid of adjacent calculations, making the chaotic sequence distribution more uniform. The chaotic characteristics of ISDNCML are analyzed experimentally and theoretically, with the following results:

[0078] Figure 2 It is the test result of KSE (Kolmogorov-Sinai entropy). KSE includes two tests: KSE density grid test h and KSE width space level test hu .exist Figure 2 (a) and Figure 2 (b), some parameters are μ , e ) is h ( μ ≤ 3.73 and e ≤ 0.94) and hu tends to 0, which means that the current lattice exhibits weak or no chaos. Specifically, in CML, h The average value is about 0.2333. μ ∈(3.57, 4] and e ∈[0, 1]. Figure 2 (c)-(d), for ISDNCML, h The values ​​of are all positive numbers. μ ∈(3.57, 4] and e ∈[0,1], even when μ ∈(3, 4) and e ∈[0, 1]. Therefore, the analysis of KSE shows that the introduction of I1DS and kinetic parameters in ISDNCML h ( x ) not only compensates for the lattice defects of CML and expands the chaotic range, but also greatly improves the chaotic performance.

[0079] In this embodiment, the 68th grid is used to draw the bifurcation diagram. Figure 3 (a)-(d) show that ISDNCML effectively solves the problems of periodic window, uneven distribution and narrow chaos range. Figure 3 (e)-(f) It can be analyzed that ISDNCML extends the chaotic range of parameters to infinity, and even a small change in the parameters will not affect the uniform distribution of ISDNCML.

[0080] In specific implementation, as a preferred embodiment of the present invention, in step S2, based on the plaintext image P , determine the location of private information, including:

[0081] The plaintext image P Perform binary processing to convert into 0-1 image BW ;

[0082] Use grid blocks to mark the binary processed image BW ;

[0083] Calculate the proportion of black pixels in the combined images of different blocks to obtain the preselected position Q i ( a i , b i , w i , h i ), select the maximum value from Q max , which is the location of the private information Q ( a , b , w , h ).

[0084] The location process of private information is as follows: Figure 4 shown.

[0085] In specific implementation, as a preferred embodiment of the present invention, in step S3, a key is generated based on the determined location of the private information and the variance of the original image. K , specifically:

[0086]

[0087] Among them, the key K Depend on K 1 and K 2 components, K 1( a , b , w , h ) contains private information, in K 1, ( a , b ) represents the starting position, w Represents the width, h Represents height; K 2 is made up of eight numbers k i ( i = 1, 2, …, 8), k 1 to k 7 is a positive number randomly given by the user, k 8 is the variance of the original image.

[0088] In specific implementation, as a preferred embodiment of the present invention, in step S5, the key stream array is generated by using the established spatiotemporal chaos model SH, and fill the key stream array with 0 SH and AH 1 or AH 2 have the same length, specifically including:

[0089] Based on the uncertainty of the size of private information, it is divided into the following two cases:

[0090] Case 1: If w×h <( M×N ) / 2, then the iterative ISDNCML system ( M×Nw×h ) / 4 +w + N times, before giving up w times to eliminate the initial impact and convert the iterative data into a one-dimensional array S , intercepting a sequence of length M×N and coming from a one-dimensional array S of w × h As a keystream array SH , add 0 to AH 1. Make the key stream array SH and AH 2 are the same length;

[0091] Case 2: If w×h ≥ ( M×N ) / 2, then the iterative ISDNCML system ( w×h ) / 4+ h + N times, before giving up h times, to obtain a one-dimensional array S , from a one-dimensional array S Cut length w×h Sequence, get the key stream array SH , add 0 to AH 2. Make the key stream array SH and AH 1Same length.

[0092] In specific implementation, as a preferred embodiment of the present invention, in step S6, SH Sort the values ​​to get the index array SHS ,right AH 1 and AH 2. Circular scrambling to obtain private and non-private coupled scrambled arrays Sd , specifically including:

[0093] right AH 1 and AH 2 Perform the following operations:

[0094]

[0095] In the above formula, Indicates SHS General j Shift the bits right, and then AHS 2 Insert AHS 1 interval to generate a queue Sd .

[0096] An example of a scrambling process is Figure 5 The privacy and non-privacy coupling scrambling are shown in the following table:

[0097]

[0098] In specific implementation, as a preferred embodiment of the present invention, in step S7, the privacy and non-privacy coupling scrambled array Sd Perform pathological dynamic diffusion on it to obtain the encrypted array q , specifically including:

[0099] Coupled scrambling of private and non-private arrays Sd Perform pathological dynamic diffusion on:

[0100]

[0101] In the above formula, and represents the assisted diffusion sequence; Indicates that the value in the brackets is rounded down;

[0102] if i Is an odd number, then:

[0103]

[0104] In the above formula, represents the first generated value of the improved one-dimensional sinusoidal chaotic map, Indicates the i A value is generated, Indicates the i Generate values, Indicates the first value of the mapping parameter; Indicates the first i values; The first output of the ill-conditioned matrix i values, The second output of the ill-conditioned matrix i values;

[0105] if i is an even number, then:

[0106] .

[0107] In specific implementation, as a preferred embodiment of the present invention, in step S8, the encrypted array q Reshape into a rectangular matrix Q , fill the blank part with 0 and perform pathological dynamic diffusion on the blank part to obtain the final encrypted image C The simulation results are as follows. Figure 6 shown.

[0108] An embodiment of the present application also discloses a computer-readable storage medium, which stores a computer instruction set. When the computer instruction set is executed by a processor, it implements the global coupled privacy image encryption method with infinite interval spatiotemporal chaos as provided in any of the above embodiments.

[0109] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only exemplary. For example, the division of the units can be a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

[0110] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0111] In addition, the functional units in the various embodiments of the present invention may be integrated into a single processing unit, each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0112] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the portion that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes various media that can store program code, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), a mobile hard drive, a magnetic disk, or an optical disk.

[0113] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the above embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A globally coupled privacy image encryption method with infinite interval spatiotemporal chaos, characterized in that: include: An improved sinusoidal dynamic non-adjacent coupled mapping lattice model is established, specifically: In the above formula, represents the improved one-dimensional sinusoidal chaotic map, Represents the parameters of the mapping, represents the chaotic sequence of the mapping, Indicates the operation of modulo 1; 、 and Indicates different grids, and Represents cat mapping parameters; Indicates modulo L Operation, L Indicates the number of grids; represents the improved one-dimensional sinusoidal chaotic map, Represents the parameters of the mapping, Represents the chaotic sequence of the mapping; represents the generated spatiotemporal chaotic sequence, Indicates that the current time series is n Time i The value of the grid; Based on plaintext image P , determine the location of private information; Grid marking the binary processed image and calculating the information rate of the image to determine the location of private information; Generate a key based on the determined location of the private information and the variance of the original image K ; Convert the private information area into an array AH 1. Convert the non-privacy area into an array AH 2; Generate key stream array using the established spatiotemporal chaos model SH , and fill the key stream array with 0 SH and AH 1 or AH 2 have the same length; right SH Sort the values ​​to get the index array SHS ,right AH 1 and AH 2. Circular scrambling to obtain private and non-private coupled scrambled arrays Sd ; Coupled scrambling of private and non-private arrays Sd Perform pathological dynamic diffusion on it to obtain the encrypted array q ; The encrypted array q Reshape into a rectangular matrix Q , fill the blank part with 0 and perform pathological dynamic diffusion on the blank part to obtain the final encrypted image C .

2. The globally coupled private image encryption method with infinite interval spatiotemporal chaos according to claim 1 is characterized in that: The plaintext image-based P , determine the location of private information, including: The plaintext image P Perform binary processing to convert into 0-1 image BW ; Use grid blocks to mark the binary processed image BW ; Calculate the proportion of black pixels in the combined images of different blocks to obtain the preselected position Q i ( a i , b i , w i , h i ), select the maximum value from Q max , which is the location of the private information Q ( a , b , w , h ).

3. The globally coupled private image encryption method with infinite interval spatiotemporal chaos according to claim 1, characterized in that: The key is generated based on the determined location of the private information and the original image variance. K , specifically: Among them, the key K Depend on K 1 and K 2 components, K 1( a , b , w , h ) contains private information, in K 1, ( a , b ) represents the starting position, w Represents the width, h Represents height; K 2 is made up of eight numbers k i ( i = 1, 2, …, 8), k 1 to k 7 is a positive number randomly given by the user, k 8 is the variance of the original image.

4. The globally coupled private image encryption method with infinite interval spatiotemporal chaos according to claim 1, characterized in that: The key stream array is generated by adopting the established spatiotemporal chaos model SH , and fill the key stream array with 0 SH and AH 1 or AH 2 have the same length, specifically including: Based on the uncertainty of the size of private information, it is divided into the following two cases: Case 1: If w×h < ( M×N ) / 2, then the iterative ISDNCML system ( M×Nw×h ) / 4 +w + N times, before giving up w times to eliminate the initial impact and convert the iterative data into a one-dimensional array S , intercepting a sequence of length M×N and coming from a one-dimensional array S of w × h As a key stream array SH , add 0 to AH 1. Make the key stream array SH and AH 2 are the same length; Case 2: If w×h ≥ ( M×N ) / 2, then the iterative ISDNCML system ( w×h ) / 4+ h + N times, before giving up h times, to obtain a one-dimensional array S , from a one-dimensional array S Cut length w×h Sequence, get the key stream array SH , add 0 to AH 2. Make the key stream array SH and AH 1Same length.

5. The globally coupled private image encryption method with infinite interval spatiotemporal chaos according to claim 1, characterized in that: The pair SH Sort the values ​​to get the index array SHS ,right AH 1 and AH 2. Circular scrambling to obtain private and non-private coupled scrambled arrays Sd , specifically including: right AH 1 and AH 2 Perform the following operations: In the above formula, Indicates SHS General j Shift the bits right, and then AHS 2 Insert AHS 1 interval to generate a queue Sd .

6. The globally coupled private image encryption method with infinite interval spatiotemporal chaos according to claim 1, characterized in that: The privacy and non-privacy coupled scrambled array Sd Perform pathological dynamic diffusion on it to obtain the encrypted array q , specifically including: Coupled scrambling of private and non-private arrays Sd Perform pathological dynamic diffusion on the diffused sequence q : In the above formula, and represents the assisted diffusion sequence; Indicates that the value in the brackets is rounded down; if i Is an odd number, then: In the above formula, represents the first generated value of the improved one-dimensional sinusoidal chaotic map, Indicates the i A value is generated, Indicates the i Generate values, Indicates the first value of the mapping parameter; Indicates the first i values; The first output of the ill-conditioned matrix i values, The second output of the ill-conditioned matrix i values; if i is an even number, then: 。 7. A storage medium, characterized in that: The storage medium includes a stored program, wherein when the program is run, the globally coupled private image encryption method with infinite interval spatiotemporal chaos described in any one of claims 1 to 6 is executed.

Images