- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for deriveCounter (0.3 sec)
-
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,...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.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,...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0)