# BINARY LINEAR TRANSFORMATIONS IN MODIFICATIONS OF RSA ALGORITHM OF IMAGES

2020;
: 37-42

Accepted: October 25, 2020

Цитування за ДСТУ: Ковальчук А. М. Бінарні лінійні перетворення в модифікаціях алгоритму RSA шифрування зображень. Український журнал інформаційних технологій. 2020, т. 2, № 1. С. 37–42.

Citation APA: Kovalchuk, A. M. (2020). Binary linear transformations in modifications of RSA algorithm of images. Ukrainian Journal of Information Technology, 2(1), 37–42. https://doi.org/10.23939/ujit2020.02.037

Authors:
1
Lviv Politechnik National University, Department of Publishing Information Technologies

The images are one of the most used kinds of the information in modern information company. Therefore actual problems is the organization of protection from unauthorized access and usage. An important characteristic of the image is the presence of contours in the image. The task of contour selection requires the use of operations on adjacent elements that are sensitive to change and suppress areas of constant levels of brightness, that is, contours are those areas where changes occur, becoming light, while other parts of the image remain dark. Mathematically, the ideal outline is to break the spatial function of the brightness levels in the image plane. Therefore, contour selection means finding the most dramatic changes, that is, the maxima of the gradient vector module. This is one of the reasons that the contours remain in the image when encrypted in the RSA system, since the encryption here is based on a modular elevation of some natural number. At the same time, on the contour and on the neighboring contours of the peak villages, the elevation of the brightness value gives an even bigger gap.

Problem protect from unauthorized access is by more composite in matching with a problem protect from usage. Basis for organization of protection is the interpretation of the image as stochastic signal. It stipulates carry of methods of encoding of signals on a case of the images. But the images are a specific signal, which one in possesses, is padding to representative selfless creativeness, also by visual selfless creativeness. Therefore to methods of encoding, in case of their usage concerning the images, one more requirement – full noise of the coded image is put forward. It is necessary to make to impossible usage of methods of visual image processing. The algorithm RSA is one of the most used production specifications of encoding of signals. In attitude of the images there are some problems of its encoding, the contours on the coded image are in particular saved. Therefore actual problem is the mining of modification to a method RSA such, that: to supply stability to decoding; to supply full noise of the images. One of pathes of the solution of this problem is usage of affine transformations.

1. Gryciuk, Yu., & Grytsyuk, P. (2015). Perfecting of the matrix Affine cryptosystem information security. Computer Science and Information Technologies: Proceedings of Xth International Scientific and Technical Conference (CSIT'2015), 14–17 September, 2015. pp. 67–69. https://doi.org/10.1109/stc-csit.2015.7325433
2. Gryciuk, Yu. I., & Grytsyuk, P. Yu. (2015). Mathematical Foundations of the generation of keys using a permutation cipher Cardano. Scientific Bulletin of UNFU, 25(10), 311–323. https://doi.org/10.15421/40251048
3. Hrytsiuk, Yu., & Grytsyuk, P, Dyak, T., & Hrynyk, H. (2019). Software Development Risk Modeling. IEEE 2019 14th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT 2019), (Vol. 2, pp. 134–137), 17–20 September, 2019. https://doi.org/10.1109/stc-csit.2019.8929778
4. Iane, B. (2007). Tcifrovaia obrabotka izobrazhenii. Moscow: Tekhnosfera. 583 p. [In Russian].
5. Kovalchuk, A., Izonin, I., Strauss, C., & Kustra, N. (2019). Image encryption and decryption schemes using linear and quadratic fractal algorithms and their systems. 1-st International Workshop on Digital Content and Smart Multimedia, DCSMart, 2019. Lviv, Ukraine.
6. Netravali, A. N., & Limb, D. O. (1980). Kodirovanie izobrazhenii: obzor. TIIER, 68(3), 76–117. [In Russian].
7. Pavlidis, T. (1986). Algoritmy mashinoi grafiki i obrabotki izobrazhenii. Moscow: Radio i sviaz. [In Russian].
8. Rashkevych, Y., Kovalchuk, A., Peleshko, D., & Kupchak, M. (2009). Stream Modification of RSA algorithm for image coding with precize contour extraction. Proceedings of the X-th International Conference CADSM, 2009. Lviv-Polyana, Ukraine.
9. Rashkevych, Yu. M., Peleshko, D. D., Kovalchuk, A. M., & Peleshko, M. Z. (2008). Modyfikatsiia alhorytmu RSA dlia deiakykh klasiv zobrazhen. Tekhnichni visti, 1(27), 2(28), 59–62. [In Ukrainian].
10. Shnaier, B. (2003). Prikladnaia kriptografiia. Moscow: Triumf. 815 p. [In Russian].