Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 41 - 43 of 43 for isSatisfied (0.07 seconds)

  1. CREDITS

    Exhibit A - Form of Secondary Licenses Notice
    
    "This Source Code may also be made available under the following
    Secondary Licenses when the conditions for such availability set forth
    in the Eclipse Public License, v. 2.0 are satisfied: {name license(s),
    version(s), and exceptions or additional permissions here}."
    
      Simply including a copy of this Agreement, including this Exhibit A
    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)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    // defined in RFC 7627 and allowed by SP 800-135, Revision 1, Section 4.2.2. func MasterSecret[H fips140.Hash](hash func() H, preMasterSecret, transcript []byte) []byte { // "The TLS 1.2 KDF is an approved KDF when the following conditions are // satisfied: [...] (3) P_HASH uses either SHA-256, SHA-384 or SHA-512." h := hash() switch any(h).(type) { case *sha256.Digest: if h.Size() != 32 { fips140.RecordNonApproved() } case *sha512.Digest: if h.Size() != 46 && h.Size() != 64 { fips140.RecordNonApproved()...
    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)
  3. lib/fips140/v1.1.0-rc1.zip

    as // defined in RFC 7627 and allowed by SP 800-135, Revision 1, Section 4.2.2. func MasterSecret[H hash.Hash](hash func() H, preMasterSecret, transcript []byte) []byte { // "The TLS 1.2 KDF is an approved KDF when the following conditions are // satisfied: [...] (3) P_HASH uses either SHA-256, SHA-384 or SHA-512." h := hash() switch any(h).(type) { case *sha256.Digest: if h.Size() != 32 { fips140.RecordNonApproved() } case *sha512.Digest: if h.Size() != 46 && h.Size() != 64 { fips140.RecordNonApproved()...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top