Pseudo-random sequence set generation method and device

Abstract

The invention provides a pseudorandom sequence set generation method and device, and the method comprises the steps: configuring a first parameter, a first initial value and a first iteration length of a disturbance generator, carrying out the iteration based on the disturbance generator, and obtaining a first chaotic value sequence; mapping the first chaotic value sequence into a uniformly distributed sequence to obtain an initial sequence; configuring a target number of groups of second iteration lengths and second initial values of the main chaos sequence generators, configuring second parameters of the main chaos sequence generators according to the initial sequences, and performing iteration based on the main chaos sequence generators to obtain a target number of second chaos value sequences; and respectively mapping the second chaotic value sequences into uniformly distributed sequences to obtain the target number of mapping results, and obtaining a pseudo-random sequence set according to the target number of mapping results. The chaotic sequence period can be prolonged.

Description

Technical Field

[0001] The present invention relates to the field of information security technology, and in particular to a method and device for generating a pseudo-random sequence set. Background Art

[0002] Pseudo-random sequences are widely used in image encryption, secure communication, cryptography and other fields. At present, the commonly used methods for generating pseudo-random sequences in digital circuits include chaotic mapping, such as Logistic chaotic mapping, Chebyshev chaotic mapping and Tent chaotic mapping, which generate chaotic numerical sequences by iterative equations with given initial values, and then map the numerical values ​​into numbers to obtain pseudo-random sequences. The pseudo-random sequences obtained by chaotic iteration have good randomness and ergodicity, are highly sensitive to initial values ​​and conditional parameters, and can iteratively obtain completely different sequences with only slight changes, so they can be used to construct a large number of pseudo-random number sequences. Theoretically, under infinite precision, the sequence period obtained by chaotic mapping iteration is infinitely long, but in hardware implementation, only finite precision can be used. Under the premise of finite precision, its dynamic characteristics are severely degraded. After the chaotic mapping iteration reaches a certain long period, it will enter a short period loop, which seriously affects the encryption performance. Therefore, it is necessary to design a pseudo-random sequence generation scheme with a longer period to achieve better encryption effect. In some application scenarios, multiple pseudo-random sequences are required. If the random sequence value corresponds to a specific physical meaning, it may be required that the sequence values ​​at the same time avoid consistent collisions as much as possible (such as frequency hopping in Bluetooth communication). Therefore, it is also necessary to prefer a sequence set generation scheme with smaller correlation and fewer mutual collisions.

[0003] In existing digital circuits, a chaotic cascade is often used, with one mapping as a perturbation parameter generator and the other as a main chaotic sequence generator. The two mappings can use the same chaos type or different chaos types. For example, an existing solution uses a dual Logistic mapping coupling structure, uses different initial values ​​for iteration, and uses the perturbation parameters generated by the perturbation parameter generator to update the control parameters of the chaotic sequence generator, so that the orbit of the chaotic sequence generator output sequence continuously jumps on the chaotic mapping set, which can not only extend the length of the chaotic sequence output orbit, but also enhance the uniformity of the output sequence distribution, reducing the impact of the chaotic system entering a short-period orbit on the security of the chaotic cipher.

[0004] The existing technical solution can improve the period of the pseudo-random sequence and reduce the possibility of the pseudo-random sequence entering the short period by regularly changing the iteration parameter of the second chaotic map through the first chaotic map, but it is impossible to completely avoid the pseudo-random sequence from entering the short period loop, and there is still a small probability of occurrence. Once entering the short period loop, it will seriously affect the performance of the pseudo-random sequence. Although the frequency of changing the iteration parameter can be increased to allow the sequence to escape from the short period loop in time and eliminate the influence, this will greatly reduce the length of the non-periodic sequence generated by the first chaotic map. Moreover, multiple groups of pseudo-random sequences are generated by this solution. Although the correlation between the pseudo-random sequences is very small, there are still collisions at the same position.

[0005] In summary, the existing technology has the problem of short chaotic sequence period. Summary of the invention

[0006] The present invention provides a pseudo-random sequence set generation method and device, which are used to solve the defect of short chaotic sequence period in the prior art and realize the generation of an orthogonal pseudo-random sequence set with a long chaotic sequence period.

[0007] The present invention provides a method for generating a pseudo-random sequence set, comprising the following steps: Configure a first parameter, a first initial value and a first iteration length of a disturbance generator, and iterate based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on a logistic chaotic map; Mapping the first chaotic value sequence into a uniformly distributed sequence to obtain an initial sequence; The second iteration length and the second initial value of the target number group master chaotic sequence generator are configured, the second parameter of the master chaotic sequence generator is configured according to the initial sequence, and the master chaotic sequence generator is iterated according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the master chaotic sequence generator is constructed based on the Chebyshev chaotic map; the target number is obtained by adding one to the preset number of sequence sets; The second chaotic value sequences are respectively mapped into uniformly distributed sequences to obtain the target number of mapping results, and a pseudo-random sequence set is obtained according to the target number of mapping results.

[0008] According to a pseudo-random sequence set generation method provided by the present invention, mapping the first chaotic value sequence to a uniformly distributed sequence to obtain an initial sequence specifically includes: The boundary value is calculated according to the first value interval number by using the cosine mapping algorithm; wherein the first value interval number is the number of powers of the second parameter of the Chebyshev chaotic map; The sequence value of the first chaotic value sequence is mapped using a binary search algorithm according to the boundary value to obtain an initial sequence.

[0009] According to a pseudo-random sequence set generation method provided by the present invention, the first chaotic value sequence is mapped into a uniformly distributed sequence to obtain an initial sequence, and then further includes: De-continuing the continuous values ​​of the initial sequence to obtain a first sequence; Performing a periodic self-check on the first sequence, and updating the first initial value according to the self-check result; Re-iteration is performed based on the disturbance generator according to the first parameter, the updated first initial value and the first iteration length.

[0010] According to a pseudo-random sequence set generation method provided by the present invention, the second chaotic value sequence is mapped into a uniformly distributed sequence to obtain the target number of mapping results, which specifically includes: The number of value intervals of the first group of main chaotic sequence generators is set to a first number, and the number of value intervals of the remaining main chaotic sequence generators is set to a second number; wherein the first number is the factorial of the number of preset sequence sets; Using the cosine mapping algorithm, the respective boundary values ​​are calculated according to the value interval number of the main chaotic sequence generator; The sequence values ​​of the second chaotic value sequence are mapped using a binary search algorithm according to the boundary values ​​to obtain the target number of mapping results.

