Skip to main content
Log in

Algorithm of Multidimensional Data Transmission Using Extremal Uniform Hypergraphs

  • COMPUTER METHODS
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

Recently, unmanned aerial vehicles are being used more often for reconnaissance in combat conditions. Communication with unmanned aerial vehicles must be carried out in a confidential mode to protect against the interception of control, while being fast and resistant to attacks from outside. A new algorithm for transferring confidential data, based on the properties of extremal uniform hypergraphs, is proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. A. A. Mironov, Minimax Under Transportation Constraints (Kluwer Academic, Dordrecht, 1999).

    MATH  Google Scholar 

  2. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 1,” J. Comput. Syst. Sci. Int. 33, 107–116 (1995).

    MathSciNet  MATH  Google Scholar 

  3. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 2,” J. Comput. Syst. Sci. Int. 32 (6), 1–11 (1994).

    MathSciNet  MATH  Google Scholar 

  4. A. A. Zykov, “Hypergraphs,” Usp. Mat. Nauk 29 (6), 89–154 (1974).

    MATH  Google Scholar 

  5. E. F. Moore and C. E. Shannon, “Reliable circuits using less reliable relays,” J. Franklin Inst. 262, 281–297 (1956).

    Article  MathSciNet  Google Scholar 

  6. V. M. Fomichev, Ya. E. Avezova, A. M. Koreneva, and S. N. Kyazhin, “Primitivity and local primitivity of digraphs and nonnegative matrices,” J. Appl. Ind. Math. 12, 453–469 (2018).

    Article  MathSciNet  Google Scholar 

  7. V. Ustimenko, U. Romańczuk-Polubiec, A. Wróblewska, M. K. Polak, and E. Zhupa, “On the constructions of new symmetric ciphers based on nonbijective multivariate maps of prescribed degree,” Secur. Commun. Networks, 2137561 (2019). https://doi.org/10.1155/2019/2137561

  8. A. V. Prolubnikov and R. T. Faizullin, “Encrypt video images with double permutation cipher,” Izv. Chelyab. Nauchn. Tsentra UrO RAN, No. 1, 17–21 (2004).

    Google Scholar 

  9. L. Wang, E. K. Egorova, and A. V. Mokryakov, “Development of hypergraph theory,” J. Comput. Syst. Sci. Int. 57, 109 (2018).

    Article  MathSciNet  Google Scholar 

  10. A. A. Mironov, A. V. Mokryakov, and A. A. Sokolov, “About realization of integer non-negative numbers tuple into 2-dimensional complexes,” Appl. Comput. Math. 6, 58–68 (2007).

    MathSciNet  MATH  Google Scholar 

  11. P. S. Aleksandrov, Combinatorial Topology (Gostekhteorizdat, Moscow, 1947) [in Russian].

    Google Scholar 

  12. A. A. Mironov, “Geometry of points in the space R n realizable into a graph,” Usp. Mat. Nauk 32, 232–233 (1977).

    MATH  Google Scholar 

  13. A. V. Mokryakov and V. I. Tsurkov, “Reconstructing 2-complexes by a nonnegative integer-valued vector,” Autom. Remote Control 72, 2541 (2011).

    Article  MathSciNet  Google Scholar 

  14. A. V. Mokryakov, “Hypergraphs as algebraic structures,” J. Comput. Syst. Sci. Int. 50, 734 (2011).

    Article  MathSciNet  Google Scholar 

  15. E. K. Egorova, A. V. Mokryakov, and A. A. Suvorova, “The concept of data encryption using extreme homogeneous hypergraphs,” in Proceedings of the 18th International Conference on Aviation and Astronautics-2019 (MAI, Moscow, 2019), pp. 98–99.

  16. E. K. Egorova, A. S. Esenkov, and A. V. Mokryakov, “Operations over k-homogeneous hypergraphs and their vectors of the degrees of the vertices,” J. Comput. Syst. Sci. Int. 59, 381 (2020).

    Article  Google Scholar 

  17. A. V. Mokryakov, P. S. Selin, and V. I. Tsurkov, Minimax and Vector Recovery in Graphs (Fizmatlit, Moscow, 2017) [in Russian].

    Google Scholar 

  18. D. S. Kostyanoi, A. V. Mokryakov, and V. I. Tsurkov, “Hypergraph recovery algorithms from a given vector of vertex degrees,” J. Comput. Syst. Sci. Int. 53, 511 (2014).

    Article  MathSciNet  Google Scholar 

Download references

Funding

This study was supported by the Russian Ministry of Education and Science (unique project identifier RFMEFI60719X0312).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. V. Mokryakov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Egorova, E.K., Mokryakov, A.V., Suvorova, A.A. et al. Algorithm of Multidimensional Data Transmission Using Extremal Uniform Hypergraphs. J. Comput. Syst. Sci. Int. 60, 69–74 (2021). https://doi.org/10.1134/S1064230721010056

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230721010056

Navigation