H0llyW00dzZ / crypto-rand / 16442059026

91%

push

github

Enhance Testing for RSA Operation in randPrime & randPrimeAsync (#127)

- [+] feat(math_helper.ts): add gcd function to calculate greatest common divisor using the Euclidean algorithm
- [+] test(crypto.async.test.ts, crypto.test.ts): add tests for gcd function to verify coprimality of e and phi

261 of 291 branches covered (89.69%)

Branch coverage included in aggregate %.

5 of 5 new or added lines in 1 file covered. (100.0%)

300 of 346 relevant lines covered (86.71%)

52724782.9 hits per line