[0011] According to a pseudo-random sequence set generation method provided by the present invention, a pseudo-random sequence set is obtained according to the target number of mapping results, specifically comprising: S1: let i=1; S2: using the i-th chaotic value in the mapping result of the first group of main chaotic sequence generators as an address, taking out a possible arrangement from the pre-stored arrangement results as the value segment number of the target number of main chaotic generators; S3: Selecting a value range whose segment number is the value segment number from a pre-constructed value range set as a target value range; S4: taking the chaotic values ​​of the remaining main chaotic sequence generators as serial numbers, selecting an integer corresponding to the serial number from a preset value range set as a value result, and obtaining the i-th column of data; S5: Let i=i+1, and repeat steps S2-S5 until the length of each row of pseudo-random number sequence reaches a preset sequence length, thereby obtaining a pseudo-random sequence set.

[0012] According to a pseudo-random sequence set generation method provided by the present invention, the steps of constructing the arrangement result and the value range set include: Dividing the preset random number value range by the preset number of sequence sets to obtain the preset number of value ranges of the sequence sets, numbering the value ranges to obtain segment numbers, and obtaining a value range set according to the preset number of value ranges of the sequence sets marked with the segment numbers; The values ​​of the value range corresponding to each segment number are numbered, and the segment numbers are fully arranged to obtain an arrangement result.

[0013] According to a pseudo-random sequence set generation method provided by the present invention, the second chaotic value sequence is mapped into a uniformly distributed sequence to obtain the target number of mapping results, and then further includes: Performing periodic self-check on the mapping result, and updating the second initial value according to the self-check result; Re-iteration is performed based on the main chaotic sequence generator according to the second iteration length, the updated second initial value and the second parameter.

[0014] The present invention also provides a pseudo-random sequence set generation device, comprising the following modules: A first iteration unit, configured to configure a first parameter, a first initial value and a first iteration length of a disturbance generator, and iterate based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on a logistic chaotic map; A first result unit, used for mapping the first chaotic value sequence into a uniformly distributed sequence to obtain an initial sequence; A second iteration unit is used to configure a second iteration length and a second initial value of a target number of sets of master chaotic sequence generators, configure a second parameter of the master chaotic sequence generator according to the initial sequence, and iterate based on the master chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the master chaotic sequence generator is constructed based on a Chebyshev chaotic map; and the target number is obtained by adding one to the preset number of sequence sets; The second result unit is used to map the second chaotic value sequence into a uniformly distributed sequence to obtain the target number of mapping results, and obtain a pseudo-random sequence set according to the target number of mapping results.

[0015] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, any of the pseudo-random sequence set generation methods described above is implemented.

[0016] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the pseudo-random sequence set generation method as described in any one of the above is implemented.

[0017] The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method for generating a pseudo-random sequence set as described above is implemented.

[0018] The pseudo-random sequence set generation method and device provided by the present invention configure the first parameter, the first initial value and the first iteration length of a disturbance generator, and iterate based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on logistic chaotic mapping; the first chaotic value sequence is mapped to a uniformly distributed sequence to obtain an initial sequence; the second iteration length and the second initial value of the target number group of main chaotic sequence generators are configured, and the second parameter of the main chaotic sequence generator is configured according to the initial sequence, and iterates based on the main chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the main chaotic sequence generator is constructed based on Chebyshev chaotic mapping; the target number is obtained by adding one to the preset number of sequence sets; the second chaotic value sequences are respectively mapped to uniformly distributed sequences to obtain the target number of mapping results, and a pseudo-random sequence set is obtained according to the target number of mapping results. The present invention perturbs the parameters of the secondary Chebyshev chaotic map by using the primary logistic chaotic map, which can greatly extend the chaotic sequence period and fundamentally avoid the influence of the repeated occurrence of short-period rings of the pseudo-random sequence on the encryption performance. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solutions in the present invention or 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 creative work.

[0020] Figure 1 This is one of the flow charts of the pseudo-random sequence set generation method provided by the present invention.

[0021] Figure 2 This is the second flow chart of the pseudo-random sequence set generation method provided by the present invention.

[0022] Figure 3This is the third flow chart of the pseudo-random sequence set generation method provided by the present invention.

[0023] Figure 4 This is the fourth flow chart of the pseudo-random sequence set generation method provided by the present invention.

[0024] Figure 5 This is the fifth flow chart of the pseudo-random sequence set generation method provided by the present invention.

[0025] Figure 6 It is a schematic diagram of the timing of discontinuously processing data in the pseudo-random sequence set generation method provided by the present invention.

[0026] Figure 7 It is a schematic diagram of sequence set distribution of an embodiment of the pseudo-random sequence set generation method provided by the present invention.

[0027] Figure 8 It is a structural schematic diagram of the pseudo-random sequence set generating device provided by the present invention.

[0028] Fig. 9 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0029] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are 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.

[0030] The existing technology often only improves the average period of the pseudo-random sequence, but cannot completely avoid the existence of a large number of short-period loops in the chaotic process. It is necessary to design a solution to reduce the probability of the pseudo-random chaotic sequence entering the short-period loop as much as possible, and fundamentally avoid the impact of the repeated short-period loop of the pseudo-random sequence on the encryption performance. Based on this, the present invention proposes a method and device for generating a pseudo-random sequence set.

[0031] Combine the following Figure 1-Figure 7 The pseudo-random sequence set generation method of the present invention is described. Figure 1 This is one of the flow charts of pseudo-random sequence set generation provided by the present invention, such as Figure 1 As shown, the method comprises the following steps: Step 110: configure the first parameter, the first initial value and the first iteration length of the disturbance generator, and obtain a first chaotic value sequence based on the iterative operation of the disturbance generator according to the first parameter, the first initial value and the first iteration length; wherein the disturbance generator is constructed based on the logistic chaotic map.

[0032] In step 110, a set of disturbance parameter generators is set based on the logistic chaotic map.

[0033] Among them, the logistic chaotic mapping formula is: .

[0034] in, is the logistic parameter (i.e. the first parameter), When , the chaos effect is better; is the result of the last iteration, This is the result of this iteration.

[0035] Understandably, The value is stored in the register and can be configured in real time through the bus. The first initial value is also configured through the bus and the first iteration length , the length can be obtained through chaotic iteration It is understandable that if we do not set , the sequence is iterated continuously in the digital circuit.

[0036] In the specific implementation process, the specific steps of step 110 are: Step 111: The software configures the first parameter of the logistic chaos iteration through the bus And the first initial value x0.

[0037] Step 112: quantize the first initial value into a binary number and input it into the disturbance parameter generator.

[0038] Step 113: Calculate .

