A Dynamic Encryption Method for Local Area Network Information Security Based on Composite Chaotic Mapping

Abstract

The present invention provides a dynamic encryption method for local area network information security based on a composite chaotic mapping. Nowadays, the pace of technological progress is unprecedentedly rapid, but there is still a lack of necessary security management measures for the security threats from computer clients within the network, and the security threats are relatively large. The present invention provides a dynamic encryption method for local area network information security based on a composite chaotic mapping. Under the escort of the composite chaotic mapping method, the information security performance of the local area network is enhanced, and the risk of local area network information leakage is reduced. A mapping relation network is arranged in the local area network, the utility parameter values and weight levels of each main node in the mapping relation network are monitored and calculated, then a load chain is constructed and a reasonable floating domain of the load is delimited, the abnormal access coefficient of each computer is calculated through the reasonable floating domain of the load, and finally dynamic encryption adjustment is carried out by using the composite chaotic mapping.

Description

Technical Field

[0001] The present invention belongs to the technical fields of local area network security and information encryption, and particularly relates to a dynamic encryption method for local area network information security based on a composite chaotic mapping. Background Art

[0002] Today, the pace of technological progress is unprecedentedly rapid. However, there are still a lack of necessary security management measures for security threats from computer clients within the network, and the security threats are relatively large. Unauthorized network devices or users may automatically enter the network through the network devices of the local area network, posing a great security risk. Currently, the security risks in the local area network take advantage of the security weaknesses existing in the network system itself, and the omissions in the use and management process of the system increase the severity of security problems. The information within the local area network often has high commercial value or knowledge value. Doing a good job in local area network information security is very important for enterprises or research institutes. Summary of the Invention

[0003] The purpose of the present invention is to propose a dynamic encryption method for local area network information security based on a composite chaotic mapping to solve one or more technical problems existing in the prior art, and at least provide a beneficial choice or create conditions.

[0004] To achieve the above purpose, according to one aspect of the present invention, there is provided a dynamic encryption method for local area network information security based on a composite chaotic mapping, and the method includes the following steps:

[0005] S100, arranging a mapping relationship network for the server of the local area network;

[0006] S200, monitoring and calculating the utility parameter values and weight levels of each main node in the mapping relationship network;

[0007] S300, constructing a load chain according to the utility parameter values and weight levels;

[0008] S400, using the load chain to delimit a reasonable floating domain for the load;

[0009] S500, calculating the abnormal access coefficients of each slave node through the reasonable floating domain for the load;

[0010] S600, performing dynamic encryption adjustment according to the abnormal access coefficients of the slave nodes.

[0011] Further, in step S100, the method for arranging a mapping relationship network for the server of the local area network is:

[0012] The mapping relationship network SvGrp includes multiple nodes, and the nodes include multiple main nodes and slave nodes. Among them, each main node is connected to multiple slave nodes;

[0013] The requested encryption signal is for the slave node to encrypt and transmit the file to be encrypted. Each requested encryption signal and its file to be encrypted are regarded as a work event. Among them, there can be one or more files to be encrypted in the work event; the total number of work events received by each master node is δ; the number of files allocated to one master node for a work event is NDC.

[0014] When the slave node sends a requested encryption signal, the files to be encrypted in each work event are divided into Nsv parts and allocated to Nsv different master nodes.

[0015] The file to be encrypted is an audio file or an image file.

[0016] The master node is a server installed with an encryption system, and the slave node is a number of computer terminals StNbr connected to each master node; the data files of each work event are divided into Nsv parts and allocated to Nsv different servers.

[0017] The encryption system is a software system applying the compound chaotic mapping encryption technology.

[0018] The compound chaotic mapping encryption technology is the following literature [1] or [2].

[0019] Literature [1] Du Ruishan, Shang Fuhua, Li Yang. Application of Compound Chaotic Mapping in Speech Encryption Algorithm [J]. Computer Engineering and Applications, 2009, 45(7): 3.

[0020] Literature [2] Zhang Tongfeng. Research on Digital Image Encryption Algorithm Based on One-Dimensional Compound Chaotic Mapping [D]. Lanzhou University.

[0021] Further, in step S200, the method for monitoring and calculating the utility parameter value and weight series of each master node in the mapping relationship network is: in the local area network system, one master node provides data encryption functions for multiple work events to encrypt the files to be encrypted.

[0022] Within the recent time interval time, the master node counts the work event load PTime and work event access times PPick of each work event Event it serves. The work event load PTime refers to the time length for the master node to encrypt data for the work event Event; the work event access times PPick refers to the number of times the master node encrypts data for the work event Event; the utility parameter value PTRate is calculated from the work event load amount PTime and work event access times PPick of each work event Event of the master node. When the work event access times PPick > 0, the calculated utility parameter value PTRate = PTime ÷ PPick. When the work event access times PPick ≤ 0, then the utility parameter value PTRate = 0.

