Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 2 of 2 for 0b1111_1111 (0.05 sec)

  1. lib/fips140/v1.1.0-rc1.zip

    n; i += 4 { b0, b1, b2, b3, b4 := pk[0], pk[1], pk[2], pk[3], pk[4] t1[r][i+0] = uint16(b0>>0) | uint16(b1&0b0000_0011)<<8 t1[r][i+1] = uint16(b1>>2) | uint16(b2&0b0000_1111)<<6 t1[r][i+2] = uint16(b2>>4) | uint16(b3&0b0011_1111)<<4 t1[r][i+3] = uint16(b3>>6) | uint16(b4&0b1111_1111)<<2 pk = pk[5:] } } return ρ, nil } var errInvalidPublicKeyL = errors.New("mldsa: invalid public key length") func NewPublicKey44(pk []byte) (*PublicKey, error) { return newPublicKey(pk, params44) } func NewPublicKey65(pk...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    selIsZero := subtle.ConstantTimeByteEq(sel, 0) p.Select(NewP256Point(), t.Projective(), selIsZero) for index >= 5 { index -= 6 if index >= 0 { sel, sign = boothW6(s.Rsh(index) & 0b1111111) } else { // Booth encoding considers a virtual zero bit at index -1, // so we shift left the least significant limb. wvalue := (s[0] << 1) & 0b1111111 sel, sign = boothW6(wvalue) } table := &p256GeneratorTables[(index+1)/6] table.Select(t, sel) t.Negate(sign) selIsZero := subtle.ConstantTimeByteEq(sel, 0) p.AddAffine(p,...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
Back to top