- Sort Score
- Num 10 results
- Language All
Results 231 - 234 of 234 for inbound (0.11 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
lib/fips140/v1.1.0-rc1.zip
panic("mldsa: internal error: unsupported γ2") } } func coefficientsExceedBo(w ringElement, bound uint32) bool { // If this function appears in profiles, it might be possible to deduplicate // the work of fieldFromMontgomery inside fieldInfinityNorm with the // subsequent encoding of w. for i := range w { if fieldInfinityNorm(w[i]) >= bound { return true } } return false } func lowBitsExceedBound(w ringElement, bound uint32, p parameters) bool { switch p.γ2 { case 32: for i := range w { _, r0 := decompose32(w[i])...Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.13.md
## Changelog since v1.13.3 ### Other notable changes * fix get azure accounts timeout issue when there is no out-bound IP ([#74191](https://github.com/kubernetes/kubernetes/pull/74191), [@andyzhangx](https://github.com/andyzhangx))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu May 05 13:44:43 GMT 2022 - 273.1K bytes - Click Count (0) -
CREDITS
Application, but excluding the System Libraries of the Combined Work. 1. Exception to Section 3 of the GNU GPL. You may convey a covered work under sections 3 and 4 of this License without being bound by section 3 of the GNU GPL. 2. Conveying Modified Versions. If you modify a copy of the Library, and, in your modifications, a facility refers to a function or data to be supplied by an Application
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Thu Mar 13 05:29:51 GMT 2025 - 1.8M bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
error if either a or m is zero, or if they are both even. func extendedGCD(a, m *Nat) (u, A *Nat, err error) { // This is the extended binary GCD algorithm described in the Handbook of // Applied Cryptography, Algorithm 14.61, adapted by BoringSSL to bound // coefficients and avoid negative numbers. For more details and proof of // correctness, see https://github.com/mit-plv/fiat-crypto/pull/333/files. // // Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)