| 基于可信基点的结构化签名比较算法 |
| |
| 引用本文： | 魏强,金然,王清贤. 基于可信基点的结构化签名比较算法[J]. 计算机工程与设计, 2007, 28(24): 5850-5853 |
| |
| 作者姓名： | 魏强 金然 王清贤 |
| |
| 作者单位： | 解放军信息工程大学,信息工程学院,河南,郑州,450002;解放军信息工程大学,信息工程学院,河南,郑州,450002;解放军信息工程大学,信息工程学院,河南,郑州,450002 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 提出了一种基于可信基点的结构化签名比较算法,对现有的结构化签名比较算法在基点初始化和传播过程中的不足进行了改进,并证明了改进的算法更可信.同时,通过增加循环属性、相同参数信息等方法作为新的划分属性来更细致地刻画函数信息,提高了可信基点在初始化和传播过程中的正确性和匹配率.还提出了一种启发式策略对比较结果是否存在错误匹配进行校验.
|
| 关 键 词： | 结构化签名 可信基点 划分属性 启发式校验 补丁安全性 |
| 文章编号： | 1000-7024（2007）24-5850-04 |
| 收稿时间： | 2007-12-27 |
| 修稿时间： | 2006-12-27 |
Structural comparing algorithm based on trusted base points |
| |
| WEI Qiang,JIN Ran,WANG Qing-xian. Structural comparing algorithm based on trusted base points[J]. Computer Engineering and Design, 2007, 28(24): 5850-5853 |
| |
| Authors: | WEI Qiang JIN Ran WANG Qing-xian |
| |
| Abstract: | A structural signature's comparing algorithm based on trusted base points is presented, which improves current algorithm on base-points initialization and propagation, and has proved that our algorithm is more trusted than the former. At the same time, by adding new partitioning properties such as loop and same number of parameters to describe functions, the algorithm gains improvement on correctness and matching ratio. And a heuristic strategy is presented to verify if there is any mismatching in comparing result. |
| |
| Keywords: | structural signature trusted base point partitioning properties heuristic verification patch's security |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
