Back to Current Issues

Analysis of Computational Time on DREAD Model

Didit Suprihanto, Retantyo Wardoyo,

Department of Electrical Engineering,Universitas Mulawarman, Kalimantan Timur, Indonesia, 75123
:10.22362/ijcert/2017/v4/i2/xxxx [UNDER PROCESS]

In identifying the risks, there are several factors needed to consider, such as the extent to which these risks are exploited and how much damage will occur. Considerations for choosing the most appropriate risk reduction that is fast and safe to perform a good calculation. Calculation complexity is one thing that should be considered in selecting an algorithm to be applied to the decision support system. This paper uses DREAD model by discussing the complexity testing and implement DREAD model into a program. Complexity is used to find out the computation time and its ratio completed with the result that the computation time of the final data is affected by the data addition. Therefore, the addition of data greatly affects to the computation time which is required the ratio of computing time, even though it has a bunch of similar data computation time and in fact these have different results that the ratio of computation time does not give any effect (stable). Computation ratio changes from the initial data group until the end of data group are not significantly compared with the value of computing time for each additional 100 tested data.

Didit Suprihanto, “Analysis of Computational Time on DREAD Model”, International Journal Of Computer Engineering In Research Trends, 4(2):53-56, February-2017.

Keywords : Complexity, Computing, DREAD

[1] McEvoy, N., Whitcombe, A.,. Structured Risk Analysis. International conference on infrastructure security, vol. 2437, Bristol , October 1-3, 88-103. 2002
[2] Elky, S., An Introduction to Information System Risk Management. SANS Institute InfoSec Reading Room.copyright©SANS Institute. 2006.
[3] Hamdani., Wardoyo, R., The Complexity Calculation for Group Decision Making Using TOPSIS Algorithm. Advances of Science and Technology for Society AIP Conf. Proc. 1755, 070007-1–070007-7; doi: 10.1063/1.4958502 Published by AIP Publishing. 978-0-7354-1413-6: 2016.
[4] M. Ölmez and U. Lindemann, Procedia Comput. Sci. 28, 130 :2014.
[5] I. Wegener, Complexity Theory (Exploring the Limits of Efficient Algorithms) (Springer-Verlag, Dortmund), pp. 1–380: 2005
[6] Sipser, Michael, Introduction to the Theory of Computation – Second Edition, Thomson Course Technology, Massachusetts : 2006.
[7] Meier, J.D., Mackman, A., Vasireddy, S., Dunner,M., Escamilla, S., Murukan, A.,. Improving web application security: Threats and Countermeasures. Microsoft Corporation.2003..

DOI Link : Not yet assigned

Download :

Refbacks : There are currently no refbacks

Quick Links


Science Central

Score: 13.30

Submit your paper to [email protected]