CN117978430A - Packet encryption network safe transmission method based on dynamic binary tree - Google Patents

Abstract

The invention discloses a packet encryption network security transmission method based on a dynamic binary tree, which not only solves the problem of data consistency, but also can effectively improve the network security performance. The packet encryption network safe transmission method based on the dynamic binary tree comprises the following steps: s1, establishing packet transmission of the Internet of things; s2, acquiring data, grouping the data, and S3, generating a corresponding binary tree structure based on the diversity of the dynamic binary tree traversal mode and the diversity of the structure of the grouped data; performing dynamic binary tree packet encryption; s4, sending a data packet; s5, judging whether the data transmission is completed or not; s6, after data transmission is completed, checking the data integrity, and checking the data integrity; and S7, integrating all the data by the client to form the data which is finally needed, and decrypting a plurality of main chains of the data to finish data encryption transmission. The method for safely transmitting the packet encryption network based on the dynamic binary tree can save the storage space; and the data security is effectively improved.

Description

Packet encryption network safe transmission method based on dynamic binary tree

Technical Field

The invention relates to a data transmission method, in particular to a packet encryption network security transmission method based on a dynamic binary tree.

Background

It is well known that: with the development of information technology, more and more Internet of things equipment is connected into a network to interact with a user, meanwhile, the computing performance, the memory and the bandwidth of the Internet of things equipment are limited, and packet transmission and safety based on a transmission protocol of the Internet of things become important consideration targets;

In the prior art, as disclosed in Chinese patent No. CN 110492992A, a data encryption transmission method based on a radio frequency identification technology is disclosed, a tag enters a reader-writer identification range for bidirectional authentication, and the tag generates a random temporary binary tree for information transmission encryption; the reader generates a characteristic binary tree of the note according to the characteristic key stored in the database, and further generates a temporary binary tree of the tag; the reader-writer decrypts the information ciphertext sent by the tag by utilizing the temporary binary tree coding format; the reader-writer sends the information to the database, and the temporary key information is destroyed.

Although the method has good confidentiality, saves the storage space required by encryption, has low time complexity, has the advantages of low cost, high speed and easy realization compared with the traditional methods of DES, AES and the like, which are used for encrypting and transmitting the interactive information through binary tree, and has higher security for the current lighter weight algorithm.

However, the conventional chained packet encryption transmission method generally cannot solve the problems of data consistency and low data transmission efficiency in the prior art.

Disclosure of Invention

The invention aims to solve the technical problem of providing a method for solving the problem of data consistency and effectively improving the network security performance; and in combination with encryption transmission, the packet encryption network security transmission method based on the dynamic binary tree effectively improves the data security.

The technical scheme adopted for solving the technical problems is as follows: a packet encryption network secure transmission method based on a dynamic binary tree comprises the following steps:

S1, establishing packet transmission of the Internet of things, and adopting MQTT protocol packet transmission; the MQTT consists of a message proxy server, a publisher and a subscriber; the MQTT uses a publishing end and a subscriber model to transmit messages; the publisher is a transmitting end; the subscriber is a receiving subscriber terminal;

S2, acquiring data, grouping the data, and randomly determining the grouping number by the self-adaptive network bandwidth, wherein the grouping number is n, and n is more than or equal to 5 and less than or equal to 20; grouping data into: m ₁,M₂,...,M_n;

s3, generating a corresponding binary tree structure based on the diversity of the dynamic binary tree traversal mode and the diversity of the structure of the packet data; performing dynamic binary tree packet encryption; the hash value of the packet data is calculated in a layering way through the self-adaptive dynamic tree, and only the whole hash value of the data is needed to be stored;

Specifically, the Hash value corresponding to each group of data is calculated as Hash (M ₁),Hash(M₂),....,Hash(M_n), namely

D₁＝Hash(M₁)

D₂＝Hash(M₂)

…

D_n＝Hash(M_n)；

Obtaining a hash value D ₁,D₂,...,D_n corresponding to each group of data;

