How to use the xgcd function from mathjs

Find comprehensive JavaScript mathjs.xgcd code examples handpicked from public code repositorys.

HillFunctions.js

0
1
2
3
4
5
6
7
8
9
10
11
const math = require("mathjs");


//small helped functions
let modInverse = (a, n) => {


    let cache = math.xgcd(a, n);
    //unpack matrix object
    let gcdresult = cache._data[0], inverse = cache._data[1];
    if (gcdresult != 1) {
        console.log("inverse non found");

0

+ 3 other calls in file

hillCipher.js

GitHub: OrghoN/hillCipher

36
37
38
39
40
41
42
43
44
45
46
47
    return math.matrix(encodingKey);
}


function createDecodingKey(encodingKey) {
    var det = math.det(encodingKey);
    var detInv = math.xgcd(det, dictionary.modulo).toArray()[1];


    var decodingKey = math.map(adjugate(encodingKey), function(val) {
        return math.mod((detInv * val), dictionary.modulo);
    });

0

Other functions in mathjs

Sorted by popularity

mathjs.evaluate is the most popular function in mathjs (87200 examples)

Other popular packages:

Home

About

Privacy Policy