期刊文献+

计算机取证中磁盘快速搜索算法研究 被引量:5

Quick Searching Algorithms in Computer Forensics
原文传递
导出
摘要 在计算机取证中,快速而又准确地查找并提取潜在的证据信息成为计算机取证的关键。主要研究了计算机取证中磁盘深层取证的一些方法,并对其中可能用到的搜索和模式匹配算法(包括BF、KMP、BM和BMH算法)在不同缓存条件下进行了对比实验分析,找出了效率最高的取证算法和环境,为实际的计算机磁盘取证项目提供理论支持。 The key to computer forensics is to find out the potential electronic evidence quickly and accurately. In this paper, some methods for how to extract in-depth electronic evidence from the hard disk are discussed, and the efficiencies of several pattern matching algorithms are compared(including BF, KMP, BM and BMH algorithms) under different buffer sizes. This could serve as a theoretical foundation for practical computer forensic cases.
出处 《信息安全与通信保密》 2010年第4期78-80,共3页 Information Security and Communications Privacy
关键词 计算机取证 快速搜索 模式匹配算法 computer forensics quick searching pattern matching algorithm
  • 相关文献

参考文献6

  • 1王笑强.数据修复技术在电子取证中的应用[C]//中国计算机学会.第十九次全国计算机安全学术交流会论文集.西安:中国计算机学会,2004:321-323.
  • 2黄步根.存储介质上电子证据的发现和提取技术[J].计算机应用与软件,2008,25(1):88-90. 被引量:3
  • 3Knuth D E,Morris J H,Pratt V R.Fast Patternin Strings[J].SIAM Journal on Computing,1977,06(02):323-350.
  • 4Boyer R S,Moore J S.A Fast String SearchingAlgorithm[J].Communications of the ACM,1977,20 (10):762-772.
  • 5Horspool R N.Practical Fast Searching inStrings[J].Software Practice and Experience,1980,10(06):501-506.
  • 6宁小军,黄刘生,周智.一种较少比较的串匹配新算法[J].信息安全与通信保密,2006,28(11):158-160. 被引量:2

二级参考文献8

  • 1[1]Boyer R S & Moore J S.A fast string searching algo-rithm.Communications of ACM,1977,20(10):762-772.
  • 2[2]Knuth D E,Morris J H & Pratt V R.Fast pattern ma-tching in string.SIAM Journal onComputing,1977,6(2):323-350.
  • 3[3]Richard M.Karp and Michael O.Rabin.Efficient randomi-zed pattern-matching altorithms.Technical ReportTR-31-81,Aiken Computation Laboratory,Harvard University,1981.
  • 4[4]Eggen,R.E.Eggen and?Mr.Charles Kurak.Pattern matchi-ng in fewer comparisons.In:Southeast con'92,Proceedings,EEE,1992,1(1):410-412.
  • 5[6]Han Kesong,Wang Yongcheng & Chen Guilin.Research-on A FasterAlgorithm for Pattern Matching.Proceeding,ACM,2000.119-124.
  • 6The NTFS documentation[EB/OL].http://www.linux-ntfs.org/content/view/103/42/.
  • 7文件格式大全[EB/OL].http://www.moon-soft.com/program/FORMAT/.
  • 8黄步根.硬盘数据修复技术[J].江苏警官学院学报,1999,15(4):94-99. 被引量:4

共引文献4

同被引文献25

  • 1丁丽萍.论计算机取证的原则和步骤[J].中国人民公安大学学报(自然科学版),2005,11(1):70-73. 被引量:19
  • 2HUME A,SUNDAY D.Fast String Searching[J].SoftwarePractice and Experience,1991,21(11):1221-1248.
  • 3KNUTH D,MORRIS J H,PRATT V Jr.Fast Pattern Matching in Strings[J].SIAM Journal on Computing,1977,06(02):323-350.
  • 4AGRAWAL R,SRIKANT R.Fast Algorithms for Mining Assoiation Rules in Large Databases[C].Santigo de Chile,Chile:Morgan Kaufmann,1994:487-499.
  • 5ZAKI M J.Scalable Algorithms for Association Mining[J].IEEE Transactions on Knowledge and Data Engineering,2000,12(03):372-390.
  • 6HAN J,PEI J,YIN Y,et al.Mining Frequent Patterns Without Candidate Generation[J].Data Mining and Knowledge Discovery,2004,08:53-87.
  • 7AGRAWAL R,MIELINSK T,SWAMI A.Mining Association Rules Between Sets of Items in Large Databases[C].USA,Washington D.C.:ACM Press,1993:207-216.
  • 8LIN Chuan-sheng, DUNG Lan-rong. A NAND Flash MemoryController for SD/MMC Flash Memory Card[J]. IEEETrans on Magnetics, 2007, 43 (02) : 78-84.
  • 9HOYOUNG J, HYOKIS, SUNGMIN P. LRU-WSR: Integrationof LRU and Writes Sequence Recording for FlashMemory[J], Consumer Electronics, IEEE Trans on,2008(54) :1215-1223.
  • 10ZHANG X M, PARHI K K. High-speed Architectures forParallel Long BCH Encodes[J]. IEEE Trans on VeryLarge Scale Integration (VLSI) systems, 2005, 13(07):872-877.

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部