on he(e){return e.replace(/[-\/\\^$*+?.()|[\]{}]/g,"\\$&")}q={};var ce={};function Le(e,t){var a,s=t;for("string"==typeof e&&(e=[e]),m(t)&&(s=function(e,a){a[t]=G(e)}),a=0;a<e.length;a++)ce[e[a]]=s}function Ye(e,n){Le(e,function(e,a,t,s){t._w=t._w||{},n(e,t._w,t,s)})}var ye,fe=0,pe=1,ke=2,De=3,Te=4,ge=5,we=6,ve=7,be=8;function Se(e,a){if(isNaN(e)||isNaN(a))return NaN;var t,s=(a%(t=12)+t)%t;return e+=(a-s)/12,1==s?I(e)?29:28:31-s%7%2}ye=Array.prototype.indexOf?Array.prototype.indexOf:function(e){for(var...

in RSA. See montgomeryMul for details. case 1024 / _W: const n = 1024 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW1024(&T[i], &xLimbs[0], yLimbs[i]) } return x.Mod(&Nat{limbs: T}, m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW1536(&T[i], &xLimbs[0], yLimbs[i]) } return x.Mod(&Nat{limbs: T}, m) case 2048 / _W: const n = 2048 / _W // compiler hint T := make([]uint, n*2) for i := 0;...

in RSA. See montgomeryMul for details. case 1024 / _W: const n = 1024 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW1024(&T[i], &xLimbs[0], yLimbs[i]) } return x.Mod(&Nat{limbs: T}, m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW1536(&T[i], &xLimbs[0], yLimbs[i]) } return x.Mod(&Nat{limbs: T}, m) case 2048 / _W: const n = 2048 / _W // compiler hint T := make([]uint, n*2) for i := 0;...