gauss-jacques
Version:
Method to obtain modular inverse matrices sized n x n considering computational efficiency and applications in symmetric cryptography.
35 lines (34 loc) • 883 B
JSON
{
"name": "gauss-jacques",
"version": "1.2.3",
"description": "Method to obtain modular inverse matrices sized n x n considering computational efficiency and applications in symmetric cryptography.",
"main": "index.js",
"scripts": {
"test": "echo \"Error: no test specified\" && exit 1"
},
"repository": {
"type": "git",
"url": "https://github.com/adolfos94/Gauss-Jacques.git"
},
"keywords": [
"gauss-jacques",
"security",
"cryptography",
"encryption",
"modular inverse",
"matrix"
],
"bugs": {
"url": "https://github.com/adolfos94/Gauss-Jacques/issues",
"email": "adolfo2794@gmail.com"
},
"contributors": [
"Fausto Abraham Jacques García <jacques@uaq.edu.mx>"
],
"author": "Adolfo Solis <adolfo2794@gmail.com>",
"license": "ISC",
"dependencies": {
"mathjs": "^5.6.0",
"save": "^2.3.3"
}
}