D ₁ will be ored with D ₂ and then hash the result:

D₁₂＝Hash(D₁PD₂)

D₃₄＝Hash(D₃PD₄)

……

D_n-1,n＝hash(D_n-1PD_n)

……

D_1,4＝Hash(D₁₂PD₃₄)

……

D_1,n＝Hash(D₁₂PD_n-1,n)；

wherein D _n-1,n is the final verification result of the packet data; p is or II operation;

Obtaining D _1,n; retaining data D _1,n in the system;

s4, sending a data packet; realizing data packet transmission based on the MQTT protocol;

S5, judging whether the data transmission is completed or not;

firstly, a transmitting end transmits a first data packet and waits for receiving a message confirmation packet returned by a subscribing end;

If the acknowledgement message of the received message returned by the subscribing terminal is not received within a specified time period, the transmitting terminal retransmits the data packet;

If the confirmation message is received within a specified time period, the transmitting end judges whether the transmission is completed or not;

if the transmission is completed, ending the transmission; meanwhile, the sending end receives the message returned by the subscribing end;

If the data packet is incomplete, retransmitting until the data transmission is completed;

s6, after data transmission is completed, checking the data integrity, and checking the data integrity;

After the receiving subscription receives the data packet, checking the data integrity through checking the data integrity in the step S2, and then returning the data to the transmitting end;

If the data integrity check is wrong, re-subscribing the data to the transmitting end, and if the data integrity check is successful, transmitting the whole group of data packets;

and S7, integrating all the data by the client to form the data which is finally needed, and decrypting a plurality of main chains of the data to finish data encryption transmission.

Further, in step S3, dynamic binary tree packet encryption is performed; sequentially encrypting the data according to the first order traversal, the middle order traversal or the subsequent order traversal, and simultaneously encrypting the data when each node of the binary tree is generated.

Further, the encryption algorithm for performing dynamic binary tree packet encryption in the step S3 adopts a DES algorithm;

The data decryption keys of the sending end and the receiving subscription end are K; grouping the data into a plaintext data packet D ₁,D₂,...,D_n; respectively encrypting by a secret key K; the first plaintext data packet D ₁ is encrypted and then is exclusive-or' ed by using a timestamp vector IV;

The former plaintext data packet is exclusive-or' ed with the next encrypted plaintext data packet, and so on; and respectively obtaining the grouping ciphertext data packets DM ₁,DM₂,...,DM_n.

Further, in step S7, data decryption is achieved in the following manner;

The subscribing terminal receives the first ciphertext data packet DM ₁ and carries out exclusive OR calculation with the timestamp vector IV, and then uses the encryption key K to decrypt the ciphertext data packet to obtain a plaintext first plaintext data packet D ₁;

Then, starting from the subscribing terminal to receive a second ciphertext data packet DM _i, before data decryption, performing exclusive OR operation on a plaintext data packet D _i-1 obtained by the previous decryption, and then using an encryption key K to decrypt ciphertext data to obtain D _i;

and after the subscribing terminal receives the last data packet, performing the same operation to obtain D _n, and finally integrating the data with the operation opposite to the grouping to obtain the final complete data.

The beneficial effects of the invention are as follows: the invention relates to a packet encryption network safe transmission method based on a dynamic binary tree; randomly determining the number of packets through the adaptive network bandwidth in the data transmission process; generating a corresponding binary tree structure based on the diversity of the dynamic binary tree traversal mode and the diversity of the structure of the packet data; performing dynamic binary tree packet encryption; layering and calculating hash values of the packet data through the self-adaptive dynamic tree; generating a corresponding binary tree structure based on the diversity of the dynamic binary tree traversal mode and the diversity of the structure; therefore, the single dependence of a chain structure is overcome, and the encryption performance is greatly improved; meanwhile, the hash value is calculated for storage, so that the storage space can be effectively saved, and the data transmission efficiency is ensured.

Drawings

