基于样本识别复杂度和解密时间设计加密控制系统的最优密钥长度与控制律
Designing Optimal Key Lengths and Control Laws for Encrypted Control Systems based on Sample Identifying Complexity and Deciphering Time
AI总结：
本文针对加密控制系统提出样本识别复杂度与解密时间概念，设计了最优密钥长度与控制器，兼顾控制性能与防窃听安全性，首次从控制理论视角建立密码学与动态系统安全的联系。
摘要：
在密码学与控制理论的前沿文献中，尚无系统化的方法来构建既能实现期望控制性能又能防御窃听攻击的信息物理系统。本文解决了这一挑战性问题。我们首先在加密控制框架中提出了两个新概念：样本识别复杂度和样本解密时间。前者明确刻画了控制系统的动态特性与系统可识别度之间的关系，后者展示了识别的计算时间与密码系统密钥长度之间的关系。基于这两个可处理的新概念，我们提出了一种系统化方法，用于设计最优密钥长度（以在系统给定生命周期内防止以给定精度进行系统识别）和最优控制器（以最大化控制性能和识别难度）。通过数值仿真研究了所提方法在安全水平和实时性方面的效率。据我们所知，本文首次从控制理论角度连接了密码学与动态系统安全性之间的关系。
英文摘要：
In the state-of-the-art literature on cryptography and control theory, there has been no systematic methodology of constructing cyber-physical systems that can achieve desired control performance while being protected against eavesdropping attacks. In this paper, we tackle this challenging problem. We first propose two novel notions referred to as sample identifying complexity and sample deciphering time in an encrypted-control framework. The former explicitly captures the relation between the dynamical characteristics of control systems and the level of identifiability of the systems while the latter shows the relation between the computation time for the identification and the key length of a cryptosystem. Based on these two tractable new notions, we propose a systematic method for designing the both of an optimal key length to prevent system identification with a given precision within a given life span of systems, and of an optimal controller to maximize both of the control performance and the difficulty of the identification. The efficiency of the proposed method in terms of security level and realtime-ness is investigated through numerical simulations. To the best of our knowledge, this paper first connect the relationship between the security of cryptography and dynamical systems from a control-theoretic perspective.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
