# Application of Data Encryption Technology in Network Information Security Sharing

Authors: Dongzhi Xu; Wenjuan Zheng
Journal: Security and Communication Networks
 (2022)

---

## Abstract

In order to solve the problem of user information insecurity in the process of network information security sharing, this study proposes a data encryption technology based on network information security sharing. This method applies the data encryption technology to the computer network security protection, which can not only improve the computer network security but also protect the user data information security and provide users with more efficient and high-quality computer network services. The experimental results show that it takes about 2.35 seconds to generate a 1024-bit key pair. It takes about 12.29 seconds to encrypt a 2.1 m text document with a 1024-bit public key and about 561 seconds to decrypt a 2.1 m text document.Conclusion. The data encryption technology based on network information security sharing can effectively solve the problem of user information insecurity in the process of network information security sharing.


---

## Body

## 1. Introduction

With the continuous development of science and technology, people are more and more widely using electronic computers. Today’s era is the information age, and computers are more and more used in people’s lives and studies. People are becoming increasingly inseparable from computers, but computers also have many shortcomings resulting in endless network security problems, making the maintenance of network security by technicians a difficult task [1]. Therefore, through the implementation of computer security work, the computer network environment will be more secured and computer data encryption technology will be developed [2].With the development of the times, the progress of the society, and the rapid rise of the economy, China has seen changes and optimization in various fields, especially in the field of information technology, where network interaction is very frequent. With the continuous expansion of the openness of the network, people’s access to information and data has also been substantially improved, but the subsequent problem is the theft risk of network information and data. Therefore, people pay more and more attention to the security of their privacy in the network environment [3]. Data encryption is now more widely known as a result of this demand..Based on this background, data information also need to have strong confidentiality and security, which can not only effectively prevent illegal elements from stealing and tampering with data information but also strengthen users’ security experience in the process of data information transmission. Therefore, China should continue to study data encryption technology and continue to try and optimize it in practice, so as to seek security application channels in today’s computer environment [4]. Due to the influence of viruses, hackers, and other factors, computer network security incidents have shown a high incidence trend in recent years, ranging from loss and leakage of data information to network paralysis, affecting normal applications. Applying data encryption technology to computer network security protection has an important application value [5].


## 2. Literature Review

Information is a macroconcept, which is composed of data. In other words, data appear as a carrier. Therefore, we must take certain measures to protect data security and avoid data theft, destruction, or intentional modification. The best way to solve the problem of data security is to prevent data leakage through file encryption [6]. In other words, even if the file is stolen by hackers and other illegal users, it does not matter because the file is encrypted and cannot be correctly interpreted without the corresponding key. Therefore, data must be encrypted during network transmission [7]. Sometimes, even if the files are not transmitted in the network communication, users also need to encrypt some of their files because everyone has a lot of keys and private information that they do not want to be known or watched by others [8]. The identity authentication technology is implemented by software technology. It is a technology that can determine the identity of the users [9]. Before transmission, the data are encrypted and converted into ciphertext and then transmitted. This can ensure that the data users cannot get the correct information even if it is intercepted or copied during transportation. The introduction of encryption can maximize the security of data transmission in networked systems. It can be said that using technical means to encrypt data is the best processing method that can be thought of at this stage. With the rapid development of the Internet, people can conduct various transactions and exchanges on the Internet, which makes our life more interesting and our work more efficient. However, whether it is an old object or a new object, the two sides are always the same, so it is the same. For example, the problem of information security on the Internet has brought a lot of trouble to people. In recent years, it has been repeatedly exposed that personal information, personal privacy, or enterprise data information have been leaked, and this leakage is increasing every year.Generally speaking, the leakage of network information has the following factors:(1)
Stealing information: in the process of data transmission, the gateway or router is a very dangerous node, where hackers can intercept the transmitted data information. If the data are not encrypted on the network, it will lead to information leakage.(2)
Tampering with information: if the data are not encrypted on the network, the intruder can tamper with the data information after intercepting the information, so that the data receiver cannot obtain the real information.(3)
Impersonate authorized users: through the means of stealing data information and then modifying the information, pretend to be an authorized user to enter the system.(4)
Malicious damage: after entering the system as an authorized user, an unauthorized user can maliciously destroy the system information, and the consequences are very serious.In our life, data encryption becomes more and more important, especially considering that a large number of transactions and data transmission occur on the Internet every day. At present, data encryption is the most effective way to protect information security. Through encryption technology, achieve the concealment of important information and protect the transmission security of data information. Therefore, data encryption is extremely necessary and indispensable in ensuring data security.On the basis of current research, this study proposes a data encryption technology based on network information security sharing. The use of data encryption technology requires setting a password. This encryption method has also been accepted and used by the public. This technology guarantees the security of people when using the network, reduces the insecurity and instability of the network in the communication process, reduces the possibility of insecurity when consuming the network, and guarantees the purchased network services that can be used independently and the privileges that can be shared with people. From the operational point of view, this technology can ensure the safety and continuous operation of network communication. This technology is protected in the process. By improving the effectiveness of network communication during use, the equipment can be more secure and stable during operation, so as to meet the needs of customers for consumer services and further develop the network communication technology [10].


