Lines Matching refs:p256
6 // implementation of P256. The optimizations performed here are described in
33 p256 p256Curve
40 p256.CurveParams = &CurveParams{Name: "P-256"}
41 p256.P, _ = new(big.Int).SetString("115792089210356248762697446949407573530086143415290314195533631308867097853951", 10)
42 p256.N, _ = new(big.Int).SetString("115792089210356248762697446949407573529996955224135760342422259061068512044369", 10)
43 p256.B, _ = new(big.Int).SetString("5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b", 16)
44 p256.Gx, _ = new(big.Int).SetString("6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296", 16)
45 p256.Gy, _ = new(big.Int).SetString("4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5", 16)
46 p256.BitSize = 256
54 // Montgomery multiplication modulo P256
57 // Montgomery square modulo P256
101 if k.Cmp(p256.N) >= 0 {
103 k = new(big.Int).Mod(k, p256.N)
194 if n.Cmp(p256.N) >= 0 {
195 n.Mod(n, p256.N)
206 if in.Cmp(p256.P) < 0 {
209 return new(big.Int).Mod(in, p256.P)
