Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 2 of 2 for _W (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  2. github.com/golang/go

    lib/fips140/v1.26.0.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;...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  3. 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;...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
Back to Top