[0039] Step 114: Input into the multiplier for calculation and obtain the iterative result.

[0040] Step 115: Use the output result of the multiplier as the new first initial value of the disturbance parameter generator, and repeat steps 112 to 115 until the sequence length reaches the first iteration length. , thus realizing sequence value iteration and obtaining the first chaotic value sequence.

[0041] Step 120: Map the first chaotic value sequence to a uniformly distributed sequence to obtain an initial sequence.

[0042] It can be understood that the purpose of the present invention is to perturb the secondary Chebyshev chaotic map parameter k by the primary logistic chaotic map to extend the sequence period. On this basis, the first chaotic value sequence iteratively generated in step 110 cannot be directly applied to the secondary Chebyshev chaotic map parameter, and the chaotic value sequence needs to be mapped to an integer value within the required pseudo-random sequence value range.

[0043] Therefore, in step 120, the first chaotic value sequence is mapped.

[0044] It can be understood that mapping is divided into uniform mapping and non-uniform mapping. The logistic chaotic value sequence directly uses uniform mapping to obtain a sequence value with uneven distribution, which affects the encryption performance. Therefore, a non-uniform encryption method is used to map the first chaotic value sequence to a uniformly distributed initial sequence, so that the final pseudo-random sequence is also evenly distributed.

[0045] The present invention does not limit the selected non-uniform encryption method, and the method can be selected according to the situation.

[0046] In some embodiments, non-uniform cosine mapping is used for mapping. It is understandable that the cosine mapping method can balance the probability density of chaotic mapping, thereby obtaining a uniformly distributed sequence. The present invention will further explain how to obtain a uniformly distributed initial sequence using the non-uniform cosine mapping method in subsequent embodiments.

[0047] Step 130: configure a second iteration length and a second initial value of a target number group of master chaotic sequence generators, configure a second parameter of the master chaotic sequence generator according to the initial sequence, and iterate based on the master chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the master chaotic sequence generator is constructed based on a Chebyshev chaotic map; and the target number is obtained by adding one to the preset number of sequence sets.

[0048] In step 130, a target number of group master chaotic sequence generators are set based on the Chebyshev chaotic map. For the convenience of description, the target number is recorded as n+1, where n is the number of sequence sets to be generated. is an integer.

[0049] Among them, the Chebyshev chaotic mapping formula is: .

[0050] in, is the result of the last iteration, The result of this iteration is is the order (i.e. the power of the second parameter), When the power of 2 is a positive integer, the system is in a chaotic state. The value of takes the final output value of the disturbance parameter generator.

[0051] It is understood that the second initial value is configured via the bus and the second iteration length , the length can be obtained through chaotic iteration The second chaotic value sequence.

[0052] In addition, it should be pointed out that since the iterative formula contains the calculation of cosine value, it cannot be directly implemented in digital circuit. The present invention does not limit the specific implementation method. In the actual implementation process, Chebyshev chaotic iteration can be performed according to the situation. In a specific embodiment, the Cordic algorithm is used to assist the digital circuit to perform Chebyshev chaotic iteration. Specifically, the Cordic algorithm kernel is first used to calculate , and then multiply it by the order k to get , and finally use the cordic algorithm to calculate , you can get In addition, it should be pointed out that in the specific calculation process, the calculation accuracy of the cordic algorithm kernel can be configured according to the accuracy requirements. The higher the accuracy, the longer the iteration period, and the less likely the chaotic sequence is to enter a periodic loop.

[0053] It is understandable that in the existing digital circuit implementation of Chebyshev chaotic iteration, in order to simplify the calculation, the order k is usually directly set to 2, which will cause the sequence to enter the chaotic state slowly and the parameters are easy to be cracked. The embodiment of the present invention uses the Cordic algorithm to assist the digital circuit in performing Chebyshev chaotic iteration, which can realize iterative calculation of any value of k.

[0054] Based on the above embodiments, in some embodiments, the specific steps of iterating each group of main chaotic sequence generators are: Step 131: The software configures the second initial value x of the Chebyshev chaos iteration via the bus 0。

[0055] Step 132: quantize the absolute value of the second initial value and input it into the main chaotic sequence generator.

[0056] Step 133: The initial sequence output by the disturbance parameter generator after step 120 is used as the power of the second parameter k, and the iteration process is entered. It should be emphasized that the second iteration lengths of the n+1 groups of main chaotic sequence generators are the same, the second initial values ​​are different, and the second parameter is taken from the initial sequence. In the process of taking the value of the second parameter, the value can be taken from the initial sequence in order, or other methods can be used, and the present invention does not limit this.

[0057] It should be pointed out that, because the parameters of the main chaotic sequence generator do not need to change all the time, in order to save computing resources, the iteration speed of the perturbation parameter generator can be slow, and the perturbation parameter generator will iterate once after the main chaotic sequence generator iterates a circle.

[0058] Step 134: Input the quantization result into the cordic algorithm core 1 for calculation , and get the arccosine value.

[0059] Step 135: Input the calculation result of the cordic algorithm core 1 into the multiplier and multiply it by the order k to obtain .

[0060] Step 136: Input the calculation result of the multiplier into the cordic algorithm core 2 for calculation , and get the cosine quantization value.

[0061] Step 137: re-input the cosine quantization value into the cordic algorithm core 1 to implement sequence value iteration until the sequence length reaches the second iteration length , thus realizing sequence value iteration, and obtaining the second chaotic value sequence. In the process of iteratively generating (n+1) groups of pseudo-random sequences using different initial values, the cordic algorithm core can be time-division reused to save resources.

[0062] It should be noted that the length of the first iteration is independent of the length of the second iteration. The first and second are only used for distinction and do not imply a limitation on order or size.

[0063] Step 140: respectively map the second chaotic value sequences into uniformly distributed sequences to obtain the target number of mapping results, and obtain a pseudo-random sequence set according to the target number of mapping results.

[0064] In step 140, each second chaotic value sequence is first mapped.

[0065] It is understandable that mapping is divided into uniform mapping and non-uniform mapping. The sequence values ​​obtained by directly using uniform mapping of the Chebyshev chaotic value sequence are unevenly distributed, which affects the encryption performance. Therefore, a non-uniform encryption method is used to map the second chaotic value sequence to a uniformly distributed mapping result, so that the final pseudo-random sequence is also evenly distributed.

[0066] The present invention does not limit the selected non-uniform encryption method, and the method can be selected according to the situation.

[0067] In some embodiments, a non-uniform cosine mapping method is selected for mapping. It can be understood that the cosine mapping method can balance the probability density of chaotic mapping, thereby obtaining a uniformly distributed sequence. The present invention will further explain how to obtain a uniformly distributed mapping result using the non-uniform cosine mapping method in subsequent embodiments.

