- Sort Score
- Num 10 results
- Language All
Results 1 - 3 of 3 for 3010 (0.06 seconds)
-
src/cmd/asm/internal/asm/testdata/amd64enc.s
XORB $7, (R11) // 41803307 XORB $7, DL // 80f207 XORB $7, R11 // 4180f307 XORB DL, (BX) // 3013 XORB R11, (BX) // 44301b XORB DL, (R11) // 413013 XORB R11, (R11) // 45301b XORB DL, DL // 30d2 or 32d2
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Oct 08 21:38:44 GMT 2021 - 581.9K bytes - Click Count (1) -
lib/fips140/v1.0.0-c2097c7c.zip
// into this table we'll be using bits from a field element and // therefore the bits will be in the reverse order. So normally one // would expect, say, 4*H to be in index 4 of the table but due to // this bit ordering it will actually be in index 0010 (base 2) = 2. x := gcmFieldElement{ byteorder.BEUint64(H[:8]), byteorder.BEUint64(H[8:]), } productTable[reverseBits(1)] = x for i := 2; i < 16; i += 2 { productTable[reverseBits(i)] = ghashDouble(&productTable[reverseBits(i/2)]) productTable[reverseBits(i+1)]...
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) -
lib/fips140/v1.1.0-rc1.zip
// into this table we'll be using bits from a field element and // therefore the bits will be in the reverse order. So normally one // would expect, say, 4*H to be in index 4 of the table but due to // this bit ordering it will actually be in index 0010 (base 2) = 2. x := gcmFieldElement{ byteorder.BEUint64(H[:8]), byteorder.BEUint64(H[8:]), } productTable[reverseBits(1)] = x for i := 2; i < 16; i += 2 { productTable[reverseBits(i)] = ghashDouble(&productTable[reverseBits(i/2)]) productTable[reverseBits(i+1)]...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)