计算机科学 ›› 2012, Vol. 39 ›› Issue (10): 303-307.

• 体系结构 • 上一篇    下一篇

自动复位快速环树数据采集算法

陈志锋,李清宝,王炜,林夕杰   

  1. (解放军信息工程大学 郑州450002)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Quick Data Collecting Algorithm Based on Ring-tree with Auto-reset

  • Online:2018-11-16 Published:2018-11-16

摘要: 获取时序可编程逻辑器件内部状态转移关系是可编程逻辑器件逆向分析的关键和安全缺陷分析的基础。在分析现有可编程逻辑器件数据采集算法的基础上,基于环树数据采集算法,提出一种自动复位机制,以实现可编程逻辑器件功能全集数据的采集;针对环树数据采集算法驱动路径动态变化的问题,提出一种动态最短路径算法,以减少状态转移次数,提高采集效率。实验结果显示,自动复位快速环树数据采集算法不仅实现了可编程逻辑器件功能全集数据的正确采集,而且数据采集效率比现有算法提高了约9%。

关键词: 可编程逻辑器件,数据采集,自动复位,最短路径

Abstract: Acquisition of insidcstates transition-functions of sequential PI_D is the main point of PLD reverse analysis and the foundation of security vulnerability analysis. With the analysis of existing data collecting algorithms,an auto-reset mechanism was proposed to collect the PLD functional corpora data based on the ring-tree data collecting algorithm.For the dynamic change problems of driver paths of the ring-tree data collecting algorithm, a novel dynamic shortest path algorithm was proposed which reduces the times of state transition and improves the efficiency of data collection.Experiment results show that quick data collecting algorithm based on ring-tree with auto-reset can not only realize the collection of functional corpora data correctly, but also increase about 9% of data collection efficiency than existing algo- rithms.

Key words: Programmable logic device, Data collection, Auto-reset, Shortest path

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!