Oleksandr P. Markovskyi

Efficient burst error correction method for application in low frequency channels and data storage units

This paper investigates a simple and effective method for the correction of errors that occur in bursts during data transmission in low - frequency channels but also during data storage in magnetic and optical disks. The specific technique is based on the binary weighted checksum which is computed with logical operations. It is shown that the solution proposed not only guarantees the correction of any single error burst but it also lowers the computational complexity reducing the required redundancy and making use of simple procedures and rules out erroneous correction. Finally, the use of the algorithm is illustrated via the thorough presentation of an example of erroneous data transmission.

Fast subscriber identification based on the zero knowledge principle for multimedia content distribution

In this article, an innovative method is proposed for the realisation of zero knowledge subscriber identification schemes that is suitable for multimedia content distribution applications. The fundamental principle underlying the proposed method is the concept of using one-way Boolean functions as transformations for the zero knowledge identification. This enables the increase of the speed of completion of the identification process by two to three orders of magnitude, compared to the corresponding speed when using modular arithmetic with large numbers. A method for the establishment of one way Boolean functions for zero knowledge identification has been developed. Two examples for the application of the proposed method are presented.

Performance Increase of Error Control Operation on Data Transmission

In this paper a new approach is proposed to increase the performance of the operation of error control on data transmission. Specifically, a hardware structure for parallel Cyclic Redundancy Check (CRC) calculation is developed to speed up the error control operation of data transmission. Based on a study of the properties of both CRC and Check Sum (CS) a new error detecting scheme is developed which combines CRC and CS. Also it is shown that the proposed error detecting scheme ensures high reliability and performance of the error control operation on data transmission in comparison to CRC alone.

Two level efficient user authentication scheme

User authentication procedures are a computer systems first line of defense against malicious attacks that could potentially jeopardize its availability and reliability. Computational complexity considerations may prevent system designers from implementing efficient authentication procedures. This paper presents a robust two level authentication procedure is presented that is highly efficient and suitable for multi-user systems. Authentication is attained in only a single cycle of exchanges between the user and the authentication system. Further advantages arise from the fact that with the proposed technique, it is not necessary to store lists of passwords and therefore the overhead caused in systems with large numbers of registered users is minimal. The proposed architecture is shown to be reliable while creating significant economies in the amount of information that needs to be stored. These facts therefore render the architecture highly suitable for hardware implementations.

Burst error correction using binary multiplication without carry

An innovative approach to error detection and correction is presented that permits accelerated performance with reduced computational complexity as compared to Reed - Solomon codes, while using the same number of bits for error control. The approach is based on the mathematical operation of binary multiplication without carry. The mathematical background of the proposed approach is first presented. The procedure for detecting transmission errors is then explained. This is followed by the development of the method for error correction. A numerical example for both procedures is given. Finally, an analytical comparison of the complexity of both the proposed and the Reed - Solomon methods is presented, that demonstrates the improvements attained.

Efficient zero — Knowledge identification based on one way Boolean transformations

An innovative method for formulating non-linear, oneway Boolean transformations is presented. These transformations are used at the core of an efficient implementation of the theoretically strict concept of zero knowledge identification of users. This implementation uses oneway non-linear Boolean transformations instead of operations on large numbers as a means of reducing the computational overheads related to user authentication for legitimate users and computational systems, without compromising system security. The principles, related to user identification and authentication using Boolean functions, are first presented. The necessary properties of the Boolean functions required are hence determined. A procedure for formulating non-linear one-way Boolean transformations, suitable for use in the context of user identification and authentication is presented. The procedure is iterative and scalable. The steps comprising the procedure are analytically presented. A numerical example of the calculations involved is also given. The computational effort required for formulating one such function of average complexity that is suitable for a large variety of applications, is approximated analytically. The results of statistical experiments verifying the validity of the approximation are also presented. These calculations demonstrate that the proposed method can be feasibly applied, even the only available computational capability is derived from an ordinary personal computer.

Effective method to restore data in distributed data storage systems

In this work, a method for backup and restoring data is proposed. The data is stored on different remote disks (storage nodes) and temporary or permanent loss of access to any q of them appears. The high efficiency of the proposed method is achieved by using a theoretically proved minimum number of backup storage nodes, which is equal to the number of the disks to which access has been lost. The theoretical justification with a methodology of backup codes and their use for data recovery, which is illustrated by examples, is presented. The theoretical and experimental effectiveness evaluation of the proposed method is demonstrated as well. The proposed method is aimed to ensure a high level of survivability of system of distributed data storage for military applications.

Fast implementation zero knowledge identification schemes using the Galois Fields arithmetic

This article proposes an approach that accelerates the realization of user identification schemes that follow the principle of zero knowledge. The proposed approach is based on using finite field arithmetic to replace the usual modular arithmetic approaches. The application of this efficient method that was developed using Galois Fields, renders feasible an exponential reduction of the computation time required for classical zero knowledge authentication methods, such as FFSIS, Schnorr and Guillou & Quisquater. Modifications of the relevant schemes are presented that use Galois Field multiplication operations. It is shown, both theoretically and experimentally that the proposed procedure attains a per order acceleration of the execution time required for the user authentication by 2-3 orders of magnitude, via a hardware implementation.

Double burst error correction method: Case of interference incidents during data transmission in wired channels

Digital Ecosystems are largely driven by capabilities and infrastructures offered by cyber engineering, such as security, trust and risk containment. This paper seeks to promote trust in the reliability of cyber infrastructure systems by introducing an innovative technique for efficient correction of burst errors that have been caused by single or double interference incidents during data transmission in wired channels. Bridging the gap that common error correction codes have caused because of the extremely high complexity of the encoding and decoding processes, the proposed method obtains reliable double burst error correction reducing both time complexity of processes involved and redundancy. The method that relies on a modification of the weighted checksum is presented and several issues such as the steps for the computation of the control code, the categorization and the correction of bursts of distorted bits as well as the requirements for the selection of weight coefficients are analyzed. Finally, the superiority of the technique is showed via the illustration of relevant examples.

Erasure Code for Efficient Error Correction in Block Data Transmission

This paper proposes an innovative technique for correcting transmission burst errors in data transmitted over amplitude modulated channels suffering from strong electromagnetic interference, such as encountered in military situations. Efficiency is achieved by separating the error detection from the correction process and using different codes for each case. The proposed technique is based on simple mathematical operations and is suitable for implementation in FPGA devices. It is shown to be more efficient than existing ones, according to criteria that are relevant to current applications.