期刊文献+

基于0-1游程频数检测的链路层加密数据识别 被引量:1

Encrypted Data Recognition of Link Layer Based on 0-1 Run Frequency Detection
下载PDF
导出
摘要 链路层加密数据的识别是进一步开展网络安全防护和协议识别的前提,当前方法主要是对流量所属的上层协议类型进行加密数据识别,采用混合多级的加密流量识别方法,对链路层加密数据的识别性能欠佳。提出一种基于0-1游程频数检测的链路层加密数据识别算法,采用随机性检测理论,进行链路层数据加密解密方案设计,构建标准正态分布函数的统计量对比特序列进行码元频数检测,实现0-1游程频数检测算法。实验表明,该算法能有效解决链路层块内频数检测过程中的分块长度选择及对加密数据识别率低的问题,链路层加密数据准确识别率提高显著,在网络保密数据传输等领域具有很好应用价值。 Link layer encrypting data recognition is the basis of further development of the network security protection and protocol recognition, the current main method takes upper layer protocols and flow types encrypted data identification meth-od, hybrid encryption flow identification method of link layer encrypting multistage is taken, the recognition performance of data is poor. A data encryption algorithm based on the link layer 0-1 run frequency detection is proposed, the random de-tection theory is used, link layer data encryption and decryption scheme design is obtained, construction of standard normal distribution function of statistics of element frequency detection of a bit sequence is achieved, 0-1 run frequency detection algorithm is realized. Experiments show that, this algorithm can effectively solve the low recognition rate problem in block length options of link layer, the link layer encrypting data accurate recognition rate is improved significantly, it has the very good application value in the fields of network security data transmission.
作者 王蓉
出处 《科技通报》 北大核心 2014年第10期145-147,共3页 Bulletin of Science and Technology
关键词 链路层 加密 随机性检测 识别 link layer encryption random detection recognition
  • 相关文献

参考文献6

二级参考文献36

  • 1Rivest R L, Adleman L, Dertouzos M L.On data banks and privacy homomorphisms[Z].Foundations of Secure Computation, 1978. 被引量:1
  • 2Gentry C.Fully homomorphic encryption using ideal lattices[C]//STOC' 09,2009 : 169-178. 被引量:1
  • 3Gentry C.A fully homomorphic encryption scheme[D/OL]. Stanford University , 2009.http : //crypto.stanford.edu/craig. 被引量:1
  • 4van Dijk M, Gentry C, Halevi S, et al.Fully homomorphic encryption over the integers[C]//Volume 6110 of LNCS : Proc of Eurocrypt, 2010 : 24-43. 被引量:1
  • 5Smart N P, Vercauteren F.Fully homomorphic encryption with relatively small key and ciphertext sizes[C]// Volume 6056 of Lecture Notes in Computer Science: Public Key Cryptography-PKC' 10, Springer, 2010. 被引量:1
  • 6Stehle D, Steinfeld R.Faster fully homomorphic encryption, Cryptology ePrint Archive, Report 2010/299[EB/OL]. (2010).http://eprint.iacr.org/. 被引量:1
  • 7Howgrave-Graham N.Approximate integer common divisors[C]//Volume 2146 of Lecture Notes in Computer Science: CaLC' 01.[S.l.] : Springer, 2001 : 51-66. 被引量:1
  • 8RIVEST R, SHAMIR A, ADLEMAN L. A method for obtaining di- gital signatures and public-key cryptosystems [ J ]. Communications of the ACM,1978,21 (2) :120-126. 被引量:1
  • 9RIVEST R, SHAMIR A, DERTOUZOS M, On data banks and pri-va- cy homomorphisms [ J ]. Foundations of Secure Computation, 1978,7 ( 1 ) : 169-177. 被引量:1
  • 10BONEH D, GENTRY. A fully homomorphic encryption scheme [ D ]. Stanford : Stanford University,2009. 被引量:1

共引文献94

同被引文献2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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