MOFDP uses random nodes to send interference data, so distinguishing the authenticity of the data requires the existence of the characteristics of each interference data of nodes to be analyzed.
MOFDP preventive measures have three stages of protection.
It can be seen that the crack cost of MOFDP algorithm is much larger than the cost of the SMART algorithm, mainly because of heavy workload of cracking the function in the library and identifying the true and false data.
The SMART algorithm and MOFDP algorithm both have the idea of chip integration.
In order to further analyze and compare, based on the classical SMART algorithm, the MOFDP algorithm is implemented in this paper.
In the MOFDP algorithm, N stands for data fragmentation, and all N data slices are encrypted.
When J takes 4 in SMART, NumFun takes 3, N takes up to 3 in the MOFDP, and the comparison results between them are shown in Figure 2.
When J takes 3 in SMART, NumFun takes 2, N takes up to 2 in the MOFDP, and the comparison results between them are shown in Figure 3.