# Application of Data Encryption Technology in Computer Network Information Security

Authors: Lifeng Li
Journal: Security and Communication Networks
 (2022)

---

## Abstract

In order to solve the partial optimization problems of the RSA algorithm in computer network security, a method of RSA algorithm optimization based on data encryption was proposed. In the research, the application of data encryption in network information security system was mainly investigated, using RSA as the representative algorithm in the public key cryptosystem. The network information security model on the basis of data encryption was built on the public key cryptosystem in the research. Through the introduction of the RSA algorithm and the corresponding optimization scheme, the experiments for comparison were set up. Through the experiments, the feasibility of the optimization scheme was verified. Experimental results show that the efficiency of the RSA algorithm was about 1.0% to 2% higher than that of the traditional algorithm after a reasonable selection of parameters and the use of an optimized algorithm (also known as the combination algorithm), which improved the efficiency of RSA algorithm to a certain extent and achieved the purpose of improving RSA algorithm. It was proved that the method could effectively improve the budget efficiency of the RSA algorithm and solve the optimization problem of the RSA algorithm in computer network security.


---

## Body

## 1. Introduction

With the rapid development of computer network technology, computer network technology has been widely used in many fields of people’s life. With the emergence of 5G technology and the gradual maturity of WiFi technology, we have entered the era of big data. With the wide application of computer network technology, people’s life is becoming more and more convenient. At the same time, the data information security related to it has also attracted more attention. If the information security problem is not solved in time, it will produce a series of bad consequences, such as the leakage of username, password, and other personal information. So there is an urgent need for a reliable technology to solve the information security problem. At present, the best technology to solve the problem of information security is data encryption technology [1].The development of the Internet has brought unprecedented convenience to people, and it also brings new challenges to people. On the Internet, there are a large number of data in transmission every day, including not only the web content with relatively low-security requirements but also the e-mail and ICQ information with relatively high-security requirements, as well as the highly confidential e-commerce transaction data. Because of all these problems, higher requirements are put forward for data security on the Internet [2]. Since the open nature of the Internet, every Internet user has become the beneficiary of the network and may become the destroyer of the network. Similarly, due to the current disorder of the Internet, the order of the network is basically in a state that cannot be followed. Therefore, it is required to encrypt or decrypt and sign or verify the data transmitted by users on the Internet to ensure their online security.Now, TCP/IP protocol is used in all the communication on the Internet network. Due to the characteristics of the Internet itself and the weakness of the TCP/IP protocol, TCP/IP protocol may go through many intermediate computers and separate networks before the information gets to the destination, which makes transmission information vulnerable to the third party’s interference; hence, there are all kinds of security problems. The network security of data transfer also has different requirements. For example, the transmission of web data is only asked to not be tampered with, while e-mail is asked to not be eavesdropped on or tampered with. And the security of the transmission of sensitive data in electronic commerce has higher requirements. At the same time, there are some data on the Internet, such as personal credit card passwords, personal files, and government documents, which put forward higher requirements for the security of data transmission [3].


## 2. Literature Review

