Complexity-Based Information Assurance
暂无分享,去创建一个
Unless vulnerabilities can be identified and measured, the information assurance of a system can never be properly designed or guaranteed. Results from a study on complexity evolving within an information system using Mathematica, Swarm, and a new Java complexity probe toolkit are presented in this paper. An underlying definition of information security is hypothesized based upon the attacker and defender as reasoning entities, capable of learning to outwit one another. This leads to a study of the evolution of complexity in an information system and the effects of the environment upon the evolution of information complexity. Understanding the evolution of complexity in a system enables a better understanding of how to measure and quantify the vulnerability of a system. Finally, the design of the Java complexity probe toolkit under construction for automated measurement of information assurance is presented.
[1] David L. Dowe,et al. Minimum Message Length and Kolmogorov Complexity , 1999, Comput. J..
[2] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .
[3] G.J. Minden,et al. A survey of active network research , 1997, IEEE Communications Magazine.
[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .