UNPKG

crypto-random-prime

Version:

Generate a cryptographically-random probable prime number that passes the Miller-Rabin test with the given number of bits of entropy.

39 lines (38 loc) 1.05 kB
{ "name": "crypto-random-prime", "repository": "github:fabiospampinato/crypto-random-prime", "description": "Generate a cryptographically-random probable prime number that passes the Miller-Rabin test with the given number of bits of entropy.", "license": "MIT", "version": "1.0.1", "type": "module", "main": "dist/index.js", "exports": "./dist/index.js", "types": "./dist/index.d.ts", "scripts": { "benchmark": "tsex benchmark", "benchmark:watch": "tsex benchmark --watch", "clean": "tsex clean", "compile": "tsex compile", "compile:watch": "tsex compile --watch", "test": "tsex test", "test:watch": "tsex test --watch", "prepublishOnly": "tsex prepare" }, "keywords": [ "random", "prime", "number", "generator" ], "dependencies": { "crypto-miller-rabin": "^1.0.1", "crypto-random-bigint": "^2.1.1" }, "devDependencies": { "benchloop": "^2.1.1", "crypto-prime-test": "^1.0.0", "fava": "^0.3.4", "tsex": "^4.0.2", "typescript": "^5.7.3" } }