In 2004, Yan and Zhang [4] analyzed and improved the DCF mechanism in the MAC layer of IEEE802.11 protocol, and the improved scheme achieved better channel utilization efficiency and more stable performance through two “virtual competition” stages [4]. In 2005, Yaqin et al. [5] made an in-depth analysis of the vulnerabilities and denial of service attacks of the IEEE802.11 authentication protocol [5]. In 2006, Fauvelle and Somerville [6] proposed a password-based authentication enhancement scheme based on the M.802.1x protocol framework and EAP protocol, which could meet the security requirements of WLAN authentication to a certain extent and effectively enhance the authentication mechanism of 802.11i [6]. In 2010, in order to enhance the security of the IEEE802.1x protocol, a new scheme EAP-DH was proposed [7]. The scheme could effectively prevent fake authenticator from attacking on IEEE802.1x protocol by auditing authenticator identity, which improved the security performance of the protocol [7]. In 2011, Vareda et al. [8] pointed out the source of the 802.1x protocol’s vulnerability to attack, namely the inequality and incompleteness of the protocol state machine and the lack of protection of message integrity and source authenticity. They proposed and implemented an improved scheme of two-way challenge handshake and offline verification [8].However, the security performance of wireless LAN is not as stable as a wired network. At present, the most widely used wireless LAN standard is the 802.11 series. 802.1x makes up for some of the shortcomings of the 802.11 standard, but it still has some shortcomings. The reason is that the protocol lacks bidirectional authentication between client and authenticator and encryption protection of authentication message, and illegal users can use these defects to implement various attacks. There are three main attacks. One is fake authenticator attack, the other is session hijacking attack, and the third is a denial of service attack. To some extent, these security defects have become the bottleneck restricting the development of the wireless network. Improving the security performance based on the wireless network can make wireless remote control technology more safe and practical. But so far, people have not paid attention to the security problems under wireless networks. At present, problems such as illegal wiretapping or information tampering and unauthorized control have not received enough attention. It is just like a remote-controlled bomb, and the remote control is in the hands of unauthorized people [9].In the research, the application of data encryption in network information security system was mainly investigated, using RSA as the representative algorithm in the public key cryptosystem. The network information security model on the basis of data encryption was built on the public key cryptosystem in the research. Through the introduction of the RSA algorithm and the corresponding optimization scheme, the experiments for comparison were set up. Through the experiments, the feasibility of the optimization scheme was verified.


## 3. Research Methods

### 3.1. RSA Algorithm

PKI is an infrastructure based on the public key. RSA algorithm is commonly used in public key system. RSA algorithm can realize data encryption and digital signature, which also can solve the key management problem in single-key algorithm well. But it has a defect in speed. In the research, the RSA algorithm is adopted in the security model to realize data encryption and digital signature. In order to make the RSA algorithm better applied to this model, it is necessary to take some measures to improve the RSA algorithm, so that its encryption and signature speed can be improved. The following is an analysis of RSA security, so as to get some measures to improve the RSA algorithm [10].Theoretically, the security of RSA depends on the difficulty of factoring mode N. This is not true from a strictly technical point of view. And it has not been mathematically proven that decomposition moduli are the best way to attack RSA. The fact is that the factorization of large integers has been a worldwide problem for mathematicians for hundreds of years. Some nonfactorization approaches have been proposed to attack RSA, but none of these approaches are as easy as the factorization of N. Therefore, strictly speaking, the security of RSA is based on the difficulty of solving the inverse of its one-way functions. The security of the inverse of the RSA one-way function is not as high as that of the real factor decomposition modulin. At present, it cannot be proven that the two are equivalent [11]. Many researchers have tried to improve RSA so that its security is equivalent to the factorization moduli n.RSA algorithm has been put forward for more than 20 years, and its wide application proves that the security of the RSA system is quite reliable. However, under certain conditions, the implementation details of RSA will lead to attacks on the RSA algorithm. But these security flaws can be avoided by careful consideration of the details of the implementation of the RSA architecture.The attacks on the RSA algorithm are as follows.(1)
Attack on decomposition modulin of RSADecomposition modulin is the most direct attack method, but also the most difficult method. The attacker can obtain the public key e and module n. If the module n=pq is calculated, the attacker can calculate the medium ϕn=p−1q−1 through p and q and then obtain the decryption key d by ed=lmodϕn. The investigation of big integer decomposition has always been an important topic in the research of number theory and cryptography theory [12].(2)
Attack on chosen-ciphertext of RSAchosen-ciphertext attack is one of the most common and effective attacks against public key algorithms such as RSA. The chosen-ciphertext attack is usually induced by the nature of RSA encryption transforms. There are three common chosen-ciphertext attacks against RSA, including plaintext decryption, arbitration signature cheating, and forged legitimate signature [13].(3)
Attack on the small exponent of RSAThis type of attack specifically targets the details of RSA algorithm implementation. Smalle and d can accelerate the speed of encryption and signature verification, which requires small storage space. However, if e and d are too small, they are vulnerable to small exponent attack, including low encryption exponent attacks and low decryption exponent attacks [14].For example, for encryption keye, if the messages are the same, e messages can be used for low encryption exponent attack. Suppose the three encryption keys in the system all choose 3, each using a different module n1, n2, and n3.If a user wants to send the same plaintext messagex to three users, the encrypted ciphertext is as follows:(1)y1=x3modn1,x<n1,y2=x3modn2,x<n2,y3=x3modn3,x<n3.In general,n1, n2, and n3 are prime. According to the Chinese remainder theorem, y=x3modn1n2n3 can be obtained by using y1.y2, and y3. < n1n2n3 can be obtained due to x < n1, x < n2, and x < n3. So x=y1/3 can be calculated. The plaintext message X is filled by independent random numbers, so that xemodn≠xe can effectively resist a small exponent attack.