## 3. Research Methods

### 3.1. System Safety Design

(1)
Network transmission encryption [11]: prevent someone from illegally obtaining the reported information and content in transmission by means of network eavesdropping (it is obvious that if we do not encrypt, it will be very dangerous). We must highly encrypt the data in transmission to ensure that everything is safe and that even if it is eavesdropped, it is “inaudible” (because it cannot be decrypted and understood). One-way encryption that cannot be reversed is adopted for passwords and other authentication information.(2)
Data file encryption [12]: to prevent the illegal acquisition of reported information, all reported data files must be encrypted with file encryption software based on the RSA encryption algorithm, and the downloaded data files must be decrypted with a private key.(3)
Data storage security [13]: data related to the reported content is encrypted and stored in the database to prevent data leakage caused by database security or internal personnel violations. The database permissions are strictly managed. The database is only allowed to be accessed locally on the server to ensure that the data will not be leaked due to problems such as database password theft.(4)
Login security: the number of password errors of the specified user cannot exceed 3 times in a single day; otherwise, the account will be locked. Through this measure, it can avoid exhaustively trying out the user’s password.(5)
Log management: all user operations in the system are logged. It mainly records the basic information of user name, login time, operation module, data update, and system exit.(6)
System management security [14]: the highest authority administrator has maintenance administrator authority, and the system administrator account can only log in on the server.


#### 3.1.1. System Database

The goal of database design is to model the business data in the functional modules of the system and design the data tables and the relationship between them, so as to support the operation of business functions [15]. The E-R diagram of the network reporting system is shown in Figure 1. Here, only some entity relationships are listed for demonstration [16].Figure 1
Database table.


#### 3.1.2. Solving Single Point of Failure

To avoid a single point of failure, the solution is shown in Figure2.Figure 2
Fully realize no single point.For the abovementioned three modules, the master and slave are synchronized in real-time. Once the master or slave fails, there will always be another replacement. There will be no downtime and other single points of failure [17].


### 3.2. Working Principle of the RSA Algorithm

RSA is a kind of asymmetric key, and it is a very typical one. Here, it is its working principle: first, a key pair containing public and private keys should be generated [18]. The public key, as the name suggests, is public and available to all. It is used for encryption, and then, the encrypted data are transmitted to the public key publisher [19]. The private key is private. It is only owned by the publisher and will not be made public. It is the core secret used to decrypt data [20]. The private key cannot be calculated only by getting the key. Because the private key is confidential, the data encrypted with the public key are secure and can reach the receiver only. At the same time, in order to be more secure and improve the strength of encryption, the RSA key length should not be too short; otherwise, its reliability will be affected. Generally, we set it to 512 or 1024 bits, as shown in Figure 3.Figure 3
Diagram of the RSA basic operation process.The RSA algorithm is an asymmetric and very secure algorithm. From the above, the biggest feature of this algorithm is that it uses completely different keys for encryption and decryption. The public key encryption key, private key decryption key, and thec principle of encryption and decryption of the RSA algorithm are as follows:Public key PR:n: the product of two prime numbers p and q; e: the product of (p − 1) and (q − 1) is mutually prime;Private key PU:n: product of two prime numbers P and Q(1)d=e−1modp−1q−1.Encryption:(2)c≡memodn.Decrypt:(3)m≡cdmodn.The specific process is as follows:(1)
Select two different prime numbersp,q with long enough digits;(2)
Calculate the value ofn according to the formula n=p∗q;(3)
Calculatep−1∗q−1, whose product is calculated as fn (p, q are unknowable);(4)
Specify an integere greater than 1, which must be less than p−1∗q−1 and mutually prime with it, usually 3 or 17 or 65537;(5)
Through the formulad∗e≡1modfn, e and fn are known; we can find d. mod is a remainder operation, that is, the value of the remainder of B to C is equal to 1;(6)
n and e are selected by us to be used as public keys, and n and d are selected by us to be used as private keys (public keys e and n are public, and d must be kept a secret);(7)
The encryption calculation method isC≡Memodn, when the length is long, segmentation operation is required;(8)
The decryption calculation method isM≡Cdmodn, and the relationship between plaintext length and key length in the RSA algorithm is described in the algorithm implementation chapter.It is known from the above thate and nare public keys, which are known by everyone and can be used for encryption. However, d cannot be obtained from e and n, which is supported by its basic theory. Therefore, only those who are legal can have d and only those who are private can decrypt [21].