[0068] Afterwards, a pseudo-random sequence set is obtained according to the target number (n+1) mapping results.

[0069] It should be noted that in the process of obtaining the pseudo-random sequence set from the mapping results, multiple methods can be used to extract values ​​from n+1 mapping results to obtain n pseudo-random sequences and then obtain the pseudo-random sequence set. The present invention does not limit the method of extracting values.

[0070] In some embodiments, the chaotic value in the mapping result is used as the address, and a permutation is taken from the pre-qualified permutation result as the value segment number of each main chaotic generator. The main chaotic generator takes a value again in the (value range) segment corresponding to the value segment number, and outputs the final result of the row as the result, and repeats to obtain n rows of pseudo-random sequences, thereby obtaining a pseudo-random sequence set. The present invention will explain this value-taking method in subsequent embodiments.

[0071] The present invention perturbs the secondary Chebyshev chaotic map parameter k through the primary logistic chaotic map, thereby greatly extending the chaotic sequence period, solving the defect of short chaotic sequence period in the prior art, and can be applied to SOC encryption scenarios, including text, image, and communication encryption, and can also be applied to other fields that need to generate pseudo-random numbers, such as Bluetooth frequency hopping communication and other scenarios.

[0072] The following further describes the use of the non-uniform cosine mapping method in step 120 to obtain a uniformly distributed initial sequence. In some embodiments, mapping the first chaotic value sequence to a uniformly distributed sequence to obtain the initial sequence specifically includes: Step 121: using a cosine mapping algorithm to calculate a boundary value according to a first value interval number; wherein the first value interval number is the number of powers of the second parameter of the Chebyshev chaotic map; Step 122: Map the sequence value of the first chaotic value sequence using a binary search algorithm according to the boundary value to obtain an initial sequence.

[0073] Specifically, an embodiment of the present invention provides a chaotic value mapping method that does not affect the dynamic characteristics of the chaotic system, makes its output sequence value distribution uniform, and facilitates modifying the range of sequence values, so as to solve the problem of uneven output sequence distribution that may occur in existing chaotic mapping schemes.

[0074] The specific steps of the cosine mapping algorithm are: First, the chaotic sequence values ​​in the range of [-1, 1] obtained each time are divided into ranges. If they meet the following conditions:

[0075] but The corresponding sequence value is k. Where: The number of value intervals that are set.

[0076] It should be pointed out that in the logistic chaotic map, q is the number of powers of the parameter k in the Chebyshev that needs to be generated. If the power of k can be {1, 2, 3, 4}, then q=4.

[0077] Afterwards, in the digital circuit, the chaotic quantization value (i.e., the sequence value of the first chaotic value sequence) needs to be divided into intervals and judged. Specifically, after the software configures q, the digital circuit will calculate q+1 boundary values ​​in sequence and store them in RAM. According to the boundary values ​​calculated in advance, the sequence value of the first chaotic value sequence is judged by binary search method, and the judgment result is output to obtain a set of pseudo-random sequences with values ​​of [0,q-1], which are recorded as the initial sequence.

[0078] In addition, in order to save computing time, since the logistic iteration interval is relatively long, in some embodiments, a delay period is used to perform a binary search mapping.

[0079] The embodiment of the present invention uses a cosine mapping method in the process of mapping chaotic values ​​to sequence values, so that the chaotic output sequence values ​​are evenly distributed and the range of sequence values ​​can be easily modified, and the mapping process can be quickly implemented in a digital circuit.

[0080] Further, based on the above embodiment, in order to completely avoid the repetition of the period segment for a long time, the pseudo-random sequence is checked and corrected in real time during the pseudo-random sequence generation process, and this step may occur after step 120. That is, the first chaotic value sequence is mapped to a uniformly distributed sequence to obtain an initial sequence, and then the following steps are further included: Step 151: performing decontinuation processing on the continuous values ​​of the initial sequence to obtain a first sequence; Step 152: performing a periodic self-check on the first sequence, and updating the first initial value according to the self-check result; Step 153: re-iterate based on the disturbance generator according to the first parameter, the updated first initial value and the first iteration length.

[0081] Specifically, the obtained sequence may have continuous values, which results in no change in the parameters of the subsequent main chaotic sequence generator, which may affect the long-period performance of the final generated sequence set.

[0082] Therefore, the continuous values ​​of the initial sequence are decontinuously processed. The present invention does not specifically limit the method used for the decontinuous processing. In the specific implementation process, the decontinuous processing method can be selected according to the actual situation.

[0083] In some embodiments, the ring method is used to decontinuously process the continuous values. The ring method can process the continuous values ​​without destroying the correlation of the chaotic sequence. The specific steps include: using the ring method to judge all adjacent sequence values ​​in turn, if the current sequence value is repeated with the previous sequence value, then add 1 to the current sequence value and all subsequent sequence values, and then judge the next sequence value. After the first iteration length After iterative judgment, the first sequence after de-continuous processing can be obtained.

[0084] It should be pointed out that in digital circuits, the sequence is generated in real time, and the complete sequence cannot be obtained in advance, so the hardware implementation of the ring method needs to be improved. Assuming that the chaotic sequence value register is xn, first beat the sequence value register, the register is xn_delay1, and determine whether the two values ​​of xn and xn_delay1 are equal under the current clock. If they are equal, add 1 to the value of the accumulated value register added_reg. The current original sequence value xn plus the value of the accumulated value register added_reg is used as the current sequence value and finally output yn. If the original sequence appears multiple times in succession, the accumulated value register will be accumulated multiple times, but the value of the register will not increase infinitely. This is precisely because the sequence value is a finite value, so when the value of the accumulated value register exceeds the sequence value range, you can first take the modulus and then add.

[0085] After the deserialization process is completed, each row of the obtained first sequence is periodically self-checked, and the first initial value is updated according to the self-check result. The present invention does not specifically limit the method used for the periodic self-check, and in the specific implementation process, the periodic self-check method can be selected according to the actual situation.

[0086] After the self-check is completed, step 110 to step 120 are re-executed according to the updated first initial value.

[0087] In some embodiments, the following steps are used to perform a periodic self-check: Set the sampling length check_length, the number of samples checked within the cycle check_number and the guarantee cycle circle as needed. First, sample the sequence regularly according to the sampling length and save the sampled sequence into a register. Sampling frequency = guarantee cycle / number of samples checked within the cycle. Then, shift and register the subsequent input and compare it with the sampling sequence. If they are consistent, it is considered that a cycle repetition occurs within the circle data. At this time, a chaos generator initial value change pulse signal is generated, and the chaos generator changes the first initial value, thereby jumping to step 110 and iterating using the new first initial value.

