Text encryption with singular values

Abstract

In this paper, we will talk about how text is encrypted. Generally, this is done through a number of processes that spread out the later values in a matrix, which is A through remittances are linear and the use of svd enters, including one key where work will start on the application process. New matrices B1 and B2 of the original text matrix are generated in a compound, and the key is entered. The second step of the dispersion involves utilizing SVD on the final matrices and switching the S matrix between the two spectra for the new matrices C1 and C2, which signifies inserting the matrix of the encoded text as correlative F = [C1 C2]. To determine the accuracy of the work, we calculated the matrix of the absolute value of the difference between the matrix of numbers for the original text characters lettering before encryption and the matrix of numbers for text characters after decryption, which resulted in a zero matrix, as well as the calculation of the average values of this matrix which resulted in a zero matrix.