paillier-bigint - npm Package Compare versions

Comparing version 3.1.1 to 3.1.2

lib/index.browser.bundle.iife.js

@@ -1,1 +0,1 @@
-var paillierBigint=function(n){"use strict";function t(n){return(n=BigInt(n))>=0n?n:-n}function e(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(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,u=t%n,a=e-i*s,c=r-o*s;t=n,n=u,e=i,r=o,i=a,o=c}return{b:t,x:e,y:r}}function i(n,e){return n=BigInt(n),e=BigInt(e),0n===n&&0n===e?0n:t(n*e)/function(n,e){if(n=t(n),e=t(e),0n===n)return e;if(0n===e)return n;let r=0n;for(;!(1n&(n|e));)n>>=1n,e>>=1n,r++;for(;!(1n&n);)n>>=1n;do{for(;!(1n&e);)e>>=1n;if(n>e){const t=n;n=e,e=t}e-=n}while(e);return n<<r}(n,e)}function o(n,t){const e=r(u(n,t),t);return 1n!==e.b?NaN:u(e.x,t)}function s(n,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return 0n;if(n=u(n,r),(e=BigInt(e))<0n)return o(s(n,t(e),r),r);let i=1n;for(;e>0;)e%2n===1n&&(i=i*n%r),e/=2n,n=n**2n%r;return i}function u(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function a(n,t=16){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const i=new Worker(m());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function c(n,t=16){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);if(!y){let e=0n;do{e=d(h(n,!0))}while(!w(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;n<r.length;n++)r[n].terminate();for(;r.length;)r.pop();e(i.value)}else{const e=d(h(n,!0));try{o.postMessage({rnd:e,iterations:t,id:i.id})}catch(n){}}};{const n=m();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),r.push(t)}}for(let e=0;e<r.length;e++){const i=d(h(n,!0));r[e].postMessage({rnd:i,iterations:t,id:e})}})}function l(n,t=16){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);let e=0n;do{e=d(h(n,!0))}while(!w(e,t));return e}function f(n,t=1n){if(n<=t)throw new Error("max must be > min");const r=n-t,i=e(r);let o;do{o=d(h(i))}while(o>r);return o+t}function h(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const e=g(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 g(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);{const e=new Uint8Array(n);return crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function d(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t<<BigInt(8))+n}return t}function m(){let n=`'use strict';const ${r.name}=${r.toString()};const ${o.name}=${o.toString()};const ${s.name}=${s.toString()};const ${u.name}=${u.toString()};const ${h.name}=${h.toString()};const ${g.name}=${g.toString()};const ${f.name}=${f.toString()};const ${a.name}=${w.toString()};${e.toString()}${d.toString()}`;return n+=`onmessage = ${async function(n){const t=await a(n.data.rnd,n.data.iterations);postMessage({isPrime:t,value:n.data.rnd,id:n.data.id})}.toString()};`,function(n){n=`(() => {${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 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<e.length&&e[t]<=n;t++){const r=e[t];if(n===r)return!0;if(n%r===0n)return!1}let r=0n;const i=n-1n;let o=i;for(;o%2n===0n;)o/=2n,++r;const u=i/2n**r;do{let t=s(f(i,2n),u,n);if(1n===t||t===i)continue;let e=1;for(;e<r&&(t=s(t,2n,n),t!==i);){if(1n===t)return!1;e++}if(t!==i)return!1}while(--t);return!0}let y=!1;self.Worker&&(y=!0);class p{constructor(n,t){this.n=n,this._n2=this.n**2n,this.g=t}get bitLength(){return e(this.n)}encrypt(n,t=f(this.n)){return s(this.g,n,this._n2)*s(t,this.n,this._n2)%this._n2}addition(...n){return n.reduce((n,t)=>n*t%this._n2,1n)}multiply(n,t){return s(BigInt(n),BigInt(t),this._n2)}}class b{constructor(n,t,e,r=null,i=null){this.lambda=n,this.mu=t,this._p=r||null,this._q=i||null,this.publicKey=e}get bitLength(){return e(this.publicKey.n)}get n(){return this.publicKey.n}decrypt(n){return $(s(n,this.lambda,this.publicKey._n2),this.publicKey.n)*this.mu%this.publicKey.n}getRandomFactor(n){if(this.publicKey.g!==this.n+1n)throw RangeError("Cannot recover the random factor if publicKey.g != publicKey.n + 1. You should generate yout keys using the simple variant, e.g. generateRandomKeys(3072, true) )");const t=this.decrypt(n),e=(this._p-1n)*(this._q-1n),r=o(this.n,e);return s(n*(1n-t*this.n)%this.publicKey._n2,r,this.n)}}function $(n,t){return(n-1n)/t}function K(n,t){return(f(n)*n+1n)*s(f(n),n,t)%t}return n.PrivateKey=b,n.PublicKey=p,n.generateRandomKeys=async function(n=3072,t=!1){let r,u,a,l,f,h;do{r=await c(Math.floor(n/2)+1),u=await c(Math.floor(n/2)),a=r*u}while(u===r||e(a)!==n);if(!0===t)l=a+1n,f=(r-1n)*(u-1n),h=o(f,a);else{const n=a**2n;l=K(a,n),f=i(r-1n,u-1n),h=o($(s(l,f,n),a),a)}const g=new p(a,l);return{publicKey:g,privateKey:new b(f,h,g,r,u)}},n.generateRandomKeysSync=function(n=3072,t=!1){let r,u,a,c,f,h;do{r=l(Math.floor(n/2)+1),u=l(Math.floor(n/2)),a=r*u}while(u===r||e(a)!==n);if(!0===t)c=a+1n,f=(r-1n)*(u-1n),h=o(f,a);else{const n=a**2n;c=K(a,n),f=i(r-1n,u-1n),h=o($(s(c,f,n),a),a)}const g=new p(a,c);return{publicKey:g,privateKey:new b(f,h,g,r,u)}},n}({});
+var paillierBigint=function(n){"use strict";function t(n){return(n=BigInt(n))>=0n?n:-n}function e(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,u=t%n,a=e-i*s,c=r-o*s;t=n,n=u,e=i,r=o,i=a,o=c}return{g:t,x:e,y:r}}function i(n,e){if(n=t(n),e=t(e),0n===n)return e;if(0n===e)return n;let r=0n;for(;!(1n&(n|e));)n>>=1n,e>>=1n,r++;for(;!(1n&n);)n>>=1n;do{for(;!(1n&e);)e>>=1n;if(n>e){const t=n;n=e,e=t}e-=n}while(e);return n<<r}function o(n,e){return n=BigInt(n),e=BigInt(e),0n===n&&0n===e?BigInt(0):t(n*e)/i(n,e)}function s(n,t){const e=r(a(n,t),t);if(1n!==e.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return a(e.x,t)}function u(n,e,r){if(0n===(r=BigInt(r)))throw new RangeError("n must be > 0");if(1n===r)return BigInt(0);if(n=a(n,r),(e=BigInt(e))<0n)return s(u(n,t(e),r),r);let i=1n;for(;e>0;)e%2n===1n&&(i=i*n%r),e/=2n,n=n**2n%r;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,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0)throw RangeError("w MUST be >= 0");return new Promise((e,r)=>{const i=new Worker(y());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function l(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!p){let e=0n;do{e=m(w(n,!0))}while(!b(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;n<r.length;n++)r[n].terminate();for(;r.length;)r.pop();e(i.value)}else{const e=m(w(n,!0));try{o.postMessage({rnd:e,iterations:t,id:i.id})}catch(n){}}};{const n=y();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),r.push(t)}}for(let e=0;e<r.length;e++)h(n,!0).then((function(n){const i=m(n);r[e].postMessage({rnd:i,iterations:t,id:e})}))})}function f(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=m(w(n,!0))}while(!b(e,t));return e}function g(n,t=1n){if(n<=0n||t<0n||n<=t)throw new RangeError("Arguments MUST be: max > 0 && min >=0 && max > min");const r=n-t,i=e(r);let o;do{o=m(w(i))}while(o>r);return o+t}function h(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8;return new Promise(n=>{(function(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))})(e,!1).then((function(e){if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}n(e)}))})}function w(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=d(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 d(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function m(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t<<BigInt(8))+n}return t}function y(){let n=`'use strict';const ${r.name}=${r.toString()};const ${s.name}=${s.toString()};const ${u.name}=${u.toString()};const ${a.name}=${a.toString()};const ${w.name}=${w.toString()};const ${d.name}=${d.toString()};const ${g.name}=${g.toString()};const ${c.name}=${b.toString()};${e.toString()}${m.toString()}`;return n+=`onmessage = ${async function(n){const t=await c(n.data.rnd,n.data.iterations);postMessage({isPrime:t,value:n.data.rnd,id:n.data.id})}.toString()};`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function b(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<e.length&&e[t]<=n;t++){const r=e[t];if(n===r)return!0;if(n%r===0n)return!1}let r=0n;const i=n-1n;let o=i;for(;o%2n===0n;)o/=2n,++r;const s=i/2n**r;do{let t=u(g(i,2n),s,n);if(1n===t||t===i)continue;let e=1;for(;e<r&&(t=u(t,2n,n),t!==i);){if(1n===t)return!1;e++}if(t!==i)return!1}while(--t);return!0}let p=!1;self.Worker&&(p=!0);class S{constructor(n,t){this.n=n,this._n2=this.n**2n,this.g=t}get bitLength(){return e(this.n)}encrypt(n,t=null){if(null===t)do{t=g(this.n)}while(1n!==i(t,this.n));return u(this.g,n,this._n2)*u(t,this.n,this._n2)%this._n2}addition(...n){return n.reduce((n,t)=>n*t%this._n2,1n)}multiply(n,t){return u(BigInt(n),BigInt(t),this._n2)}}class ${constructor(n,t,e,r=null,i=null){this.lambda=n,this.mu=t,this._p=r||null,this._q=i||null,this.publicKey=e}get bitLength(){return e(this.publicKey.n)}get n(){return this.publicKey.n}decrypt(n){return R(u(n,this.lambda,this.publicKey._n2),this.publicKey.n)*this.mu%this.publicKey.n}getRandomFactor(n){if(this.publicKey.g!==this.n+1n)throw RangeError("Cannot recover the random factor if publicKey.g != publicKey.n + 1. You should generate yout keys using the simple variant, e.g. generateRandomKeys(3072, true) )");const t=this.decrypt(n),e=(this._p-1n)*(this._q-1n),r=s(this.n,e);return u(n*(1n-t*this.n)%this.publicKey._n2,r,this.n)}}function R(n,t){return(n-1n)/t}function B(n,t){return(g(n)*n+1n)*u(g(n),n,t)%t}return n.PrivateKey=$,n.PublicKey=S,n.generateRandomKeys=async function(n=3072,t=!1){let r,i,a,c,f,g;do{r=await l(Math.floor(n/2)+1),i=await l(Math.floor(n/2)),a=r*i}while(i===r||e(a)!==n);if(!0===t)c=a+1n,f=(r-1n)*(i-1n),g=s(f,a);else{const n=a**2n;c=B(a,n),f=o(r-1n,i-1n),g=s(R(u(c,f,n),a),a)}const h=new S(a,c);return{publicKey:h,privateKey:new $(f,g,h,r,i)}},n.generateRandomKeysSync=function(n=3072,t=!1){let r,i,a,c,l,g;do{r=f(Math.floor(n/2)+1),i=f(Math.floor(n/2)),a=r*i}while(i===r||e(a)!==n);if(!0===t)c=a+1n,l=(r-1n)*(i-1n),g=s(l,a);else{const n=a**2n;c=B(a,n),l=o(r-1n,i-1n),g=s(R(u(c,l,n),a),a)}const h=new S(a,c);return{publicKey:h,privateKey:new $(l,g,h,r,i)}},n}({});

lib/index.browser.bundle.mod.js

@@ -1,1 +0,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,u=t%n,c=e-i*s,a=r-o*s;t=n,n=u,e=i,r=o,i=c,o=a}return{b:t,x:e,y:r}}function r(t,e){return t=BigInt(t),e=BigInt(e),0n===t&&0n===e?0n:n(t*e)/function(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<<r}(t,e)}function i(n,t){const r=e(s(n,t),t);return 1n!==r.b?NaN:s(r.x,t)}function o(t,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return 0n;if(t=s(t,r),(e=BigInt(e))<0n)return i(o(t,n(e),r),r);let u=1n;for(;e>0;)e%2n===1n&&(u=u*t%r),e/=2n,t=t**2n%r;return u}function s(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function u(n,t=16){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const i=new Worker(d());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function c(n,t=16){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);if(!m){let e=0n;do{e=g(f(n,!0))}while(!w(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;n<r.length;n++)r[n].terminate();for(;r.length;)r.pop();e(i.value)}else{const e=g(f(n,!0));try{o.postMessage({rnd:e,iterations:t,id:i.id})}catch(n){}}};{const n=d();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),r.push(t)}}for(let e=0;e<r.length;e++){const i=g(f(n,!0));r[e].postMessage({rnd:i,iterations:t,id:e})}})}function a(n,t=16){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);let e=0n;do{e=g(f(n,!0))}while(!w(e,t));return e}function l(n,e=1n){if(n<=e)throw new Error("max must be > min");const r=n-e,i=t(r);let o;do{o=g(f(i))}while(o>r);return o+e}function f(n,t=!1){if(n<1)throw new RangeError(`bitLength MUST be > 0 and it is ${n}`);const e=h(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 h(n,t=!1){if(n<1)throw new RangeError(`byteLength MUST be > 0 and it is ${n}`);{const e=new Uint8Array(n);return crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function g(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t<<BigInt(8))+n}return t}function d(){let n=`'use strict';const ${e.name}=${e.toString()};const ${i.name}=${i.toString()};const ${o.name}=${o.toString()};const ${s.name}=${s.toString()};const ${f.name}=${f.toString()};const ${h.name}=${h.toString()};const ${l.name}=${l.toString()};const ${u.name}=${w.toString()};${t.toString()}${g.toString()}`;return n+=`onmessage = ${async function(n){const t=await u(n.data.rnd,n.data.iterations);postMessage({isPrime:t,value:n.data.rnd,id:n.data.id})}.toString()};`,function(n){n=`(() => {${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 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<e.length&&e[t]<=n;t++){const r=e[t];if(n===r)return!0;if(n%r===0n)return!1}let r=0n;const i=n-1n;let s=i;for(;s%2n===0n;)s/=2n,++r;const u=i/2n**r;do{let t=o(l(i,2n),u,n);if(1n===t||t===i)continue;let e=1;for(;e<r&&(t=o(t,2n,n),t!==i);){if(1n===t)return!1;e++}if(t!==i)return!1}while(--t);return!0}let m=!1;self.Worker&&(m=!0);class p{constructor(n,t){this.n=n,this._n2=this.n**2n,this.g=t}get bitLength(){return t(this.n)}encrypt(n,t=l(this.n)){return o(this.g,n,this._n2)*o(t,this.n,this._n2)%this._n2}addition(...n){return n.reduce((n,t)=>n*t%this._n2,1n)}multiply(n,t){return o(BigInt(n),BigInt(t),this._n2)}}class y{constructor(n,t,e,r=null,i=null){this.lambda=n,this.mu=t,this._p=r||null,this._q=i||null,this.publicKey=e}get bitLength(){return t(this.publicKey.n)}get n(){return this.publicKey.n}decrypt(n){return b(o(n,this.lambda,this.publicKey._n2),this.publicKey.n)*this.mu%this.publicKey.n}getRandomFactor(n){if(this.publicKey.g!==this.n+1n)throw RangeError("Cannot recover the random factor if publicKey.g != publicKey.n + 1. You should generate yout keys using the simple variant, e.g. generateRandomKeys(3072, true) )");const t=this.decrypt(n),e=(this._p-1n)*(this._q-1n),r=i(this.n,e);return o(n*(1n-t*this.n)%this.publicKey._n2,r,this.n)}}function b(n,t){return(n-1n)/t}async function $(n=3072,e=!1){let s,u,a,l,f,h;do{s=await c(Math.floor(n/2)+1),u=await c(Math.floor(n/2)),a=s*u}while(u===s||t(a)!==n);if(!0===e)l=a+1n,f=(s-1n)*(u-1n),h=i(f,a);else{const n=a**2n;l=I(a,n),f=r(s-1n,u-1n),h=i(b(o(l,f,n),a),a)}const g=new p(a,l);return{publicKey:g,privateKey:new y(f,h,g,s,u)}}function B(n=3072,e=!1){let s,u,c,l,f,h;do{s=a(Math.floor(n/2)+1),u=a(Math.floor(n/2)),c=s*u}while(u===s||t(c)!==n);if(!0===e)l=c+1n,f=(s-1n)*(u-1n),h=i(f,c);else{const n=c**2n;l=I(c,n),f=r(s-1n,u-1n),h=i(b(o(l,f,n),c),c)}const g=new p(c,l);return{publicKey:g,privateKey:new y(f,h,g,s,u)}}function I(n,t){return(l(n)*n+1n)*o(l(n),n,t)%t}export{y as PrivateKey,p as PublicKey,$ as generateRandomKeys,B as generateRandomKeysSync};
+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)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,u=t%n,c=e-i*s,a=r-o*s;t=n,n=u,e=i,r=o,i=c,o=a}return{g: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<<r}function i(t,e){return t=BigInt(t),e=BigInt(e),0n===t&&0n===e?BigInt(0):n(t*e)/r(t,e)}function o(n,t){const r=e(u(n,t),t);if(1n!==r.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return u(r.x,t)}function s(t,e,r){if(0n===(r=BigInt(r)))throw new RangeError("n must be > 0");if(1n===r)return BigInt(0);if(t=u(t,r),(e=BigInt(e))<0n)return o(s(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 c(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0)throw RangeError("w MUST be >= 0");return new Promise((e,r)=>{const i=new Worker(m());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function a(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!p){let e=0n;do{e=d(g(n,!0))}while(!b(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;n<r.length;n++)r[n].terminate();for(;r.length;)r.pop();e(i.value)}else{const e=d(g(n,!0));try{o.postMessage({rnd:e,iterations:t,id:i.id})}catch(n){}}};{const n=m();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),r.push(t)}}for(let e=0;e<r.length;e++)h(n,!0).then((function(n){const i=d(n);r[e].postMessage({rnd:i,iterations:t,id:e})}))})}function f(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=d(g(n,!0))}while(!b(e,t));return e}function l(n,e=1n){if(n<=0n||e<0n||n<=e)throw new RangeError("Arguments MUST be: max > 0 && min >=0 && max > min");const r=n-e,i=t(r);let o;do{o=d(g(i))}while(o>r);return o+e}function h(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8;return new Promise(n=>{(function(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))})(e,!1).then((function(e){if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}n(e)}))})}function g(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=w(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 w(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function d(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t<<BigInt(8))+n}return t}function m(){let n=`'use strict';const ${e.name}=${e.toString()};const ${o.name}=${o.toString()};const ${s.name}=${s.toString()};const ${u.name}=${u.toString()};const ${g.name}=${g.toString()};const ${w.name}=${w.toString()};const ${l.name}=${l.toString()};const ${c.name}=${b.toString()};${t.toString()}${d.toString()}`;return n+=`onmessage = ${async function(n){const t=await c(n.data.rnd,n.data.iterations);postMessage({isPrime:t,value:n.data.rnd,id:n.data.id})}.toString()};`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function b(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<e.length&&e[t]<=n;t++){const r=e[t];if(n===r)return!0;if(n%r===0n)return!1}let r=0n;const i=n-1n;let o=i;for(;o%2n===0n;)o/=2n,++r;const u=i/2n**r;do{let t=s(l(i,2n),u,n);if(1n===t||t===i)continue;let e=1;for(;e<r&&(t=s(t,2n,n),t!==i);){if(1n===t)return!1;e++}if(t!==i)return!1}while(--t);return!0}let p=!1;self.Worker&&(p=!0);class y{constructor(n,t){this.n=n,this._n2=this.n**2n,this.g=t}get bitLength(){return t(this.n)}encrypt(n,t=null){if(null===t)do{t=l(this.n)}while(1n!==r(t,this.n));return s(this.g,n,this._n2)*s(t,this.n,this._n2)%this._n2}addition(...n){return n.reduce((n,t)=>n*t%this._n2,1n)}multiply(n,t){return s(BigInt(n),BigInt(t),this._n2)}}class S{constructor(n,t,e,r=null,i=null){this.lambda=n,this.mu=t,this._p=r||null,this._q=i||null,this.publicKey=e}get bitLength(){return t(this.publicKey.n)}get n(){return this.publicKey.n}decrypt(n){return $(s(n,this.lambda,this.publicKey._n2),this.publicKey.n)*this.mu%this.publicKey.n}getRandomFactor(n){if(this.publicKey.g!==this.n+1n)throw RangeError("Cannot recover the random factor if publicKey.g != publicKey.n + 1. You should generate yout keys using the simple variant, e.g. generateRandomKeys(3072, true) )");const t=this.decrypt(n),e=(this._p-1n)*(this._q-1n),r=o(this.n,e);return s(n*(1n-t*this.n)%this.publicKey._n2,r,this.n)}}function $(n,t){return(n-1n)/t}async function M(n=3072,e=!1){let r,u,c,f,l,h;do{r=await a(Math.floor(n/2)+1),u=await a(Math.floor(n/2)),c=r*u}while(u===r||t(c)!==n);if(!0===e)f=c+1n,l=(r-1n)*(u-1n),h=o(l,c);else{const n=c**2n;f=R(c,n),l=i(r-1n,u-1n),h=o($(s(f,l,n),c),c)}const g=new y(c,f);return{publicKey:g,privateKey:new S(l,h,g,r,u)}}function B(n=3072,e=!1){let r,u,c,a,l,h;do{r=f(Math.floor(n/2)+1),u=f(Math.floor(n/2)),c=r*u}while(u===r||t(c)!==n);if(!0===e)a=c+1n,l=(r-1n)*(u-1n),h=o(l,c);else{const n=c**2n;a=R(c,n),l=i(r-1n,u-1n),h=o($(s(a,l,n),c),c)}const g=new y(c,a);return{publicKey:g,privateKey:new S(l,h,g,r,u)}}function R(n,t){return(l(n)*n+1n)*s(l(n),n,t)%t}export{S as PrivateKey,y as PublicKey,M as generateRandomKeys,B as generateRandomKeysSync};

lib/index.browser.mod.js

@@ -1,2 +0,2 @@
-import { bitLength, randBetween, modPow, modInv, prime, lcm, primeSync } from 'bigint-crypto-utils'
+import { bitLength, gcd, randBetween, modPow, modInv, prime, lcm, primeSync } from 'bigint-crypto-utils'
 
@@ -34,3 +34,8 @@ /**
      */
-  encrypt (m, r = randBetween(this.n)) {
+  encrypt (m, r = null) {
+    if (r === null) {
+      do {
+        r = randBetween(this.n)
+      } while (gcd(r, this.n) !== 1n)
+    }
     return (modPow(this.g, m, this._n2) * modPow(r, this.n, this._n2)) % this._n2
@@ -37,0 +42,0 @@ }

lib/index.node.js

@@ -38,3 +38,8 @@ 'use strict'
      */
-  encrypt (m, r = bcu.randBetween(this.n)) {
+  encrypt (m, r = null) {
+    if (r === null) {
+      do {
+        r = bcu.randBetween(this.n)
+      } while (bcu.gcd(r, this.n) !== 1n)
+    }
     return (bcu.modPow(this.g, m, this._n2) * bcu.modPow(r, this.n, this._n2)) % this._n2
@@ -41,0 +46,0 @@ }

package.json

 {
   "name": "paillier-bigint",
-  "version": "3.1.1",
+  "version": "3.1.2",
   "description": "An implementation of the Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt",
@@ -62,18 +62,18 @@ "keywords": [
     "@rollup/plugin-commonjs": "^11.1.0",
-    "@rollup/plugin-multi-entry": "^3.0.0",
+    "@rollup/plugin-multi-entry": "^3.0.1",
     "@rollup/plugin-node-resolve": "^7.1.3",
-    "@rollup/plugin-replace": "^2.3.2",
+    "@rollup/plugin-replace": "^2.3.3",
     "chai": "^4.2.0",
     "jsdoc-to-markdown": "^5.0.3",
-    "mocha": "^7.1.1",
+    "mocha": "^7.2.0",
     "npm-run-all": "^4.1.5",
-    "nyc": "^15.0.1",
-    "rollup": "^2.6.1",
+    "nyc": "^15.1.0",
+    "rollup": "^2.23.0",
     "rollup-plugin-terser": "^5.3.0",
-    "standard": "^14.3.3",
-    "typescript": "^3.8.3"
+    "standard": "^14.3.4",
+    "typescript": "^3.9.7"
   },
   "dependencies": {
-    "bigint-crypto-utils": "^3.0.1"
+    "bigint-crypto-utils": "^3.0.7"
   }
 }

README.md

@@ -66,5 +66,5 @@ [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
 ## Encryption
-Let `m` in `Z*` of `n` be the clear-text message,
+Let `m` in `[0, n)` be the clear-text message,
 
-1. Select random integer `r` in `(1, n)`.
+1. Select random integer `r` in `Z*` of `n`.
 
@@ -216,6 +216,6 @@ 2. Compute ciphertext as: **`c = g**m · r**n mod n**2`**
 
-| Param | Type | Description |
-| --- | --- | --- |
-| m | <code>bigint</code> | a bigint representation of a cleartext message |
-| [r] | <code>bigint</code> | the random integer factor for encryption. By default is a random in (1,n) |
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| m | <code>bigint</code> |  | a bigint representation of a cleartext message |
+| [r] | <code>bigint</code> | <code></code> | the random integer factor for encryption. By default is a random in (1,n) |
 
@@ -222,0 +222,0 @@ <a name="PublicKey+addition"></a>

types/index.d.ts

@@ -104,3 +104,3 @@ export type KeyPair = {
        */
-    multiply(c: bigint, k: number | bigint): bigint;
+    multiply(c: bigint, k: bigint | number): bigint;
 }
@@ -107,0 +107,0 @@ /**

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

53329

increased by3.11%

Lines of code

623

increased by2.64%

Dependency changes

• Updatedbigint-crypto-utils@^3.0.7