Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for testPow (0.06 seconds)

  1. 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 Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Oct 08 21:38:44 GMT 2021
    - 581.9K bytes
    - Click Count (1)
  2. 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 Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  3. lib/fips140/v1.1.0-rc1.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 Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top