### 3.2. Improved RSA Algorithm

In modern cryptography, the public key cryptosystem plays an important role. RSA cryptosystem, as a representative of the public key cryptosystem, is widely used in various fields of modern information security technology. However, the power residual calculation adopted by this algorithm is time-consuming, which has been a bottleneck restricting its wide application [15].Both encryption and decryption in RSA involve calculating a power of an integer and then modulon. If the integer is exponentiated first and then modulo n is performed, the intermediate result will be extremely large. Fortunately, a property of modulo operations can be exploited.(2)amodn×bmodnmodn=a×bmodn.Thus, a modulon operation can be performed on the intermediate result, which makes the calculation practical.Another consideration is the efficiency of exponentials since it is possible to encounter very large exponents in RSA. For example, to computex16, the direct method requires exact multiplication.(3)x16=x×x×x×x×x×x×x×x×x×x×x×x×x×x×x×x.However, the same final result can be obtained with just four multiplications. If you repeatedly square the partial results each time,x2, x4, x8, x16 can be obtained.More generally, ifam will be calculated, where a and m are integers. If m is expressed as a binary number bkbk−1, …, b1b0, then(4)m=∑2i,Thus:am=a∑2i=∏a2i,ammodn=∏a2imodn=∏a2imodn.Therefore, a square modulo algorithm can be constructed, which adopts the iterative method of repeated square modulo and multiplication modulo as described above. The specific implementation steps are as follows (takinga=gxmodp as an example):(1)
Express the decimal numberx as a binary number(5)x=xtxt−1xt−2…x1x0.(2)
Set the initial value ofa is 1, namely a = l(3)
Fori=t,t−1,t−2,…1,0 repeat i and ii(i)
a=a2modp(ii)
ifxi=1, then a=a∗gmodp(4)
End. Get the resulta0It can be seen that the algorithm modulo p in each iteration to control the size of the number of intermediate results. Each iteration needs at most 2 times of multiplication and 2 times of modulo, a total oflog2x iterations. Obviously, 2log2x times of multiplication and 2log2x times of moduli are the key factors affecting the implementation speed of the algorithm [16]. In order to further improve the speed of the above algorithm, SMM algorithm is combined with it.SMM is a fast algorithm that uses the feature of multiplicative symmetry to reduce multiplication and moduli calculation in RSA encryption and decryption. RSA encryption is the rest of the process for plaintext.(6)y=Men.〈〉n denotes the modulo n of the numbers in brackets. The above RSA algorithm represents the exponent e as a t-bit binary number and turns the power residue into a series of iterations of multiplicative congruence (taking a=gxmodp as an example). From the above discussion, it is known that each iteration must have a=a2modp and possibly a=a∗gmodp.SMM algorithm is a conditional substitution of multipliers in each iteration. The specific substitution situation is as follows. Ifai −1 represents the result of iteration at step (i − l), then iteration is performed at step i. If ai −1 or g<n−1/2, then the original number is kept the same. But if ai −1 or g>n−l/2, then use n−ai−1 or n−g to replace ai −1 or g [17].Combining the above RSA algorithm with the SMM method, although the times of multiplication and moduli are not changed, it can reduce the absolute values of partial multipliers and multipliers. So the algorithm is improved to some extent.