#### 3.2.1. Design Public KeyKU and Private Key KR

Here, we specify the values ofp and q, which are smaller for ease of calculation. Then, p is specified as 3, and q is specified as 11. Obviously, the value of n is 33, and the value of p−1q−1 is 20. For this purpose, we write it as fn. The value of is also taken as small as possible, so it is taken as 3 [22]. After the above values are clear, the evaluation formula of d is d∗e≡1modfn. Thus, the value of d can be calculated. Since the value is small, we can find it through trial calculation. Table 1 provides the trial calculation results.Table 1
Trial calculation process for obtainingd value.
Dd∗ed∗e≡1modfn13326939124121251515618187211Through the trial calculation in the above table, we find that whend = 7, the identity is true. Take the value of d as 7, so you can get the private key. The two values of the private key are 7 and 33. The two values KU of the corresponding public key are 3 and 33. So far, we have generated a pair of key pairs. Let us verify it.


#### 3.2.2. English Digitalization

Convert the plaintext information into numbers, assuming a transformation rule of letters and code values. The corresponding relationship assumed in this study is shown in Table2.Table 2
Comparison table of transformation between letters and code values.
Letterabcdefghijk1mCode value01020304050607080910111213LetternopqrstuvwxyzCode value14151617181920212223242526It can be seen from the abovementioned table that the digital codes of English keys are 11, 05, and 25.


#### 3.2.3. Plaintext Encryption

The user transforms the information obtained in the second step into ciphertext that others cannot read through the encryption key (3, 33). The ciphertext after transformation is obtained fromC≡Memodn: 11,31,16.


#### 3.2.4. Ciphertext Decryption

When we get the ciphertext, we perform transformation processing according to the formulaM≡Cdmodn, that is, decryption, that is, we can get the digital coding information of the decrypted plaintext: 11,05,25. Find the corresponding letters according to Table 2, and you can get the plaintext KEY [23].


## 3.1. System Safety Design

(1)
Network transmission encryption [11]: prevent someone from illegally obtaining the reported information and content in transmission by means of network eavesdropping (it is obvious that if we do not encrypt, it will be very dangerous). We must highly encrypt the data in transmission to ensure that everything is safe and that even if it is eavesdropped, it is “inaudible” (because it cannot be decrypted and understood). One-way encryption that cannot be reversed is adopted for passwords and other authentication information.(2)
Data file encryption [12]: to prevent the illegal acquisition of reported information, all reported data files must be encrypted with file encryption software based on the RSA encryption algorithm, and the downloaded data files must be decrypted with a private key.(3)
Data storage security [13]: data related to the reported content is encrypted and stored in the database to prevent data leakage caused by database security or internal personnel violations. The database permissions are strictly managed. The database is only allowed to be accessed locally on the server to ensure that the data will not be leaked due to problems such as database password theft.(4)
Login security: the number of password errors of the specified user cannot exceed 3 times in a single day; otherwise, the account will be locked. Through this measure, it can avoid exhaustively trying out the user’s password.(5)
Log management: all user operations in the system are logged. It mainly records the basic information of user name, login time, operation module, data update, and system exit.(6)
System management security [14]: the highest authority administrator has maintenance administrator authority, and the system administrator account can only log in on the server.


### 3.1.1. System Database

