In this paper, we present a new matrix-based protocol for key exchange. This method is based on non-invertible matrices and the non-commutativity property of the matrix. Systems with non-invertible elements are mathematically non-trivial problems that are cryptographically convenient to use as one-way functions. The complexity of the protocol we present is rely on factorization of matrix, not discrete logarithms, unlike classical Diffie-Hellman. The accuracy of the proposed protocol has been verified with numerous of examples.
17 February 2022 in Problems of Informatization and Management
In the article, an efficient method of hiding secret information in text-type containers based on changing inter-symbol intervals is suggested. Here, the hiding process is performed by selecting the symbols of the container in a pseudo-random sequence to increase reliability. To obtain a pseudo-random sequence the linear congruent method and Feigenbaum's quadratic function were used.
1 June 2025 in Problems of Informatization and Management
The article is devoted to the study and processing of methods for creating electronic document management systems of medical organizations, increasing the level of protection of documents and information stored and processed in this system. For this purpose, International and local experience in the field of legislation on the protection of documents containing personal and medical information of patients in medical organizations was commented in the article, the issue of creating a distributed structured electronic document management system for medical organizations was considered, various protection methods were used to ensure the confidentiality of personal and medical information of patients, it was proposed to use the authentication procedure and secure encryption methods.
30 September 2026 in Information Technologies and Learning Tools
The object of this study is the automated classification of Cloudflare Bot Management (CBM) firewall log records collected from a university web application. The study addresses the problem of distinguishing potentially malicious requests from legitimate academic traffic in the digital educational infrastructure of a higher education institution. Static threshold-based firewall rules are often insufficient for analyzing multidimensional security indicators, including WAF machine-learning attack scores, bot-related signals, TLS fingerprint information, and request-level metadata. A comparative machine-learning framework was developed using six supervised classifiers: Random Forest (RF), Gradient Boosting (GB), Decision Tree (DT), Support Vector Machine (SVM), K-Nearest Neighbors (KNN), and Gaussian Naive Bayes (GNB). The models were trained and evaluated on 24 engineered features extracted from 500 CBM log entries using a stratified 80/20 train-test split and 5-fold cross-validation. RF, GB, and DT achieved 100% test accuracy on the constructed dataset, while SVM, KNN, and GNB achieved 96.00%, 93.00%, and 44.00%, respectively. These results should be interpreted in the context of the proposed labelling procedure, because the target variable was derived from WAF score aggregation and the same group of WAF indicators was also used among the input features. Feature importance analysis showed that WAF machine-learning attack scores formed the dominant group of classification indicators. The Decision Tree model produced an interpretable threshold rule based on the normalized “wafMlAttackScore”. This rule is not presented as a fully deployed production firewall policy, but as a candidate rule that can support further expert validation and configuration of university WAF security policies. The proposed approach therefore contributes to the interpretation and secondary classification of CBM firewall logs in educational ICT security management.
This article proposes a linear-time correlation-controlled shuffling method that attenuates Pearson correlation by permuting one variable through local swaps on a random regular graph. Each round processes a fixed edge order and accepts only vertex-disjoint swaps, producing greedy matching rather than a standard interchange-process update. The analysis uses the induced first-moment operator. A uniform lower bound on edge acceptance yields a Laplacian-domination relation, while a lower bound on the probability that vertices remain unmatched controls the negative spectrum. Conditional on the loop-deleted realized graph being connected and having a spectral gap bounded away from zero, the absolute value of the expected correlation contracts exponentially. For every fixed same-sign attenuation target, an activation probability exists that attains the target in expectation. Finite-sample calibration uses a fixed-budget multi-resolution direct search without assuming monotonicity. Because the procedure applies only permutations, the marginal distribution is preserved exactly. Under fixed degree and fixed calibration budgets, both calibration and shuffling scale linearly with sample size. Experiments show small target errors, exact marginal preservation, and approximately linear runtime scaling. A matched-degree spectral ablation further shows that, with degree and edge count held fixed, the higher-gap random regular graph exhibits substantially faster decay of the mean correlation than the low-gap regular circulant graph.