FIG. 1 is a flow chart of a method for secure transmission of a packet encryption network based on a dynamic binary tree in an embodiment of the invention;

FIG. 2 is a flow chart of the MQTT in an embodiment of the present invention;

FIG. 3 is a diagram showing a dynamic tree structure with a packet number of 8 according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of an overall dynamic binary tree structure in an embodiment of the present invention;

FIG. 5 is a flowchart illustrating encryption when the number of packets is 8 according to an embodiment of the present invention;

Fig. 6 is a flowchart of decryption when the number of packets is 8 in the embodiment of the present invention.

Detailed Description

The invention will be further described with reference to the drawings and examples.

As shown in fig. 1 to 6, the method for securely transmitting the packet encryption network based on the dynamic binary tree according to the present invention comprises the following steps:

S1, establishing packet transmission of the Internet of things, and adopting MQTT protocol packet transmission; the MQTT consists of a message proxy server, a publisher and a subscriber; the MQTT uses a publishing end and a subscriber model to transmit messages; the publisher is a transmitting end; the subscriber is a receiving subscriber terminal; as particularly shown in fig. 2.

In a specific application process, the maximum bearing capacity of the MQTT protocol is 256MB, data are segmented according to 256MB groups, if a message topic issued by a publisher is A, an agent end can sort the messages and send the messages to all clients subscribing the topic according to the topic. Each set of messages is transmitted in a tandem order. And retransmitting if the previous packet is not successfully transmitted, discarding the whole packet if the retransmission is unsuccessful to a certain limit, and labeling the packet. The overall flow is as in the overall flow diagram of fig. 2.

The data transmitting end of the MQTT protocol firstly carries out grouping operation on the data after receiving the large-block data, can carry out grouping with fixed size, and can dynamically adjust the grouping size of the grouping according to the bandwidth of the internet equipment. After finishing the data grouping, the client starts to transmit data, the client firstly transmits a first data grouping, then waits for receiving a message confirmation package returned by the subscribing terminal, and if the confirmation message of the received message returned by the subscribing terminal is not received in a time period, the client retransmits the data grouping; if the confirmation message is received, the client judges whether the transmission is completed, and if the transmission is completed, the transmission is ended; meanwhile, the sending end receives the information returned by the subscribing end, and if the data packet is incomplete, the sending end resends the information until the data sending is completed; after the data subscription receives the data packet, the data integrity is checked through S2 data integrity check, and then the data is returned to the sending end. After the whole group of data packets are sent, the client integrates all the data into the data which is finally needed.

S2, acquiring data, grouping the data, and randomly determining the grouping number by the self-adaptive network bandwidth, wherein the grouping number is n, and n is more than or equal to 5 and less than or equal to 20; grouping data into: m ₁,M₂,...,M_n;

s3, generating a corresponding binary tree structure based on the diversity of the dynamic binary tree traversal mode and the diversity of the structure of the packet data; performing dynamic binary tree packet encryption; the hash value of the packet data is calculated in a layering way through the self-adaptive dynamic tree, and only the whole hash value of the data is needed to be stored;

Specifically, the Hash value corresponding to each group of data is calculated as Hash (M ₁),Hash(M₂),....,Hash(M_n), namely

D₁＝Hash(M₁)

D₂＝Hash(M₂)

…

D_n＝Hash(M_n)；

Obtaining a hash value D ₁,D₂,...,D_n corresponding to each group of data;

D ₁ will be ored with D ₂ and then hash the result:

D₁₂＝Hash(D₁PD₂)

D₃₄＝Hash(D₃PD₄)

……

D_n-1,n＝Hash(D_n-1PD_n)

……

D_1,4＝Hash(D₁₂PD₃₄)

……

D_1,n＝Hash(D₁₂PD_n-1,_n)

wherein D _n-1,n is the final verification result of the packet data; p is or II operation;

Obtaining D _1,n; retaining data D _1,n in the system;

