Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 2 of 2 for p224SqrtCandidate (0.08 sec)

  1. lib/fips140/v1.0.0-c2097c7c.zip

    by a BSD-style // license that can be found in the LICENSE file. package nistec import ( "crypto/internal/fips140/nistec/fiat" "sync" ) var p224GG *[96]fiat.P224Element var p224GGOnce sync.Once // p224SqrtCandidate sets r to a square root candidate for x. r and x must not overlap. func p224SqrtCandidate(r, x *fiat.P224Element) { // Since p = 1 mod 4, we can't use the exponentiation by (p + 1) / 4 like // for the other primes. Instead, implement a variation of Tonelli–Shanks. // The constant-time implementation...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  2. lib/fips140/v1.1.0-rc1.zip

    by a BSD-style // license that can be found in the LICENSE file. package nistec import ( "crypto/internal/fips140/nistec/fiat" "sync" ) var p224GG *[96]fiat.P224Element var p224GGOnce sync.Once // p224SqrtCandidate sets r to a square root candidate for x. r and x must not overlap. func p224SqrtCandidate(r, x *fiat.P224Element) { // Since p = 1 mod 4, we can't use the exponentiation by (p + 1) / 4 like // for the other primes. Instead, implement a variation of Tonelli–Shanks. // The constant-time implementation...
    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