Develop Coding Operations by Improving Applications of Matrix Algebra in Cross Mathematical Notation

Currently encryption methods are much more sophisticated , among them the most used is the RSA algorithm, created by Rivest, Shamir, Adleman pblished in 1977 in the journal Scientific American, based on prime numbers of great magnitude, the which uses the model of a public and a private key (asymmetric encryption) . The reliability offered by the RSA algorithm allowed Phil Zimmerman in 1991, develop PGP (Pretty Good Privacy) which is an encryption algorithm that works easily on home computers. PGP uses classical cryptography concepts and combines them with the RSA algorithm . In most classical ciphers, the algorithms developed are based on mathematical foundations, for example, modular arithmetic, the fundamental theorem of arithmetic and its applications to prime numbers, such as the Euler function and the Chinese remainder theorem, among others. others. For the transposition encryption system, an encryption and decryption algorithm can be determined whose mathematical basis is based on matrix algebra .