#### 3.2.1. System Structure of RSA Optimization Algorithm

32-bit computers can represent integers in the range of −231—231 − 1 (64 bit). And the RSA algorithm adopted in the research requires large primes of at least 100 bit. Therefore, in the implementation of this program, the first thing to think of is how to store these large numbers and how to establish the operation library of these large numbers. This large number is usually represented by a large array, which can be treated as a binary stream, with different bit operations. Currently, on 32-bit systems, an array of type unsigned long can be defined because unsigned long is 32 bit. If a 1024-bit key will be generated, the dimension of this array should be set to 32. Figure 1 shows the main flow chart of the program [18].Figure 1
Flow chart of the main program.To figure out how to getn, e, and d, the program should first generate a big prime e, then a prime q, and guarantee that e and q − 1 are mutually prime. And similarly, it generates a big prime p, guarantees that e and p − 1 are mutually prime, then calculates n=p∗q, and compares n and e. If e≥n, go back to the beginning. If e<n, then n and e are successfully found. And d can be calculated by the formula d=e−1modp−1∗q−1. Figure 2 shows a flow diagram of how to get these numbers.Figure 2
Flow chart of GETn, e, d.Then, what is the specific process of GETe, GETq, and GETp in Figure2? Because they are randomly generated large prime numbers, one algorithm can be used uniformly. First, a large number is randomly generated, and then, this large number is set to make sure it is large enough and odd. Then, whether the number was prime or not is determined. And, the method is Rabin-Miller probabilistic primality test [19]. The process is shown in Figure 3.Figure 3
Flow chart of generating large prime numbers.


## 3.1. RSA Algorithm

PKI is an infrastructure based on the public key. RSA algorithm is commonly used in public key system. RSA algorithm can realize data encryption and digital signature, which also can solve the key management problem in single-key algorithm well. But it has a defect in speed. In the research, the RSA algorithm is adopted in the security model to realize data encryption and digital signature. In order to make the RSA algorithm better applied to this model, it is necessary to take some measures to improve the RSA algorithm, so that its encryption and signature speed can be improved. The following is an analysis of RSA security, so as to get some measures to improve the RSA algorithm [10].Theoretically, the security of RSA depends on the difficulty of factoring mode N. This is not true from a strictly technical point of view. And it has not been mathematically proven that decomposition moduli are the best way to attack RSA. The fact is that the factorization of large integers has been a worldwide problem for mathematicians for hundreds of years. Some nonfactorization approaches have been proposed to attack RSA, but none of these approaches are as easy as the factorization of N. Therefore, strictly speaking, the security of RSA is based on the difficulty of solving the inverse of its one-way functions. The security of the inverse of the RSA one-way function is not as high as that of the real factor decomposition modulin. At present, it cannot be proven that the two are equivalent [11]. Many researchers have tried to improve RSA so that its security is equivalent to the factorization moduli n.RSA algorithm has been put forward for more than 20 years, and its wide application proves that the security of the RSA system is quite reliable. However, under certain conditions, the implementation details of RSA will lead to attacks on the RSA algorithm. But these security flaws can be avoided by careful consideration of the details of the implementation of the RSA architecture.The attacks on the RSA algorithm are as follows.(1)
Attack on decomposition modulin of RSADecomposition modulin is the most direct attack method, but also the most difficult method. The attacker can obtain the public key e and module n. If the module n=pq is calculated, the attacker can calculate the medium ϕn=p−1q−1 through p and q and then obtain the decryption key d by ed=lmodϕn. The investigation of big integer decomposition has always been an important topic in the research of number theory and cryptography theory [12].(2)
Attack on chosen-ciphertext of RSAchosen-ciphertext attack is one of the most common and effective attacks against public key algorithms such as RSA. The chosen-ciphertext attack is usually induced by the nature of RSA encryption transforms. There are three common chosen-ciphertext attacks against RSA, including plaintext decryption, arbitration signature cheating, and forged legitimate signature [13].(3)
Attack on the small exponent of RSAThis type of attack specifically targets the details of RSA algorithm implementation. Smalle and d can accelerate the speed of encryption and signature verification, which requires small storage space. However, if e and d are too small, they are vulnerable to small exponent attack, including low encryption exponent attacks and low decryption exponent attacks [14].For example, for encryption keye, if the messages are the same, e messages can be used for low encryption exponent attack. Suppose the three encryption keys in the system all choose 3, each using a different module n1, n2, and n3.If a user wants to send the same plaintext messagex to three users, the encrypted ciphertext is as follows:(1)y1=x3modn1,x<n1,y2=x3modn2,x<n2,y3=x3modn3,x<n3.In general,n1, n2, and n3 are prime. According to the Chinese remainder theorem, y=x3modn1n2n3 can be obtained by using y1.y2, and y3. < n1n2n3 can be obtained due to x < n1, x < n2, and x < n3. So x=y1/3 can be calculated. The plaintext message X is filled by independent random numbers, so that xemodn≠xe can effectively resist a small exponent attack.


