Xedge>> Gauss-Jacques>> 返回
项目作者： adolfos94

项目描述 ：
Method to obtain modular inverse matrices sized n x n considering computational efficiency and applications in symmetric cryptography.
高级语言： JavaScript
项目地址: git://github.com/adolfos94/Gauss-Jacques.git
创建时间： 2019-04-05T07:21:35Z
项目社区：https://github.com/adolfos94/Gauss-Jacques
开源协议：
下载


Gauss - Jacques

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.

The proposed Gauss-Jacques method to obtain modular inverse matrices variable sized without a theoretical limit.

Installation

This is a Node.js module.

Installation is done using the npm install command:

  1.     npm i gauss-jacques

Example of use

  2. // Import the module
  3. const GaussJacques = require( 'gauss-jacques' );
  5. // Let K a (N x N) matrix
  6. let K =
  7.     [ [ 42, 97, 23 ],
  8.     [ 51, 30, 77 ],
  9.     [ 33, 7, 66 ] ];
  11. // Let m a prime number, referred as modulo.
  12. const m = 89;
  14. // Calculate the inverModular of K
  15. let invK = GaussJacques.inverseModular( K, m );
  17. // result:
  18. console.log(invK);
  20.     [ [ 79, 85, 54 ], 
  21.     [ 56, 20, 3 ], 
  22.     [ 53, 70, 59 ] ];

The main function is:

Contributing

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

Authors