[0023] Construct a working event traffic sequence PTRLst through each utility parameter value PTRate, PTRLst = [PTRate1, PTRate2, …, PTRate Nsv , where PTRate Nsv represents the utility parameter value assigned to the Nsv-th master node for this working event; for a working event, each file to be encrypted has a file importance level Dgr, and the file importance level Dgr is the ranking of the number of historical encryption times or encryption frequency of this file to be encrypted in the database of the master node;

[0024] The larger the value of Dgr, the lower the permission required to access the file to be encrypted, and the file to be encrypted with a Dgr value of 1 is the file that requires the highest permission to access; for a working event, each master node has a weight level SGLV of the master node, and the calculation method of the weight level SGLV is:

[0025]

[0026] where m1 is the cumulative independent variable, and Dgr m1 represents the file importance level of the m1-th file in the same master node under the same working event; is the arithmetic mean of the file importance levels Dgr of each file in the same master node under the same working event; construct a working event permission sequence SGLVLst according to the weight levels SGLV of each master node, SGLVLst = [SGLV1, SGLV2, …, SGLV Nsv , where SGLV Nsv represents the weight level of the Nsv-th master node assigned to this working event, NDC is the number of files to be encrypted assigned to the current master node for the working event, and log is the logarithmic function.

[0027] Furthermore, in step S300, the method of constructing the load chain according to the utility parameter and the weight level is to calculate the working event load coefficient WCN through the working event permission sequence SGLVLst and the working event traffic sequence PTRLst. The working event load coefficient WCN of the m2-th master node is denoted as WCN m2 , and the calculation method of WCN m2 is:

[0028]

[0029] where λ1 is the memory usage ratio or hard disk occupancy ratio of all files to be encrypted of the current working event in the m2-th master node; λ2 is the IO consumption or database usage ratio of all files to be encrypted of the current working event in the m2-th master node; PTRatem2 Represents the utility parameter value of the m2-th master node in PTRLst, PTRate sum Represents the sum of the utility parameter values PTRate of the current working event in PTRLst on all master nodes, SGLV m2 Represents the weight level SGLV of the m2-th master node in SGLVLst. Pr is a probability parameter, and the calculation method of Pr is as follows:

[0030]

[0031] Where SGLV min Represents the minimum weight level among the master nodes in SGLVLst, SGLV max Represents the maximum weight level among the master nodes in SGLVLst; A load chain LoWCN is constructed through the workload coefficients WCN of each working event, LoWCN = [WCN1, WCN2,..., WCN Nsv , where WCN Nsv Represents the workload coefficient of the working event assigned to the Nsv-th master node of this working event. Use LoWCN(SvN) to represent the workload coefficient WCN of the SvN-th master node in the load chain LoWCN, where SvN is the serial number of the element in the load chain LoWCN.

[0032] Furthermore, in step S400, the method of using the load chain to delimit the reasonable load floating range is: Let the current time be T0, and the load chain obtained at T0 is LoWCN0. Starting from T0 (excluding T0), ω consecutive load chains in time sequence are obtained. On the Nsv master nodes, each master node corresponds to a load chain. A matrix is constructed with each load chain as a row as the load model Mtx(Sv,t) of the mapping relationship network SvGrp. The mathematical expression form of the load model Mtx(Sv,t) is as follows:

[0033]

[0034] Where server represents the serial number of the master node, and t represents the serial number of the time; WCN Nsv,ω Represents the workload coefficient WCN of the Nsv-th master node in the load chain at the ω-th moment Nsv; Use Mtx(server,) to represent the value of the server-th row of the load model, and use Mtx(,t) to represent the value of the t-th column of the load model; Set the variable m3, and set the initial value of the master node variable m3 to 1. Set the variable m4, and set the initial value of the time variable m4 to 1; Set a sequence as the growth chain GrLs to store the load growth rate of a work event in the same master node; Set a sequence as the decay chain DeLs to store the mount decay rate of a work event in the same master node;

[0035] S401, if m3 ≤ Nsv, jump to step S402; if m3 > Nsv, jump to S406;

[0036] S402, if m4 < α, jump to step S403; if m4 ≥ α, calculate the expected growth rate ExpInc through the growth chain GrLs, where the expected growth rate ExpInc is the arithmetic mean of the elements in the growth chain GrLs. After the calculation, clear the growth chain GrLs; Calculate the expected decay rate ExpDec through the decay chain DeLs, where the expected decay rate ExpDec is the arithmetic mean of the elements in the decay chain DeLs. After the calculation, clear the decay chain DeLs, and jump to step S405;

[0037] S403, if WCN m3,m4 >WCN m3,m4+1 , calculate the load growth rate GrWCN, GrWCN = (WCN m3,m4 -WCN m3,m4+1 ) / WCN m3,m4+1 ; Store GrWCN in the growth chain GrLs, increment the value of m4 by 1, and jump to step S402; otherwise, jump to step S404;

[0038] S404, if WCN m3,m4 <WCN m3,m4+1 , calculate the mount decay rate DeWCN, DeWCN = (WCN m3,m4+1 -WCN m3,m4 ) / WCN m3,m4+1 ; Store DeWCN in the decay chain DeLs, increment the value of m4 by 1, and jump to step S402; Increment the value of m4 by 1, and jump to step S402;

[0039] S405, calculate the discount factor ε according to Mtx(m3,), where Mtx(m3,) represents the value of the m3-th row of the load model, and the discount factor ε is the standard deviation of Mtx(m3,); Calculate and obtain the first load threshold FTld m3 and the second load threshold STld m3 :

[0040]

[0041]

[0042] wherein is the maximum operation value function for the range of m5 in the formula being [1, ω], and is used to obtain the maximum value of the numerical value obtained by the formula operation within the brackets is the minimum operation value function for the range of m6 in the formula being [1, ω], and is used to obtain the minimum value of the numerical value obtained by the formula operation within the brackets. m5 is a variable; m6 is a variable; obtain the reasonable load floating range GRArea of the m3 - th main node in a working event m3 =[[STld m3 ,[[FTld m3 ; Increase the value of m3 by 1, update the value of m4 to 1, and jump to step S401

[0043] S406, end

[0044] Furthermore, in step S500, the method for calculating the abnormal access coefficient of each slave node according to the reasonable load floating range is as follows: Calculate the load over - boundary SpssIdx of the mapping relationship network SvGrp obtained according to the reasonable load floating range GRArea, SpssIdx = SpssIdx1+SpssIdx2; where SpssIdx1 and SpssIdx2 respectively represent the over - load parameter value and the under - load parameter value, and the calculation methods of SpssIdx1 and SpssIdx2 are as follows

[0045] In the formula LoWCN0(m7), it is required that LoWCN0(m7)>FTld m7 Otherwise, it does not participate in the operation, and m7 is an accumulative variable

[0046] In the formula LoWCN0(m8), it is required that LoWCN0(m8)<STld m8 Otherwise, it does not participate in the operation, and m8 is an accumulative variable

[0047] LoWCN0(m7) is the working event load coefficient of the m7 - th main node of the load chain obtained at time T0

[0048] LoWCN0(m8) is the working event load coefficient of the m8 - th main node of the load chain obtained at time T0

[0049] Calculate the abnormal access coefficient of a slave node through the mapping relationship network SvGrp connected by each slave node serial number STNBR where m9 is an accumulative variable, SpssIdx m9It represents the load overrun value of the mapping relationship network SvGrp assigned when the m9th working event Event is issued from a slave node, and δ represents the number of working events issued from a slave node.

[0050] Further, in step S600, the method for dynamically encrypting and adjusting according to the abnormal access coefficient of the slave node is as follows: Obtain the abnormal access coefficients Danger of all slave nodes and form an abnormal list DangerList. Arrange the elements in DangerList in ascending order according to the Danger value. Use the encryption system to encrypt the slave node order corresponding to the order of each element in DangerList in sequence, and the master node encrypts the working events transmitted by each slave node in sequence according to the order.

[0051] The present invention also provides a system for a dynamic encryption method for local area network information security based on compound chaotic mapping. The system for a dynamic encryption method for local area network information security based on compound chaotic mapping includes: a processor, a memory, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps in the dynamic encryption method for local area network information security based on compound chaotic mapping. The system for a dynamic encryption method for local area network information security based on compound chaotic mapping can run on computing devices such as desktop computers, notebooks, palm computers, and cloud data centers. The operable system may include, but is not limited to, a processor, a memory, and a server cluster. The processor executes the computer program and runs in the following system units:

[0052] A data storage unit for storing local area network data and arranging the mapping relationship network;

[0053] An information collection unit for monitoring and calculating the utility parameter values and weight levels of each master node in the mapping relationship network;

[0054] An information collection unit for constructing a load chain and demarcating a reasonable floating domain for the load;

[0055] An abnormal operation unit for calculating the abnormal access coefficients of each computer through the reasonable floating domain of the load;

[0056] A dynamic adjustment unit for dynamically encrypting and adjusting according to the abnormal access coefficient of the slave node;

[0057] The beneficial effects of the present invention are as follows: The present invention provides a dynamic encryption method for local area network information security based on compound chaotic mapping. Under the escort of the compound chaotic mapping method, the information security performance of the local area network is enhanced, and the risk of local area network information leakage is reduced. Description of the Drawings

[0058] By elaborating on the embodiments shown in the accompanying drawings in detail, the above and other features of the present invention will become more apparent. In the drawings of the present invention, the same reference numerals denote the same or similar elements. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can be obtained based on these drawings. In the drawings:

[0059] Figure 1 Shown is a flowchart of a dynamic encryption method for local area network information security based on a composite chaotic map;

[0060] Figure 2 Shown is a system structure diagram of a dynamic encryption method for local area network information security based on a composite chaotic map. Specific Embodiments

[0061] The following will clearly and completely describe the concept, specific structure, and technical effects of the present invention in combination with embodiments and drawings to fully understand the purpose, solution, and effects of the present invention. It should be noted that, without conflict, the embodiments in this application and the features in the embodiments can be combined with each other.

[0062] As Figure 1 Shown is a flowchart of a dynamic encryption method for local area network information security based on a composite chaotic map. The following will elaborate on a dynamic encryption method for local area network information security based on a composite chaotic map according to the embodiments of the present invention. The method includes the following steps: Figure 1 to

[0063] S100, arranging a mapping relationship network for the servers of the local area network;

[0064] S200, monitoring and calculating the utility parameter values and weight levels of each main node in the mapping relationship network;

[0065] S300, constructing a load chain based on the utility parameter values and weight levels;

[0066] S400, using the load chain to delimit a reasonable load floating range;

[0067] S500, calculating the abnormal access coefficients of each slave node through the reasonable load floating range;

[0068] S600, performing dynamic encryption adjustment according to the abnormal access coefficients of the slave nodes.

[0069] Furthermore, in step S100, the method of arranging a mapping relationship network for the servers of the local area network is:

[0070] The mapping relationship network SvGrp includes multiple nodes, and the nodes include multiple master nodes and slave nodes. Among them, each master node is connected to multiple slave nodes;

[0071] The request encryption signal is for the slave node to encrypt and transmit the file to be encrypted. Each request encryption signal and its file to be encrypted are used as a work event; the total number of work events received by each master node is δ; the number of files assigned to a master node for one work event is NDC;

[0072] When the slave node sends a request encryption signal, the file to be encrypted for each work event is divided into Nsv parts and assigned to Nsv different master nodes;

[0073] The file to be encrypted is an audio file or an image file;

[0074] The master node is a server installed with an encryption system, and the slave node is several computer terminals StNbr connected to each master node; the data file of each work event is divided into Nsv parts and assigned to Nsv different servers,

[0075] The encryption system is a software system applying the compound chaotic mapping encryption technology;

[0076] The compound chaotic mapping encryption technology is the following literature [1] or [2];

[0077] Literature [1] Du Ruishan, Shang Fuhua, Li Yang. Application of Compound Chaotic Mapping in Speech Encryption Algorithm [J]. Computer Engineering and Applications, 2009, 45(7): 3.

[0078] Literature [2] Zhang Tongfeng. Research on Digital Image Encryption Algorithm Based on One-Dimensional Compound Chaotic Mapping [D]. Lanzhou University.

[0079] Furthermore, in step S200, the method for monitoring and calculating the utility parameter values and weight levels of each master node in the mapping relationship network is: in the local area network system, a master node provides a data encryption function for multiple work events to encrypt the file to be encrypted;

[0080] During the most recent time interval time, the master node counts the workload PTime of each work event Event it serves and the number of accesses PPick to the work event. The workload PTime of the work event refers to the length of time for which the master node encrypts data for the work event Event; the number of accesses PPick to the work event refers to the number of times the master node encrypts data for the work event Event; the utility parameter value PTRate is calculated from the workload PTime and the number of accesses PPick of each work event Event of the master node. When the number of accesses PPick to the work event > 0, the calculated utility parameter value PTRate = PTime ÷ PPick. When the number of accesses PPick to the work event ≤ 0, the utility parameter value PTRate = 0;

[0081] A work event traffic sequence PTRLst is constructed from each utility parameter value PTRate, PTRLst = [PTRate1, PTRate2, …, PTRate Nsv , where PTRate Nsv represents the utility parameter value of the Nsv-th master node assigned to the work event; for a work event, each file to be encrypted has a file importance level Dgr. The file importance level Dgr is the ranking of the number of historical encryption times or encryption frequencies of the file to be encrypted in the database of the master node;

[0082] The larger the value of Dgr, the lower the permission required to access the file to be encrypted. The file to be encrypted with a Dgr value of 1 is the file that requires the highest permission to access; for a work event, each master node has a weight level SGLV of the master node. The calculation method of the weight level SGLV is:

[0083]

[0084] where m1 is the cumulative independent variable, and Dgr m1 represents the file importance level of the m1-th file in the same master node under the same work event; is the arithmetic mean of the file importance levels Dgr of each file in the same master node under the same work event; A work event permission sequence SGLVLst is constructed from the weight levels SGLV of each master node, SGLVLst = [SGLV1, SGLV2, …, SGLV Nsv , where SGLV Nsv represents the weight level of the Nsv-th master node assigned to the work event. NDC is the number of files to be encrypted assigned to the current master node for the work event, and log is the logarithmic function.

[0085] Further, in step S300, the method of constructing the load chain according to the utility parameter value and the weight series is to calculate the workload coefficient WCN of the work event through the work event permission sequence SGLVLst and the work event traffic sequence PTRLst. The workload coefficient WCN of the m2-th master node is denoted as WCN m2 , WCN m2 The calculation method is as follows:

[0086]

[0087] Among them, λ1 is the memory usage ratio or hard disk occupancy ratio of all files to be encrypted of the current work event on the m2-th master node; λ2 is the IO consumption or database usage ratio of all files to be encrypted of the current work event on the m2-th master node; PTRate m2 represents the utility parameter value of the m2-th master node in PTRLst, and PTRate sum represents the sum of the utility parameter values PTRate of the current work event on all master nodes in PTRLst. SGLV m2 represents the weight series SGLV of the m2-th master node in SGLVLst. Pr is the probability parameter, and the calculation method of Pr is as follows:

[0088]

[0089] Among them, SGLV min represents the minimum weight series of each master node in SGLVLst, and SGLV max represents the maximum weight series of each master node in SGLVLst; the load chain LoWCN is constructed through each workload coefficient WCN, LoWCN = [WCN1, WCN2,..., WCN Nsv , where WCN Nsv represents the workload coefficient of the work event assigned to the Nsv-th master node of this work event. LoWCN(SvN) represents the workload coefficient WCN of the SvN-th master node in the load chain LoWCN, where SvN is the serial number of the element in the load chain LoWCN.

[0090] Further, in step S400, the method of using the load chain to delimit the reasonable floating range of the load is as follows: Let the current moment be T0, and the load chain obtained at T0 moment is LoWCN0. Starting from T0 (excluding T0), ω consecutive load chains in time series are obtained. On the Nsv master nodes, each master node corresponds to a load chain. A matrix is constructed with each load chain as a row as the load model Mtx(Sv, t) of the mapping relationship network SvGrp. The mathematical representation of the load model Mtx(Sv, t) is as follows:

[0091]

[0092] where server represents the serial number of the master node, and t represents the serial number of the moment; WCN Nsv,ω represents the load coefficient WCN of the Nsv-th master node in the load chain at the ω-th moment; Nsv Use Mtx(server, ) to represent the value of the server-th row of the load model, and use Mtx(, t) to represent the value of the t-th column of the load model; Set the variable m3, and set the initial value of the master node variable m3 to 1. Set the variable m4, and set the initial value of the moment variable m4 to 1; Set a sequence as the growth chain GrLs to store the load growth rate of a work event in the same master node; Set a sequence as the decay chain DeLs to store the attachment decay rate of a work event in the same master node;

[0093] S401, when m3 ≤ Nsv, jump to step S402; when m3 > Nsv, jump to S406;

[0094] S402, when m4 < α, jump to step S403; when m4 ≥ α, calculate the expected growth rate ExpInc through the growth chain GrLs, where the expected growth rate ExpInc is the arithmetic mean of each element in the growth chain GrLs. After the calculation, clear the growth chain GrLs; Calculate the expected decay rate ExpDec through the decay chain DeLs, where the expected decay rate ExpDec is the arithmetic mean of each element in the decay chain DeLs. After the calculation, clear the decay chain DeLs, and jump to step S405;

[0095] S403, if WCN m3,m4 > WCN m3,m4+1 , calculate the load growth rate GrWCN, GrWCN = (WCN m3,m4 - WCN m3,m4+1 ) / WCN m3,m4+1 ; Store GrWCN in the growth chain GrLs, increase the value of m4 by 1, and jump to step S402; Otherwise, jump to step S404;

[0096] S404, if WCN m3,m4 < WCN m3,m4+1 , calculate the attachment decay rate DeWCN, DeWCN = (WCN m3,m4+1 - WCN m3,m4 ) / WCN m3,m4+1 ; Store DeWCN in the decay chain DeLs, increase the value of m4 by 1, and jump to step S402; Increase the value of m4 by 1, and jump to step S402;

[0097] S405. Calculate the discount coefficient ε based on Mtx(m3,), where Mtx(m3,) represents the value of the m3 - rd row of the load model, and the discount coefficient ε is the standard deviation of Mtx(m3,); calculate and obtain the first load valve FTld m3 and the second load valve STld m3 :

[0098]

[0099]

[0100] where is the function that takes the maximum value of the operation values of m5 in the range of [1, ω], and is used to obtain the maximum value of the values obtained by the formula operation in the brackets, is the function that takes the minimum value of the operation values of m6 in the range of [1, ω], and is used to obtain the minimum value of the values obtained by the formula operation in the brackets. m5 is a variable; m6 is a variable; obtain the reasonable load floating range GRArea of the m3 - rd master node in a working event m3 =[STld m3 , FTld m3 ; Increase the value of m3 by 1, update the value of m4 to 1, and jump to step S401;

[0101] S406. End.

[0102] Furthermore, in step S500, the method for calculating the abnormal access coefficient of each slave node according to the reasonable load floating range is as follows: Calculate the load out - of - bounds SpssIdx of the mapping relationship network SvGrp according to the reasonable load floating range GRArea, SpssIdx = SpssIdx1+SpssIdx2; where SpssIdx1 and SpssIdx2 represent the over - load parameter value and the under - load parameter value respectively, and the calculation methods of SpssIdx1 and SpssIdx2 are as follows:

[0103] In the formula, LoWCN0(m7) should satisfy LoWCN0(m7)>FTld m7 otherwise it does not participate in the operation, and m7 is an accumulative variable;

[0104] In the formula, LoWCN0(m8) should satisfy LoWCN0(m8)<STld m8 otherwise it does not participate in the operation, and m8 is an accumulative variable;

[0105] LoWCN0(m7) is the working event load coefficient of the m7 - th master node of the load chain obtained at time T0;

[0106] LoWCN0(m8) is the working event load coefficient of the m8th master node of the load chain obtained at time T0;

[0107] Calculate the abnormal access coefficient Danger of a slave node through the mapping relationship network SvGrp connected by each slave node serial number STNBR, where m9 is an accumulation variable, SpssIdx m9 represents the load overrun value of the mapping relationship network SvGrp allocated when the m9th working event Event is sent by a slave node, and δ represents the number of working events sent by a slave node.

[0108] Furthermore, in step S600, the method of dynamically encrypting and adjusting according to the slave node abnormal access coefficient is: obtain the abnormal access coefficients Danger of all slave nodes and form an abnormal list DangerList, sort the elements in DangerList in ascending order according to the Danger value, and use the encryption system to encrypt the slave node order corresponding to the order of each element in DangerList in sequence. The master node encrypts the working events transmitted by each slave node in order.

[0109] The present invention also provides a system for a dynamic encryption method for local area network information security based on compound chaotic mapping, as Figure 2 shown, a system for a dynamic encryption method for local area network information security based on compound chaotic mapping includes: a processor, a memory, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps in the dynamic encryption method for local area network information security based on compound chaotic mapping. The system for the dynamic encryption method for local area network information security based on compound chaotic mapping can run on computing devices such as desktop computers, notebooks, palm computers, and cloud data centers. The operable system may include, but is not limited to, a processor, a memory, and a server cluster. The processor executes the computer program and runs in the following system units:

[0110] A data storage unit for storing local area network data and arranging a mapping relationship network;

[0111] An information collection unit for monitoring and calculating the utility parameter values and weight levels of each master node in the mapping relationship network;

[0112] An information aggregation unit for constructing a load chain and delimiting a reasonable load floating domain;

[0113] An abnormal operation unit for calculating the abnormal access coefficient of each computer through the reasonable load floating domain;

[0114] A dynamic adjustment unit for dynamically encrypting and adjusting according to the abnormal access coefficient of slave nodes;

[0115] The system of the dynamic encryption method for local area network information security based on compound chaotic mapping can run on computing devices such as desktop computers, notebooks, palmtop computers, and cloud servers. The system of the dynamic encryption method for local area network information security based on compound chaotic mapping, the operable system may include, but is not limited to, a processor and a memory. Those skilled in the art can understand that the above examples are only examples of the system of the dynamic encryption method for local area network information security based on compound chaotic mapping, and do not constitute a limitation on the system of the dynamic encryption method for local area network information security based on compound chaotic mapping. It may include more or fewer components than the examples, or combine some components, or different components. For example, the system of the dynamic encryption method for local area network information security based on compound chaotic mapping may also include input / output devices, network access devices, buses, etc.

[0116] The so-called processor may be a central processing unit (CPU), or may also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The processor is the control center of the operable system of the system of the dynamic encryption method for local area network information security based on compound chaotic mapping, and connects all parts of the operable system of the system of the dynamic encryption method for local area network information security based on compound chaotic mapping through various interfaces and lines.

[0117] The memory can be used to store the computer program and / or modules. By running or executing the computer program and / or modules stored in the memory, and invoking the data stored in the memory, the processor realizes various functions of the system of the dynamic encryption method for local area network information security based on compound chaotic mapping. The memory may mainly include a program storage area and a data storage area. Among them, the program storage area can store an operating system, application programs required for at least one function (such as a sound playback function, an image playback function, etc.); the data storage area can store data created according to the use of the mobile phone (such as audio data, phone book, etc.). In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) card, a Flash Card, at least one magnetic disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0118] Although the description of the present invention has been quite detailed and several of the described embodiments have been described in particular, it is not intended to be limited to any of these details or embodiments or any particular embodiment, so as to effectively cover the intended scope of the present invention. In addition, the present invention has been described above in terms of embodiments foreseeable by the inventors for the purpose of providing a useful description, and non-substantive modifications to the present invention that are not currently foreseeable may still represent equivalent modifications of the present invention.

Claims

1. A dynamic encryption method for local area network information security based on a composite chaotic map, characterized in that, The method includes the following steps: S100, arranging a mapping relationship network for the servers in the local area network; S200, monitoring and calculating the utility parameter values and weight levels of each master node in the mapping relationship network; S300, constructing a load chain according to the utility parameter values and weight levels; S400, using the load chain to delimit a reasonable load floating range; S500, calculating the abnormal access coefficients of each slave node through the reasonable load floating range; S600, performing dynamic encryption adjustment according to the abnormal access coefficients of the slave nodes; In step S100, the method of arranging a mapping relationship network for the servers in the local area network is as follows: The mapping relationship network SvGrp includes multiple nodes, and the nodes include multiple master nodes and slave nodes. Among them, each master node is connected to multiple slave nodes; In step S200, the method of monitoring and calculating the utility parameter values and weight levels of each master node in the mapping relationship network is as follows: In the local area network system, a master node provides a data encryption function for multiple work events and is used to encrypt the file to be encrypted; Within the most recent time interval time, the master node counts the work event load PTime and the work event access times PPick of each work event Event it serves. The work event load PTime refers to the time length for which the master node encrypts the data for the work event Event; the work event access times PPick refers to the number of times the master node encrypts the data for the work event Event; the utility parameter value PTRate is calculated from the work event load amounts PTime and the work event access times PPick of each work event Event of the master node. When the work event access times PPick > 0, the calculated utility parameter value PTRate = PTime ÷ PPick. When the work event access times PPick ≤ 0, the utility parameter value PTRate = 0; Construct a working event traffic sequence PTRLst through each utility parameter value PTRate, PTRLst = [PTRate1, PTRate2, …, PTRate Nsv , where PTRate Nsv represents the utility parameter value of the Nsvth master node assigned to this working event; for a working event, each file to be encrypted has a file importance level Dgr, and the file importance level Dgr is the ranking of the number of historical encryption times or encryption frequencies of this file to be encrypted in the database of the master node; The larger the value of Dgr, the lower the permission required to access the file to be encrypted. The file to be encrypted with a Dgr value of 1 is the file that requires the highest permission to access; for a work event, each master node has a weight level SGLV of the master node. The calculation method of the weight level SGLV is as follows: ， where m1 is the cumulative independent variable, Dgr m1 represents the file importance level of the m1-th file in the same master node under the same work event; is the arithmetic mean of the file importance levels Dgr of each file in the same master node under the same work event; construct the work event permission sequence SGLVLst according to the weight series SGLV of each master node, SGLVLst = [SGLV1, SGLV2,..., SGLV Nsv , where SGLV Nsv represents the weight series of the Nsv-th master node assigned to this work event, NDC is the number of files to be encrypted in the current master node assigned to the work event, and log is the logarithmic function; In step S300, the method of constructing the load chain according to the utility parameter value and the weight series is to calculate the working event load factor WCN through the working event permission sequence SGLVLst and the working event traffic sequence PTRLst. The working event load factor WCN of the m2-th master node is denoted as WCN m2 , WCN m2 The calculation method is as follows: ， Among them, λ1 is the memory usage ratio or hard disk occupancy ratio of all files to be encrypted for the current working event at the m2 - th master node; λ2 is the IO consumption or database usage ratio of all files to be encrypted for the current working event at the m2 - th master node; PTRate m2 represents the utility parameter value of the m2 - th master node in PTRLst, PTRate sum represents the sum of the utility parameter values PTRate of the current working event in PTRLst on all master nodes, SGLV m2 represents the weight level SGLV of the m2 - th master node in SGLVLst, Pr is a probability parameter, and the calculation method of Pr is as follows: ， Among them, SGLV min represents the minimum weight level among the respective main nodes in SGLVLst, and SGLV max represents the maximum weight level among the respective main nodes in SGLVLst; a load chain LoWCN is constructed through each working event load factor WCN, LoWCN = [WCN1, WCN2,..., WCN Nsv , where WCN Nsv represents the working event load factor of the Nsv-th main node assigned to this working event, and LoWCN(SvN) represents the working event load factor WCN of the SvN-th main node in the load chain LoWCN, where SvN is the serial number of the element in the load chain LoWCN; In step S400, the method of using the load chain to delimit the reasonable floating domain of the load is as follows: Let the current moment be T0, and the load chain obtained at moment T0 be LoWCN0. Starting from the next moment of T0, obtain sequentially-timed load chains. On Nsv master nodes, each master node corresponds to a load chain. Construct a matrix with each load chain as a row to serve as the load model Mtx(Sv,t) of the mapping relation network SvGrp. The mathematical representation of the load model Mtx(Sv,t) is as follows: ； where server represents the serial number of the master node and t represents the serial number of the moment; WCN Nsv,ω represents the load coefficient WCN of the Nsv-th master node in the load chain at the t-th moment Nsv ; Mtx(server, ) represents the value of the server-th row of the load model, and Mtx(, t) represents the value of the t-th column of the load model; set the variable m3 and set the initial value of the master node variable m3 to 1, set the variable m4 and set the initial value of the moment variable m4 to 1; set a sequence as the growth chain GrLs to store the load growth rate of a work event in the same master node; set a sequence as the decay chain DeLs to store the mounting decay rate of a work event in the same master node; S401, when m3 ≤ Nsv, jump to step S402; when m3 > Nsv, jump to S406; S402, when m4 < α, jump to step S403; when m4 ≥ α, calculate the expected growth rate ExpInc through the growth chain GrLs, where the expected growth rate ExpInc is the arithmetic mean of each element in the growth chain GrLs. After the calculation, clear the growth chain GrLs; calculate the expected decay rate ExpDec through the decay chain DeLs, where the expected decay rate ExpDec is the arithmetic mean of each element in the decay chain DeLs. After the calculation, clear the decay chain DeLs, and jump to step S405; S403, if WCN m3,m4 > WCN m3,m4+1 , calculate the load growth rate GrWCN, GrWCN = (WCN m3,m4 - WCN m3,m4+1 ) / WCN m3,m4+1 ; store GrWCN in the growth chain GrLs, increment the value of m4 by 1, and jump to step S402; otherwise, jump to step S404; S404, if WCN m3,m4 <WCN m3,m4+1 , calculate the mounting attenuation rate DeWCN, DeWCN = (WCN m3,m4+1 -WCN m3,m4 ) / WCN m3,m4+1 ; store DeWCN in the attenuation chain DeLs, increment the value of m4 by 1, and jump to step S402; increment the value of m4 by 1 and jump to step S402; S405. Calculate the discount factor ε according to Mtx(m3,), where Mtx(m3,) represents the value of the m3-th row of the load model, and the discount factor ε is the standard deviation of Mtx(m3,); calculate and obtain the first load valve FTld m3 and the second load valve STld m3 : ； ； Among them is the maximum value function for the range of m5 in the formula to be [1, , which is used to obtain the maximum value of the numerical value obtained by the formula operation within the brackets. is the minimum value function for the range of m6 in the formula to be [1, , which is used to obtain the minimum value of the numerical value obtained by the formula operation within the brackets. m5 is a variable; m6 is a variable; obtain the reasonable floating domain GRArea of the m3rd main node in a working event. m3 =[STld m3 , FTld m3 ; increase the value of m3 by 1, update the value of m4 to 1, and jump to step S401; S406, end; In step S500, the method for calculating the abnormal access coefficient of each slave node according to the load reasonable floating domain is as follows: the load out-of-bounds SpssIdx of the mapping relationship network SvGrp is obtained according to the load reasonable floating domain GRArea, and SpssIdx = SpssIdx1 + SpssIdx2; where SpssIdx1 and SpssIdx2 represent the load excessive parameter value and the load insufficient parameter value respectively, and the calculation methods of SpssIdx1 and SpssIdx2 are as follows: , in the formula , it is necessary to satisfy Otherwise, it does not participate in the operation, and m7 is an accumulative variable; , where in the formula , it is necessary to satisfy Otherwise, it does not participate in the operation, and m8 is an accumulative variable; It is the working event load coefficient of the m7th main node of the load chain obtained at time T0; It is the working event load factor of the m8th main node of the load chain obtained at time T0; Calculate the abnormal access coefficient Danger of a slave node through the mapping relation network SvGrp simultaneously connected by each slave node serial number STNBR, , where m9 is an accumulative variable, and SpssIdx m9 represents the load overrun value of the mapping relation network SvGrp assigned when the m9th work event Event is issued by a slave node, and δ represents the number of work events issued by a slave node; In step S600, the method for dynamically encrypting and adjusting according to the abnormal access coefficient of the slave node is as follows: obtain the abnormal access coefficient Danger of all slave nodes and form an abnormal list DangerList, sort each element in the DangerList in ascending order according to the value of Danger, and use the encryption system to encrypt the slave node order corresponding to the order of each element in the DangerList in sequence. The master node encrypts the work events transmitted by each slave node in turn according to the order.

2. The dynamic encryption method for local area network information security based on compound chaotic mapping according to claim 1, wherein The file to be encrypted is an audio file or an image file.

3. A dynamic encryption method for local area network information security based on a composite chaotic map according to claim 1, characterized in that, The master node is a server installed with an encryption system, and the slave nodes are several computer terminals StNbr connected to each master node; the data file of each work event is divided into Nsv copies and distributed to Nsv different servers.

4. A dynamic encryption method for local area network information security based on a composite chaotic map according to claim 1, characterized in that, The encryption system is a software system applying the compound chaotic mapping encryption technology.

Images