Modelling and Solving the Location Problem of Fire Launching Sites

Document Type : Original Article

Authors

Abstract

Using the mathematical and optimization models has significant impact in military strategic decision making problems such as finding location of domestic fire launching site of hard and soft kill. In this paper, an integer linear programming model is developed for location problem of fire launching sites with goal of maximizing the expected value of the target accessibility and protection of strategic realms. Also, two     metaheuristic algorithms based on genetic algorithm and particle swarm optimization algorithm have been designed to solve the problem. The computational results of these methods have been compared to exact answers from modeling. It is revealed that with time limit of 60 seconds, the developed genetic algorithm and particle swarm optimization have 0.16% and 0.07% average deviation from optimal solutions,          indicating they perform efficiently.  
 

Keywords


[1]     D. Stinson, “Cryptography Theory and Practice,” CRC, 2006.
[2]     F. Chabaud and A. Joux, “Differential Collisions in SHA-0,” CRYPTO '98, 1998.
[3]     M. Stevens, P. Karpman, and T. Peyrin, “Freestart Collision for Full SHA-1,” Eurocrypt 2016: Advances in       Cryptology – Eurocrypt 2016, LNCS, vol. 9665, pp.        459-483, 2016.
[4]     S. Yu, L. Yang, W. Lei, S. Kazuo, and O. Kazuo, “Applications to ECHO and Grøstl,” In Proceedings of Asiacrypt, vol. LNCS 6477, pp. 38-55, 2010.
[5]     S. K. Sanadhya and P. Sarkar, “New Collision Attacks Against up To 24-step SHA-2,” IACR Cryptology, 2008.
[6]     T. Peyrin, “Improved Differential Attacks for ECHO and Grøstl,” Cryptology 2010, 2010.
[7]     D. Khovratovich and I. Nikoli´c, “Rotational cryptanalysis of ARX,” FSE 2010. LNCS, vol. 6147, pp. 333–346, 2010.
[8]     K. Dmitry, I. Nikolic, J. Pieprzyk, P. Sokolowski, and R. Steinfeld, “Rotational Cryptanalysis of ARX Revisited,” IACR Cryptology, 2015.
[9]     D. Bernstein, “CubeHash specification,” Department of Computer Science University of Illinois at Chicago Chicago, IL 60607–7045, 2009.
 [10]  A. Canteaut, T. Pornin, E. Bresson, and T. Icart, “Shabal, a Submission to NIST's Cryptographic Hash Algorithm Competition,” Submission to NIST, 2008.
[11]  V. Jha, “Cryptanalysis of Cubehash,” Aalto School of Science and Technology, 2010.
[12]  E. Brier and T. Peyrin, “Cryptanalysis of CubeHash,” ACNS 2009, vol. 5536, pp. 354-368, 2009.
[13]  G. V. Assche, “A rotational distinguisher on Shabal’s keyed permutation and its impact on the security proofs,” 2010.