Development of an encryption method based on cyclic codes
- DOI
- 10.2991/csit-19.2019.34How to use a DOI?
- Keywords
- cyclic code, linear block code, RSA algorithm, noise resistant coding, encryption module, error correction module.
- Abstract
The constant increase in the number of new types of cyber threats actualizes the issues of their information transfer. This article (report) proposes a research on the development of an encryption method based on cyclic codes. The purpose of this article is to develop an open algorithm, even knowing which an attacker will not be able to obtain the source text. The devel-oped software encryption module will solve the problem of protecting information for small companies and private users, and also saves a large amount of resources, since one module solves the problem of ensuring the confidentiality and noise stability of transmitted messages. Also, this module is intended for common operating systems. This module is also intended for common operating systems, and user work is carried out using a friendly user interface. The software module performs RSA (Rivest–Shamir–Adleman) asymmetric encryption and jam resistant coding using the BCH (Bose-Chaudhuri-Hocquenghem) code. It is provided an example of the work of the program module developed on the basis of the pro-posed method. Based on the collection and analysis of statistical data output software system, a conclusion about the efficiency of the proposed solution and comparison with analogues has been drawn.
- Copyright
- © 2019, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Vyacheslav Petrenko AU - S.S. Ryabtsev AU - A.S. Pavlov AU - A.A. Apurin PY - 2019/12 DA - 2019/12 TI - Development of an encryption method based on cyclic codes BT - Proceedings of the 21st International Workshop on Computer Science and Information Technologies (CSIT 2019) PB - Atlantis Press SP - 196 EP - 201 SN - 2589-4900 UR - https://doi.org/10.2991/csit-19.2019.34 DO - 10.2991/csit-19.2019.34 ID - Petrenko2019/12 ER -