and will be updated with the next // count value. The length of out must be greater than or equal to the length // of in. // counterCryptASM implements counterCrypt which then allows the loop to // be unrolled and optimized. func counterCrypt(b *aes.Block, out, in []byte, counter *[gcmBlockSize]byte) { enc := aes.EncryptionKeySchedul(b) rounds := len(enc)/4 - 1 counterCryptASM(rounds, out, in, counter, &enc[0]) } // paddedGHASH pads data with zeroes until its length is a multiple of // 16-bytes. It...