Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 2 of 2 for _W (0.1 sec)

  2. github.com/golang/go

    lib/fips140/v1.0.0-c2097c7c.zip 

    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;...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  3. github.com/golang/go

    lib/fips140/v1.1.0-rc1.zip 

    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;...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
Back to top