[0088] In addition, even if there is no repetition in the circle data, the initial value of the chaotic iteration generator is changed once at the beginning of each circle. The above method can ensure that there is no periodic loop with a length greater than circle / check_number in the circle, and there will be no periodic repetition between different circles.

[0089] It can be understood that a short period sequence with a period less than circle / check_number is bound to exist and cannot be eliminated, and has no effect on the performance, such as the sequence {1, 2, 1, 2, 3, 6, 7...}, where {1, 2} has two short periods. This situation has no effect on the sequence performance, and the present invention does not pay attention to this.

[0090] The following further describes the uniformly distributed mapping result obtained by using the non-uniform cosine mapping method in step 140. In some embodiments, the second chaotic value sequence is mapped into a uniformly distributed sequence to obtain the target number of mapping results, specifically including: Step 141: setting the value interval number of the first group of main chaotic sequence generators to a first number, and setting the value interval number of the remaining main chaotic sequence generators to a second number; wherein the first number is the factorial of the number of preset sequence sets; Step 142: using a cosine mapping algorithm to calculate respective boundary values ​​according to the value interval number of the main chaotic sequence generator; Step 143: Map the sequence values ​​of the second chaotic value sequence using a binary search algorithm according to the boundary values ​​to obtain the target number of mapping results.

[0091] Specifically, in step 141, the second chaotic value sequence outputted in step 130 is used as the chaotic value sequence to be mapped, and the q of one group of the (n+1) groups of main chaotic sequence generators is set to n!, and the q of the other n groups is set to the second number m. The second number is the number of integers in each value range in the value range set. It should be emphasized that, in the process of setting, one group is selected from the (n+1) groups of main chaotic sequence generators, and the q of the selected main chaotic sequence generator is set to n!.

[0092] In addition, in order to save computing time, since there is a delay in the output of the cordic algorithm kernel and the logistic iteration interval is relatively long, in some embodiments, a binary search mapping is performed using the delay period.

[0093] In step 143, the specific mapping steps refer to step 122, which will not be described in detail in the present invention.

[0094] Further, based on the above embodiment, in order to completely avoid the repetition of the period segment for a long time, the pseudo-random sequence is checked and corrected in real time during the pseudo-random sequence generation process, and this step can occur after the mapping result is obtained in step 140. That is, the second chaotic value sequence is mapped to a uniformly distributed sequence, and the target number of mapping results is obtained, and then the following is also included: Step 161: performing periodic self-check on the mapping result, and updating the second initial value according to the self-check result; Step 162: re-iterate based on the main chaotic sequence generator according to the second iteration length, the updated second initial value and the second parameter.

[0095] Specifically, the method for performing periodic self-checking on the second chaotic value sequence is the same as the method for performing periodic self-checking on the first chaotic value sequence, and the present invention will not elaborate on this.

[0096] The following specifically describes how to obtain n pseudo-random sequences and then obtain a pseudo-random sequence set by taking values ​​from n+1 mapping results in step 140. In some embodiments, obtaining a pseudo-random sequence set according to the target number of mapping results specifically includes: S1: let i=1; S2: using the i-th chaotic value in the mapping result of the first group of main chaotic sequence generators as an address, taking out a possible arrangement from the pre-stored arrangement results as the value segment number of the target number of main chaotic generators; S3: Selecting a value range whose segment number is the value segment number from a pre-constructed value range set as a target value range; S4: taking the chaotic values ​​of the remaining main chaotic sequence generators as serial numbers, selecting an integer corresponding to the serial number from a preset value range set as a value result, and obtaining the i-th column of data; S5: Let i=i+1, and repeat steps S2-S5 until the length of each row of pseudo-random number sequence reaches a preset sequence length, thereby obtaining a pseudo-random sequence set.

[0097] Specifically, when the existing chaotic mapping scheme generates multiple pseudo-random sequences, there are a small number of sequence value collisions between the pseudo-random sequences, that is, the data in the same column (at the same time) of the pseudo-random sequence set collides, which will affect the performance of the pseudo-random sequence set in certain scenarios (such as Bluetooth frequency hopping communication). In order to solve this problem, an embodiment of the present invention provides a scheme for generating a set of pseudo-random sequences without column collision, that is, orthogonal.

[0098] Specifically, based on the set of permutation results and value ranges, the first group of chaos generators is used to select a full permutation result, with the aim of selecting a value interval segment number for the current values ​​of different column sequences. The other n groups of sequence generators then select specific values ​​from their respective selected segment numbers.

[0099] In actual operation, suppose that the current output result of the first group of chaos generators corresponds to the arrangement in RAM as {k0, k2, k1···}, and the output sequence of the first group in the n groups is {h1, h0, h2}, then the h1th value of the k0th segment is selected as the pseudo-random number of the first row of the sequence set, and the same applies to the remaining rows.

[0100] The embodiment of the present invention pre-divides the sequence value interval, applies independent chaotic sequences to different rows in the sequence set, and performs secondary selection within the value interval to obtain the final pseudo-random sequence set. The method of ensuring that the sequence values ​​of the same column in the sequence set are taken from different intervals completely avoids collisions between different sequences and realizes the orthogonality of pseudo-random sequences. This method makes the value probability of each element in the sequence set evenly distributed in the entire value interval.

[0101] Based on the above embodiment, the steps of constructing the arrangement result and the value range set include: Step 171: Divide the preset random number value range by the preset number of sequence sets to obtain the preset number of value ranges, number the value ranges to obtain segment numbers, and obtain a value range set according to the preset number of value ranges of the sequence sets marked with the segment numbers; Step 172: number the values ​​in the value range corresponding to each segment number, and arrange the segment numbers to obtain an arrangement result.

[0102] Specifically, let the pseudo-random number range be [0, mn-1], the number of sequence sets to be generated be n, and the data range be divided into n corresponding segments, each with m values. The segments are numbered [0, n-1] in sequence, and the n value ranges marked with segment numbers constitute the value range set. The integers in each value range are numbered in order.

[0103] The segment numbers are fully arranged using the dictionary method, and n! arrangement results are stored in RAM, with different addresses in RAM corresponding to one arrangement result.

[0104] Further, in order to explain the present invention in more detail, a specific example is given. Figure 2 As shown, it includes a register configuration module, a disturbance parameter generator module, a cosine mapping module, a decontinuous processing module, a main chaos generator module, a periodic self-checking module, a full arrangement recording and generating module, and a sequence set mapping module.