## 3.2. Improved RSA Algorithm

In modern cryptography, the public key cryptosystem plays an important role. RSA cryptosystem, as a representative of the public key cryptosystem, is widely used in various fields of modern information security technology. However, the power residual calculation adopted by this algorithm is time-consuming, which has been a bottleneck restricting its wide application [15].Both encryption and decryption in RSA involve calculating a power of an integer and then modulon. If the integer is exponentiated first and then modulo n is performed, the intermediate result will be extremely large. Fortunately, a property of modulo operations can be exploited.(2)amodn×bmodnmodn=a×bmodn.Thus, a modulon operation can be performed on the intermediate result, which makes the calculation practical.Another consideration is the efficiency of exponentials since it is possible to encounter very large exponents in RSA. For example, to computex16, the direct method requires exact multiplication.(3)x16=x×x×x×x×x×x×x×x×x×x×x×x×x×x×x×x.However, the same final result can be obtained with just four multiplications. If you repeatedly square the partial results each time,x2, x4, x8, x16 can be obtained.More generally, ifam will be calculated, where a and m are integers. If m is expressed as a binary number bkbk−1, …, b1b0, then(4)m=∑2i,Thus:am=a∑2i=∏a2i,ammodn=∏a2imodn=∏a2imodn.Therefore, a square modulo algorithm can be constructed, which adopts the iterative method of repeated square modulo and multiplication modulo as described above. The specific implementation steps are as follows (takinga=gxmodp as an example):(1)
Express the decimal numberx as a binary number(5)x=xtxt−1xt−2…x1x0.(2)
Set the initial value ofa is 1, namely a = l(3)
Fori=t,t−1,t−2,…1,0 repeat i and ii(i)
a=a2modp(ii)
ifxi=1, then a=a∗gmodp(4)
End. Get the resulta0It can be seen that the algorithm modulo p in each iteration to control the size of the number of intermediate results. Each iteration needs at most 2 times of multiplication and 2 times of modulo, a total oflog2x iterations. Obviously, 2log2x times of multiplication and 2log2x times of moduli are the key factors affecting the implementation speed of the algorithm [16]. In order to further improve the speed of the above algorithm, SMM algorithm is combined with it.SMM is a fast algorithm that uses the feature of multiplicative symmetry to reduce multiplication and moduli calculation in RSA encryption and decryption. RSA encryption is the rest of the process for plaintext.(6)y=Men.〈〉n denotes the modulo n of the numbers in brackets. The above RSA algorithm represents the exponent e as a t-bit binary number and turns the power residue into a series of iterations of multiplicative congruence (taking a=gxmodp as an example). From the above discussion, it is known that each iteration must have a=a2modp and possibly a=a∗gmodp.SMM algorithm is a conditional substitution of multipliers in each iteration. The specific substitution situation is as follows. Ifai −1 represents the result of iteration at step (i − l), then iteration is performed at step i. If ai −1 or g<n−1/2, then the original number is kept the same. But if ai −1 or g>n−l/2, then use n−ai−1 or n−g to replace ai −1 or g [17].Combining the above RSA algorithm with the SMM method, although the times of multiplication and moduli are not changed, it can reduce the absolute values of partial multipliers and multipliers. So the algorithm is improved to some extent.


