Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 2 of 2 for deriveCounter (0.17 seconds)

  1. lib/fips140/v1.26.0.zip

    byteorder.LEUint64(hle[8:]) } else { h1 = byteorder.BEUint64(hle[:8]) h2 = byteorder.BEUint64(hle[8:]) } byteorder.BEPutUint64(hle[:8], h1) byteorder.BEPutUint64(hle[8:], h2) gcmInit(&g.productTable, hle) } // deriveCounter computes the initial GCM counter state from the given nonce. func deriveCounter(counter *[gcmBlockSize]byte, nonce []byte, productTable *[256]byte) { if len(nonce) == gcmStandardNonceSize { copy(counter[:], nonce) counter[gcmBlockSize-1] = 1 } else { var hash [16]byte paddedGHASH(&hash,...
    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

    byteorder.LEUint64(hle[8:]) } else { h1 = byteorder.BEUint64(hle[:8]) h2 = byteorder.BEUint64(hle[8:]) } byteorder.BEPutUint64(hle[:8], h1) byteorder.BEPutUint64(hle[8:], h2) gcmInit(&g.productTable, hle) } // deriveCounter computes the initial GCM counter state from the given nonce. func deriveCounter(counter *[gcmBlockSize]byte, nonce []byte, productTable *[256]byte) { if len(nonce) == gcmStandardNonceSize { copy(counter[:], nonce) counter[gcmBlockSize-1] = 1 } else { var hash [16]byte paddedGHASH(&hash,...
    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