[0105] The register configuration module is directly connected to the APB bus and is used to store the chaos initial value, logistic chaos equation parameter μ, sampling length check_length, number of samples checked within the cycle check_number, guarantee cycle circle, and iteration cycle configured by the software. , the number of sequence sets, and the number of sequence values. The main chaos generator module is as follows: Figure 3 As shown in the figure, it mainly implements Chebyshev chaotic iterative calculation. The cosine mapping module is as follows Figure 4 As shown in the figure, it includes a boundary value calculation module, a boundary value recording module and a binary search module. In the boundary value calculation module, according to the configured q value, the cordic module is used to calculate q+1 boundary values, which are stored in the RAM of the boundary value recording module in order. After that, the input chaotic value is compared by binary search, and the mapping result is output according to the interval. The full permutation calculation and recording module is shown in the figure. Figure 5 As shown in the figure, the segment numbers of the sequence value range are fully arranged according to the dictionary method and stored in RAM in order. Then, the input chaotic value is used as the address to take out a possible arrangement as the value segment number of each main chaotic generator. The main chaotic generator takes the value again in the corresponding segment and outputs the final result of the row.

[0106] For example, in this embodiment, the sequence values ​​to be generated are integers of [0, 19], with a length of 100,000, and 4 groups of orthogonal sequences are generated.

[0107] According to steps 171-172, the interval [0,19] is divided into 4 segments, namely [0,4], [5,9], [10,14], [15,19], and the range numbers are 0 to 3. The full permutation results calculated by the dictionary method are: {0,1,2,3}, {0,1,3,2}, {0,3,1,2}, {0,3,2,1}..., a total of 24 permutation results are recorded in RAM in sequence.

[0108] According to step 110, the software configures the initial value x0=0.312, μ=4 of the disturbance parameter generator. After the initial value is quantized to 32 bits, it is configured to the disturbance parameter generator through the bus and iterated to obtain a 32-bit numerical sequence (i.e., the first chaotic value sequence).

[0109] According to step 120, the number of powers of the parameter k in the Chebyshev to be generated is set to 4, and the value is in the set {1, 2, 3, 4}, so q=4 is taken when mapping here, and the cosine mapping module is input. The cosine mapping module uses the cordic algorithm core to calculate all boundary values, and the boundary values ​​are stored in RAM in order of size. The above 32-bit value sequence is output to the binary search module, and each 32-bit sequence value is judged and mapped in turn to: {2, 1, 1, 3, 2, 0, 2, 2...} to obtain the initial sequence.

[0110] According to step 151, the de-continuation process is performed to obtain: {2, 1, 2, 0, 3, 1, 3, 0...}. The de-continuation process is as follows: Figure 6 shown.

[0111] According to steps 152-153, the sampling length check_length is set to 5, the number of samples checked in the cycle check_number is set to 5, and the guarantee cycle circle is set to 100, which can ensure that there is no periodic ring with a length greater than 20. Since the first value is 2, the parameter k of the main chaotic sequence generator is 3 in the first circle of the main chaotic sequence generator. It should be emphasized that the corresponding relationship between the sequence value and k is: sequence value + 1 = k. This is because the value of k 1. Sequence value 0, the 0 in the sequence value corresponds to k taking 1.

[0112] According to step 130, 5 groups of main chaotic sequence generators are set, the q of the first group is 24, and the q of the other 4 groups is 5. Different initial values ​​are set for the 5 groups of main chaotic sequence generators. After the uniform mapping of step 140 and the periodic self-check of steps 161-162, the first group of main chaotic sequence generators obtains the sequence: {3, 0, 17, 12, 5, 8···}, where the first value 3 corresponds to the arrangement result in RAM of {0, 3, 2, 1}, so the value of the 1st row and 1st column of the sequence set is taken from interval 0, and the value of the 2nd row and 1st column is taken from interval 3; the second group of main chaotic sequence generators obtains: {1, 3, 3, 0, 4, 2···}, where the first value 1 corresponds to the value corresponding to number 1 in interval 0, that is, 1, so the result of the 1st row and 1st column in the sequence set is 1. The third group of main chaotic sequence generators obtains: {2, 3, 4, 2, 1, 3...}, where the first value 2 corresponds to the value corresponding to number 2 in interval 3, that is, 17, so the result of the 2nd row and 1st column in the sequence set is 17. Follow this step according to the results of the fourth and fifth groups of chaotic sequences to all the data in the first column. The sequence of the second column is obtained according to the second chaotic value of the five groups of sequences. If the periodic self-check detects a periodic ring, the corresponding chaotic sequence generator updates the initial value once, otherwise the initial value is updated once for each circle. If not necessary, the initial value can be updated by adding a smaller fixed value. Repeat the above steps to obtain the second and third columns. If the periodic self-check fails halfway or the sequence length count reaches the circle, replace the initial values ​​of all chaotic generators and clear the counter. Repeat this process to obtain the entire sequence set of the 100,000th column, such as Figure 7 As shown in the figure, it can be seen that there is no collision between the 4 rows of sequence values, and the sequence value distribution is random, with no periodic repetition within the length of 100,000.

[0113] The pseudo-random sequence set generation method provided by the present invention configures the first parameter, the first initial value and the first iteration length of a disturbance generator, and iterates based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on logistic chaotic mapping; the first chaotic value sequence is mapped to a uniformly distributed sequence to obtain an initial sequence; the second iteration length and the second initial value of a target number of master chaotic sequence generators are configured, and the second parameter of the master chaotic sequence generator is configured according to the initial sequence, and iterates based on the master chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the master chaotic sequence generator is constructed based on Chebyshev chaotic mapping; the target number is obtained by adding one to the preset number of sequence sets; the second chaotic value sequences are respectively mapped to uniformly distributed sequences to obtain the target number of mapping results, and a pseudo-random sequence set is obtained according to the target number of mapping results. The present invention perturbs the parameters of the secondary Chebyshev chaotic map by using the primary logistic chaotic map, which can greatly extend the chaotic sequence period and fundamentally avoid the influence of the repeated occurrence of short-period rings of the pseudo-random sequence on the encryption performance.

