From Perfect Secrecy to Perfect Safety & Security: Cryptography-Based Analysis of Endogenous Security

In this paper, we propose a conjecture that endogenous security without any prior knowledge is similar to perfect secrecy without any prior knowledge. To prove the conjecture, we first establish a cryptography model of instinct function security to transform the security problem in the network domain into an encryption problem in the cryptographic domain. Then, we inherit and apply the established ideas and means of Perfect Secrecy, and propose the concept, definition and corollaries of the perfect instinct function security (PIFS) corresponding to Perfect Secrecy. Furthermore, we take the DHR system as a concrete implementation of PIFS and propose the DHR Perfect Security Theorem corresponding to Shannon’s Perfect Secrecy Theorem. Finally, we prove that the DHR satisfying the “One-Time Reconstruction” constraint is the sufficient and necessary condition to achieve perfect security. This means that the existence of PIFS is also proven. The analysis shows that any reconfigurable system can be encrypted by its construct and that the PIFS converts the one-way transparent superiority of the attacker into a double-blind problem for both the attacker and the defender, which leads to that the attacker is impossible to obtain useful construction information from the attacks and unable to find a better way than blind trial-and-error or brute-force attacks. Since the attackers are required to have the new powerful ability to crack the structure cryptogram, the threshold of cyber security is raised to at least the same level as cryptogram deciphering, thereafter the ubiquitous cyber threats are destined to be significantly reduced.