# A Low-Complexity Security Scheme for Drone Communication Based on PUF and LDPC
## 3 Security Architecture
### Error Correction Schemes
#### 3.4.3 Decoding Algorithm Selection
Also, the decoding scheme is improved according to the matrix structure, which makes the probability of legal drone authentication failure of this paper's protocol lower than \(6.87\times 10^{-5}\) and the probability of illegal drone authentication success lower than \(3.62\times 10^{-7}\). The proposed protocol is then analyzed both non-formally and formally using random predicates, proving that the protocol of this paper can withstand various attacks. Comparative analysis with other protocols shows that the protocol of this paper is equally as secure as other protocols. Finally, the overhead of this paper protocol is calculated and compared with other protocols, and it is found that this paper protocol is higher in time overhead as matrix operations are computationally intensive operations; storage overhead is only 32 bytes; communication overhead is higher in drone-GS authentication as it needs to send the extracted information of the PUF but the protocol of this paper does not require a drone-drone authentication; overhead is zero. In conclusion, the protocol in this paper meets the expectation of ensuring security while minimizing the information required to be stored by the drone. ## 7 Discussion

The present protocol still has some flaws. The protocols in this paper need to be monitored by administrators, and drones are not completely free to join or leave the network. In addition, the protocol in this paper assumes that GS and database resources are unrestricted and can withstand various attacks by default, so the drone information is all stored in the database. The limitations of the above conditions may impose some restrictions on the application of the protocol in this paper. In addition, the performance of the coding matrix used in this paper is poor and the probability of legitimate drone authentication failure is relatively high. Conceptualization, [PERSON] ([PERSON]); methodology, [PERSON] ([PERSON]); software, P.G. ; validation, [PERSON], [PERSON] and [PERSON]. ([PERSON]); formal analysis, [PERSON] ([PERSON]); investigation, P.G. ; writing--original draft preparation, P.G. ; writing--review and editing, [PERSON] ([PERSON]); supervision, [PERSON], [PERSON] ([PERSON]). All authors have read and agreed to the published version of the manuscript. This research received no external funding. Data Availability StatementData are contained within the article. We thank the other two authors for their theoretical guidance and the university for providing the laboratory equipment and working environment. The authors declare no conflicts of interest. \begin{table}
\begin{tabular}{c c c c} \hline \hline
**Paper** & **Computation Cost** & **Storage Cost in Bits** & **Communication Costs in Bit** \\ \hline
[22] & \(T_{R}+2T_{p}+7T_{XOR}+T_{MAP}\) & 320 & 1600 \\ \hline
[23] & \(T_{R}+2T_{p}+(8+2(m-1)T_{XOR})+T_{MAP}\) & 320 & 1600 \\ \hline
[24] & \(3T_{H}+2T_{R}+8T_{XOR}+2T_{P}\) & 352 & 1600 \\ \hline
[25] & \(3T_{R}+2T_{p}+2T_{XOR}+T_{MAP}\) & 160 & 1152 \\ \hline
[35] & \(2T_{H}+5T_{R}+T_{P}+4T_{XOR}+3T_{MAP}\) & 672 & 1506 \\ \hline Ours & \(5T_{H}+2T_{R}+2T_{P}+6T_{XOR}+T_{ECC}\) & 256 & 2624 \\ \hline \hline \end{tabular}
\end{table} 
Table 8: Authentication overhead. * [PERSON] et al. (2015) [PERSON]; [PERSON]; [PERSON] Novel ECC structure and evaluation method for NAND flash memory. In Proceedings of the 2015 28 th IEEE International System-on-Chip Conference (SOCC), Beijing, China, 8-11 September 2015; pp. 100-104. * [PERSON] et al. (2018) [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] Error elimination ECC by horizontal error detection and vertical-LDPC ECC to increase data-retention time by 230% and acceptable bit-error rate by 90% for 3D-NAND flash SSDs. In Proceedings of the 2018 IEEE International Reliability Physics Symposium (IRPS), Burlingame, CA, USA, 11-15 March 2018; pp. P-MY.7-1-P-MY.7-4. * [PERSON] et al.