Information assurance through Kolmogorov complexity

The problem of information assurance is approached from the point of view of Kolmogorov complexity and minimum message length criteria. Several theoretical results are obtained, possible applications are discussed and a new metric for measuring complexity is introduced. Utilization of Kolmogorov complexity like metrics as conserved parameters to detect abnormal system behavior is explored. Data and process vulnerabilities are put forward as two different dimensions of vulnerability that can be discussed in terms of Kolmogorov complexity. Finally, these results are utilized to conduct complexity-based vulnerability analysis