| 连通图不可约的判定 |
| |
| 引用本文： | 屈仁春.连通图不可约的判定[J].成都航空职业技术学院学报,2014(2):16-17. |
| |
| 作者姓名： | 屈仁春 |
| |
| 作者单位： | 成都航空职业技术学院,成都610100 |
| |
| 摘 要： | 布尔函数是密码研究中一类常用而重要的函数,其不同性质体现出不同的密码性能,在很大程度上决定了密码体制的安全.通过图与布尔函数的对应关系,本文在布尔函数上讨论了图的相关性质,得到了连通图对应的布尔函数更为简单的不可约判定定理.
|
| 关 键 词： | 布尔函数 简式 不可约 |
Irreducible Determination of Connected Graph |
| |
| QU Renchun.Irreducible Determination of Connected Graph[J].Journal of Chengdu Aeronautic Vocational & Technical College,2014(2):16-17. |
| |
| Authors: | QU Renchun |
| |
| Institution: | QU Renchun (Chengdu Aeronautic Polytechnic, Chengdu 610100, China ) |
| |
| Abstract: | 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. |
| |
| Keywords: | Boolean function simple minor irreducibility |
| 本文献已被 维普 等数据库收录！ |
|