The goal of database design is to model the business data in the functional modules of the system and design the data tables and the relationship between them, so as to support the operation of business functions [15]. The E-R diagram of the network reporting system is shown in Figure 1. Here, only some entity relationships are listed for demonstration [16].Figure 1
Database table.


### 3.1.2. Solving Single Point of Failure

To avoid a single point of failure, the solution is shown in Figure2.Figure 2
Fully realize no single point.For the abovementioned three modules, the master and slave are synchronized in real-time. Once the master or slave fails, there will always be another replacement. There will be no downtime and other single points of failure [17].


## 3.1.1. System Database

The goal of database design is to model the business data in the functional modules of the system and design the data tables and the relationship between them, so as to support the operation of business functions [15]. The E-R diagram of the network reporting system is shown in Figure 1. Here, only some entity relationships are listed for demonstration [16].Figure 1
Database table.


## 3.1.2. Solving Single Point of Failure

To avoid a single point of failure, the solution is shown in Figure2.Figure 2
Fully realize no single point.For the abovementioned three modules, the master and slave are synchronized in real-time. Once the master or slave fails, there will always be another replacement. There will be no downtime and other single points of failure [17].


## 3.2. Working Principle of the RSA Algorithm

RSA is a kind of asymmetric key, and it is a very typical one. Here, it is its working principle: first, a key pair containing public and private keys should be generated [18]. The public key, as the name suggests, is public and available to all. It is used for encryption, and then, the encrypted data are transmitted to the public key publisher [19]. The private key is private. It is only owned by the publisher and will not be made public. It is the core secret used to decrypt data [20]. The private key cannot be calculated only by getting the key. Because the private key is confidential, the data encrypted with the public key are secure and can reach the receiver only. At the same time, in order to be more secure and improve the strength of encryption, the RSA key length should not be too short; otherwise, its reliability will be affected. Generally, we set it to 512 or 1024 bits, as shown in Figure 3.Figure 3
Diagram of the RSA basic operation process.The RSA algorithm is an asymmetric and very secure algorithm. From the above, the biggest feature of this algorithm is that it uses completely different keys for encryption and decryption. The public key encryption key, private key decryption key, and thec principle of encryption and decryption of the RSA algorithm are as follows:Public key PR:n: the product of two prime numbers p and q; e: the product of (p − 1) and (q − 1) is mutually prime;Private key PU:n: product of two prime numbers P and Q(1)d=e−1modp−1q−1.Encryption:(2)c≡memodn.Decrypt:(3)m≡cdmodn.The specific process is as follows:(1)
Select two different prime numbersp,q with long enough digits;(2)
Calculate the value ofn according to the formula n=p∗q;(3)
Calculatep−1∗q−1, whose product is calculated as fn (p, q are unknowable);(4)
Specify an integere greater than 1, which must be less than p−1∗q−1 and mutually prime with it, usually 3 or 17 or 65537;(5)
Through the formulad∗e≡1modfn, e and fn are known; we can find d. mod is a remainder operation, that is, the value of the remainder of B to C is equal to 1;(6)
n and e are selected by us to be used as public keys, and n and d are selected by us to be used as private keys (public keys e and n are public, and d must be kept a secret);(7)
The encryption calculation method isC≡Memodn, when the length is long, segmentation operation is required;(8)
The decryption calculation method isM≡Cdmodn, and the relationship between plaintext length and key length in the RSA algorithm is described in the algorithm implementation chapter.It is known from the above thate and nare public keys, which are known by everyone and can be used for encryption. However, d cannot be obtained from e and n, which is supported by its basic theory. Therefore, only those who are legal can have d and only those who are private can decrypt [21].


### 3.2.1. Design Public KeyKU and Private Key KR

Here, we specify the values ofp and q, which are smaller for ease of calculation. Then, p is specified as 3, and q is specified as 11. Obviously, the value of n is 33, and the value of p−1q−1 is 20. For this purpose, we write it as fn. The value of is also taken as small as possible, so it is taken as 3 [22]. After the above values are clear, the evaluation formula of d is d∗e≡1modfn. Thus, the value of d can be calculated. Since the value is small, we can find it through trial calculation. Table 1 provides the trial calculation results.Table 1
Trial calculation process for obtainingd value.
Dd∗ed∗e≡1modfn13326939124121251515618187211Through the trial calculation in the above table, we find that whend = 7, the identity is true. Take the value of d as 7, so you can get the private key. The two values of the private key are 7 and 33. The two values KU of the corresponding public key are 3 and 33. So far, we have generated a pair of key pairs. Let us verify it.