when the dynamic binary tree block encryption is carried out, data are sequentially encrypted according to the prior traversal, the intermediate traversal or the subsequent traversal, and the data are encrypted at the same time when each node of the binary tree is generated. The encryption algorithm in the encryption process adopts a DES algorithm;

The data decryption keys of the sending end and the receiving subscription end are K; grouping the data into a plaintext data packet D ₁,D₂,...,D_n; respectively encrypting by a secret key K; the first plaintext data packet D ₁ is encrypted and then is exclusive-or' ed by using a timestamp vector IV;

The former plaintext data packet is exclusive-or' ed with the next encrypted plaintext data packet, and so on; and respectively obtaining the grouping ciphertext data packets DM ₁,DM₂,...,DM_n.

S4, sending a data packet; realizing data packet transmission based on the MQTT protocol;

S5, judging whether the data transmission is completed or not;

firstly, a transmitting end transmits a first data packet and waits for receiving a message confirmation packet returned by a subscribing end;

If the acknowledgement message of the received message returned by the subscribing terminal is not received within a specified time period, the transmitting terminal retransmits the data packet;

If the confirmation message is received within a specified time period, the transmitting end judges whether the transmission is completed or not;

if the transmission is completed, ending the transmission; meanwhile, the sending end receives the message returned by the subscribing end;

If the data packet is incomplete, retransmitting until the data transmission is completed;

s6, after data transmission is completed, checking the data integrity, and checking the data integrity;

After the receiving subscription receives the data packet, checking the data integrity through checking the data integrity in the step S2, and then returning the data to the transmitting end;

If the data integrity check is wrong, re-subscribing the data to the transmitting end, and if the data integrity check is successful, transmitting the whole group of data packets;

And S7, integrating all the data by the client to form the data which is finally needed, and decrypting a plurality of main chains of the data to finish data encryption transmission. The specific decryption process is as follows: the subscribing terminal receives the first ciphertext data packet DM ₁ and carries out exclusive OR calculation with the timestamp vector IV, and then uses the encryption key K to decrypt the ciphertext data packet to obtain a plaintext first plaintext data packet D ₁;

Then, starting from the subscribing terminal to receive a second ciphertext data packet DM _i, before data decryption, performing exclusive OR operation on a plaintext data packet D _i-1 obtained by the previous decryption, and then using an encryption key K to decrypt ciphertext data to obtain D _i;

and after the subscribing terminal receives the last data packet, performing the same operation to obtain D _n, and finally integrating the data with the operation opposite to the grouping to obtain the final complete data.

Examples

A packet encryption network secure transmission method based on a dynamic binary tree comprises the following steps:

1. establishing packet transmission of the Internet of things, and adopting MQTT protocol packet transmission;

2. Acquiring data, grouping the data, and randomly determining the grouping number of the self-adaptive network bandwidth, wherein the grouping number is 8; grouping data into: m ₁,M₂,...,M₈;

3. generating a corresponding binary tree structure based on the diversity of the dynamic binary tree traversal mode and the diversity of the structure of the packet data; the dynamic binary tree overall structure is shown in fig. 4;

performing dynamic binary tree packet encryption; the hash value of the packet data is calculated in a layering way through the self-adaptive dynamic tree, and only the whole hash value of the data is needed to be stored;

Specifically, the Hash value corresponding to each group of data is calculated as Hash (M ₁),Hash(M₂),....,Hash(M_n), namely

D₁＝Hash(M₁)

D₂＝Hash(M₂)

…

D_n＝Hash(M_n)；

Obtaining a hash value D ₁,D₂,...,D_n corresponding to each group of data;

D ₁ will be ored with D ₂ and then hash the result:

D₁₂＝Hash(D₁PD₂)

D₃₄＝Hash(D₃PD₄)

……

D_n-1,n＝Hash(D_n-1PD_n)

……

D_1,4＝Hash(D₁₂PD₃₄)

……

D_1,n＝Hash(D₁₂PD_n-1,_n)

wherein D _n-1,n is the final verification result of the packet data; p is or II operation;

