From eaf7c53ca2ab10fd315ca6584ca022c9fbfc1a83 Mon Sep 17 00:00:00 2001 From: juanelas Date: Tue, 7 Apr 2020 19:36:14 +0200 Subject: [PATCH] randBitsSync --- README.md | 5 ++++- lib/index.browser.bundle.js | 2 +- lib/index.browser.bundle.min.mod.js | 2 +- lib/index.browser.bundle.mod.js | 6 +++--- lib/index.browser.mod.js | 4 ++-- lib/index.node.js | 4 ++-- types/index.d.ts | 2 +- 7 files changed, 14 insertions(+), 11 deletions(-) diff --git a/README.md b/README.md index 413cf24..b0a6cab 100644 --- a/README.md +++ b/README.md @@ -148,7 +148,10 @@ The sync version is NOT RECOMMENDED since it won't use workers and thus it&#
randBetween(max, [min]) ⇒ bigint

Returns a cryptographically secure random integer between [min,max]

-
randBits(bitLength, [forceLength]) ⇒ Buffer | Uint8Array
+
randBits(bitLength, [forceLength]) ⇒ Promise.<(Buffer|Uint8Array)>
+

Secure random bits for both node and browsers. Node version uses crypto.randomFill() and browser one self.crypto.getRandomValues()

+
+
randBitsSync(bitLength, [forceLength]) ⇒ Buffer | Uint8Array

Secure random bits for both node and browsers. Node version uses crypto.randomFill() and browser one self.crypto.getRandomValues()

