Resistance of the method for associative stegosecurity of cartographic scene data

For further consideration, the article presents earlier introduced concept of a two-dimensional associative masking mechanism used to protect the data of cartographic scenes represented by point objects. The masking mechanism is the basis of associative steganography. In this case, the objects and coordinates of the scene are represented by code words using the alphabet of postal symbols and are masked with stegocontainers developed later. A set of masks is a secret key employed then to recognize a scene represented in a protected form by a set of stegocontainers. The method offence resistance is evaluated from the standpoint of the availability of information about some objects and their coordinates (associations with the terrain map). Two cases of such attacks are considered – the enemy's actual knowledge of the location of an object familiar to them as well as the analysis of the scene for plausibility after recognition using a key. The results of experimental studies are presented, which makes it possible to assert the unconditional or provable (i.e. computational associated with the impossibility of a complete search for keys) resistance of the method. Additionally, a resistance analysis is carried out for the case of excessive masking introduced to increase the noise immunity of stored or transmitted data, when not one, but several sets of masks are used to protect this data.

1. Raikhlin V.A., Vershinin I.S. Modeling of processes of two-dimensional associative masking of distributed point objects of cartography. Nelinejnyj mir = Non-linear world. 2010;8(5):288–296. (In Russ.).

2. Raikhlin V.A., Vershinin I.S., Gibadullin R.F. Substantiation of the principles of associative steganography. Vestnik KGTU im. A.N. Tupoleva = Bulletin KSTU named after A.N. Tupolev. 2015;2:110–119. (In Russ.).

3. Raikhlin V.A., Vershinin I.S., Gibadullin R.F. The elements of associative steganography theory. Moscow University Computational Mathematics and Cybernetics. 2019;43(1):40–46. DOI: 10.3103/S0278641919010072.

4. Duda R.O., Hart P.E., Stork D.G. Pattern classification and scene analysis. New York, Wiley; 1973. 512 p.

5. Xiao N. GIS algorithms. Moscow, DMK Press; 2021. 328 p. (In Russ.).

6. Babenko L.K., Basan A.S., Zhurkin I.G., Makarevich O.B. Data protection of geoinformation systems. Moscow, Gelios ARV; 2010. 336 p. (In Russ.).

7. Tian X., Benkrid K. Mersenne twister random number generation on FPGA, CPU and GPU. 2009 NASA/ESA Conference on Adaptive Hardware and Systems, San Francisco, CA, USA. 2009. p. 460–464. DOI: 10.1109/AHS.2009.11.

8. Gribunin V.G., Okov I.N., Turincev I.V. Digital steganography. Moscow, SOLON-Press; 2002. 272 p. (In Russ.).

9. Moldovyan N.A., Moldovyan A.A., Eremeev M.A. Cryptography: from Primitives to Algorithm Synthesis. Saint Petersburg, BHV-Peterburg; 2004. 448 p. (In Russ.).

10. Morelos-Zaragoza‬ R. The Art of error correcting coding. Moscow, Tekhnosfera; 2006. 320 p. (In Russ.).