Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 2 of 2 for bigEndianUint (0.12 seconds)

  1. lib/fips140/v1.26.0.zip

    overflows the modulus size") } x.maybeSubtractModulus(no, m) return x, nil } // bigEndianUint returns the contents of buf interpreted as a // big-endian encoded uint value. func bigEndianUint(buf []byte) uint { if _W == 64 { return uint(byteorder.BEUint64(buf)) } return uint(byteorder.BEUint32(buf)) } func (x *Nat) setBytes(b []byte) error { i, k := len(b), 0 for k < len(x.limbs) && i >= _S { x.limbs[k] = bigEndianUint(b[i-_S : i]) i -= _S k++ } for s := 0; s < _W && k < len(x.limbs) && i > 0; s +=...
    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)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    overflows the modulus size") } x.maybeSubtractModulus(no, m) return x, nil } // bigEndianUint returns the contents of buf interpreted as a // big-endian encoded uint value. func bigEndianUint(buf []byte) uint { if _W == 64 { return uint(byteorder.BEUint64(buf)) } return uint(byteorder.BEUint32(buf)) } func (x *Nat) setBytes(b []byte) error { i, k := len(b), 0 for k < len(x.limbs) && i >= _S { x.limbs[k] = bigEndianUint(b[i-_S : i]) i -= _S k++ } for s := 0; s < _W && k < len(x.limbs) && i > 0; s +=...
    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