### 3.2.2. English Digitalization

Convert the plaintext information into numbers, assuming a transformation rule of letters and code values. The corresponding relationship assumed in this study is shown in Table2.Table 2
Comparison table of transformation between letters and code values.
Letterabcdefghijk1mCode value01020304050607080910111213LetternopqrstuvwxyzCode value14151617181920212223242526It can be seen from the abovementioned table that the digital codes of English keys are 11, 05, and 25.


### 3.2.3. Plaintext Encryption

The user transforms the information obtained in the second step into ciphertext that others cannot read through the encryption key (3, 33). The ciphertext after transformation is obtained fromC≡Memodn: 11,31,16.


### 3.2.4. Ciphertext Decryption

When we get the ciphertext, we perform transformation processing according to the formulaM≡Cdmodn, that is, decryption, that is, we can get the digital coding information of the decrypted plaintext: 11,05,25. Find the corresponding letters according to Table 2, and you can get the plaintext KEY [23].


## 3.2.1. Design Public KeyKU and Private Key KR

Here, we specify the values ofp and q, which are smaller for ease of calculation. Then, p is specified as 3, and q is specified as 11. Obviously, the value of n is 33, and the value of p−1q−1 is 20. For this purpose, we write it as fn. The value of is also taken as small as possible, so it is taken as 3 [22]. After the above values are clear, the evaluation formula of d is d∗e≡1modfn. Thus, the value of d can be calculated. Since the value is small, we can find it through trial calculation. Table 1 provides the trial calculation results.Table 1
Trial calculation process for obtainingd value.
Dd∗ed∗e≡1modfn13326939124121251515618187211Through the trial calculation in the above table, we find that whend = 7, the identity is true. Take the value of d as 7, so you can get the private key. The two values of the private key are 7 and 33. The two values KU of the corresponding public key are 3 and 33. So far, we have generated a pair of key pairs. Let us verify it.


## 3.2.2. English Digitalization

Convert the plaintext information into numbers, assuming a transformation rule of letters and code values. The corresponding relationship assumed in this study is shown in Table2.Table 2
Comparison table of transformation between letters and code values.
Letterabcdefghijk1mCode value01020304050607080910111213LetternopqrstuvwxyzCode value14151617181920212223242526It can be seen from the abovementioned table that the digital codes of English keys are 11, 05, and 25.


## 3.2.3. Plaintext Encryption

The user transforms the information obtained in the second step into ciphertext that others cannot read through the encryption key (3, 33). The ciphertext after transformation is obtained fromC≡Memodn: 11,31,16.


## 3.2.4. Ciphertext Decryption

When we get the ciphertext, we perform transformation processing according to the formulaM≡Cdmodn, that is, decryption, that is, we can get the digital coding information of the decrypted plaintext: 11,05,25. Find the corresponding letters according to Table 2, and you can get the plaintext KEY [23].


## 4. Result Analysis

Through ten tests, the length of time used to encrypt and decrypt a 2.1M TXT document with a 1024-bit key pair is given. Figure4 shows the ten-test data chart.Figure 4
Ten-test data chart.From the above test, it can be seen that the time required to generate a key pair with 1024 bits is about 2.35 seconds. It takes about 12.29 seconds to encrypt a 2.1 m text document with a 1024-bit public key, and about 561 seconds to decrypt a 2.1 m text document.


## 5. Conclusion

In this study, a data encryption technology based on network information security sharing is proposed. Based on network transmission security, cryptography, and encryption algorithm, the RSA encryption algorithm is the core; combined with the requirements of file encryption, the search and test of large prime numbers are deeply studied and analyzed and implemented with software. In addition, the file encryption and decryption software has been developed to do a variety of detailed experiments on the production key of the client and the time efficiency of encryption and decryption, which show that the client can absolutely meet the use and the design requirements of users. In the actual process of data transmission, a variety of encryption methods are used to encrypt and decrypt the data, so as to provide a strong guarantee for the security of data and information in transmission. In modern society, more and more people pay attention to the future development of computer networks. Therefore, the technology of encrypting data and information should keep pace with the times, conform to the development trend of the times, and minimize the threat of damage to computer network information security.



---

*Source: 2745334-2022-08-21.xml*