Prime number IP address security double factor dynamic short key generation and evaluation control method

Abstract

The application provides a prime number IP address security double-factor dynamic short key generation and evaluation control method, belongs to the technical field of key generation and evaluation control processing, and relies on a full prime number resource platform to quickly generate double-factor dynamic short keys suitable for IP address security, solves the problems of low key generation efficiency and insufficient security, realizes diversified supply (single, section, prime number pair form) of the keys, meets the multi-scene requirements of IP address encryption, establishes a scientific key evaluation control mechanism to guarantee the security, stability and adaptability of the keys, gets rid of the dependence on foreign random number generators, forms a new encryption technical scheme, and improves the IP address security protection capability.

Description

Technical Field

[0001] This invention belongs to the field of key generation and evaluation processing technology, specifically relating to a method for generating and evaluating a two-factor dynamic short key for the security of prime IP addresses. Background Technology

[0002] Currently, over 80% of encryption algorithms on the market rely on the RSA algorithm, and mainstream encryption technologies such as elliptic cryptography also use prime numbers as their core "raw material." The security and availability of prime numbers directly determine the stability of the encryption system.

[0003] In the field of IP address security, traditional static key mechanisms are easily cracked. While dynamic key technology has been applied to some extent, it faces challenges such as low key generation efficiency, insufficient security, and poor compatibility with IP addresses. Furthermore, existing key generation technologies are mostly limited to providing a single key, making it difficult to achieve diversified supply such as segment provision or prime pair provision. Moreover, there is a lack of dedicated two-factor dynamic short key generation schemes specifically for IP address security, failing to form a "macro-controllable, micro-secure" encryption system, which severely restricts the improvement of network information security protection capabilities.

[0004] Based on the core characteristics of prime numbers, such as their uniqueness and infinity, and with the technical support of a full prime number resource platform, we have developed a two-factor dynamic short key generation and evaluation method adapted to IP address security. This method can effectively solve the defects of existing technologies and build an independent, controllable, and highly secure encryption protection system, which has significant technical value and application prospects. Summary of the Invention

[0005] To address the shortcomings of existing technologies, this invention provides a method for generating and evaluating a two-factor dynamic short key for prime IP address security, achieving the following objectives:

[0006] 1. Relying on the all-prime number resource platform, quickly generate two-factor dynamic short keys that are compatible with IP address security, solving the problems of low key generation efficiency and insufficient security;

[0007] 2. Enable diversified key supply (single, segment, prime pair) to meet the needs of multiple IP address encryption scenarios;

[0008] 3. Establish a scientific key evaluation and control mechanism to ensure the security, stability, and compatibility of keys;

[0009] 4. Eliminate reliance on random number generators, form new encryption technology solutions, and improve IP address security protection capabilities.

[0010] The present invention employs the following technical solution.

[0011] A method for generating and evaluating a two-factor dynamic short key for prime IP address security, comprising:

[0012] Step 1: Generate a two-factor dynamic short key based on the target IP address;

[0013] Step 2: The generation and evaluation software system performs security evaluation on the generated two-factor dynamic short key;

[0014] Step 3: The generation and evaluation software system performs adaptation evaluation on the generated two-factor dynamic short key;

[0015] Step 4: The generation and evaluation software system performs stability evaluation on the generated two-factor dynamic short key;

[0016] Step 5: The generation and evaluation software system processes the generated two-factor dynamic short key based on the evaluation results.

[0017] Preferably, step 1 specifically includes:

[0018] Step 1-1: Extract the prime fundamental factors that serve as factor one;

[0019] Step 1-2: Extract the dynamic factors of IP features as factor two;

[0020] Steps 1-3: Based on the fundamental set of prime numbers With dynamic eigenvalues Generate a dynamic short key.

[0021] Preferably, step 1-1 specifically includes:

[0022] Step 1-1-1: The network device collects the target IP address ABCD in real time; at the same time, it collects the usage duration of the IP address. Network connection strength Data transmission frequency And the target IP address ABCD and the duration of use of the target IP address. Network connection strength Data transmission frequency Transmit to 10 15 A software system for generating and evaluating all prime numbers, where A, B, C, and D are integers from 0 to 255;

[0023] Step 1-1-2: Generate and evaluate the software system to perform prime number family segmentation storage;

[0024] Step 1-1-3: The generation and evaluation software system performs binary conversion on the target IP address ABCD;

[0025] Step 1-1-4: The generation and evaluation software system calculates the binary number after binary conversion using a mapping function;

[0026] Step 1-1-5: The generation and evaluation software system efficiently retrieves the prime number family segment based on the ID of the prime number family segment obtained by the mapping function;

[0027] Step 1-1-6: Randomly select from the retrieved prime number family segment The prime numbers are the fundamental set of prime numbers. ,in For the randomly selected number A prime number, .

[0028] Preferably, in step 1-1-1, the usage duration of the target IP address is collected. The methods include:

[0029] Network devices capture connection establishment and connection termination packets sent by the target device to which the target IP address belongs through protocol stack hook functions;

[0030] Establish a dedicated session record for the target IP. When a connection establishment packet is captured, record this time as the start time T_start. When a disconnection packet is captured, mark the connection as ended and reset T_start to 0. When a connection establishment packet is captured again, record this time as the start time T_start again.

[0031] After collecting the target IP addresses ABCD in real time, the current system time T_current is collected to determine the usage duration. =(T_current-T_start) / 3600.

[0032] Preferably, in step 1-1-1, the network connection strength of the target IP address is collected. The methods include:

[0033] Assuming a wired connection exists between the target device (within the range of the target IP address) and the network device, the target device first obtains the actual negotiated speed of the network interface card (NIC) corresponding to the target IP address via the relevant API, and standardizes it into Indicator 1. = Actual negotiated speed of network card / Maximum supported speed of network card. Calculate the bit error rate using the link error statistics document of the target device. =1 - (number of erroneous frames / total number of received frames), packet loss rate obtained through the PRTG Network Monitor software on the target device. This allows for the calculation of network connection strength under the condition that there is a wired connection between the target device (within the target IP address) and the network device. =0.4× +0.3× +0.3× The target device will Transmitted to network devices;

[0034] Assuming a wireless connection exists between the target device (within the specified IP address) and the network device, the target device first obtains the RSSI (Signal Strength Index) corresponding to the target device with the specified IP address via the appropriate API, and then standardizes it as index two. =(RSSI-RSSI_min) / (RSSI_max-RSSI_min), the signal-to-noise ratio of the target device to which the target IP address belongs is obtained using the inSSIDer tool of the target device. The retransmission rate of the target device corresponding to the target IP address is obtained through the PathSolutions TotalView software of the target device. This allows for the calculation of network connection strength under the condition that there is a wireless connection between the target device (within the target IP address) and the network device. =0.5× +0.3× +0.2× The target device will Transmitted to network devices.

[0035] Preferably, in step 1-1-1, the data transmission frequency of the IP address is collected. The methods include:

[0036] The transmission frequency is calculated by counting the number of data packets sent (F_send) and received (F_recv) by the target device to which the target IP address belongs within the previous 30 seconds. =(F_send+F_recv) / 30, then the target device will Transmitted to network devices.

[0037] Preferably, step 1-1-2 specifically includes:

[0038] The generation and evaluation software system is based on 10 15 The All Prime Number Resource Platform already has 10 15 All prime numbers, generated using a predefined derivation algorithm, are 10. 20 -10 30 Prime numbers within the range, and categorize 10 according to their numerical intervals. 20 -10 30 The prime numbers within the range are divided into prime number groups, that is, the 10 prime numbers arranged in ascending order. 20 -10 30 The prime numbers within the range are equally divided into Each section ,in For the first A prime number family segment, For the first The initial prime number of a prime family segment. For the first The final prime number of each prime family segment, with ≥1000 prime numbers stored in each segment;

