Key distribution method and system of DFMA system based on dynamic parameter table
By using a DFMA system with dynamic parameter tables in the PON network, combined with chaotic system and parameter registers, the problems of low key distribution efficiency and insufficient security in the PON network are solved, and efficient decryption and attack resistance are achieved.
Patent Information
- Application Number
- CN202410040935.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-01-09
- Publication Date
- 2024-11-01
- Estimated Expiration
- 2044-01-09
AI Technical Summary
The PON network has security problems due to the transmission of data in broadcast format, and the key distribution efficiency in existing chaotic encryption is low and easy to be attacked. Fixed parameter tables lead to the stolen synchronization sequence and keys easily.
Using a DFMA system based on dynamic parameter tables, the sending and receiving ends use the same chaotic system and parameter registers, and the dynamic parameter table and static parameter table are combined to generate a unique key sequence through random index values, update the parameter table in real time, and improve decryption. Efficient and resist select plaintext attacks.
It effectively improves the decryption rate of the receiver, resists plaintext attacks, ensures that the keys are different each time, enhances network security, and avoids the reuse and theft of keys.
Smart Images

Figure CN117879783B_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the field of communication technology, and in particular relates to a key distribution method and system of a DFMA system based on a dynamic parameter table. Background Art
[0002] With the development of technologies such as high-definition video, virtual reality VR, and 5G fronthaul, modern society has put forward higher and higher requirements for transmission rate and bandwidth. PON network meets these requirements well due to its high bit rate, flexible resource allocation, and low comprehensive construction cost. Among them, digital filtering multiple access passive optical network has become one of the core technologies of the next generation access network by virtue of its advantages such as meeting the highly dynamic and reconfigurable requirements of future broadband access networks and having flexible bandwidth allocation schemes. However, since PON networks generally use broadcasting to transmit data downstream, this means that no ONU in the network can receive all data sent from the OLT. Some illegal ONUs will disguise themselves as legitimate OUNs to steal information from the OLT. This transmission of data in broadcasting form is also the main cause of PON network security problems.
[0003] The application of chaotic encryption in PON networks is also a hot topic of research. At present, there are two main aspects of the application of chaotic encryption in PON networks, one is laser chaos and the other is digital chaos. Laser chaos requires high synchronization of the lasers of the sender and the receiver, which leads to high requirements for equipment and low economic benefits. The current digital chaotic encryption in PON networks mainly focuses on the encryption level, and improves security through various improved encryption algorithms. However, as a type of symmetric encryption, key distribution of chaotic encryption is often overlooked, and the common key distribution process is separated from data transmission. The key distribution process as a two-step process will also reduce the efficiency of encryption and decryption of symmetric encryption.
[0004] In addition, the current chaos synchronization is achieved by selecting different parameters. Basically, static parameters and dynamic parameters are selected in the parameter table without changing the parameter table. There are two problems with this method. One is that the efficiency of chaos synchronization is extremely low. A large number of chaotic iterative calculations are required each time, and a large DSP delay is introduced at the receiving end. The other is that due to the fixed parameter table, it can resist the selective attack of inscriptions in a short time, but if a large amount of information is sent for a long time, repeated parameters will definitely be selected. The same parameters are used as the chaos initial values, and the synchronization sequence and key generated according to the fixed parameters are also the same. In this way, it is easy to be stolen by illegal attackers in the long run. Summary of the invention
[0005] In order to more effectively resist chosen plaintext attacks and improve the decryption rate of the receiver, the present invention proposes a key distribution method for a DFMA system based on a dynamic parameter table. The sending end and the receiving end use the same chaotic system and parameter register. The parameter register stores the index value required for the next encryption. A dynamic parameter table and a static parameter table are also provided in the chaotic system. Each index value corresponds to a position in a dynamic parameter table and a position in a static parameter table. The process of key distribution specifically includes the following steps:
[0006] The sender takes the index value from the parameter register as the index value P used this time. i , and generate a random index P by random number i+1 Overwrite the index value in the register;
[0007] The sender uses the index value P i The corresponding dynamic parameters and static parameters act on the chaotic system, and after iteration and quantization, a binary chaotic sequence B is generated. i , from B i The binary sequence of N bits is intercepted from the first bit as the synchronization sequence L;
[0008] From B i Starting from the N+1th bit, a binary sequence of the same length as the transmitted data is intercepted as the key, the binary sequence of the data to be transmitted and the index value is XOR-encrypted, and the encrypted data and the synchronization sequence are sent to the receiver together;
[0009] The last two parameters of the output sequence of the chaotic system Y at the sender replace the index value P i Corresponding to the value in the dynamic parameter table;
[0010] After the receiver receives the data, the index value stored in the receiver parameter memory generates a synchronization sequence L', and determines whether the correlation between the synchronization sequence L' and the synchronization sequence L is greater than a set threshold;
[0011] If the correlation between the synchronization sequence L' and the synchronization sequence L is not greater than the set threshold, the receiving end traverses the static parameters and dynamic parameters corresponding to all index values until the correlation between the synchronization sequence L' and the synchronization sequence L is greater than the set threshold, and obtains the dynamic parameters and static parameters at this time;
[0012] If it is greater than, the dynamic parameters and static parameters corresponding to the index value stored in the parameter memory of the receiver are used to generate a key on the chaotic system, and the key is used to decrypt the received encrypted data;
[0013] Use the two parameters output from the chaotic system Y to replace the index value P i The corresponding dynamic parameters;
[0014] The index value obtained by decryption at the receiving end is used to replace the index value stored in the parameter register at the receiving end.
[0015] Furthermore, when the sending end and the receiving end are initialized, the sending end randomly selects two index values, stores one of them as the index value to be used next time in its local parameter register, and initializes the local parameter register of the receiving end to zero.
[0016] Furthermore, the calculation of the correlation between two synchronization sequences is expressed as:
[0017]
[0018] Among them, ρ vu represents the correlation parameter between the synchronization sequence V and the synchronization sequence U. When ρ vu When it is greater than a set threshold, the synchronization sequence V is correlated with the synchronization sequence U.
[0019] Furthermore, the receiving end and the transmitting end use a two-dimensional improved logistics chaotic system to generate chaotic signals. The two-dimensional improved logistics chaotic system is expressed as:
[0020]
[0021] Among them, X n+1 represents the signal generated by the X-end of the chaotic system at the n+1th iteration, Y n+1 represents the signal generated by the Y terminal of the chaotic system at the n+1th iteration; a is the static parameter of the chaotic system, and the value range of a is (0,1); X 0 and Y 0 is the dynamic parameter of the chaotic system, and its value range is (0,1).
[0022] Furthermore, the two-dimensional improved logistics chaotic system is superimposed n+2 times in total, and the signal generated by the X end is preprocessed and quantized as the chaotic sequence B i ; Use the values output from the last two iterations of the Y end to update the index value P used this time i Corresponding to the values of the two dynamic parameters in the dynamic parameter table.
[0023] Furthermore, in order to enhance the statistical characteristics of 0 and 1 in binary, the sequence output by each chaotic system is preprocessed, including:
[0024] X i =10 6 X i -floor(10 6 X i )
[0025] Y i =106 Y i -floor(10 6 Y i )
[0026] Among them, (X i , Y i ) is the sequence of the X-end and Y-end outputs of the chaotic system at the i-th iteration; floor(·) is the floor rounding function.
[0027] Furthermore, the chaotic sequence (X i , Y i ), perform quantization on the output of the X terminal, and use the quantized sequence as:
[0028]
[0029] Among them, B i Represents the binary sequence after the chaotic sequence is quantized.
[0030] Furthermore, the binary sequence B i The length of is n, where n is the sum of the synchronization sequence length, the data to be sent, and the binary sequence of the index value.
[0031] Furthermore, each index value includes a row and column position index in a static parameter table and a row and column position index in two dynamic parameter tables, and each index position of all positions is converted into a binary parameter and then encrypted.
[0032] The present invention also proposes a key distribution system of a DFMA system based on a dynamic parameter table, which is used to implement a key distribution method of a DFMA system based on a dynamic parameter table, including a chaotic signal generation module, a parameter index register, a parameter table register, and a correlation coefficient judgement device, wherein:
[0033] The parameter index register is used to store the index values of static parameters and dynamic parameters required for the next use of the chaotic signal generating module;
[0034] A chaotic signal generating module is used to generate a chaotic sequence according to static parameters and dynamic parameters, obtain a synchronization sequence according to the chaotic sequence, and update the dynamic parameters corresponding to the index values in the parameter table register according to the chaotic sequence;
[0035] Parameter table registers, used to store dynamic parameters and static parameters according to index values;
[0036] The correlation coefficient determiner is used to determine whether the correlation coefficient of two synchronization sequences is greater than a set threshold.
[0037] By adding a parameter register to the sender and the receiver, the parameter register stores the same index value, that is, the parameter group index required for the next encryption and decryption, and inserting the index required for the next encryption and decryption after the transmission data and encrypting it, and then inserting the synchronization sequence after the index and transmitting it to the sender together, the efficiency of encryption and decryption is improved. At the same time, the output parameters of the Y end of the chaotic system are used to replace the used dynamic parameters, so that the parameter table is updated in real time. The parameters used each time are unique, and the encryption key is different each time, achieving a one-time one-key effect, which can more effectively resist chosen plaintext attacks. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 A schematic diagram of the transmission structure of the encryption process of the key distribution scheme of the DFMA system based on the dynamic parameter table in the DFMA-PON system according to an embodiment of the present invention;
[0039] Figure 2 Detailed flow chart of the encryption and decryption process of the present invention;
[0040] Figure 3 It is a line graph of the sensitivity characteristics of the initial value of chaos;
[0041] Figure 4 is the relationship between the correlation coefficient and autocorrelation coefficient of the chaotic sequence in the chaotic system, where (a) is the relationship between the correlation coefficient and time of the chaotic sequence generated by the chaotic system; (b) is the relationship between the autocorrelation coefficient and time of the chaotic sequence generated by the chaotic system;
[0042] Figure 5 It is the relationship curve between the correlation coefficient and the bit error rate;
[0043] Figure 6 This is a schematic diagram comparing the bit error rate of the encrypted signal and the original signal of the embodiment of the present invention, and the illegal ONU transmitted through a 25km optical fiber;
[0044] Figure 7 A curve diagram showing the effect of the number of parameters in the parameter table on the time required to achieve chaotic synchronization without and with registers in the present invention DETAILED DESCRIPTION
[0045] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments 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 creative work are within the scope of protection of the present invention.
[0046] The present invention proposes a key distribution method for a DFMA system based on a dynamic parameter table. The transmitting end and the receiving end use the same chaotic system and parameter register. The parameter register stores the index value required for the next encryption. A dynamic parameter table and a static parameter table are also provided in the chaotic system. Each index value corresponds to a position in the dynamic parameter table and a position in the static parameter table. The process of key distribution specifically includes the following steps:
[0047] The sender takes the index value from the parameter register as the index value P used this time. i , and generate a random index P by random number i+1 Overwrite the index value in the register;
[0048] The sender uses the index value P i The corresponding dynamic parameters and static parameters act on the chaotic system, and after iteration and quantization, a binary chaotic sequence B is generated. i , from B i The binary sequence of N bits is intercepted from the first bit as the synchronization sequence L;
[0049] From B i Starting from the N+1th bit, a binary sequence of the same length as the transmitted data is intercepted as the key, the binary sequence of the data to be transmitted and the index value is XOR-encrypted, and the encrypted data and the synchronization sequence are sent to the receiver together;
[0050] The last two parameters of the output sequence of the chaotic system Y at the sender replace the index value P i Corresponding to the value in the dynamic parameter table;
[0051] After the receiver receives the data, the index value stored in the receiver parameter memory generates a synchronization sequence L', and determines whether the correlation between the synchronization sequence L' and the synchronization sequence L is greater than a set threshold;
[0052] If the correlation between the synchronization sequence L' and the synchronization sequence L is not greater than the set threshold, the receiving end traverses the static parameters and dynamic parameters corresponding to all index values until the correlation between the synchronization sequence L' and the synchronization sequence L is greater than the set threshold, and obtains the dynamic parameters and static parameters at this time;
[0053] If it is greater than, the dynamic parameters and static parameters corresponding to the index value stored in the parameter memory of the receiver are used to generate a key on the chaotic system, and the key is used to decrypt the received encrypted data;
[0054] Use the two parameters output from the chaotic system Y to replace the index value P i The corresponding dynamic parameters;
[0055] The index value obtained by decryption at the receiving end is used to replace the index value stored in the parameter register at the receiving end.
[0056] The present invention is based on an encryption method for a key distribution scheme of a DFMA system based on a dynamic parameter table, and the process is as follows: Figure 1 and Figure 2 As shown, the system includes a two-dimensional improved logistics chaotic signal generating module, a signal generating module, an optical transmission module, a signal receiving module, a parameter index register, and a parameter table register. The encryption process specifically includes:
[0057] The logistic map is a one-dimensional discrete chaotic system with fast operation speed. Repeated iteration of the equation can generate a better chaotic sequence. In order to enhance the ability of DFMA-PON to resist attacks, the present invention selects a two-dimensional improved logistics chaotic system to generate chaotic signals for this system, aiming at the problems of small key space and simple structure of traditional logistics chaos. The chaotic system adds sine terms and new variables on the basis of the original traditional logistics chaotic system to construct an improved two-dimensional logistics chaotic system. The system can increase the key space, and has a simple structure. The generated chaotic sequence has strong pseudo-randomness. Using it as a key can improve the security of the encryption algorithm. The following is the formula of the improved chaotic system:
[0058]
[0059] Among them, X n+1 represents the signal generated by the X-end of the chaotic system at the n+1th iteration, Y n+1 represents the signal generated by the Y terminal of the chaotic system at the n+1th iteration; a is the static parameter of the chaotic system, and the value range of a is (0,1); X 0 , Y 0 is the dynamic parameter of the chaotic system, and its value range is (0,1); when all values are within the range, the chaotic system is in a chaotic state.
[0060] The chaotic output sequence is (X i , Y i ), in order to enhance the statistical characteristics of 0 and 1 in binary, the output sequence (X i , Y i ) is processed as follows:
[0061] X i =10 6 X i -floor(10 6 X i )
[0062] Y i =10 6 Y i -floor(106 Y i )
[0063] Among them, (X i , Y i ) is the sequence of the X-end and Y-end outputs of the chaotic system at the i-th iteration; floor(...) is the floor rounding function.
[0064] After iteration, the chaotic sequence (X i , Y i ), for X i The output is quantized:
[0065]
[0066] The chaotic system used in the present invention can increase the key space, has a simple structure, and generates a chaotic sequence with strong pseudo-randomness. Using it as a key can improve the security of the encryption algorithm. Through analysis, the value ranges of the three parameters of the two-dimensional improved logistic chaotic system are all 0 to 1 and do not include 0 and 1. The calculation accuracy of the present invention is 10 -15 (i.e. 15 decimal places), the key space is 10 15 ×10 15 ×10 15 ≈2 150 >2 100 , indicating that the chaos can effectively resist exhaustive attacks.
[0067] In the first communication, the index values stored in the registers of the sender and the receiver are empty. The process of key synchronization between the sender and the receiver includes:
[0068] The sender selects two sets of static parameters and dynamic parameters from the parameter table in the register, and records the index value of one set as P i , another set of index values is recorded as P i+1 , P i+1 Stored in the register as the next index value, we use P i Parameters are selected from the parameter table to act on chaos to generate a binary sequence of a certain length (a binary sequence of 400 bits in length is generated in this embodiment), and the synchronization sequence generated by the transmitting end is called the synchronization sequence L.
[0069] After obtaining the synchronization sequence, P i+1 Convert to binary sequence D i+1 And insert it after the data to be sent, insert the synchronization sequence into D i+1 After that, we will send data, synchronization sequence, D i+1 The three parts are regarded as a whole data, and the chaos is used again to generate the key C, which is combined with the sent data and D i+1The total length is the same, we use the key C to send data and D i+1 The two parts are XOR-encrypted, and then the encrypted whole data is sent to the receiver through the channel. The encryption process is as follows:
[0070]
[0071] Among them, C is the key, Q is the binary data to be sent, S is the ciphertext generated after encryption, and D i+1 P i+1 The corresponding binary sequence, P i+1 It includes three groups of indexes, namely, the coordinate index of a static parameter and the coordinate index of two dynamic parameters. If one of the coordinates is (3,4), it means that the group of parameters is the parameter value stored in the 3rd row and 4th column of the dynamic parameter table or the static parameter table. The binary value of the coordinate is 100011. It is an XOR operation.
[0072] After the sender completes the transmission, it will use the Y output at the Y end n+1 and Y n+2 Replace the dynamic parameters used in the dynamic parameter table. This ensures that the dynamic parameters are used only once and will not be reused. The key used for encryption will not have repeated results each time, achieving a one-time-one-key effect and more effectively resisting chosen-plaintext attacks.
[0073] After the receiver receives the transmission data, since the parameters in the local memory are empty for the first time, the receiver traverses its own parameter set and selects different static parameters and dynamic parameters from them, acts on the chaotic system to generate the synchronization sequence L', and calculates the correlation coefficient between L and L'. The correlation coefficient formula is defined as follows:
[0074]
[0075] Among them, ρ vu represents the correlation parameter between synchronization sequence V and synchronization sequence U; cov(V,U) represents the covariance function between synchronization sequence V and synchronization sequence U, D(V) represents the variance of synchronization sequence V, D(U) represents the variance of synchronization sequence U, and cov(V,U) is denoted as σ vu , Denoted as σ v , Denoted as σ u .
[0076] Due to the sensitive characteristic of the initial value of chaos, if the parameters of the sender and the receiver are different, the correlation coefficient between L and L' will be very small. If they are the same, L and L' are exactly the same, which means that their correlation coefficient is 1. Considering that the synchronization sequence may generate bit errors during transmission, a threshold is set in the present invention (the threshold is 0.3 in this embodiment, and those skilled in the art can choose it according to actual conditions or experience). When the correlation coefficient between L and L' is greater than the threshold, it is considered that the parameters of the receiving end are the same as the parameters of the sending end, that is, the synchronization of chaos is achieved. Then, the synchronized chaotic synchronization system is used to generate a key to decrypt the received data S and extract D therein. i+1 and converted to P i+1 , and then obtain the P required for the next decryption i+1 After that, it will store it in its own parameter register. At the same time, the receiver will use the Y output of the Y terminal n+1 and Y n+2 Replace the used dynamic parameters in the dynamic parameter table to ensure that the parameter tables of the sender and receiver remain consistent.
[0077] The subsequent communication will be much simpler. The present invention will store the last generated P in the sender's memory. i+1 Take it out, select the corresponding dynamic parameters and static parameters in the parameter table to act on the chaotic system to generate a synchronization sequence, and at the same time generate a set of new index values P i+1 Store the new P in the register. i+1 Convert to binary sequence D i+1 And insert it to the end of the transmitted data, and similarly insert the synchronization sequence into D i+1 The back is sent to the sender together, because the receiver has obtained the P required for decryption in the last communication. i (P in the last communication i+1 ) and stored in the local register. After receiving the data, the receiver directly takes out the index value P from its own register i , directly acts on the chaos to generate the synchronization sequence L', and then calculates the correlation coefficient R between L and L'. If R>threshold, it is considered that P stored in the register i is correct. Of course, the receiver register P i That is, P from the last communication. i+1 In the last communication, a bit error or loss may occur, resulting in the P stored in the receiver's register in this communication. i is wrong, which means the correlation coefficient is less than the threshold. When the correlation coefficient is less than the threshold, the receiver will traverse the parameter set to generate the synchronization sequence L' as at the beginning until the correlation coefficient is greater than the threshold, and then use the selected parameters to generate the key for decryption to ensure normal communication. After the decryption is completed, D is also extracted.i+1 and converted to P i+1 , and then obtain the P required for the next decryption i+1 After that, it will store it in its own parameter register.
[0078] Finally, the sender and the receiver use the same method to generate the corresponding chaotic value Y n+1 and Y n+2 Replaces used parameters in the dynamic parameter table.
[0079] Generally, the attacker temporarily obtains the right to use the encryption system, so the attacker can encrypt any plaintext and obtain the corresponding ciphertext. The attacker then compares the encrypted ciphertext with the intercepted ciphertext one by one to decipher all or part of the plaintext. In the invention of this article, by adopting the method of dynamic parameters and dynamic parameter tables, the key required for each encryption and its corresponding synchronization sequence are different, which effectively resists the chosen plaintext attack.
[0080] The present invention also proposes a key distribution system of a DFMA system based on a dynamic parameter table, which is used to implement a key distribution method of a DFMA system based on a dynamic parameter table, including a chaotic signal generation module, a parameter index register, a parameter table register, and a correlation coefficient judgement device, wherein:
[0081] The parameter index register is used to store the index values of static parameters and dynamic parameters required for the next use of the chaotic signal generating module;
[0082] A chaotic signal generating module is used to generate a chaotic sequence according to static parameters and dynamic parameters, obtain a synchronization sequence according to the chaotic sequence, and update the dynamic parameters corresponding to the index value in the parameter table register according to the chaotic sequence; the chaotic signal generating module performs n+2 iterations, and the two ports of the X end and the Y end respectively output n+2 chaotic parameters, and the first n chaotic parameters of the chaotic parameters generated by the X end are preprocessed and quantized to form a binary sequence, and the first N bits of the binary sequence are used as the synchronization sequence, and the Nth to nth bits are used as the key for encrypting the binary sequence of the data to be sent and the index value, and the length of the key is the same as the sum of the lengths of the binary sequence of the data to be sent and the index value, and the data of the last two iterations of the Y end are used to update the values stored in the positions of the two dynamic parameters corresponding to the current index value, so as to ensure that the value of the dynamic parameter when the index position is used next time is different from that when it is used this time;
[0083] A parameter table register is used to store dynamic parameters and static parameters according to index values. In this register, each table includes multiple rows and columns. Each row and column is used as an index position. A parameter value is stored in each position. The value of the static parameter is fixed, but the value of the index position used each time in the dynamic parameter needs to be updated after use.
[0084] The correlation coefficient judger is used to judge whether the correlation coefficient of two synchronization sequences is greater than the set threshold. If it is greater, it is determined that the chaotic systems of the receiving end and the sending end have been aligned, and the parameters in the parameter register can be directly used for key synchronization. If it is not greater than the set threshold, it is necessary to traverse the parameters in the parameter register until the correlation coefficient of the generated synchronization sequence and the received synchronization sequence is greater than the set threshold, and the key generated by the parameters that meet this condition is used as the synchronization key.
[0085] pass Figure 3 , we can have a deeper understanding of the initial value sensitivity of chaos. There are two broken lines in the figure. The points on these two broken lines are basically non-coincident. These two broken lines are the results of chaos iteration with two different initial values, and the difference between these two initial values is only 10 -15 .and Figure 4 (a) shows the correlation coefficient of the chaotic sequences generated by different initial values after quantization to form binary. It can be concluded that due to the initial value sensitivity of chaos, the correlation between the chaotic sequences generated by different initial values is very small, and their correlation coefficient is also a value close to 0.
[0086] Figure 6 This is a comparison of the bit error rates of the encrypted signal and the original signal after being transmitted over a 25km standard single-mode optical fiber. In the figure, the BER of the original signal is slightly lower than that of the encrypted signal. This is mainly because the scheme increases the complexity of the system, but since the scheme only changes the original data and does not introduce additional modulation operations, the difference between them is almost negligible.
[0087] from Figure 7 It can be seen that, under the condition of normal transmission of the optical fiber channel, the key distribution scheme of the DFMA system based on the dynamic parameter table of the present invention can greatly improve the efficiency of the receiving end to achieve chaotic synchronization, and solve the problems that the physical layer encryption scheme is generally unable to resist the chosen plaintext attack and the key is fixed. In addition, the encryption system is simple to operate, occupies a small space, has the ability to encrypt signals in real time and at high speed, and can provide physical layer encryption for DFMA-PON.
[0088] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.
Claims
1. A key distribution method for a digital filtering multiple access (DFMA) system based on a dynamic parameter table, characterized in that: The sending end and the receiving end use the same chaotic system and parameter register. The parameter register stores the index value required for the next encryption. A dynamic parameter table and a static parameter table are also set in the chaotic system. Each index value corresponds to a position in the dynamic parameter table and a position in the static parameter table. The key distribution process specifically includes the following steps: The sender takes the index value from the parameter register as the index value P used this time. i , and generate a random index P by random number i+1 Overwrite the index value in the register; The sender uses the index value P i The corresponding dynamic parameters and static parameters act on the chaotic system, and after iteration and quantization, a binary chaotic sequence B is generated. i , from B i The binary sequence of N bits is intercepted from the first bit as the synchronization sequence L; From B i Starting from the N+1th bit, a binary sequence with the same length as the data to be encrypted is intercepted as the key, the data to be sent and the binary sequence of the index value are XOR-encrypted, and the encrypted data and the synchronization sequence are sent to the receiver together. The length of the data to be sent is the sum of the length of the binary data to be sent and the binary length of the index value; The current index value P is calculated by using the data output from the last two iterations of the chaotic system Y of the sender. i Update the values stored in the two dynamic parameter positions in the corresponding dynamic parameter table; After the receiver receives the data, the index value stored in the receiver parameter register generates a synchronization sequence L', and determines whether the correlation between the synchronization sequence L' and the synchronization sequence L is greater than a set threshold; If the correlation between the synchronization sequence L' and the synchronization sequence L is not greater than the set threshold, the receiving end traverses the static parameters and dynamic parameters corresponding to all index values until the correlation between the synchronization sequence L' and the synchronization sequence L is greater than the set threshold, and obtains the dynamic parameters and static parameters at this time; If it is greater than, the dynamic parameters and static parameters corresponding to the index value stored in the parameter register of the receiving party are used to generate a key on the chaotic system, and the key is used to decrypt the received encrypted data; Use the two parameters output from the chaotic system Y to replace the index value P i The corresponding dynamic parameters; The index value obtained by decryption at the receiving end is used to replace the index value stored in the parameter register at the receiving end.
2. A key distribution method for a DFMA system based on a dynamic parameter table according to claim 1, characterized in that: When the sender and the receiver are initialized, the sender randomly selects two index values, stores one of them as the index value to be used next time in its local parameter register, and initializes the local parameter register of the receiver to zero.
3. The key distribution method of the DFMA system based on the dynamic parameter table according to claim 1 is characterized in that: The calculation of the correlation between two synchronization sequences is expressed as: Among them, ρ vu represents the correlation parameter between the synchronization sequence V and the synchronization sequence U. When ρ vu When the synchronization sequence V is greater than the set threshold, it is correlated with the synchronization sequence U; cov(V,U) represents the covariance function between V and U, D(V) represents the variance of V, D(U) represents the variance of U, and cov(V,U) is denoted as σ vu , Denoted as σ v , Denoted as σ u .
4. The key distribution method of the DFMA system based on the dynamic parameter table according to claim 1 is characterized in that: The receiving end and the sending end use a two-dimensional improved logistics chaotic system to generate chaotic signals. The two-dimensional improved logistics chaotic system is expressed as: Among them, X n+1 , X n represents the signal generated by the X-end at the n+1th and nth iterations of the chaotic system, Y n+1 , Y n It represents the signal generated at the Y end of the chaotic system at the n+1th and nth iterations, and the initial value of the X end and Y end iterations of the chaotic system, that is, the dynamic parameters X0 and Y0 of the chaotic system have a value range of (0,1); a is the static parameter of the chaotic system, and the value range of a is (0,1).
5. A key distribution method for a DFMA system based on a dynamic parameter table according to claim 4, characterized in that: The two-dimensional improved logistics chaotic system is superimposed n+2 times in total, and the signal generated by the X end is preprocessed and quantized as the chaotic sequence B i ; Use the values output from the last two iterations of the Y end to update the index value P used this time i Corresponding to the values of the two dynamic parameters in the dynamic parameter table.
6. A key distribution method for a DFMA system based on a dynamic parameter table according to claim 5, characterized in that: In order to enhance the statistical characteristics of 0 and 1 in binary, the sequence output by each chaotic system is preprocessed, including: Among them, (X i , Y i ) is the sequence of the X-end and Y-end outputs of the chaotic system at the i-th iteration; floor(·) is the floor rounding function.
7. A key distribution method for a DFMA system based on a dynamic parameter table according to claim 6, characterized in that: After iteration, the chaotic sequence (X i , Y i ), perform quantization on the output of the X terminal, and use the quantized sequence as: Among them, B i Represents the binary sequence after the chaotic sequence is quantized.
8. The key distribution method of the DFMA system based on the dynamic parameter table according to claim 6 is characterized in that: Binary sequence B i The length of is n, where n is the sum of the synchronization sequence length, the length of the binary data to be sent, and the binary length of the index value.
9. A key distribution method for a DFMA system based on a dynamic parameter table according to claim 1 or 8, characterized in that: Each index value includes a row and column position index in a static parameter table and a row and column position index in two dynamic parameter tables. The index position, that is, the row and column position of the parameter table where the index value is located, is converted into a binary parameter and then encrypted.
10. A key distribution system for a DFMA system based on a dynamic parameter table, characterized in that: A key distribution method for a DFMA system based on a dynamic parameter table according to claim 1, comprising a chaotic signal generation module, a parameter index register, a parameter table register, and a correlation coefficient determiner, wherein: The parameter index register is used to store the index values of static parameters and dynamic parameters required for the next use of the chaotic signal generating module; A chaotic signal generating module is used to generate a chaotic sequence according to static parameters and dynamic parameters, obtain a synchronization sequence according to the chaotic sequence, and update the dynamic parameters corresponding to the index values in the parameter table register according to the chaotic sequence; Parameter table registers, used to store dynamic parameters and static parameters according to index values; The correlation coefficient determiner is used to determine whether the correlation coefficient of two synchronization sequences is greater than a set threshold.
