COMPUTATIONAL THINKING IN THE PROBLEM OF RELIABLE AND SECURE DATA TRANSMISSION OVER A COMMUNICATION CHANNEL
There are three problems that have to be solved when transmitting data over communication channels: detection and correction of errors caused by interference in communication channels; ensuring of transmitted data privacy; protection against injection of false data. Traditionally, each of these problems is solved based on the use of a separate mechanism – respectively, error correction coding, encryption, formation (on the sender's side) and verification (on the recipient's side) of the message authentication code. As a result, real data transmission systems are inefficient and overly complex. Thus, there is an inventive problem: it is necessary to find a single technical solution that ensures protection against accidental distortion of information in a communication channel with interference; information privacy; protection against intentional distortion of information. In the work, computational thinking is used to solve this problem, heuristic approaches for resolving technical contradictions and the method of control questions are used. The ideal final result is being formulated: a code is required that solves all three of the above-mentioned information security problems and at the same time provides a predetermined probability of correct reception of information when solving the first problem. The essence of the solution is being described – a stochastic coding scheme.
Authors
- M. A. Ivanov (ORCID: https://orcid.org/0000-0002-3204-8055)
- Andrey Starikovskiy (ORCID: https://orcid.org/0000-0001-5299-8376)
- Kirill V. Agievets
- Andarbek Z. Ahmadov
- Grigory A. Ivanenko
- Mikael A. Kondakhchan
Institutions
- State University of Management (RU)
- National Research Nuclear University MEPhI (RU)
Publication Details
- Journal
- Bezopasnost informacionnyh tehnology
- Published
- 2025-05-01
- DOI
- https://doi.org/10.26583/bit.2025.2.09
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00