- Sort Score
- Num 10 results
- Language All
Results 1 - 2 of 2 for p224SqrtCandidate (0.57 seconds)
-
lib/fips140/v1.26.0.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...
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) -
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...
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)