- Sort Score
- Num 10 results
- Language All
Results 1 - 3 of 3 for testPow (0.07 seconds)
-
src/cmd/asm/internal/asm/testdata/amd64enc.s
TESTW R11, (BX) // 6644851b TESTW DX, (R11) // 66418513 TESTW R11, (R11) // 6645851b TESTW DX, DX // 6685d2 TESTW R11, DX // 664485da TESTW DX, R11 // 664185d3 TESTW R11, R11 // 664585db
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Fri Oct 08 21:38:44 GMT 2021 - 581.9K bytes - Click Count (1) -
lib/fips140/v1.26.0.zip
code is governed by a BSD-style // license that can be found in the LICENSE file. package aes import "testing" // See const.go for overview of math here. // Test that powx is initialized correctly. // (Can adapt this code to generate it too.) func TestPowx(t *testing.T) { p := 1 for i := 0; i < len(powx); i++ { if powx[i] != byte(p) { t.Errorf("powx[%d] = %#x, want %#x", i, powx[i], p) } p <<= 1 if p&0x100 != 0 { p ^= poly } } } // Multiply b and c as GF(2) polynomials modulo poly func mul(b, c uint32)...
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) -
lib/fips140/v1.0.0-c2097c7c.zip
code is governed by a BSD-style // license that can be found in the LICENSE file. package aes import "testing" // See const.go for overview of math here. // Test that powx is initialized correctly. // (Can adapt this code to generate it too.) func TestPowx(t *testing.T) { p := 1 for i := 0; i < len(powx); i++ { if powx[i] != byte(p) { t.Errorf("powx[%d] = %#x, want %#x", i, powx[i], p) } p <<= 1 if p&0x100 != 0 { p ^= poly } } } // Multiply b and c as GF(2) polynomials modulo poly func mul(b, c uint32)...
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)