Calculate of modular inverse matrices using Gauss-Jacques algorithm sized n x n for applications in cryptography.
Method to obtain modular inverse matrices sized n x n considering computational efficiency and applications in symmetric cryptography. It is also discussed about some phenomenon in linear arithmetic spaces and some theorems found. This work is an important contribution to knowledge and direct appliance in data security problems in computer science context. Based on research and experiments conducted, it was observed that this method is precise, defined and finite, so it can be programmed in any computer language.
n = 10; % size of the matrixK = randi(100,n,n); % generate a randon matrix with size 'n'm = 89; % modulus -> prime number[InvMod, I] = gauss_jacques(K, m);
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
This project is licensed under the MIT License