The Community for Technology Leaders
Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
ISBN: 1-4244-0198-4
pp: 77
P.-M. Bureau , Ecole Polytech. de Montreal, Que., Canada
J.M. Fernandez , Ecole Polytech. de Montreal, Que., Canada
In recent years, malicious software (malware) has become one of the most insidious threats in computer security. However, this is arguably not the result of increased sophistication in malware design or attack strategies, but rather of the increased presence of computers and computer networks within every aspect of society. In this paper, we address and defend the commonly shared point of view that the worst is very much yet to come. We introduce an aim-oriented performance theory for malware and malware attacks, within which we identify some of the performance criteria for measuring their "goodness" with respect to some of the typical objectives for which they are currently used. We also use the OODA loop model, a well-known paradigm of command and control borrowed from military doctrine, as a tool for organising and reasoning about the behavioural characteristics of malware and orchestrated attacks using it. We then identify and discuss particular areas of malware design and deployment strategy in which very little development has been seen in the past, and that are likely sources of increased future malware threats. Finally, we discuss how standard optimisation techniques could be applied to malware design, in order to allow even moderately equipped malicious attackers to quickly converge towards optimal malware attack strategies and tools fine-tuned for the current Internet.
Internet, malicious software, computer security, computer networks, aim-oriented performance theory, OODA loop model, optimal malware attack strategies
P.-M. Bureau, J.M. Fernandez, "Optimising malware", Performance, Computing, and Communications Conference, 2002. 21st IEEE International, vol. 00, no. , pp. 77, 2006, doi:10.1109/.2006.1629455
102 ms
(Ver 3.3 (11022016))