### 3.2.1. System Structure of RSA Optimization Algorithm

32-bit computers can represent integers in the range of −231—231 − 1 (64 bit). And the RSA algorithm adopted in the research requires large primes of at least 100 bit. Therefore, in the implementation of this program, the first thing to think of is how to store these large numbers and how to establish the operation library of these large numbers. This large number is usually represented by a large array, which can be treated as a binary stream, with different bit operations. Currently, on 32-bit systems, an array of type unsigned long can be defined because unsigned long is 32 bit. If a 1024-bit key will be generated, the dimension of this array should be set to 32. Figure 1 shows the main flow chart of the program [18].Figure 1
Flow chart of the main program.To figure out how to getn, e, and d, the program should first generate a big prime e, then a prime q, and guarantee that e and q − 1 are mutually prime. And similarly, it generates a big prime p, guarantees that e and p − 1 are mutually prime, then calculates n=p∗q, and compares n and e. If e≥n, go back to the beginning. If e<n, then n and e are successfully found. And d can be calculated by the formula d=e−1modp−1∗q−1. Figure 2 shows a flow diagram of how to get these numbers.Figure 2
Flow chart of GETn, e, d.Then, what is the specific process of GETe, GETq, and GETp in Figure2? Because they are randomly generated large prime numbers, one algorithm can be used uniformly. First, a large number is randomly generated, and then, this large number is set to make sure it is large enough and odd. Then, whether the number was prime or not is determined. And, the method is Rabin-Miller probabilistic primality test [19]. The process is shown in Figure 3.Figure 3
Flow chart of generating large prime numbers.


## 3.2.1. System Structure of RSA Optimization Algorithm

32-bit computers can represent integers in the range of −231—231 − 1 (64 bit). And the RSA algorithm adopted in the research requires large primes of at least 100 bit. Therefore, in the implementation of this program, the first thing to think of is how to store these large numbers and how to establish the operation library of these large numbers. This large number is usually represented by a large array, which can be treated as a binary stream, with different bit operations. Currently, on 32-bit systems, an array of type unsigned long can be defined because unsigned long is 32 bit. If a 1024-bit key will be generated, the dimension of this array should be set to 32. Figure 1 shows the main flow chart of the program [18].Figure 1
Flow chart of the main program.To figure out how to getn, e, and d, the program should first generate a big prime e, then a prime q, and guarantee that e and q − 1 are mutually prime. And similarly, it generates a big prime p, guarantees that e and p − 1 are mutually prime, then calculates n=p∗q, and compares n and e. If e≥n, go back to the beginning. If e<n, then n and e are successfully found. And d can be calculated by the formula d=e−1modp−1∗q−1. Figure 2 shows a flow diagram of how to get these numbers.Figure 2
Flow chart of GETn, e, d.Then, what is the specific process of GETe, GETq, and GETp in Figure2? Because they are randomly generated large prime numbers, one algorithm can be used uniformly. First, a large number is randomly generated, and then, this large number is set to make sure it is large enough and odd. Then, whether the number was prime or not is determined. And, the method is Rabin-Miller probabilistic primality test [19]. The process is shown in Figure 3.Figure 3
Flow chart of generating large prime numbers.


## 4. Results Analysis

### 4.1. Development Environment

The hardware environment used in this experiment is CPU PIII800, 192M memory, 20G hard disk, 15′ monitor, and the operating system with windows 2000 running results.


### 4.2. Test Results

The test text file is test.txt, and the text content is 123456789 test. Because there may be machine factors affecting the encryption speed, the optimized RSA algorithm and SMM method combined with the algorithm (now temporarily called the combination algorithm) are adopted. The traditional algorithm and the combination algorithm are tested for three times, and the average time is used to compare the operating efficiency of the algorithm [20]. Considering the performance of the computer used in the experiment, large numbers cannot be used to carry out the experiment. The followings are the comparison between the traditional algorithm and the combination algorithm for 40, 80, and 100 moduli as shown in Tables 1–3, Figures 4–6.Table 1
Comparison between the traditional algorithm and the combination algorithm using 40 moduli.
Operation time (40 moduli)Time required for traditional algorithm (s)Time required for combination algorithm (s)Encryption operationDecryption operationEncryption operationDecryption operationThe first time2.7542.8842.6942.794The second time2.7542.9052.6942.884The third time2.7542.9142.7842.884The fourth time2.7642.9142.7042.794The fifth time2.7542.8842.6842.886The average time2.7652.8982.6942.894The improved encryption efficiency on average1.09%The improved decryption efficiency on average1.23%Table 2
Comparison between the traditional algorithm and the combination algorithm using 80 moduli.
Operation time (80 moduli)Time required for traditional algorithm (s)Time required for combination algorithm (s)Encryption operationDecryption operationEncryption operationDecryption operationThe first time17.89518.51317.63518.49The second time17.95818.50317.81518.496The third time17.88118.58217.83118.492The fourth time17.70518.50317.75918.492The fifth time17.92818.57217.82218.482The average time17.86218.53317.76218.493The improved encryption efficiency on average1.326%The improved decryption efficiency on average1.32%Table 3
Comparison between the traditional algorithm and the combination algorithm using 100 moduli.
Operation time (100 moduli)Time required for traditional algorithm (s)Time required for combination algorithm (s)Encryption operationDecryption operationEncryption operationDecryption operationThe first time35.47439.65835.46839.588The second time35.42439.78234.58939.536The third time35.48539.69834.98639.552The fourth time35.49239.72434.76539.568The fifth time35.48539.75635.26939.562The average time35.47639.73135.08339.569The improved encryption efficiency on average1.86%The improved decryption efficiency on average1.19%Figure 4
Histogram of the comparison between the traditional algorithm and the combination algorithm using 40 moduli.Figure 5
Histogram of the comparison between the traditional algorithm and the combination algorithm using 80 moduli.Figure 6
Histogram of the comparison between the traditional algorithm and the combination algorithm using 100 moduli.From the above data, it can be seen that the operation efficiency of the RSA algorithm is about 1.0% to 2% higher than that of the traditional algorithm after the reasonable selection of parameters and the use of an optimized algorithm (also known as the combination algorithm), which improves the operation efficiency of RSA algorithm to a certain extent and achieves the purpose of improving RSA algorithm [21].In the research, the application of data encryption in network information security system was mainly investigated. The algorithm used was RSA, which is the representative algorithm in the public key cryptosystem. In the research, the network information security model based on data encryption was based on the public key cryptosystem. Public key cryptography meets the requirements of information security. RSA algorithm in public key cryptography plays an important role in cryptography. RSA cryptography has the following properties.(1)
RSA algorithm is perfect (it can be used for both data encryption and digital signature), with good security and being easy to implement and understand. RSA system can be used as the realization basis of the algorithm and scheme of the subject, which can effectively make use of the advantages of the RSA system [22].(2)
RSA is the most representative public key cryptosystem. The characteristics of the RSA system make it become a standard template for the research of public key cryptosystem.(3)
RSA algorithm has high efficiency, and its ciphertext inflation rate is about 1. The so-called ciphertext inflation rate refers to the ratio of specified text length to ciphertext length [23–25].


## 4.1. Development Environment

The hardware environment used in this experiment is CPU PIII800, 192M memory, 20G hard disk, 15′ monitor, and the operating system with windows 2000 running results.


## 4.2. Test Results

