Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for c_hash (0.06 seconds)

  1. RELEASE.md

    *   Fixes an overflow producing a crash in `tf.range`
        ([CVE-2021-41202](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-41202))
    *   Fixes an overflow producing a crash in `tf.image.resize` when size is large
        ([CVE-2021-41199](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-41199))
    *   Fixes an overflow producing a crash in `tf.tile` when tiling tensor is large
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  2. lib/fips140/v1.1.0-rc1.zip

    MGF1 function // specified in PKCS #1 v2.1. func mgf1XOR(out []byte, hash hash.Hash, seed []byte) { var counter [4]byte var digest []byte done := 0 for done < len(out) { hash.Reset() hash.Write(seed) hash.Write(counter[0:4]) digest = hash.Sum(digest[:0]) for i := 0; i < len(digest) && done < len(out); i++ { out[done] ^= digest[i] done++ } incCounter(&counter) } } func emsaPSSEncode(mHash []byte, emBits int, salt []byte, hash hash.Hash) ([]byte, error) { // See RFC 8017, Section 9.1.1. hLen := hash.Size()...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    function // specified in PKCS #1 v2.1. func mgf1XOR(out []byte, hash fips140.Hash, seed []byte) { var counter [4]byte var digest []byte done := 0 for done < len(out) { hash.Reset() hash.Write(seed) hash.Write(counter[0:4]) digest = hash.Sum(digest[:0]) for i := 0; i < len(digest) && done < len(out); i++ { out[done] ^= digest[i] done++ } incCounter(&counter) } } func emsaPSSEncode(mHash []byte, emBits int, salt []byte, hash fips140.Hash) ([]byte, error) { // See RFC 8017, Section 9.1.1. hLen := hash.Size()...
    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)
Back to Top