[0114] The pseudo-random sequence set generation device provided by the present invention is described below. The pseudo-random sequence set generation device described below and the pseudo-random sequence set generation method described above can be referred to each other. Figure 8 As shown, the device includes the following modules: A first iteration unit 810 is used to configure a first parameter, a first initial value and a first iteration length of a disturbance generator, and iterate according to the first parameter, the first initial value and the first iteration length based on the disturbance generator to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on a logistic chaotic map; A first result unit 820 is used to map the first chaotic value sequence into a uniformly distributed sequence to obtain an initial sequence; The second iteration unit 830 is used to configure the second iteration length and the second initial value of the target number group master chaotic sequence generator, configure the second parameter of the master chaotic sequence generator according to the initial sequence, and iterate based on the master chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the master chaotic sequence generator is constructed based on the Chebyshev chaotic map; the target number is obtained by adding one to the preset number of sequence sets; The second result unit 840 is used to map the second chaotic value sequence into a uniformly distributed sequence respectively to obtain the target number of mapping results, and obtain a pseudo-random sequence set according to the target number of mapping results.

[0115] According to a pseudo-random sequence set generation device provided by the present invention, mapping the first chaotic value sequence into a uniformly distributed sequence to obtain an initial sequence specifically includes: The boundary value is calculated according to the first value interval number by using the cosine mapping algorithm; wherein the first value interval number is the number of powers of the second parameter of the Chebyshev chaotic map; The sequence value of the first chaotic value sequence is mapped using a binary search algorithm according to the boundary value to obtain an initial sequence.

[0116] According to a pseudo-random sequence set generation device provided by the present invention, the first chaotic value sequence is mapped into a uniformly distributed sequence to obtain an initial sequence, and then further includes: De-continuing the continuous values ​​of the initial sequence to obtain a first sequence; Performing a periodic self-check on the first sequence, and updating the first initial value according to the self-check result; Re-iteration is performed based on the disturbance generator according to the first parameter, the updated first initial value and the first iteration length.

[0117] According to a pseudo-random sequence set generation device provided by the present invention, the second chaotic value sequence is mapped into a uniformly distributed sequence to obtain the target number of mapping results, specifically including: The number of value intervals of the first group of main chaotic sequence generators is set to a first number, and the number of value intervals of the remaining main chaotic sequence generators is set to a second number; wherein the first number is the factorial of the number of preset sequence sets; Using the cosine mapping algorithm, the respective boundary values ​​are calculated according to the value interval number of the main chaotic sequence generator; The sequence values ​​of the second chaotic value sequence are mapped using a binary search algorithm according to the boundary values ​​to obtain the target number of mapping results.

[0118] According to a pseudo-random sequence set generation device provided by the present invention, a pseudo-random sequence set is obtained according to the target number of mapping results, specifically comprising: S1: let i=1; S2: using the i-th chaotic value in the mapping result of the first group of main chaotic sequence generators as an address, taking out a possible arrangement from the pre-stored arrangement results as the value segment number of the target number of main chaotic generators; S3: Selecting a value range whose segment number is the value segment number from a pre-constructed value range set as a target value range; S4: taking the chaotic values ​​of the remaining main chaotic sequence generators as serial numbers, selecting an integer corresponding to the serial number from a preset value range set as a value result, and obtaining the i-th column of data; S5: Let i=i+1, and repeat steps S2-S5 until the length of each row of pseudo-random number sequence reaches a preset sequence length, thereby obtaining a pseudo-random sequence set.

[0119] According to a pseudo-random sequence set generating device provided by the present invention, the steps of constructing the arrangement result and the value range set include: Dividing the preset random number value range by the preset number of sequence sets to obtain the preset number of value ranges of the sequence sets, numbering the value ranges to obtain segment numbers, and obtaining a value range set according to the preset number of value ranges of the sequence sets marked with the segment numbers; The values ​​of the value range corresponding to each segment number are numbered, and the segment numbers are fully arranged to obtain an arrangement result.

[0120] According to a pseudo-random sequence set generation device provided by the present invention, the second chaotic value sequence is mapped into a uniformly distributed sequence to obtain the target number of mapping results, and then further includes: Performing periodic self-check on the mapping result, and updating the second initial value according to the self-check result; Re-iteration is performed based on the main chaotic sequence generator according to the second iteration length, the updated second initial value and the second parameter.

[0121] The pseudo-random sequence set generating device provided by the present invention configures the first parameter, the first initial value and the first iteration length of the disturbance generator, and iterates based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on the logistic chaotic map; the first chaotic value sequence is mapped to a uniformly distributed sequence to obtain an initial sequence; the second iteration length and the second initial value of the target number group of main chaotic sequence generators are configured, the second parameter of the main chaotic sequence generator is configured according to the initial sequence, and iterates based on the main chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the main chaotic sequence generator is constructed based on the Chebyshev chaotic map; the target number is obtained by adding one to the preset sequence set number; the second chaotic value sequence is respectively mapped to a uniformly distributed sequence to obtain the target number of mapping results, and a pseudo-random sequence set is obtained according to the target number of mapping results. The present invention perturbs the parameters of the secondary Chebyshev chaotic map by using the primary logistic chaotic map, which can greatly extend the chaotic sequence period and fundamentally avoid the influence of the repeated occurrence of short-period rings of the pseudo-random sequence on the encryption performance.

[0122] Fig. 9 An example of a physical structure diagram of an electronic device is shown in FIG. Fig. 9As shown, the electronic device may include: a processor (processor) 910, a communication interface (Communications Interface) 920, a memory (memory) 930 and a communication bus 940, wherein the processor 910, the communication interface 920, and the memory 930 communicate with each other through the communication bus 940. The processor 910 can call the logic instructions in the memory 930 to execute a pseudo-random sequence set generation method, which includes: configuring a first parameter, a first initial value and a first iteration length of a disturbance generator, iterating based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on a logistic chaotic map; mapping the first chaotic value sequence to a uniformly distributed sequence to obtain an initial sequence; configuring a second iteration length and a second initial value of a target number of master chaotic sequence generators, configuring the second parameter of the master chaotic sequence generator according to the initial sequence, and iterating based on the master chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the master chaotic sequence generator is constructed based on a Chebyshev chaotic map; the target number is obtained by adding one to the preset number of sequence sets; mapping the second chaotic value sequences to uniformly distributed sequences to obtain the target number of mapping results, and obtaining a pseudo-random sequence set according to the target number of mapping results.

[0123] In addition, the logic instructions in the above-mentioned memory 930 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0124] On the other hand, the present invention also provides a computer program product, which includes a computer program. The computer program can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the pseudo-random sequence set generation method provided by the above methods, the method including: configuring a first parameter, a first initial value and a first iteration length of a disturbance generator, iterating based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on a logistic chaotic map; mapping the first chaotic value sequence into a uniformly distributed sequence, Obtain an initial sequence; configure a second iteration length and a second initial value of a target number group of main chaotic sequence generators, configure the second parameter of the main chaotic sequence generator according to the initial sequence, iterate based on the main chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter, and obtain a target number of second chaotic value sequences; wherein the main chaotic sequence generator is constructed based on Chebyshev chaotic mapping; the target number is obtained by adding one to the preset number of sequence sets; respectively map the second chaotic value sequences into uniformly distributed sequences to obtain the target number of mapping results, and obtain a pseudo-random sequence set according to the target number of mapping results.