Obtaining D _1,n; retaining data D _1,n in the system;

And the final verification result of the packet data is finally obtained in a dynamic tree chain mode, the data is reserved in the system, and compared with the packet signature verification mode, the final data is only stored and transmitted, so that the storage space is greatly saved, and the data transmission efficiency is ensured.

Specifically, the dynamic binary tree packet encryption adopts sequential encryption of data according to the prior traversal, the middle traversal or the subsequent traversal; the data is encrypted simultaneously as each node of the binary tree is generated. In this embodiment, 1,2,3,4,5,6,7,8 are generated sequentially by first traversing the packet data encryption, each node being encrypted by its upper node. The encryption algorithm of the dynamic binary tree block encryption adopts a DES algorithm; a plurality of main chain encryption are respectively 1,2 and 3;1,2,4;1,5,6;1,5,7,8 the encryption process is as follows:

As shown in fig. 5, the data decryption keys of the transmitting end and the receiving subscriber end are K; grouping the data into a plaintext data packet D ₁,D₂,...,D_n; respectively encrypting by a secret key K; the first plaintext data packet D ₁ is encrypted and then is exclusive-or' ed by using a timestamp vector IV;

The former plaintext data packet is exclusive-or' ed with the next encrypted plaintext data packet, and so on; and respectively obtaining the grouping ciphertext data packets DM ₁,DM₂,...,DM_n.

4. Transmitting a data packet; realizing data packet transmission based on the MQTT protocol;

5. judging whether the data transmission is completed or not;

firstly, a transmitting end transmits a first data packet and waits for receiving a message confirmation packet returned by a subscribing end;

If the acknowledgement message of the received message returned by the subscribing terminal is not received within a specified time period, the transmitting terminal retransmits the data packet;

If the confirmation message is received within a specified time period, the transmitting end judges whether the transmission is completed or not;

if the transmission is completed, ending the transmission; meanwhile, the sending end receives the message returned by the subscribing end;

If the data packet is incomplete, retransmitting until the data transmission is completed;

6. after the data transmission is completed, checking the data integrity, and checking the data integrity;

After the receiving subscription receives the data packet, checking the data integrity through checking the data integrity in the step S2, and then returning the data to the transmitting end;

If the data integrity check is wrong, re-subscribing the data to the transmitting end, and if the data integrity check is successful, transmitting the whole group of data packets;

7. And integrating all the data by the client to form the data which is finally needed, and decrypting a plurality of main chains of the data to finish the encryption transmission of the data. As shown in fig. 6, the implementation of data decryption includes the steps of: the subscribing terminal receives the first ciphertext data packet DM ₁ and carries out exclusive OR calculation with the timestamp vector IV, and then uses the encryption key K to decrypt the ciphertext data packet to obtain a plaintext first plaintext data packet D ₁;

Then, starting from the subscribing terminal to receive a second ciphertext data packet DM _i, before data decryption, performing exclusive OR operation on a plaintext data packet D _i-1 obtained by the previous decryption, and then using an encryption key K to decrypt ciphertext data to obtain D _i;

and after the subscribing terminal receives the last data packet, performing the same operation to obtain D _n, and finally integrating the data with the operation opposite to the grouping to obtain the final complete data.

Claims (4)

1. A packet encryption network safe transmission method based on a dynamic binary tree is characterized in that: the method comprises the following steps:

S1, establishing packet transmission of the Internet of things, and adopting MQTT protocol packet transmission; the MQTT consists of a message proxy server, a publisher and a subscriber; the MQTT uses a publishing end and a subscriber model to transmit messages; the publisher is a transmitting end; the subscriber is a receiving subscriber terminal;

S2, acquiring data, grouping the data, and randomly determining the grouping number by the self-adaptive network bandwidth, wherein the grouping number is n, and n is more than or equal to 5 and less than or equal to 20; grouping data into: m ₁,M₂,...,M_n;

