基于可信基点的结构化签名比较算法

Structural comparing algorithm based on trusted base points

提出了一种基于可信基点的结构化签名比较算法,对现有的结构化签名比较算法在基点初始化和传播过程中的不足进行了改进,并证明了改进的算法更可信。同时,通过增加循环属性、相同参数信息等方法作为新的划分属性采更细致地刻画函数信息,提高了可信基点在初始化和传播过程中的正确性和匹配率。还提出了一种启发式策略对比较结果是否存在错误匹配进行校验。

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.