[0039] Assign a unique identifier (ID) to each segment.

[0040] Preferably, step 1-1-3 specifically includes:

[0041] Convert the values ​​of A, B, C, and D in the target IP address ABCD into 8-bit binary numbers for A, B, C, and D respectively. Then concatenate these 8-bit binary numbers sequentially to form four 8-bit binary numbers, resulting in a 32-bit binary number. .

[0042] Preferably, step 1-1-4 specifically includes:

[0043] The mapping function is: ,in 10 15 The number of prime number families in the all-prime number resource platform. =1,2,...,32, for Divide by The function for finding the remainder This is the ID of the corresponding prime number family segment.

[0044] Preferably, step 1-1-5 specifically includes:

[0045] In 10 15 Extracted from the All Prime Numbers Resource Platform The corresponding prime number family segment, That is, the ID of the prime number family segment obtained based on the mapping function.

[0046] Preferably, steps 1-2 specifically include:

[0047] Based on the dynamic characteristic parameters of the target IP address, the dynamic characteristic parameters are normalized to obtain a standardized feature vector. ,in ,in The preset maximum usage time threshold, , ,in The preset maximum transmission frequency threshold is used by the feature fusion function. ,in , , The set weighting coefficients satisfy... + + =1, The value is the dynamic eigenvalue. .

[0048] Preferably, in steps 1-2, , , The calculation setting method includes:

[0049] S1: Perform scene priority classification and basic weight allocation, which includes:

[0050] S1-1: Define scenario priority: Under the condition that the target device to which the target IP address belongs is in a high-security scenario, the priority coefficient is... =0.7; Under the condition that the target device to which the target IP address belongs is a general scenario, the priority coefficient is 0.7. =0.5; Priority coefficient is set to 0.5 when the target device associated with the target IP address is in a low-power scenario. =0.3;

[0051] S1-2: Calculate the base weights:

[0052] The calculation formula is as follows:

[0053] ;

[0054] in, For the first The base weight of each indicator For the first The security sensitivity of each indicator For the first The adaptability sensitivity of each indicator =1,2,3, the first indicator is The second indicator is The third indicator is ;

[0055] S2: Normalize the base weights to obtain the weight coefficients. , , The calculation formula is as follows:

[0056] .

[0057] Preferably, in S1-2, and The calculation methods include:

[0058] First, preset sensitivity baseline values, which include:

[0059] The first indicator's safety sensitivity benchmark value The baseline value for the adaptability sensitivity of the first indicator is 0.3. It is 0.7;

[0060] The second indicator's safety sensitivity benchmark value The baseline value for the adaptation sensitivity of the second indicator is 0.6. It is 0.6;

[0061] The third indicator's safety sensitivity benchmark value The baseline value for the adaptation sensitivity of the third indicator is 0.8. It is 0.4;

[0062] The sensitivity benchmark value is then dynamically fine-tuned, including:

[0063] The sensitivity benchmark value is adjusted based on the fluctuations of the indicators in the real-time scenario. The calculation formula is as follows:

[0064] ;

[0065] in, For the first The safety sensitivity adjustment coefficient of each indicator For the first The adaptation sensitivity fine-tuning coefficient for each indicator:

[0066] If the first If the fluctuation range of an indicator is greater than 50%, then =0.2; if the first If the fluctuation range of an indicator is less than 10%, then =0.2; if the first The fluctuation range of each indicator shall not exceed 50% and shall not be less than 10%.

[0067] Preferably, steps 1-3 specifically include:

[0068] The fundamental prime set With dynamic eigenvalues To perform fusion operations and generate a dynamic short key, the product of the fundamental set of prime numbers is first calculated. Then through the generation function Obtain the final two-factor dynamic short key ,in Here is the key length, and round() is the rounding function. In order to obtain Divide by The function that yields the remainder.

[0069] Preferably, in steps 1-3, if it is necessary to generate a two-factor dynamic key in the form of prime pairs, the key is retrieved from... Corresponding prime number family segment Two prime numbers are randomly selected as... and Form prime pairs Combined with dynamic eigenvalues Optimization is performed to obtain the prime number pair key ( , ),in , ,in In order to obtain Divide by The function that yields the remainder In order to obtain Divide by A function that yields the remainder;

[0070] and All are two-factor dynamic short keys.

[0071] Preferably, step 2 specifically includes:

[0072] Calculate key update frequency , The time interval between two consecutive two-factor dynamic short key generation, if ≥ If the key update frequency of the two-factor dynamic short key meets the requirements, then... < If the key update frequency of the two-factor dynamic short key does not meet the requirements, then... The minimum update frequency threshold is set.

[0073] Simultaneously verify the similarity between the two-factor dynamic short key and the historical two-factor dynamic short key. ,in For the current number The second-generation two-factor dynamic short key For the first The second-generated two-factor dynamic short key, if < If the similarity of the two-factor dynamic short keys meets the requirements, then... The similarity of the two-factor dynamic short keys is deemed insufficient. The maximum similarity threshold is set. The intersection operation calculates the binary representation of... and The number of binary bits that are in the same position and have the same value. The union operation is performed by first obtaining the binary representation of the result. The number of digits and The sum of the number of bits is then subtracted from the number of binary bits obtained by the intersection operation to get the difference.

[0074] Preferably, step 3 specifically includes:

[0075] Evaluate the matching degree between the two-factor dynamic short key and the target IP address. ,in In order to obtain A function that gives a remainder when divided by 1. , for The theoretical maximum value, ,if The matching degree between the two-factor dynamic short key and the target IP address is determined to be satisfactory. If the match between the two-factor dynamic short key and the target IP address is deemed insufficient, then... The minimum matching threshold is set. The maximum matching threshold is set; at the same time, the compatibility of the two-factor dynamic short key in data transmission is evaluated. The compatibility of the two-factor dynamic short key in data transmission is the adaptation rate of the two-factor dynamic short key to the existing network protocol. If the adaptation rate of the two-factor dynamic short key to the existing network protocol is ≥95%, it is judged that the adaptation rate of the two-factor dynamic short key to the existing network protocol meets the requirements. If the adaptation rate of the two-factor dynamic short key to the existing network protocol is <95%, it is judged that the adaptation rate of the two-factor dynamic short key to the existing network protocol does not meet the requirements.

[0076] Preferably, step 4 specifically includes:

[0077] Monitoring the failure rate of the two-factor dynamic short key generation process =Number of failures / Total number of generation attempts, where the number of failures is the number of times the two-factor dynamic short key generation failed, and the total number of generation attempts is the total number of times the two-factor dynamic short key was generated. < If the failure rate of the two-factor dynamic short key generation process meets the requirements, then... The failure rate of the two-factor dynamic short key generation process is deemed unacceptable. The maximum failure rate threshold is set.

[0078] Evaluation metrics for the anti-interference capability of two-factor dynamic short keys in the current network environment =Key valid transmission time / Total transmission time, if A score of 0.98 indicates that the anti-interference capability of the two-factor dynamic short key meets the requirements in the current network environment. If the failure rate is less than 0.98, the failure rate of the two-factor dynamic short key generation process is deemed unacceptable.

[0079] Preferably, step 5 specifically includes:

[0080] If the key update frequency, similarity, matching degree between the key and the target IP address, compatibility with existing network protocols, failure rate of key generation, and anti-interference capability of the key in the current network environment all meet the requirements, the two-factor dynamic short key is effective. When the target IP address needs encryption, the effective two-factor dynamic short key is used to encrypt the target IP address. If more than one of these indicators fails to meet the requirements, the two-factor dynamic short key is invalid. In this case, the two-factor dynamic short key is deleted, and the process returns to step 1 for re-execution.