s3, generating a corresponding binary tree structure based on the diversity of the dynamic binary tree traversal mode and the diversity of the structure of the packet data; performing dynamic binary tree packet encryption; the hash value of the packet data is calculated in a layering way through the self-adaptive dynamic tree, and only the whole hash value of the data is needed to be stored;

Specifically, the Hash value corresponding to each group of data is calculated as Hash (M ₁),Hash(M₂),....,Hash(M_n), namely

D₁＝Hash(M₁)

D₂＝Hash(M₂)

…

D_n＝Hash(M_n)；

Obtaining a hash value D ₁,D₂,...,D_n corresponding to each group of data;

D ₁ will be ored with D ₂ and then hash the result:

D₁₂＝Hash(D₁PD₂)

D₃₄＝Hash(D₃PD₄)

……

D_n-1,n＝Hash(D_n-1PD_n)

……

D_1,4＝Hash(D₁₂PD₃₄)

……

D_1,n＝Hash(D₁₂PD_n-1,n)

wherein D _n-1,n is the final verification result of the packet data; p is or II operation;

Obtaining D _1,n; retaining data D _1,n in the system;

s4, sending a data packet; realizing data packet transmission based on the MQTT protocol;

S5, judging whether the data transmission is completed or not;

firstly, a transmitting end transmits a first data packet and waits for receiving a message confirmation packet returned by a subscribing end;

If the acknowledgement message of the received message returned by the subscribing terminal is not received within a specified time period, the transmitting terminal retransmits the data packet;

If the confirmation message is received within a specified time period, the transmitting end judges whether the transmission is completed or not;

if the transmission is completed, ending the transmission; meanwhile, the sending end receives the message returned by the subscribing end;

If the data packet is incomplete, retransmitting until the data transmission is completed;

s6, after data transmission is completed, checking the data integrity, and checking the data integrity;

After the receiving subscription receives the data packet, checking the data integrity through checking the data integrity in the step S2, and then returning the data to the transmitting end;

If the data integrity check is wrong, re-subscribing the data to the transmitting end, and if the data integrity check is successful, transmitting the whole group of data packets;

and S7, integrating all the data by the client to form the data which is finally needed, and decrypting a plurality of main chains of the data to finish data encryption transmission.

2. The method for packet encryption network security transmission based on dynamic binary tree according to claim 1, wherein: performing dynamic binary tree packet encryption in step S3; sequentially encrypting the data according to the first order traversal, the middle order traversal or the subsequent order traversal, and simultaneously encrypting the data when each node of the binary tree is generated.

3. The method for packet encryption network security transmission based on dynamic binary tree according to claim 2, wherein: the encryption algorithm for carrying out dynamic binary tree packet encryption in the step S3 adopts a DES algorithm;

The data decryption keys of the sending end and the receiving subscription end are K; grouping the data into a plaintext data packet D ₁,D₂,...,D_n; respectively encrypting by a secret key K; the first plaintext data packet D ₁ is encrypted and then is exclusive-or' ed by using a timestamp vector IV;

The former plaintext data packet is exclusive-or' ed with the next encrypted plaintext data packet, and so on; and respectively obtaining the grouping ciphertext data packets DM ₁,DM₂,...,DM_n.

4. A method for secure transmission of a dynamic binary tree based packet encryption network according to claim 3, characterized in that: in step S7, data decryption is realized in the following way;

The subscribing terminal receives the first ciphertext data packet DM ₁ and carries out exclusive OR calculation with the timestamp vector IV, and then uses the encryption key K to decrypt the ciphertext data packet to obtain a plaintext first plaintext data packet D ₁;

Then, starting from the subscribing terminal to receive a second ciphertext data packet DM _i, before data decryption, performing exclusive OR operation on a plaintext data packet D _i-1 obtained by the previous decryption, and then using an encryption key K to decrypt ciphertext data to obtain D _i;

and after the subscribing terminal receives the last data packet, performing the same operation to obtain D _n, and finally integrating the data with the operation opposite to the grouping to obtain the final complete data.