连通图不可约的判定

Irreducible Determination of Connected Graph

布尔函数是密码研究中一类常用而重要的函数,其不同性质体现出不同的密码性能,在很大程度上决定了密码体制的安全。通过图与布尔函数的对应关系,本文在布尔函数上讨论了图的相关性质,得到了连通图对应的布尔函数更为简单的不可约判定定理。

Boolean function, different properties of which reflect different cryptographic performance to determine the security of the cryptographic system to a large extent, is a kind of commonly used important function in cryptography research. This paper discusses the related connected graph on Boolean function through the correspondences of the graph and Boolean function, and gets a more simple theorem of irreducible determination of the graph corresponding to the function.