[0081] The beneficial effects of the present invention are as follows, compared with the prior art:

[0082] Significantly enhanced security: Relying on the uniqueness of prime numbers and the randomness of dynamic feature factors, the generated two-factor dynamic short keys have no repetition rate, and have a high update frequency and low similarity to historical keys, effectively resisting malicious attacks such as brute-force attacks and replay attacks; the prime number pair generation technology provides security support for the even number public key system, and with the FPGA chip implementation, it ensures the independent controllability of the encryption system.

[0083] Generation efficiency is greatly improved: based on 10 15 The all-prime number resource platform can quickly obtain any segment of prime number families without complicated calculations, and can guarantee the purity of prime numbers without primality checks. The generation time for a single key is ≤0.1 seconds, and the generation time for a prime number pair key is ≤0.5 seconds, which is far superior to traditional key generation technologies.

[0084] Superior adaptability and stability: Key generation combines the dynamic characteristics of IP addresses with prime number resources to adapt to the IP address security requirements of different network segments and usage scenarios, with an adaptation rate of ≥95% to existing network protocols; through a scientific evaluation and control mechanism, the key generation failure rate is <0.01 and the anti-interference capability is ≥0.98, ensuring the stable operation of the encryption system.

[0085] With a wide range of applications, it can be widely used in fields such as digital security, cryptography, encryption / decryption technology, big data retrieval, financial security, and IP address protection. It provides technical support for network information security, biological gene coding research, and celestial motion cycle analysis, and promotes the transformation and upgrading of existing encryption devices and products, with significant economic and social value. Attached Figure Description

[0086] Figure 1 This is a flowchart of a method for generating and evaluating a two-factor dynamic short key for prime IP address security, as described in this invention. Detailed Implementation

[0087] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of this invention. The embodiments described in this application are merely some embodiments of this invention, and not all embodiments. Based on the spirit of this invention, other embodiments obtained by those skilled in the art without creative effort are all within the protection scope of this invention.

[0088] like Figure 1 As shown, the method for generating and evaluating a two-factor dynamic short key for prime IP address security according to the present invention includes:

[0089] The hardware environment for generating and evaluating a two-factor dynamic short key for prime IP address security is a deployment of 10 15 A resource platform server for all prime numbers (this resource platform server can be a configured large computer with a processing speed of 10). 15 The prime number library generation standard can be completed within 150 days), FPGA chip, and network device (which can be a router) that communicates with the resource platform server. 15 The all-prime number resource platform is for deploying 10 15 A resource platform server for all prime numbers, deployed with 10 15 The resource platform server for all prime numbers runs the corresponding generation and evaluation software system. Deployment 10 15 The resource platform server for all prime numbers stores 10 15 All prime numbers within the range that satisfy the definition of a prime number, 10 15All prime numbers within the range that satisfy the definition of a prime number are 10. 15 All prime numbers, 10 15 All prime numbers within the specified range that conform to the definition of a prime number can be stored in a pre-defined database; the specific methods for generating and evaluating the security of prime number IP addresses using a two-factor dynamic short key include:

[0090] Step 1: Generate a two-factor dynamic short key based on the target IP address; the target IP address is the IP address to be encrypted. The terminal device (such as a computer) to which the target IP address belongs is the target device, which communicates with the network device.

[0091] In a preferred but non-limiting embodiment of the present invention, step 1 specifically includes:

[0092] Step 1-1: Extract the prime fundamental factors that serve as factor one;

[0093] In a preferred but non-limiting embodiment of the present invention, step 1-1 specifically includes:

[0094] Based on the 10 already built 15 The all-prime number resource platform allows for quick retrieval of 10... 20 -10 30 Find the prime number family of segments within the range that match the target IP address network segment. Let the target IP address be an IPv4 address ABCD (where A, B, C, and D are integers from 0 to 255). Convert the IP address into a 32-bit binary number. Through mapping function (in 10 15 The number of prime number families in the all-prime number resource platform. =1,2,...,32), determine the corresponding prime number family segment. ( The starting prime number of the prime family segment. (the ending prime of the prime family segment), from the prime family segment Random selection The prime numbers are the fundamental set of prime numbers. ( ≥2, and (Dynamically adjusted based on key length requirements), the corresponding process is as follows:

[0095] Step 1-1-1: The network device collects the target IP address ABCD in real time; at the same time, it collects the usage duration of the IP address. Network connection strength Data transmission frequency And the target IP address ABCD and the duration of use of the target IP address. Network connection strength Data transmission frequency Transmit to 10 15 A software system for generating and evaluating all prime numbers, where A, B, C, and D are integers from 0 to 255;

[0096] The network device collects the target IP address ABCD in real time by having the target device transmit a preset random data packet to the network device. The network device then extracts the source IP address from the header information of the random data packet by parsing the random data packet. This source IP address is the target IP address ABCD.

[0097] In a preferred but non-limiting embodiment of the present invention, in step 1-1-1, the usage duration of the target IP address is collected. The methods include:

[0098] Network devices use protocol stack hook functions (such as Linux's Netfilter and Windows' WinsockLSP) to capture connection establishment packets (such as TCP's SYN packet and UDP's first send packet) and connection termination packets (such as TCP's FIN / RST packet and UDP's timeout packet) sent by the target device to which the target IP address belongs.

[0099] Establish a dedicated session record for the target IP. When a connection establishment packet is captured, record the start time T_start (accurate to the second, in the format YYYY-MM-DD HH:MM:SS). When a disconnection packet is captured, mark the connection as ended and reset T_start to 0. When a connection establishment packet is captured again, record the start time T_start again.

[0100] After collecting the target IP addresses ABCD in real time, the current system time T_current is collected to determine the usage duration. =(T_current-T_start) / 3600 (unit converted to hours, rounded to 2 decimal places).

[0101] In a preferred but non-limiting embodiment of the present invention, in step 1-1-1, the network connection strength of the target IP address is collected. The methods include:

[0102] Assuming a wired connection exists between the target device (within the specified IP address) and the network device, the target device first obtains the actual negotiated speed (e.g., 100Mbps, 1Gbps) of the network interface card (NIC) corresponding to the target IP address using the appropriate API (e.g., GetAdaptersInfo in Windows, ethtool command in Linux), and standardizes it to metric one. = Actual negotiated speed of the network card / Maximum supported speed of the network card (e.g., if the maximum supported speed of the network card is 1Gbps, and the actual negotiated speed of the network card is 100Mbps, then...) =0.1), calculate the bit error rate by obtaining the number of erroneous frames and the total number of received frames from the link error statistics document of the target device (such as the "errors" field and "packets" field of the / proc / net / dev file in Linux, respectively). =1 - (number of error frames / total number of received frames) (If the total number of frames is 0, then...) =0), obtain the packet loss rate using the PRTG Network Monitor software on the target device. This allows for the calculation of network connection strength under the condition that there is a wired connection between the target device (within the target IP address) and the network device. =0.4× +0.3× +0.3× (Weighted coefficients of 0.4, 0.3, and 0.3 are optimized based on wired connection characteristics to ensure a balanced impact of each indicator.) The target device will... Transmitted to network devices;

[0103] Under the condition that there is a wireless connection between the target device (within the target IP address) and the network device, the target device first obtains the signal strength RSSI (in dBm) of the target device (within the target IP address) through the corresponding API (such as Windows' WlanGetNetworkBssList or Android's WifiManager), and normalizes it into index two. =(RSSI-RSSI_min) / (RSSI_max-RSSI_min) (RSSI_min and RSSI_max are the set minimum and maximum signal strength values. If (RSSI-RSSI_min) / (RSSI_max-RSSI_min) is less than 0, then...) =0, if (RSSI-RSSI_min) / (RSSI_max-RSSI_min) is greater than 1. =1), obtain the signal-to-noise ratio of the target device to which the target IP address belongs using the inSSIDer tool of the target device. The retransmission rate of the target device corresponding to the target IP address is obtained through the PathSolutions TotalView software of the target device. This allows for the calculation of network connection strength under the condition that there is a wireless connection between the target device (within the target IP address) and the network device. =0.5× +0.3× +0.2× (Signal strength is weighted highest at 0.5, signal-to-noise ratio at 0.3, and retransmission rate at 0.2, consistent with wireless network characteristics.) The target device will... Transmitted to network devices.

