Abstract—

Mathematical models of distributed computations, based on calculus of mobile processes (π-calculus) are widely used for checking information security properties of cryptographic protocols. Since \(\pi \)-calculus is a Turing-complete computation model, this problem is unsolvable in the general case. Therefore, its study is carried out only for some special classes of π-calculus processes with restricted computational capabilities, for example, for nonrecursive processes with all runs limited in length, for processes with a limited number of parallel components, etc. However, even in these cases the proposed checking procedures are very time consuming. We assume that this is due to the very nature of the π-calculus processes. The goal of this paper is to show that even for the weakest passive adversary model and for relatively simple protocols that make use of only basic π-calculus operations, the checking of the information security properties of these protocols is a co-NP-complete problem.

中文翻译：

---

即使是简单的π演算过程也难以分析

摘要—

基于移动过程演算（π演算）的分布式计算数学模型被广泛用于检查密码协议的信息安全性。由于\（\ pi \）-calculus是一个图灵完备的计算模型，这个问题在一般情况下是无法解决的。因此，其研究仅针对计算能力受限的某些特殊类别的π演算过程，例如，针对所有游程长度受限的非递归过程，针对并行组件数量有限的过程等。但是，即使在这些情况下，建议的检查程序非常耗时。我们假设这是由于π演算过程的本质所致。本文的目的是表明，即使对于最弱的被动对手模型和仅使用基本π演算操作的相对简单的协议，检查这些协议的信息安全属性也是一个共NP问题。 。