The test text file is test.txt, and the text content is 123456789 test. Because there may be machine factors affecting the encryption speed, the optimized RSA algorithm and SMM method combined with the algorithm (now temporarily called the combination algorithm) are adopted. The traditional algorithm and the combination algorithm are tested for three times, and the average time is used to compare the operating efficiency of the algorithm [20]. Considering the performance of the computer used in the experiment, large numbers cannot be used to carry out the experiment. The followings are the comparison between the traditional algorithm and the combination algorithm for 40, 80, and 100 moduli as shown in Tables 1–3, Figures 4–6.Table 1
Comparison between the traditional algorithm and the combination algorithm using 40 moduli.
Operation time (40 moduli)Time required for traditional algorithm (s)Time required for combination algorithm (s)Encryption operationDecryption operationEncryption operationDecryption operationThe first time2.7542.8842.6942.794The second time2.7542.9052.6942.884The third time2.7542.9142.7842.884The fourth time2.7642.9142.7042.794The fifth time2.7542.8842.6842.886The average time2.7652.8982.6942.894The improved encryption efficiency on average1.09%The improved decryption efficiency on average1.23%Table 2
Comparison between the traditional algorithm and the combination algorithm using 80 moduli.
Operation time (80 moduli)Time required for traditional algorithm (s)Time required for combination algorithm (s)Encryption operationDecryption operationEncryption operationDecryption operationThe first time17.89518.51317.63518.49The second time17.95818.50317.81518.496The third time17.88118.58217.83118.492The fourth time17.70518.50317.75918.492The fifth time17.92818.57217.82218.482The average time17.86218.53317.76218.493The improved encryption efficiency on average1.326%The improved decryption efficiency on average1.32%Table 3
Comparison between the traditional algorithm and the combination algorithm using 100 moduli.
Operation time (100 moduli)Time required for traditional algorithm (s)Time required for combination algorithm (s)Encryption operationDecryption operationEncryption operationDecryption operationThe first time35.47439.65835.46839.588The second time35.42439.78234.58939.536The third time35.48539.69834.98639.552The fourth time35.49239.72434.76539.568The fifth time35.48539.75635.26939.562The average time35.47639.73135.08339.569The improved encryption efficiency on average1.86%The improved decryption efficiency on average1.19%Figure 4
Histogram of the comparison between the traditional algorithm and the combination algorithm using 40 moduli.Figure 5
Histogram of the comparison between the traditional algorithm and the combination algorithm using 80 moduli.Figure 6
Histogram of the comparison between the traditional algorithm and the combination algorithm using 100 moduli.From the above data, it can be seen that the operation efficiency of the RSA algorithm is about 1.0% to 2% higher than that of the traditional algorithm after the reasonable selection of parameters and the use of an optimized algorithm (also known as the combination algorithm), which improves the operation efficiency of RSA algorithm to a certain extent and achieves the purpose of improving RSA algorithm [21].In the research, the application of data encryption in network information security system was mainly investigated. The algorithm used was RSA, which is the representative algorithm in the public key cryptosystem. In the research, the network information security model based on data encryption was based on the public key cryptosystem. Public key cryptography meets the requirements of information security. RSA algorithm in public key cryptography plays an important role in cryptography. RSA cryptography has the following properties.(1)
RSA algorithm is perfect (it can be used for both data encryption and digital signature), with good security and being easy to implement and understand. RSA system can be used as the realization basis of the algorithm and scheme of the subject, which can effectively make use of the advantages of the RSA system [22].(2)
RSA is the most representative public key cryptosystem. The characteristics of the RSA system make it become a standard template for the research of public key cryptosystem.(3)
RSA algorithm has high efficiency, and its ciphertext inflation rate is about 1. The so-called ciphertext inflation rate refers to the ratio of specified text length to ciphertext length [23–25].


## 5. Conclusions

After nearly a year of investigation, a deep understanding of the importance of network information security and its implementation methods is obtained. As a cutting-edge technology, the research of network data encryption needs rich theoretical knowledge as the foundation. In the whole process of network data encryption or signature transmission, the weakest link is not the strength of the encryption signature algorithm (of course, only for general trade secrets here) but often lies in the process of key storage and release. Whether a network data encryption system is secure or not, the practical test standard is not to prove the difficulty of cracking the algorithm in theory. This is because of the rapid development of computer technology, the average computing performance of a computer improves significantly and quickly. Problems that previously took thousands of years to solve in theoretical calculations can now be solved in months with the improved computer performance.



---

*Source: 7472205-2022-08-02.xml*