Інституційний репозитарій Черкаського національного університету імені Богдана Хмельницького

Information Protection and Recovery Hamming Codes Based' Hash Technique

Mitsenko, S., Naumenko, S., Yarmilko, A. (2023) Information Protection and Recovery Hamming Codes Based' Hash Technique. Proceedings of the 11-th International Conference "Information Control Systems & Technologies", 3513. с. 64-67. ISSN 1613-0073

[img] Text
paper_5 (1).pdf

Download (778kB)

Резюме

Among the important tasks faced by users of information systems, one of the main ones is ensuring data security, particularly their integrity, and restoring damaged data. Among the methods of solving these problems, hash function schemes are of the most significant interest. However, the favorable properties of this approach are accompanied by high redundancy, especially when monitoring the integrity of a small-sized message. The article discusses the method of constructing a generalized cryptographic hashing method for integrity control and data recovery with the ntroduction of minimal redundancy. The proposed solutions for building interference-resistant systems for encoding and decoding digital data use self-controlled and self-adjusted linear block codes. It is suggested to use a hash code system to control data integrity. They are built according to rules similar to the rules for building linear redundant codes. In this case, the rules for constructing Hamming codes are applied. The focus of attention was on the rational election of the necessary redundant code in order, on the one hand, to ensure the essential reliability of the information and, on the other hand, to avoid burdening the communication channels with a large amount of redundant data. The main advantage of the proposed method is the implementation of information integrity control and defect correction for a given level of security with minimal redundancy and the possibility of localizing integrity violations and correcting a given number of errors. It is shown that the rules for constructing linear codes are similar to those for building linear redundant codes, in particular Hamming codes, which makes it possible to adapt the theory of linear redundant codes to the problems of information protection in systems with limited resource capabilities. The obtained results provide scientific and engineering tools for monitoring and ensuring data integrity with the possibility of checking their authenticity after restoration in the event of an integrity violation. They also provide the conditions for creating promising and improving existing data storage systems. The method has the potential to be implemented in embedded systems, in particular, in IoT systems.

Тип елементу : Стаття
Неконтрольовані ключові слова: Data integrity control ; data recovery ; hash function ; matrix crypto transformations ; redundant codes
Теми: Фізико-математичні науки
Комп'ютерні науки
Комп'ютерні науки
Підрозділи: Факультет обчислювальної техніки, інтелектуальних та управляючих систем
Користувач, що депонує: Наукова Бібліотека
Дата внесення: 23 Лют 2024 10:51
Останні зміни: 23 Лют 2024 10:52
URI: https://eprints.cdu.edu.ua/id/eprint/6033

Actions (login required)

Перегляд елементу Перегляд елементу