Large-scale unmanned aerial vehicle group security authentication mechanism based on random label
Technical Field
The invention belongs to the field of network communication, and particularly provides a large-scale unmanned aerial vehicle group security authentication mechanism based on a random tag, which is used for ensuring that the large-scale unmanned aerial vehicle group is difficult to intercept and decipher confidential information when executing tasks.
Background
The mobile ad hoc network technology is widely used for current unmanned aerial vehicle flight, and in the existing encryption algorithm design, the security of secret information transmitted from a transmitting unmanned aerial vehicle to the unmanned aerial vehicle is not generally considered, and most researches only consider the fixed position and the fixed quantity of the unmanned aerial vehicle, only a communication model in one direction is from the ground to the air, and the unmanned aerial vehicle can freely and flexibly move in a three-dimensional space.
A hash function, also known as a hashing algorithm, is a method of creating a small digital "fingerprint" from any kind of data. The hash function compresses a message or data into a digest so that the amount of data becomes small, fixing the format of the data. This function mixes the data shuffled and recreates a fingerprint called a hash value (or hash value). The hash value is typically represented by a short string of random letters and numbers. And a specific Hash and mapping process is adopted, and two random labels are added on a large-scale unmanned aerial vehicle cluster to carry out verification between unmanned aerial vehicles and between the unmanned aerial vehicles and a ground station in real time, so that the reliability of the whole mobile ad hoc network is protected. According to the determined label distributed to each unmanned aerial vehicle by the ground station, the uncertain label is calculated by adopting a matching method for verification, and the label has safety and unpredictability, so that an adversary can hardly deduce the uncertain label needing verification by the determined label.
Disclosure of Invention
The invention provides a large-scale unmanned aerial vehicle group security authentication mechanism based on random labels, aiming at the potential safety hazard intercepted and captured when most of the existing unmanned aerial vehicle group executes tasks.
The technical scheme of the invention is as follows:
a large-scale unmanned aerial vehicle group security authentication mechanism based on random labels comprises the following steps:
s1: when the unmanned aerial vehicle cluster controls a starting station A from the ground, the A allocates a determining label (label) 1, 2 and 3 to each unmanned aerial vehicle;
s2: after flying for a period of time, each unmanned aerial vehicle generates an uncertain label (label) 1 based on corresponding label1 through hashing, and performs inter-group authentication mutually;
s3: in the flight process of the unmanned aerial vehicle swarm, when the unmanned aerial vehicle swarm encounters the relay station B, the relay station B knows the mode of the ground station generating the close 2 as the relay station and the ground station are communicated with each other; therefore, the unmanned plane generates a label2 (hash, mapping) according to the label2, and the relay station B verifies the label 2; subsequent relay stations validate the ciabel 3, ciabel 4.
Further, a large-scale unmanned aerial vehicle group security authentication mechanism based on a random tag, where the step S1 specifically is:
s101: the unmanned plane pre-loads a plurality of mapping schemes, generates an uncertain label (label) by combining a plurality of local labels, selects discontinuous and disorganized header bits for each part label, and maps the discontinuous and disorganized header bits to the discontinuous and disorganized bits in the label;
s102: we store the mapping as an m-level tree; the internal nodes map to bits in each entry accordingly; leaf nodes correspond to partial tags.
Further, a large-scale unmanned aerial vehicle group security authentication mechanism based on a random tag, where the step S2 specifically is:
s201: let Pkt
clabelIndicates the header marked with the label,
representing bits in the labeled tag, the length of which is represented by a 64-bit value; the ulabel generated by one UAV is validated by the other UAV, validating the formula as follows:
ulabel=Hash(Sample(Pktclabel));
wherein Hash (-) represents the SHA-256 Hash algorithm we employ;
s202: in that
Filling the tail end, firstly filling the first bit to 1, and then filling all bits to 0 to ensure that
The length satisfies that the remainder after modulus 512 is 448, and then the length is obtained
Handle
Is supplemented to
We get a list of messages;
S203:we split the message list into 16 large 32-bit end words W0,W1,...,W15The remaining 48 words W16,W17,...,W63Iteratively obtained by the following formulas:
Wt=σ1(Wt-2)+Wt-7+σ0(Wt-2)+Wt-16;
s204: the algorithm based on 32-bit word operations utilizes 6 logic functions:
through mapping iteration, we get H1(ii) a By analogy, we get the last Hn, which is the last 256-bit message digest, i.e. the ulbel we need;
s205: if the unmanned aerial vehicle satisfies: firstly, the data packet comes from a correct previous hop node; secondly, the data packet carries the correct label generated by the unmanned aerial vehicle; the inter-cluster detection passes;
s206: if not, the system triggers an alarm with the universal wildcard rule.
Further, a large-scale unmanned aerial vehicle group security authentication mechanism based on a random tag, where the step S3 specifically is:
s301: the drone generates a label by combining several partial labels; for each partial tag, we select the discontinuous and shuffled header bits and map them to the discontinuous and shuffled bits in the ulabel; we store the mapping as an m-level tree; the internal nodes map to bits in each entry accordingly; leaf nodes correspond to partial tags;
s302: if the ulabel satisfies: firstly, the message serial number of the packet header is an h-bit string corresponding to a p-bit part label; secondly, the next hop is used for detecting the MPR sequence number; the unmanned aerial vehicle passes the detection of the ground station;
s303: if not, the system triggers an alarm with the universal wildcard rule.
The invention has the technical advantages that:
1. the information security of the unmanned aerial vehicle cluster system is protected under the condition of no high calculation amount and communication overhead;
2. the mobile unmanned aerial vehicle can also generate an uncertain label and carry out group verification and ground station verification by adopting two schemes of hashing and mapping;
3. compared with the existing encryption algorithm, the method can protect the confidential information carried by the unmanned aerial vehicle more simply and effectively, reduce the complexity of the algorithm, improve the efficiency of the whole task process, and has practical feasibility.
Drawings
FIG. 1 is a block diagram of the mechanism of the present invention.
Fig. 2 is a label iteration diagram.
Fig. 3 is a probability distribution of probability labels generated by (a) hashing.
FIG. 4 is a probability distribution of probability labels generated by the mapping of (b).
Fig. 5 is a time delay comparison with the original OLSR.
Fig. 6 is a graph of throughput for the present invention.
Detailed Description
The invention is further described with reference to the following figures and detailed description.
The invention designs a large-scale unmanned aerial vehicle group security authentication mechanism based on random labels according to the technical characteristics of hash and mapping generation of the random labels, and mainly solves the following two problems:
(1) the unmanned aerial vehicle cluster belongs to a mobile ad hoc network and has high dynamic property, so that the safety of the unmanned aerial vehicle cluster is difficult to be effectively ensured, and key information is easy to intercept and acquire in the task execution process.
(2) In the existing encryption algorithm, the consideration that the unmanned aerial vehicle which protects key information and supplements can be verified immediately is lacked.
The main idea of the invention is as follows: the Hash encryption algorithm and the mapping scheme are combined to realize the maximization of information security of the unmanned aerial vehicle cluster system under the condition of not high calculation amount and communication overhead.
Specifically, a large-scale unmanned aerial vehicle group security authentication mechanism based on random tags comprises the following steps:
s1: when the unmanned aerial vehicle cluster controls a starting station A from the ground, the A allocates a determining label (label) 1, 2 and 3 to each unmanned aerial vehicle;
s101: the unmanned plane pre-loads a plurality of mapping schemes, generates an uncertain label (label) by combining a plurality of local labels, selects discontinuous and disorganized header bits for each part label, and maps the discontinuous and disorganized header bits to the discontinuous and disorganized bits in the label;
s102: we store the mapping as an m-level tree; the internal nodes map to bits in each entry accordingly; leaf nodes correspond to partial tags.
S2: after flying for a period of time, each unmanned aerial vehicle generates an uncertain label (label) 1 based on corresponding label1 through hashing, and performs inter-group authentication mutually;
s201: let Pkt
clabelIndicates the header marked with the label,
representing bits in the labeled tag, the length of which is represented by a 64-bit value; the ulabel generated by one UAV is validated by the other UAV, validating the formula as follows:
ulabel=Hash(Sample(Pktclabel));
wherein Hash (-) represents the SHA-256 Hash algorithm we employ;
s202: in that
Filling the tail end, firstly filling the first bit to 1, and then filling all bits to 0 to ensure that
The length satisfies that the remainder after modulus 512 is 448, and then the length is obtained
Handle
Is supplemented to
We get a list of messages;
s203: we split the message list into 16 large 32-bit end words W0,W1,...,W15The remaining 48 words W16,W17,...,W63Iteratively obtained by the following formulas:
Wt=σ1(Wt-2)+Wt-7+σc(Wt-2)+Wt-16;
s204: the algorithm based on 32-bit word operations utilizes 6 logic functions:
through mapping iteration, we get H1(ii) a By analogy, we get the last Hn, which is the last 256-bit message digest, i.e. the ulbel we need;
s205: if the unmanned aerial vehicle satisfies: firstly, the data packet comes from a correct previous hop node; secondly, the data packet carries the correct label generated by the unmanned aerial vehicle; the inter-cluster detection passes;
s206: if not, the system triggers an alarm with the universal wildcard rule.
S3: in the flight process of the unmanned aerial vehicle swarm, when the unmanned aerial vehicle swarm encounters the relay station B, the relay station B knows the mode of the ground station generating the close 2 as the relay station and the ground station are communicated with each other; therefore, the unmanned plane generates a label2 (hash, mapping) according to the label2, and the relay station B verifies the label 2; the subsequent relay station verifies the ciabel 3, ciabel 4.. until the task is completed;
s301: the drone generates a label by combining several partial labels; for each partial tag, we select the discontinuous and shuffled header bits and map them to the discontinuous and shuffled bits in the ulabel; we store the mapping as an m-level tree; the internal nodes map to bits in each entry accordingly; leaf nodes correspond to partial tags;
s302: if the ulabel satisfies: firstly, the message serial number of the packet header is an h-bit string corresponding to a p-bit part label; secondly, the next hop is used for detecting the MPR sequence number; the unmanned aerial vehicle passes the detection of the ground station;
s303: if not, the system triggers an alarm with the universal wildcard rule.
In the specific implementation:
the invention performs the simulation of the flight process of the unmanned aerial vehicle as shown in fig. 1 in the OMNet + + software, and performs the performance test on the proposed mechanism. We call the generation and authentication functions in the file/hash. OMNeT + + processes arriving packets by calling a generate function in the ProcessCalcket (-) and discards processed packets by calling a validate function in the PacketCallback (-).
FIG. 2 shows an iterative process of the mapping scheme, where the red field grid represents the pair divided by 232And then the rest is taken.
Fig. 3 and 4 show probability distributions of probability labels generated by (a) hashing and (b) mapping. It can be seen that the uncertainty labels generated by drones approximate a normal distribution, which well limits the scope of random inference by attackers.
In order to embody the advantages of the random tag security mechanism provided by the invention, the unmanned aerial vehicle performance under the existing common OLSR protocol is compared. As can be seen from fig. 5, the original OLSR requires 0.54s on average to process bits in a packet, while the protocol enhanced by the mechanism requires 0.24 s.
FIG. 6 shows that the throughput of the mechanism proposed by the present invention has a minimum rate of 1000 bits/s, an average rate mostly stabilized around 5000 bits/s, and a peak value sometimes reached 19000 bits/s. This also fully demonstrates the feasibility of this mechanism.
In conclusion: the large-scale unmanned aerial vehicle cluster security authentication mechanism based on the random label not only can protect information carried by the unmanned aerial vehicle, but also can complete tasks more efficiently.
While the preferred embodiments of the present invention have been illustrated and described in detail, it is not intended to limit the invention to the exact details shown and described, and various equivalents (e.g., in number, shape, location, etc.) may be substituted for elements thereof without departing from the spirit and scope of the present invention.