Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 2 of 2 for p256OrdBigToLittle (0.32 sec)

  2. github.com/golang/go

    lib/fips140/v1.0.0-c2097c7c.zip 

    zero if subtraction underflowed s[0] ^= (t0 ^ s[0]) & tMask s[1] ^= (t1 ^ s[1]) & tMask s[2] ^= (t2 ^ s[2]) & tMask s[3] ^= (t3 ^ s[3]) & tMask } func p256OrdLittleToBig(b *[32]byte, l *p256OrdElement) { limbsToBytes(b, (*[4]uint64)(l)) } func p256OrdBigToLittle(l *p256OrdElement, b *[32]byte) { bytesToLimbs((*[4]uint64)(l), b) } // Add sets q = p1 + p2, and returns q. The points may overlap. func (q *P256Point) Add(r1, r2 *P256Point) *P256Point { var sum, double P256Point r1IsInfinity := r1.isInfinity()...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  3. github.com/golang/go

    lib/fips140/v1.1.0-rc1.zip 

    zero if subtraction underflowed s[0] ^= (t0 ^ s[0]) & tMask s[1] ^= (t1 ^ s[1]) & tMask s[2] ^= (t2 ^ s[2]) & tMask s[3] ^= (t3 ^ s[3]) & tMask } func p256OrdLittleToBig(b *[32]byte, l *p256OrdElement) { limbsToBytes(b, (*[4]uint64)(l)) } func p256OrdBigToLittle(l *p256OrdElement, b *[32]byte) { bytesToLimbs((*[4]uint64)(l), b) } // Add sets q = p1 + p2, and returns q. The points may overlap. func (q *P256Point) Add(r1, r2 *P256Point) *P256Point { var sum, double P256Point r1IsInfinity := r1.isInfinity()...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
Back to top