中文摘要：

对分组密码算法进行可证明安全性的工作存在一些争论。我们针对分组密码算法S盒设计的可证明安全性进行研究并提出：可证明安全性是设计者对算法应该采取的说明与论证过程一对分析者而言＋只有当算法被破译之后才能否定安全性的证明。而在遵循S盒设计规则的同时，从多项式代散表出次数、相对于完全随机的优势度、线性偏差概率，非线性偏差概率等方面加以描述是必要的过程。

英文摘要：

Some problems exist in provable security of block cipher algorithm and the provable security of block cipher cannot be described exactly. This article is about the provable security of s-box. Taking a proper approach for the provable security of block cipher is a necessary job for the designer. We consider that provable security cannot be negated until the algorithm has been decrypted. The provable security of s-box for block cipher should include polynomial of its aigebraic degree, the advantage for relative randomness, linear probability and noniinear probability.