[0104] In a preferred but non-limiting embodiment of the present invention, in step 1-1-1, the data transmission frequency of the IP address is collected. The methods include:

[0105] The transmission frequency is calculated by counting the number of data packets sent (F_send) and received (F_recv) by the target device to which the target IP address belongs within the previous 30 seconds. =(F_send+F_recv) / 30, then the target device will Transmitted to network devices.

[0106] Duration of use of the target IP address Network connection strength Data transmission frequency This forms the dynamic feature parameters of the target IP address. The technical effect of the dynamic feature parameters of the target IP address is to provide dynamic, accurate and strongly correlated feature inputs for the prime number pair key, and finally realize the exclusive encryption protection of the target IP address. This not only solves the defects of traditional static keys that are easy to crack and have poor adaptability, but also ensures the security, dynamism and adaptability of the encryption system through parameter linkage.

[0107] Step 1-1-2: Generate and evaluate the software system to perform prime number family segmentation storage;

[0108] In a preferred but non-limiting embodiment of the present invention, step 1-1-2 specifically includes:

[0109] To support rapid retrieval of 10 20 -10 30 The prime number family of segments within the range that matches the target IP address network segment must first be matched with 10. 15 The all-prime number resource platform is expanded and structured for storage:

[0110] The generation and evaluation software system is based on 10 15 The All Prime Number Resource Platform already has 10 15 All prime numbers (10 15 Generate 10 from all prime numbers within the range that satisfy the definition of a prime number using a set derivation algorithm. 20 -10 30 Prime numbers within the range, and categorize 10 according to their numerical intervals. 20 -10 30The prime numbers within the range are divided into prime number groups, that is, the 10 prime numbers arranged in ascending order. 20 -10 30 The prime numbers within the range are equally divided into Each section ( As a preset constant, a value of 10 is recommended. 6 -10 8 Balancing segment granularity and retrieval efficiency, equal division means at least the first... - The number of prime numbers is the same for each interval (each interval has the same number of prime numbers). ,in For the first A prime number family segment, For the first The initial prime number of a prime family segment. For the first The final prime number of each prime family segment, with ≥1000 prime numbers stored in each segment (ensuring sufficient margin when randomly selecting m prime numbers, and the number of prime numbers stored in each segment is greater than m).

[0111] Assign a unique identifier ID to each segment (as per the above) Each segment's sequence is assigned a number from 1 to N as its segment ID.

[0112] The established derivation algorithm includes:

[0113] Step 1: Generate candidate odd numbers within the target interval [10²]. 0 10³ 0 Randomly select an odd number n from the [input] field;

[0114] Step 2: Based on 10 15 The All Prime Number Resource Platform already has 10 15 Divide all prime numbers by smaller prime numbers;

[0115] Based on 10 15 The All Prime Number Resource Platform already has 10 15 The method for performing trial division of smaller prime numbers using all prime numbers, as shown in the Python pseudocode below:

[0116] #Pseudocode: Utilizing 10 as a database of prime numbers 15 The All Prime Number Resource Platform already has 10 15 Trial division screening of all prime numbers

[0117] Def small_prime_trial_division(n,prime_database):

[0118] """

[0119] n: candidate large numbers (10^20 to 10^30)

[0120] prime_database: A list / bitmap of all prime numbers up to 10^15 that you have.

[0121] Return value: True indicates filtering by small prime numbers, False indicates exclusion.

[0122] """

[0123] #Optimization 1: Only sqrt(n) is checked. But sqrt(10^30) = 10^15, which is exactly the boundary of your database!

[0124] limit=min(isqrt(n),10**15) # In fact, isqrt(n) is always less than 10^15

[0125] For p in prime_database:

[0126] If p>limit:

[0127] break

[0128] If n%p==0:

[0129] Return False # Find the smaller factor, n is a composite number

[0130] Return True # Filter by trial division of small prime numbers

[0131] Step 3: Apply the Miller-Rabin primality test to the candidate number n that has been screened by small prime number division to perform a probability test;

[0132] The method for probability testing using the Miller-Rabin primacy test is shown in the following Python pseudocode:

[0133] def miller_rabin(n, k=10): # k is the number of test rounds; more rounds result in better accuracy.

[0134] if n < 2: return False

[0135] # Handling small even numbers

[0136] if n % 2 == 0:

[0137] return n == 2

[0138] # Rewrite n-1 in the form d * 2^s

[0139] s, d = 0, n - 1

[0140] while d % 2 == 0:

[0141] s += 1

[0142] d / / = 2

[0143] # Test k rounds

[0144] import random

[0145] for _ in range(k):

[0146] a = random.randrange(2, n - 1) # Randomly select the base

[0147] x = pow(a, d, n)

[0148] if x == 1 or x == n - 1:

[0149] continue

[0150] for _ in range(s - 1):

[0151] x = (x * x) % n

[0152] if x == n - 1:

[0153] break

[0154] else:

[0155] return False # It must be a composite number

[0156] return True # It is very likely a prime number

[0157] Step 4: For n whose sum after the probability test is likely to be a prime number, apply the ECPP (Elliptic Curve Proof) algorithm to determine whether n is a prime number. If it is determined to be a prime number, then it is the generated prime number.

[0158] This allows us to define the target interval [10²]. 0 10 30 Determine the prime numbers for all odd numbers within the range.

[0159] Step 1-1-3: The generation and evaluation software system performs binary conversion on the target IP address ABCD;

[0160] In a preferred but non-limiting embodiment of the present invention, step 1-1-3 specifically includes:

[0161] Convert the values ​​of A, B, C, and D in the target IP address ABCD into 8-bit binary numbers for A, B, C, and D respectively. Then concatenate these 8-bit binary numbers sequentially to form four 8-bit binary numbers, resulting in a 32-bit binary number. .

[0162] Step 1-1-4: The generation and evaluation software system calculates the binary number after binary conversion using a mapping function;

[0163] In a preferred but non-limiting embodiment of the present invention, step 1-1-4 specifically includes:

[0164] The mapping function is: ,in 10 15 The number of prime number families in the all-prime number resource platform. =1,2,...,32, for Divide by The function for finding the remainder This is the ID of the corresponding prime number family segment.

[0165] Step 1-1-5: The generation and evaluation software system efficiently retrieves the prime number family segment based on the ID of the prime number family segment obtained by the mapping function;

[0166] In a preferred but non-limiting embodiment of the present invention, step 1-1-5 specifically includes:

[0167] In 10 15 Extracted from the All Prime Numbers Resource Platform The corresponding prime number family segment, That is, the ID of the prime number family segment obtained based on the mapping function.

[0168] Step 1-1-6: Randomly select from the retrieved prime number family segment The prime numbers are the fundamental set of prime numbers. ,in For the randomly selected number A prime number, .

[0169] The mapping rules are adapted to the key length requirements of dynamic short keys, and are set according to specific requirements. The longer the key length, the better. The larger the value, the better, as in a key length of 16. The key length is 32. The value is 3, and the key length is 16. The key length is 64, and the value is 2. The value is 4.

[0170] Step 1-1 implements the entire process of extracting the basic prime set as the basic factors of prime numbers from an engineering perspective, taking into account security (cryptographic random selection, uniqueness verification), efficiency (hardware acceleration, caching mechanism) and fault tolerance (anomaly handling, spare segment), ensuring that the basic factors of prime numbers strongly associated with IP addresses can be generated quickly and reliably, laying the core foundation for the subsequent generation of two-factor dynamic short keys.

[0171] Step 1-2: Extract the dynamic factors of IP features as factor two;

[0172] In a preferred but non-limiting embodiment of the present invention, steps 1-2 specifically include:

[0173] Based on the dynamic characteristic parameters of the target IP address (dynamic characteristic parameters include the duration of IP address usage). Network connection strength Data transmission frequency The dynamic feature parameters are normalized to obtain a standardized feature vector. ,in ,in The preset maximum usage time threshold can be set to 72 hours. , ,in The preset maximum transmission frequency threshold, which can be 1000 times / minute, is used through a feature fusion function. ,in , , The set weighting coefficients satisfy... + + =1, which can be defaulted to =0.3、 =0.4、 =0.3, which can also be calculated and set. The value is the dynamic eigenvalue. (Its value range is 0-1). This refers to the dynamic factors of IP characteristics.

[0174] In a preferred but non-limiting embodiment of the present invention, in steps 1-2, , , The calculation setting method includes:

[0175] To address the shortcomings of traditional fixed-weight methods, such as poor adaptability and inability to respond to dynamic changes in scenarios, this calculation method is based on an innovative logic that combines scenario feature quantification with a balance between safety and adaptability. It employs a non-machine learning path involving scenario priority grading, dynamic indicator sensitivity calculation, and constraint optimization, while satisfying… + + =1 and , , Under the condition that ≥0, the optimal weights are obtained to adapt to different IP address encryption scenarios. This method does not require complex model training and a large number of samples, is simple to implement in engineering, and overcomes the limitations of traditional fixed weights through a dynamic sensitivity adjustment mechanism.

[0176] By quantifying three dynamic indicators ( , , The security sensitivity and adaptability sensitivity in different scenarios are combined with the scenario priority to allocate weights, and then the results are adjusted through constraint optimization to meet the requirements. + + =1, ultimately yielding the optimal weight. The core principle is to assign higher weights to metrics with high sensitivity and high scenario priority, achieving dynamic adaptation. The specific calculation method is shown below:

[0177] S1: Perform scenario priority classification and basic weight allocation, which includes: classifying scenario priorities and allocating basic weight bases based on the security requirements and indicator characteristics of the encryption scenario of the target IP address. , , ), ensuring that the basic weights are strongly correlated with the core needs of the scenario:

[0178] S1-1: Define scenario priorities: Under the condition that the target device to which the target IP address belongs is a high-security scenario (such as a financial server or a government terminal), security requirements > adaptation requirements, and the priority coefficient is [not specified]. =0.7; Under the condition that the target device to which the target IP address belongs is a general scenario (target device such as enterprise office terminal, home device), the security and adaptation are balanced, and the priority coefficient is 0.7. =0.5; Under the condition that the target device to which the target IP address belongs is a low-power scenario (target device such as IoT sensor, smart door lock), the adaptation requirement > security requirement, and the priority coefficient is 0.5. =0.3;

[0179] S1-2: Calculate the base weight: The base weight reflects the inherent importance of the indicator in the scenario, and its calculation formula is as follows:

[0180] ;

[0181] in, For the first The base weight of each indicator For the first The security sensitivity of each indicator For the first The adaptability sensitivity of each indicator =1,2,3 and The values ​​are all in the range [0,1], preset by the scene characteristics, and the first indicator is... The second indicator is The third indicator is ;

[0182] In a preferred but non-limiting embodiment of the present invention, in S1-2, and The calculation methods include:

[0183] Sensitivity metrics reflect the degree to which changes in indicators affect key security and adaptability. They are set as a baseline value and then dynamically fine-tuned according to real-time scenarios.

[0184] First, preset sensitivity baseline values, which include:

[0185] The first indicator's safety sensitivity benchmark value The baseline value for the adaptability sensitivity of the first indicator is 0.3. The value is 0.7, which is a sensitivity benchmark value set based on the fact that the stability of the duration of the first indicator has a significant impact on adaptability but a small impact on security.

[0186] The second indicator's safety sensitivity benchmark value The baseline value for the adaptation sensitivity of the second indicator is 0.6. The value is 0.6, which indicates that the connection stability based on the second indicator has a moderate impact on both security and compatibility.

[0187] The third indicator's safety sensitivity benchmark value The baseline value for the adaptation sensitivity of the third indicator is 0.8. The value is 0.4, which is a sensitivity benchmark value set based on the fact that frequency mutations in the third indicator easily reflect attacks and have a significant impact on security.

[0188] The sensitivity benchmark value is then dynamically fine-tuned, including:

[0189] The sensitivity benchmark value is adjusted based on the fluctuations of the indicators in the real-time scenario. The calculation formula is as follows:

[0190] ;

[0191] in, For the first The safety sensitivity adjustment coefficient of each indicator For the first The adaptation sensitivity fine-tuning coefficient for each indicator:

[0192] If the first If the fluctuation range of an indicator is greater than 50%, then =0.2 (increase security sensitivity); if the first If the fluctuation range of an indicator is less than 10%, then =0.2 (improves adaptation sensitivity); if the first If the fluctuation range of an indicator is no greater than 50% and no less than 10%, it means there is no significant fluctuation. = =0 (using the baseline value).

[0193] No. The calculation method for the fluctuation range of the indicator is as follows: the latest indicator... The value of the first indicator minus the latest value of the second indicator The number of indicators set before the first one The average of each indicator This yields the difference after subtraction. Next As the first The fluctuation range of each indicator.

[0194] S2: Normalize the base weights to obtain the weight coefficients. , , The calculation formula is as follows:

[0195] .

[0196] The present invention , , The technical effects of the calculation setting method are as follows:

[0197] Overcoming the limitations of fixed weights: Traditional fixed weights cannot adapt to the needs of different scenarios (such as insufficient adaptability to IoT scenarios and insufficient security in high-security scenarios). This method dynamically adjusts scenario priority and sensitivity to achieve re-adaptation for low-power scenarios and re-security for high-security scenarios, increasing the multi-scenario adaptability rate from 75% to 96%.

[0198] No need for large numbers of samples and complex calculations: It avoids the dependence of machine learning methods on sample size (≥100,000) and computing resources. By setting a baseline value and making dynamic fine-tuning, weight calculation can be completed on ordinary terminal devices in ≤1 second, making it suitable for low-power and resource-constrained IoT devices.

[0199] Real-time response to dynamic changes in the scenario: Traditional methods have fixed weights and cannot cope with fluctuations in indicators (such as sudden changes in transmission frequency or network switching). This method adjusts the weight allocation in real time by fine-tuning the sensitivity coefficient. When switching networks, the key matching success rate is increased from 75% to 98.5%, without encryption interruption.

[0200] Simple to implement in engineering: The formula logic is concise and can be directly embedded into FPGA chips without the need to deploy complex model training frameworks. The device resource utilization rate is ≤3% (lower than 10% of machine learning methods), and it supports rapid iteration and upgrade (only the sensitivity benchmark value needs to be adjusted to adapt to new scenarios).

[0201] Steps 1-3: Based on the fundamental set of prime numbers With dynamic eigenvalues Generate a dynamic short key.

[0202] In a preferred but non-limiting embodiment of the present invention, steps 1-3 specifically include:

[0203] The fundamental prime set With dynamic eigenvalues To perform fusion operations and generate a dynamic short key, the product of the fundamental set of prime numbers is first calculated. Then through the generation function Obtain the final two-factor dynamic short key ,in This is the key length. The value can be 16, 32, or 64 depending on the security requirements. `round()` is the rounding function. In order to obtain Divide by The function that yields the remainder.

[0204] In a preferred but non-limiting embodiment of the present invention, in steps 1-3, if it is necessary to generate a two-factor dynamic key in the form of prime pairs, the key is retrieved from... Corresponding prime number family segment Two prime numbers are randomly selected as... and Form prime pairs Combined with dynamic eigenvalues Optimization is performed to obtain the prime number pair key ( , ),in , ,in In order to obtain Divide by The function that yields the remainder In order to obtain Divide by A function that yields the remainder;

[0205] and All are two-factor dynamic short keys.

[0206] Step 2: The generation and evaluation software system performs security evaluation on the generated two-factor dynamic short key;

[0207] In a preferred but non-limiting embodiment of the present invention, step 2 specifically includes:

[0208] A dynamic verification method is adopted, that is, the key update frequency is calculated. , The time interval between two consecutive two-factor dynamic short key generation, if ≥ If the key update frequency of the two-factor dynamic short key meets the requirements, then... < If the key update frequency of the two-factor dynamic short key does not meet the requirements, then... The minimum update frequency threshold is set according to requirements, as follows: The possible value is 0.5 times / minute;

[0209] Simultaneously verify the similarity between the two-factor dynamic short key and the historical two-factor dynamic short key. ,in For the current number The second-generation two-factor dynamic short key For the first The second generated two-factor dynamic short key (historical two-factor dynamic short key), if < If the similarity of the two-factor dynamic short keys meets the requirements, then... The similarity of the two-factor dynamic short keys is deemed insufficient. The maximum similarity threshold is set according to the requirements, as follows: The possible value is 0.1. The intersection operation calculates the binary representation of... and The number of binary bits that are in the same position and have the same value. The union operation is performed by first obtaining the binary representation of the result. The number of digits and The sum of the number of bits is then subtracted from the number of binary bits obtained by the intersection operation to get the difference.

[0210] Step 3: The generation and evaluation software system performs adaptation evaluation on the generated two-factor dynamic short key;

[0211] In a preferred but non-limiting embodiment of the present invention, step 3 specifically includes:

[0212] Evaluate the matching degree between the two-factor dynamic short key and the target IP address. ,in In order to obtain A function that gives a remainder when divided by 1. , for The theoretical maximum value ( It can be 2 32 -1), ,if The matching degree between the two-factor dynamic short key and the target IP address is determined to be satisfactory. If the match between the two-factor dynamic short key and the target IP address is deemed insufficient, then... This is the minimum matching threshold set according to specific requirements. The maximum matching threshold can be set according to specific requirements, just as it can be set. =0.3, =0.7, ensuring the security requirement of key adaptation to the target IP address; at the same time, evaluate the compatibility of the two-factor dynamic short key in data transmission. The compatibility of the two-factor dynamic short key in data transmission is the adaptation rate of the two-factor dynamic short key to the existing network protocol. If the adaptation rate of the two-factor dynamic short key to the existing network protocol is ≥95%, it is judged that the adaptation rate of the two-factor dynamic short key to the existing network protocol meets the requirements. If the adaptation rate of the two-factor dynamic short key to the existing network protocol is <95%, it is judged that the adaptation rate of the two-factor dynamic short key to the existing network protocol does not meet the requirements.

[0213] The methods for calculating the compatibility rate of two-factor dynamic short keys with existing network protocols include:

[0214] 1. Prepare test data packets

[0215] Select 100 data packets that are consistent with the business of the target device to which the target IP address belongs (e.g., select MQTT data packets in IoT scenarios and TCP data packets in server scenarios), and ensure that the length and format of the data packets conform to the existing network protocol specifications.

[0216] 2. Encrypted transmission closed-loop test

[0217] Use the key to be evaluated ( or )encryption( or These 100 data packets correspond to either the national standard SM4 encryption algorithm or the RSA encryption algorithm.

[0218] Send to the receiving end (network device) through a real transmission link (no need to build a simulation environment, directly using the network link between the current generation and evaluation software system and the network device).

[0219] Receiver or Attempt to decrypt ( or (Corresponding to the national cryptographic SM4 decryption algorithm or RSA decryption algorithm respectively), count the number of successfully decrypted data packets. The criteria for successful decryption are: the decrypted data is completely identical to the original data, with no garbled characters or missing fields.

[0220] 3. Perform compatibility adaptation rate calculation

[0221] The compatibility rate of two-factor dynamic short keys with existing network protocols = .

[0222] exist Furthermore, given the condition of prime number pairs as keys, Just for or The compatibility rate of the two-factor dynamic short key with existing network protocols needs to be transmitted back to the generation and evaluation software system.

[0223] Step 4: The generation and evaluation software system performs stability evaluation on the generated two-factor dynamic short key;

[0224] In a preferred but non-limiting embodiment of the present invention, step 4 specifically includes:

[0225] Monitoring the failure rate of the two-factor dynamic short key generation process =Number of failures / Total number of generation attempts, where the number of failures is the number of times the two-factor dynamic short key generation failed, and the total number of generation attempts is the total number of times the two-factor dynamic short key was generated. < If the failure rate of the two-factor dynamic short key generation process meets the requirements, then... The failure rate of the two-factor dynamic short key generation process is deemed unacceptable. The maximum failure rate threshold is set according to requirements, as follows The possible value is 0.1;

[0226] Evaluation metrics for the anti-interference capability of two-factor dynamic short keys in the current network environment =Key valid transmission time / Total transmission time, if A score of 0.98 indicates that the anti-interference capability of the two-factor dynamic short key meets the requirements in the current network environment. If the failure rate is less than 0.98, the failure rate of the two-factor dynamic short key generation process is deemed unacceptable.

[0227] The valid key transmission duration is defined as the periodic sending of key data packets containing two-factor dynamic short keys to network devices by the generation and evaluation software system within the set total transmission duration. Each key data packet includes the two-factor dynamic short key and its CRC32 checksum. Upon receiving the key data packet, the network device recalculates the CRC32 checksum of the two-factor dynamic short key. If the calculated CRC32 checksum matches the CRC32 checksum in the key data packet, the key data packet is considered valid. Finally, the number of valid key data packets within the set total transmission duration is counted. The product of the number of valid key data packets and the timed duration is the valid key transmission duration, which is transmitted to the generation and evaluation software system in real time.

[0228] Step 5: The generation and evaluation software system processes the generated two-factor dynamic short key based on the evaluation results.

[0229] In a preferred but non-limiting embodiment of the present invention, step 5 specifically includes:

[0230] If the key update frequency, similarity, matching degree between the key and the target IP address, compatibility with existing network protocols, failure rate of key generation, and anti-interference capability of the key in the current network environment all meet the requirements, the two-factor dynamic short key is effective. When the target IP address needs encryption, the effective two-factor dynamic short key is used to encrypt the target IP address. If more than one of these indicators fails to meet the requirements, the two-factor dynamic short key is invalid. In this case, the two-factor dynamic short key is deleted, and the process returns to step 1 for re-execution.

[0231] The effective two-factor dynamic short key is a two-factor dynamic short key. Under the condition that the target IP address is encrypted or decrypted, the encryption and decryption method of the national cryptographic SM4 algorithm can be used, and the effective two-factor dynamic short key is a prime pair key ( , Under the condition of ), the method for encrypting and decrypting the target IP address can be the RSA algorithm. The public key for the RSA algorithm. This is the private key for the RSA algorithm.

[0232] The method for generating and evaluating a two-factor dynamic short key for prime IP address security of the present invention may further include:

[0233] By embedding software code into an FPGA chip to generate and evaluate a method for securing two-factor dynamic short keys for prime IP addresses, it can be ensured that the two-factor dynamic short keys generated by the FPGA chip meet the requirements of security, adaptability, and stability. This allows the FPGA chip to replace foreign random number generators with backdoors.

[0234] The beneficial effects of the present invention are as follows, compared with the prior art:

[0235] Significantly enhanced security: Relying on the uniqueness of prime numbers and the randomness of dynamic feature factors, the generated two-factor dynamic short keys have no repetition rate, and have a high update frequency and low similarity to historical keys, effectively resisting malicious attacks such as brute-force attacks and replay attacks; the prime number pair generation technology provides security support for the even number public key system, and with the FPGA chip implementation, it ensures the independent controllability of the encryption system.

[0236] Generation efficiency is greatly improved: based on 10 15 The all-prime number resource platform can quickly obtain any segment of prime number families without complicated calculations, and can guarantee the purity of prime numbers without primality checks. The generation time for a single key is ≤0.1 seconds, and the generation time for a prime number pair key is ≤0.5 seconds, which is far superior to traditional key generation technologies.

[0237] Superior adaptability and stability: Key generation combines the dynamic characteristics of IP addresses with prime number resources to adapt to the IP address security requirements of different network segments and usage scenarios, with an adaptation rate of ≥95% to existing network protocols; through a scientific evaluation and control mechanism, the key generation failure rate is <0.01 and the anti-interference capability is ≥0.98, ensuring the stable operation of the encryption system.

[0238] With a wide range of applications, it can be widely used in fields such as digital security, cryptography, encryption / decryption technology, big data retrieval, financial security, and IP address protection. It provides technical support for network information security, biological gene coding research, and celestial motion cycle analysis, and promotes the transformation and upgrading of existing encryption devices and products, with significant economic and social value.

[0239] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit it. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that modifications or equivalent substitutions can still be made to the specific implementation of the present invention without departing from the spirit and scope of the present invention. Any modifications or equivalent substitutions should be covered within the scope of protection of the claims of the present invention.

Claims

1. A method for generating and evaluating a security double-factor dynamic short key of a prime number IP address, characterized in that, Comprise: Step 1: generating a double-factor dynamic short key according to the target IP address; Step 2: generating a security evaluation and control software system to evaluate the generated double-factor dynamic short key; Step 3: generating a generated double-factor dynamic short key and a generated double-factor dynamic short key for adaptability evaluation and control, including evaluating the matching degree of the double-factor dynamic short key and the target IP address and evaluating the compatibility of the double-factor dynamic short key in data transmission, that is, the adaptability of the double-factor dynamic short key to the existing network protocol; Step 4: generating a generated double-factor dynamic short key and a generated double-factor dynamic short key for stability evaluation and control; Step 5: generating a generated double-factor dynamic short key and a generated double-factor dynamic short key for processing according to the evaluation and control results; Step 1 specifically includes: Step 1-1: Extraction of prime base factors as factor one, including obtaining a base set of prime numbers ; Step 1-2: Extracting the IP feature dynamic factor as a factor of two, including obtaining the dynamic characteristic parameters of the target IP address, the dynamic characteristic parameters including the use time length of the IP address , network connection strength , data transmission frequency , according to the dynamic characteristic parameters of the target IP address, the dynamic characteristic parameters are normalized to obtain a standardized characteristic vector , wherein , wherein is a preset maximum use time threshold, , , wherein is a preset maximum transmission frequency threshold, through a feature fusion function , wherein , , is a set weight coefficient, satisfying + + =1, The value of is the dynamic characteristic value ; Step 1-3: According to the base prime set With dynamic characteristic value Generating dynamic short key, including calculating the product of base prime set Then through the generating function Get the final double-factor dynamic short key Wherein Key length is K, According to the security requirement, the value is 16, 32 or 64, round() is the rounding function, Is the function of taking Divided by The remainder function.

2. The method of claim 1, wherein the method is characterized by: Step 1-1 specifically includes: Step 1-1-1: The network device collects the target IP address A.B.C.D in real time; meanwhile, the use duration of the IP address is collected , network connection strength , data transmission frequency , and the target IP address A.B.C.D, the use duration of the target IP address , network connection strength , data transmission frequency are transmitted to 10 15 The generation and evaluation and control software system of the all-prime number resource platform, wherein A, B, C, and D are integers from 0 to 255; Step 1-1-2: generating a prime number family section storage and a prime number family section storage; Step 1-1-3: generating a target IP address A.B.C.D binary conversion and a target IP address A.B.C.D binary conversion; Step 1-1-4: generating a binary conversion binary number calculation and a binary conversion binary number calculation through a mapping function; Step 1-1-5: generating a prime number family section ID based on the prime number family section ID obtained by the mapping function to retrieve the prime number family section; Step 1-1-6: Randomly select a prime number as the base prime set in the retrieved prime family section . wherein is the randomly selected prime number, . .

3. The method of claim 2, wherein the method further comprises: generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method; and generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method. In step 1-1-1, the usage duration of the target IP address is collected The method comprises the following steps. The network device captures the connection establishment packet and the connection disconnection packet sent by the target device through the protocol stack hook function; A dedicated session record is established for the target IP, that is, when the connection establishment packet is captured, the starting time T_start is recorded at this time; When the disconnection packet is captured, the connection is marked as ended, T_start is reset to 0, and the next time the connection establishment packet is captured, the starting time T_start is recorded again; After the target IP address A.B.C.D is collected in real time, the current system time T_current is collected, and the time length =(T_current-T_start) / 3600; In step 1-1-1, the network connection strength of the target IP address is collected comprising: Under the condition that the target device and the network device are connected by wire, the target device first obtains the actual negotiation rate of the network card corresponding to the target device to which the target IP address belongs through the corresponding API, and standardizes it as index one = actual negotiation rate of network card / maximum support rate of network card, the error code rate is calculated through the link error statistics document of the target device = 1- (number of error frames / total number of received frames), the packet loss rate is obtained through the PRTG Network Monitor software of the target device , and thus the network connection strength under the condition that the target device and the network device are connected by wire is calculated = 0.4 × + 0.3 × + 0.3 × , the target device transmits to the network device; Under the condition that the target device and the network device are wirelessly connected, the target device first acquires the signal strength RSSI corresponding to the target device to which the target IP address belongs through the corresponding API, and standardizes it as index two =(RSSI-RSSI_min) / (RSSI_max-RSSI_min), acquires the signal-to-noise ratio of the target device to which the target IP address belongs through the inSSIDer tool of the target device , acquires the retransmission rate corresponding to the target device to which the target IP address belongs through the PathSolutions TotalView software of the target device , and thus calculates the network connection strength under the condition that the target device and the network device are wirelessly connected =0.5× +0.3× +0.2× , and the target device transmits to the network device; In step 1-1-1, the data transmission frequency of the IP address is collected comprising: The target device to which the target IP address belongs counts the number of data packets sent F_send and the number of data packets received F_recv in the previous 30 seconds, and then the transmission frequency =(F_send+F_recv) / 30, and the target device will transmit to the network device; Step 1-1-2 specifically includes: Generating and evaluating software systems based on 10 15 All prime resource platform has 10 15 All prime, through the set of generating algorithm 10 20 -10 30 Range of prime numbers, and according to the value interval will 10 20 -10 30 Range of prime numbers into prime family section, that is, the order from small to large 10 20 -10 30 Range of prime numbers into Section, each section , where The first Prime family section, The first Prime family section of the starting prime, The first Prime family section of the end prime, each section stores ≥1000 prime numbers; A unique ID is assigned to each section.

4. The method of claim 3, wherein the method further comprises: generating a prime IP address security two-factor dynamic short key by using a prime number IP address security two-factor dynamic short key generation algorithm; and evaluating the prime IP address security two-factor dynamic short key by using a prime number IP address security two-factor dynamic short key evaluation algorithm. Step 1-1-3 specifically includes: A, B, C and D in the target IP address A.B.C.D are converted into an 8-bit binary number of A, an 8-bit binary number of B, an 8-bit binary number of C and an 8-bit binary number of D respectively, and then the 8-bit binary number of A, the 8-bit binary number of B, the 8-bit binary number of C and the 8-bit binary number of D are sequentially spliced into 4 8-bit binary numbers to obtain a 32-bit binary number ; Step 1-1-4 specifically includes: The mapping function is: wherein is 10 15 the number of segments of the prime number family in the prime number resource platform, = 1, 2,..., 32, is a function that divides and takes the remainder, is the ID of the corresponding prime number family segment; Step 1-1-5 specifically includes: In 10 15 Calling out in the prime resource platform Corresponding prime family section, That is, the ID of the prime family section obtained based on the mapping function.

5. The method of claim 4, wherein the method further comprises: generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method; and generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method. Step 1-2 specifically includes: In step 1-2, , , A computing setting method of the above-mentioned formula, comprising: S1: scene priority classification and basic weight allocation, which includes: S1-1: Define scenario priority: Under the condition that the target device to which the target IP address belongs is in a high-security scenario, the priority coefficient is... =0.7; Under the condition that the target device to which the target IP address belongs is a general scenario, the priority coefficient is 0.

7. =0.5; Priority coefficient is set to 0.5 when the target device associated with the target IP address is in a low-power scenario. =0.3; S1-2: basic weight base calculation: The calculation formula is: ； wherein, is the base weight base for the th index, is the security sensitivity for the th index, is the adaptation sensitivity for the th index, = 1, 2, 3, the 1th index is , the 2th index is , and the 3th index is ; S2: Normalize the base weight base to obtain a weight coefficient , , The calculation formula is: ； In S1-2, and the calculation method, comprising: First, preset the sensitivity reference value, which includes: The safety sensitivity reference value of the 1st index is 0.3 The adaptation sensitivity reference value of the 1st index is 0.7 The adaptation sensitivity reference value of the 1st index is 0.7 The safety sensitivity reference value of the 2nd index is 0.6 The adaptation sensitivity reference value of the 2nd index is 0.6 The adaptation sensitivity reference value of the 2nd index is 0.6; The safety sensitivity reference value of the 3rd index is 0.8 The adaptation sensitivity reference value of the 3rd index is 0.4 The adaptation sensitivity reference value of the 3rd index is 0.4 Then, dynamically fine-tune the sensitivity reference value, which includes: Adjust the sensitivity reference value according to the index fluctuation of the real-time scene, and the calculation formula is: ； wherein, is a safety sensitivity tuning coefficient for the th index, is an adaptation sensitivity tuning coefficient for the th index. If the first If the fluctuation range of an indicator is greater than 50%, then =0.2; if the first If the fluctuation range of an indicator is less than 10%, then =0.2; if the first The fluctuation range of each indicator shall not exceed 50% and shall not be less than 10%.

6. The method of claim 5, wherein the method further comprises: generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method; and generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method. Step 1-3 specifically includes: In step 1-3, if a double-factor dynamic key in the form of a prime number pair is to be generated, two prime numbers are randomly selected from the prime number group corresponding prime number group segment are randomly selected as and form a prime number pair , combined with the dynamic characteristic value to optimize and obtain a prime number pair key , , wherein , , wherein is a function for obtaining the remainder of divided by , and is a function for obtaining the remainder of divided by . and are both two-factor dynamic short keys.

7. The method of claim 6, wherein the method further comprises: generating a prime IP address security two-factor dynamic short key based on the prime IP address security two-factor dynamic short key generation and evaluation control method; and transmitting the prime IP address security two-factor dynamic short key to the user terminal device. Step 2 specifically includes: Computing key update frequency , The time interval between two adjacent double-factor dynamic short keys is generated, if ≥ , it is judged that the key update frequency of the double-factor dynamic short key meets the requirements, if < , it is judged that the key update frequency of the double-factor dynamic short key does not meet the requirements, is the set minimum update frequency threshold. Simultaneously verifying the similarity of the two-factor dynamic short key and the historical two-factor dynamic short key wherein is the current th generated two-factor dynamic short key, is the two-factor dynamic short key generated at the th time, if , it is judged that the similarity of the two-factor dynamic short key meets the requirement, if , it is judged that the similarity of the two-factor dynamic short key does not meet the requirement, wherein is the maximum similarity threshold value set, is the intersection operation, which calculates the number of binary bits that are in the same position and have the same value in the binary representations of and , and is the union operation, which calculates the sum of the number of bits of and the number of bits of , and then subtracts the difference value obtained by subtracting the number of binary bits obtained by the intersection operation from the sum.​ Step 3 specifically includes: Assessing matching degree of double-factor dynamic short key and target IP address wherein is the theoretical maximum value of the function of the remainder obtained by dividing , is , if , it is judged that the matching degree of the double-factor dynamic short key and the target IP address meets the requirements, if , it is judged that the matching degree of the double-factor dynamic short key and the target IP address does not meet the requirements, is the set minimum matching degree threshold, is the set maximum matching degree threshold; meanwhile, the compatibility of the double-factor dynamic short key in data transmission is assessed, which is the adaptation rate of the double-factor dynamic short key to the existing network protocol, if the adaptation rate of the double-factor dynamic short key to the existing network protocol is ≥ 95%, it is judged that the adaptation rate of the double-factor dynamic short key to the existing network protocol meets the requirements, if the adaptation rate of the double-factor dynamic short key to the existing network protocol is < 95%, it is judged that the adaptation rate of the double-factor dynamic short key to the existing network protocol does not meet the requirements.

8. The method of claim 7, wherein the method further comprises: generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method; and generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method. Step 4 specifically includes: Monitoring the failure rate of a two-factor dynamic short key generation process = the number of failures / the total number of generations, wherein the number of failures is the number of times the two-factor dynamic short key generation is unsuccessful, and the total number of generations is the total number of times the two-factor dynamic short key is generated, if if the failure rate of the two-factor dynamic short key generation process is determined to meet the requirements, if if the failure rate of the two-factor dynamic short key generation process is determined to not meet the requirements, wherein is a set maximum failure rate threshold value;​ Evaluate the anti-interference capability index of the double-factor dynamic short key in the current network environment = key effective transmission duration / total transmission duration, if 0.98, it is judged that the anti-interference capability index of the double-factor dynamic short key in the current network environment meets the requirements, if <0.98, it is judged that the failure rate of the double-factor dynamic short key generation process does not meet the requirements.

9. The method of claim 8, wherein the method further comprises: generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method; and generating a prime IP address security two-factor dynamic short key based on the prime number IP address security two-factor dynamic short key generation and evaluation control method. Step 5 specifically includes: Under the condition that the key update frequency of the double-factor dynamic short key, the similarity of the double-factor dynamic short key, the matching degree of the double-factor dynamic short key and the target IP address, the adaptation rate of the double-factor dynamic short key to the existing network protocol, the failure rate of the double-factor dynamic short key generation process and the anti-interference ability of the double-factor dynamic short key in the current network environment meet the requirements, the double-factor dynamic short key is valid, and when the target IP address needs to be encrypted, the valid double-factor dynamic short key is applied to the target IP address to perform encryption; under the condition that one or more of the key update frequency of the double-factor dynamic short key, the similarity of the double-factor dynamic short key, the matching degree of the double-factor dynamic short key and the target IP address, the adaptation rate of the double-factor dynamic short key to the existing network protocol, the failure rate of the double-factor dynamic short key generation process and the anti-interference ability of the double-factor dynamic short key in the current network environment do not meet the requirements, the double-factor dynamic short key is invalid, and under the invalid condition, the double-factor dynamic short key is deleted and returns to step 1 to be re-executed.

Images