An Application of Information Theory to Intrusion Detection

  • Authors:
  • E. Earl Eiland;Lorie M. Liebrock

  • Affiliations:
  • New Mexico Inst. of Mining and Technology, Socorro, New Mexico;New Mexico Inst. of Mining and Technology, Socorro, New Mexico USA

  • Venue:
  • IWIA '06 Proceedings of the Fourth IEEE International Workshop on Information Assurance
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Zero-day attacks, new (anomalous) attacks exploiting previously unknown system vulnerabilities, are a serious threat. Defending against them is no easy task, however. Having identified "degree of system knowledge" as one difference between legitimate and illegitimate users, theorists have drawn on information theory as a basis for intrusion detection. In particular, Kolmogorov complexity (K) has been used successfully. In this work, we consider information distance (Observed_K - Expected_K) as a method of detecting system scans. Observed_K is computed directly, Expected K is taken from compression tests shared herein. Results are encouraging. Observed scan traffic has an information distance at least an order of magnitude greater than the threshold value we determined for normal Internet traffic. With 320 KB packet blocks, separation between distributions appears to exceed 4\sigma.