randBytes(byteLength, [forceLength]) ⇒ Promise.<(Buffer|Uint8Array)>
diff --git a/lib/index.browser.bundle.js b/lib/index.browser.bundle.js index d68a3d1..168087a 100644 --- a/lib/index.browser.bundle.js +++ b/lib/index.browser.bundle.js @@ -1 +1 @@ -var bigintCryptoUtils=function(n){"use strict";function t(n){return(n=BigInt(n))>=0n?n:-n}function r(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)return NaN;let r=0n,e=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,a=t%n,c=r-i*s,u=e-o*s;t=n,n=a,r=i,e=o,i=c,o=u}return{b:t,x:r,y:e}}function i(n,r){if(n=t(n),r=t(r),0n===n)return r;if(0n===r)return n;let e=0n;for(;!(1n&(n|r));)n>>=1n,r>>=1n,e++;for(;!(1n&n);)n>>=1n;do{for(;!(1n&r);)r>>=1n;if(n>r){const t=n;n=r,r=t}r-=n}while(r);return n<0;)r%2n===1n&&(i=i*n%e),r/=2n,n=n**2n%e;return i}function a(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}async function c(n,t=16){return"number"==typeof n&&(n=BigInt(n)),new Promise((r,e)=>{const i=new Worker(m());i.onmessage=n=>{i.terminate(),r(n.data.isPrime)},i.onmessageerror=n=>{e(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function u(n,t=1n){if(n<=t)throw new Error("max must be > min");const e=n-t,i=r(e);let o;do{o=l(f(i))}while(o>e);return o+t}function f(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const r=d(Math.ceil(n/8),!1),e=n%8;if(e&&(r[0]=r[0]&2**e-1),t){const n=e?2**(e-1):128;r[0]=r[0]|n}return r}function g(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);return new Promise((function(r){const e=new Uint8Array(n);self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),r(e)}))}function d(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);{const r=new Uint8Array(n);return self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),r}}function l(n){let t=0n;for(const r of n.values()){const n=BigInt(r);t=(t< {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function w(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const r=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t=(t=BigInt(t))?n:t},n.min=function(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n},n.modInv=o,n.modPow=s,n.prime=function(n,t=16){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);return new Promise(r=>{const e=[],i=(i,o)=>{if(i.isPrime){for(let n=0;ni(n.data,t),e.push(t)}}for(let r=0;r 0 and it is ${n}`);let r=0n;do{r=l(d(n/8,!0))}while(!w(r,t));return r},n.randBetween=u,n.randBits=async function(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const r=Math.ceil(n/8),e=n%8,i=await g(r,!1);if(e&&(i[0]=i[0]&2**e-1),t){const n=e?2**(e-1):128;i[0]=i[0]|n}return i},n.randBitsSync=f,n.randBytes=g,n.randBytesSync=d,n.toZn=a,n}({}); +var bigintCryptoUtils=function(n){"use strict";function t(n){return(n=BigInt(n))>=0n?n:-n}function r(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)return NaN;let r=0n,e=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,a=t%n,c=r-i*s,u=e-o*s;t=n,n=a,r=i,e=o,i=c,o=u}return{b:t,x:r,y:e}}function i(n,r){if(n=t(n),r=t(r),0n===n)return r;if(0n===r)return n;let e=0n;for(;!(1n&(n|r));)n>>=1n,r>>=1n,e++;for(;!(1n&n);)n>>=1n;do{for(;!(1n&r);)r>>=1n;if(n>r){const t=n;n=r,r=t}r-=n}while(r);return n<0;)r%2n===1n&&(i=i*n%e),r/=2n,n=n**2n%e;return i}function a(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function c(n,t=16){return"number"==typeof n&&(n=BigInt(n)),new Promise((r,e)=>{const i=new Worker(w());i.onmessage=n=>{i.terminate(),r(n.data.isPrime)},i.onmessageerror=n=>{e(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function u(n,t=1n){if(n<=t)throw new Error("max must be > min");const e=n-t,i=r(e);let o;do{o=m(g(i))}while(o>e);return o+t}async function f(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const r=Math.ceil(n/8),e=n%8,i=await d(r,!1);if(e&&(i[0]=i[0]&2**e-1),t){const n=e?2**(e-1):128;i[0]=i[0]|n}return i}function g(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const r=l(Math.ceil(n/8),!1),e=n%8;if(e&&(r[0]=r[0]&2**e-1),t){const n=e?2**(e-1):128;r[0]=r[0]|n}return r}function d(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);return new Promise((function(r){const e=new Uint8Array(n);self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),r(e)}))}function l(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);{const r=new Uint8Array(n);return self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),r}}function m(n){let t=0n;for(const r of n.values()){const n=BigInt(r);t=(t< {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function h(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const r=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t=(t=BigInt(t))?n:t},n.min=function(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n},n.modInv=o,n.modPow=s,n.prime=function(n,t=16){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);return new Promise(r=>{const e=[],i=(i,o)=>{if(i.isPrime){for(let n=0;ni(n.data,t),e.push(t)}}for(let r=0;r 0 and it is ${n}`);let r=0n;do{r=m(f(n,!0))}while(!h(r,t));return r},n.randBetween=u,n.randBits=f,n.randBitsSync=g,n.randBytes=d,n.randBytesSync=l,n.toZn=a,n}({}); diff --git a/lib/index.browser.bundle.min.mod.js b/lib/index.browser.bundle.min.mod.js index 6042ed9..ec3c691 100644 --- a/lib/index.browser.bundle.min.mod.js +++ b/lib/index.browser.bundle.min.mod.js @@ -1 +1 @@ -function n(n){return(n=BigInt(n))>=0n?n:-n}function t(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)return NaN;let e=0n,r=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,a=t%n,u=e-i*s,c=r-o*s;t=n,n=a,e=i,r=o,i=u,o=c}return{b:t,x:e,y:r}}function r(t,e){if(t=n(t),e=n(e),0n===t)return e;if(0n===e)return t;let r=0n;for(;!(1n&(t|e));)t>>=1n,e>>=1n,r++;for(;!(1n&t);)t>>=1n;do{for(;!(1n&e);)e>>=1n;if(t>e){const n=t;t=e,e=n}e-=t}while(e);return t<=(t=BigInt(t))?n:t}function s(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n}function a(n,t){const r=e(c(n,t),t);return 1n!==r.b?NaN:c(r.x,t)}function u(t,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return 0n;if(t=c(t,r),(e=BigInt(e))<0n)return a(u(t,n(e),r),r);let i=1n;for(;e>0;)e%2n===1n&&(i=i*t%r),e/=2n,t=t**2n%r;return i}function c(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}async function f(n,t=16){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const i=new Worker(B());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function g(n,t=16){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;ni(n.data,t),r.push(t)}}for(let e=0;e 0 and it is ${n}`);let e=0n;do{e=h(w(n,!0))}while(!I(e,t));return e}function d(n,e=1n){if(n<=e)throw new Error("max must be > min");const r=n-e,i=t(r);let o;do{o=h(w(i))}while(o>r);return o+e}function w(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const e=$(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function m(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);return new Promise((function(e){const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}))}function $(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);let e;return e=new Uint8Array(n),self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}function h(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t< {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function I(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t=0n?n:-n}function t(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)return NaN;let e=0n,r=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,a=t%n,c=e-i*s,u=r-o*s;t=n,n=a,e=i,r=o,i=c,o=u}return{b:t,x:e,y:r}}function r(t,e){if(t=n(t),e=n(e),0n===t)return e;if(0n===e)return t;let r=0n;for(;!(1n&(t|e));)t>>=1n,e>>=1n,r++;for(;!(1n&t);)t>>=1n;do{for(;!(1n&e);)e>>=1n;if(t>e){const n=t;t=e,e=n}e-=t}while(e);return t<=(t=BigInt(t))?n:t}function s(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n}function a(n,t){const r=e(u(n,t),t);return 1n!==r.b?NaN:u(r.x,t)}function c(t,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return 0n;if(t=u(t,r),(e=BigInt(e))<0n)return a(c(t,n(e),r),r);let i=1n;for(;e>0;)e%2n===1n&&(i=i*t%r),e/=2n,t=t**2n%r;return i}function u(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function f(n,t=16){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const i=new Worker(B());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function g(n,t=16){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;ni(n.data,t),r.push(t)}}for(let e=0;e 0 and it is ${n}`);let e=0n;do{e=b(w(n,!0))}while(!I(e,t));return e}function d(n,e=1n){if(n<=e)throw new Error("max must be > min");const r=n-e,i=t(r);let o;do{o=b(h(i))}while(o>r);return o+e}async function w(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const e=Math.ceil(n/8),r=n%8,i=await m(e,!1);if(r&&(i[0]=i[0]&2**r-1),t){const n=r?2**(r-1):128;i[0]=i[0]|n}return i}function h(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const e=$(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function m(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);return new Promise((function(e){const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}))}function $(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function b(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t< {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function I(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite) + * @returns {Promise} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite) */ -async function isProbablyPrime (w, iterations = 16) { +function isProbablyPrime (w, iterations = 16) { if (typeof w === 'number') { w = BigInt(w) } @@ -321,7 +321,7 @@ function primeSync (bitLength, iterations = 16) { if (bitLength < 1) { throw new RangeError(`bitLength MUST be > 0 and it is ${bitLength}`) } let rnd = 0n do { - rnd = fromBuffer(randBytesSync(bitLength / 8, true)) + rnd = fromBuffer(randBits(bitLength, true)) } while (!_isProbablyPrime(rnd, iterations)) return rnd } diff --git a/lib/index.browser.mod.js b/lib/index.browser.mod.js index ff6af1f..ca4afbf 100644 --- a/lib/index.browser.mod.js +++ b/lib/index.browser.mod.js @@ -8,9 +8,9 @@ export { abs, bitLength, eGcd, gcd, lcm, max, min, modInv, modPow, toZn } from ' * @param {number | bigint} w An integer to be tested for primality * @param {number} [iterations = 16] The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3 * - * @return {Promise} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite) + * @returns {Promise} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite) */ -async function isProbablyPrime (w, iterations = 16) { +function isProbablyPrime (w, iterations = 16) { if (typeof w === 'number') { w = BigInt(w) } diff --git a/lib/index.node.js b/lib/index.node.js index 14227f8..2ecab1a 100644 --- a/lib/index.node.js +++ b/lib/index.node.js @@ -11,9 +11,9 @@ var bigintModArith = require('bigint-mod-arith') * @param {number | bigint} w An integer to be tested for primality * @param {number} [iterations = 16] The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3 * - * @return {Promise} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite) + * @returns {Promise} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite) */ -async function isProbablyPrime (w, iterations = 16) { +function isProbablyPrime (w, iterations = 16) { if (typeof w === 'number') { w = BigInt(w) } diff --git a/types/index.d.ts b/types/index.d.ts index 52fe376..d399980 100644 --- a/types/index.d.ts +++ b/types/index.d.ts @@ -53,7 +53,7 @@ export function gcd(a: number | bigint, b: number | bigint): bigint; * @param {number | bigint} w An integer to be tested for primality * @param {number} [iterations = 16] The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3 * - * @return {Promise} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite) + * @returns {Promise} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite) */ export function isProbablyPrime(w: number | bigint, iterations?: number): Promise; /**