[0125] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to execute the pseudo-random sequence set generation method provided by the above-mentioned methods, the method comprising: configuring a first parameter, a first initial value and a first iteration length of a disturbance generator, iterating based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on a logistic chaotic map; mapping the first chaotic value sequence to a uniformly distributed sequence to obtain an initial sequence; configuring a target number group The second iteration length and the second initial value of the main chaotic sequence generator, the second parameter of the main chaotic sequence generator is configured according to the initial sequence, and the main chaotic sequence generator is iterated according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the main chaotic sequence generator is constructed based on the Chebyshev chaotic map; the target number is obtained by adding one to the preset number of sequence sets; the second chaotic value sequences are respectively mapped into uniformly distributed sequences to obtain the target number of mapping results, and a pseudo-random sequence set is obtained according to the target number of mapping results.

[0126] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0127] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0128] 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 aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for generating a pseudo-random sequence set, characterized in that: include: Configure a first parameter, a first initial value and a first iteration length of a disturbance generator, and iterate based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on a logistic chaotic map; Mapping the first chaotic value sequence into a uniformly distributed sequence to obtain an initial sequence; The second iteration length and the second initial value of the target number group master chaotic sequence generator are configured, the second parameter of the master chaotic sequence generator is configured according to the initial sequence, and the master chaotic sequence generator is iterated according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the master chaotic sequence generator is constructed based on the Chebyshev chaotic map; the target number is obtained by adding one to the preset number of sequence sets; The second chaotic value sequences are respectively mapped into uniformly distributed sequences to obtain the target number of mapping results, and a pseudo-random sequence set is obtained according to the target number of mapping results.

2. The method for generating a pseudo-random sequence set according to claim 1, characterized in that: Mapping the first chaotic value sequence to a uniformly distributed sequence to obtain an initial sequence specifically includes: The boundary value is calculated according to the first value interval number by using the cosine mapping algorithm; wherein the first value interval number is the number of powers of the second parameter of the Chebyshev chaotic map; The sequence value of the first chaotic value sequence is mapped using a binary search algorithm according to the boundary value to obtain an initial sequence.

3. The method for generating a pseudo-random sequence set according to claim 1, characterized in that: The first chaotic value sequence is mapped into a uniformly distributed sequence to obtain an initial sequence, and then the method further includes: De-continuing the continuous values ​​of the initial sequence to obtain a first sequence; Performing a periodic self-check on the first sequence, and updating the first initial value according to the self-check result; Re-iteration is performed based on the disturbance generator according to the first parameter, the updated first initial value and the first iteration length.

4. The method for generating a pseudo-random sequence set according to claim 1, characterized in that: Mapping the second chaotic value sequence into a uniformly distributed sequence respectively to obtain the target number of mapping results specifically includes: The number of value intervals of the first group of main chaotic sequence generators is set to a first number, and the number of value intervals of the remaining main chaotic sequence generators is set to a second number; wherein the first number is the factorial of the number of preset sequence sets; Using the cosine mapping algorithm, the respective boundary values ​​are calculated according to the value interval number of the main chaotic sequence generator; The sequence values ​​of the second chaotic value sequence are mapped using a binary search algorithm according to the boundary values ​​to obtain the target number of mapping results.

5. The method for generating a pseudo-random sequence set according to claim 1, characterized in that: A pseudo-random sequence set is obtained according to the target number of mapping results, specifically including: S1: let i=1; S2: using the i-th chaotic value in the mapping result of the first group of main chaotic sequence generators as an address, taking out a possible arrangement from the pre-stored arrangement results as the value segment number of the target number of main chaotic generators; S3: Selecting a value range whose segment number is the value segment number from a pre-constructed value range set as a target value range; S4: taking the chaotic values ​​of the remaining main chaotic sequence generators as serial numbers, selecting an integer corresponding to the serial number from a preset value range set as a value result, and obtaining the i-th column of data; S5: Let i=i+1, and repeat steps S2-S5 until the length of each row of pseudo-random number sequence reaches a preset sequence length, thereby obtaining a pseudo-random sequence set.

6. The method for generating a pseudo-random sequence set according to claim 5, characterized in that: The steps of constructing the arrangement result and the value range set include: Dividing the preset random number value range by the preset number of sequence sets to obtain the preset number of value ranges of the sequence sets, numbering the value ranges to obtain segment numbers, and obtaining a value range set according to the preset number of value ranges of the sequence sets marked with the segment numbers; The values ​​in the value range corresponding to each segment number are numbered, and the segment numbers are fully arranged to obtain an arrangement result.

7. The method for generating a pseudo-random sequence set according to claim 1, characterized in that: The second chaotic value sequence is mapped into a uniformly distributed sequence respectively to obtain the target number of mapping results, and then further includes: Performing periodic self-check on the mapping result, and updating the second initial value according to the self-check result; Re-iteration is performed based on the main chaotic sequence generator according to the second iteration length, the updated second initial value and the second parameter.

8. A pseudo-random sequence set generating device, characterized in that: include: A first iteration unit, configured to configure a first parameter, a first initial value and a first iteration length of a disturbance generator, and iterate based on the disturbance generator according to the first parameter, the first initial value and the first iteration length to obtain a first chaotic value sequence; wherein the disturbance generator is constructed based on a logistic chaotic map; A first result unit, used for mapping the first chaotic value sequence into a uniformly distributed sequence to obtain an initial sequence; A second iteration unit is used to configure a second iteration length and a second initial value of a target number of sets of master chaotic sequence generators, configure a second parameter of the master chaotic sequence generator according to the initial sequence, and iterate based on the master chaotic sequence generator according to the corresponding second iteration length, the second initial value and the second parameter to obtain a target number of second chaotic value sequences; wherein the master chaotic sequence generator is constructed based on a Chebyshev chaotic map; and the target number is obtained by adding one to the preset number of sequence sets; The second result unit is used to map the second chaotic value sequence into a uniformly distributed sequence to obtain the target number of mapping results, and obtain a pseudo-random sequence set according to the target number of mapping results.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the method for generating a pseudo-random sequence set according to any one of claims 1 to 7 is implemented.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for generating a pseudo-random sequence set according to any one of claims 1 to 7 is implemented.

Images