Home
last modified time | relevance | path

Searched refs:p (Results 1 – 25 of 106) sorted by relevance

12345

/crypto/poly1305/
A Dpoly1305_vec.cc155 r0 = ((uint64_t)p->R20.d[3] << 32) | (uint64_t)p->R20.d[1]; in poly1305_first_block()
190 p->R22.v = in poly1305_first_block()
198 p->S21.v = _mm_mul_epu32(p->R21.v, FIVE); in poly1305_first_block()
199 p->S22.v = _mm_mul_epu32(p->R22.v, FIVE); in poly1305_first_block()
200 p->S23.v = _mm_mul_epu32(p->R23.v, FIVE); in poly1305_first_block()
201 p->S24.v = _mm_mul_epu32(p->R24.v, FIVE); in poly1305_first_block()
202 p--; in poly1305_first_block()
558 p->S21.d[2] = p->R21.d[2] * 5; in poly1305_combine()
559 p->S22.d[2] = p->R22.d[2] * 5; in poly1305_combine()
560 p->S23.d[2] = p->R23.d[2] * 5; in poly1305_combine()
[all …]
/crypto/conf/
A Dconf.cc298 while (*p != '\0' && is_conf_ws(*p)) { in eat_ws()
299 p++; in eat_ws()
306 return p[1] == '\0' ? p + 1 : p + 2; in scan_esc()
312 p = scan_esc(p); in eat_name()
318 p++; in eat_name()
325 p++; in scan_quote()
326 while (*p != '\0' && *p != q) { in scan_quote()
355 p = scan_quote(p); in clear_comments()
359 p = scan_esc(p); in clear_comments()
467 if (*p != '\0' && ss != p) { in NCONF_load_bio()
[all …]
/crypto/fipsmodule/bn/
A Dsqrt.cc.inc33 if (!BN_is_odd(p) || BN_abs_is_word(p, 1)) {
34 if (BN_abs_is_word(p, 2)) {
84 // A = a mod p
101 // 2 * (|p|+1)/4 == 1 (mod (|p|-1)/2),
102 // so we can use exponent (|p|+1)/4, i.e. (|p|-3)/4 + 1.
116 // |p| == 5 (mod 8)
119 // Legendre(2,p) = (-1)^((p^2-1)/8) for any odd prime.
147 // b := (2*a)^((|p|-5)/8)
182 if (!BN_copy(q, p)) {
203 // now 0 <= y < |p|
[all …]
A Ddiv_extra.cc.inc32 // |p| and |m| from |bn_mod_u16_consttime| below.
38 t = t >> (p - 1);
49 uint32_t p, uint32_t m) {
54 t = mod_u16(t, d, p, m);
58 t = mod_u16(t, d, p, m);
68 // This computes p = ceil(log_2(d)).
69 uint32_t p = BN_num_bits_word(d - 1);
72 assert(p <= 16);
73 uint32_t m = (uint32_t)(((UINT64_C(1) << (32 + p)) + d - 1) / d);
78 ret = shift_and_add_mod_u16(ret, bn->d[i], d, p, m);
[all …]
/crypto/curve25519/
A Dmake_curve25519_tables.py21 p = 2**255 - 19 variable
24 return pow(x, p-2, p)
27 modp_sqrt_m1 = pow(2, (p-1) // 4, p)
32 if y >= p:
42 x = pow(x2, (p+3) // 8, p)
43 if (x*x - x2) % p != 0:
45 if (x*x - x2) % p != 0:
49 x = p - x
56 g_y = 4 * modp_inv(5) % p
88 return ((y + x) % p, (y - x) % p, (x * y * 2 * d) % p)
[all …]
A Dcurve25519.cc598 fe_add(&r->Y, &p->X, &p->Y); in ge_p2_dbl()
620 fe_add(&r->X, &p->Y, &p->X); in ge_madd()
621 fe_sub(&r->Y, &p->Y, &p->X); in ge_madd()
625 fe_add(&r->T, &p->Z, &p->Z); in ge_madd()
637 fe_add(&r->X, &p->Y, &p->X); in ge_msub()
638 fe_sub(&r->Y, &p->Y, &p->X); in ge_msub()
642 fe_add(&r->T, &p->Z, &p->Z); in ge_msub()
654 fe_add(&r->X, &p->Y, &p->X); in x25519_ge_add()
655 fe_sub(&r->Y, &p->Y, &p->X); in x25519_ge_add()
672 fe_add(&r->X, &p->Y, &p->X); in x25519_ge_sub()
[all …]
/crypto/fipsmodule/dh/
A Dcheck.cc.inc29 // Most operations scale with p and q.
30 if (BN_is_negative(dh->p) || !BN_is_odd(dh->p) ||
36 // q must be bounded by p.
44 BN_ucmp(dh->g, dh->p) >= 0) {
72 !BN_copy(tmp, dh->p) ||
103 // for 2, p mod 24 == 11
104 // for 3, p mod 12 == 5
105 // for 5, p mod 10 == 3 or 7
127 // Check g^q == 1 mod p
143 // Check p == 1 mod q i.e. q divides p - 1
[all …]
A Ddh.cc.inc51 BN_clear_free(dh->p);
100 *out_p = dh->p;
111 if ((dh->p == NULL && p == NULL) || (dh->g == NULL && g == NULL)) {
115 if (p != NULL) {
116 BN_free(dh->p);
117 dh->p = p;
177 dh->p, ctx.get())) {
194 // the (p-1)/2 subgroup. So, we use q = (p-1)/2. (If g generates a smaller
208 // M = q = (p - 1) / 2.
270 dh->p, ctx)) {
[all …]
/crypto/x509/
A Dv3_utl.cc315 for (p = linebuf, q = linebuf; (c = *p) && (c != '\r') && (c != '\n'); p++) { in STACK_OF()
395 p = name; in strip_spaces()
396 while (*p && OPENSSL_isspace((unsigned char)*p)) { in strip_spaces()
397 p++; in strip_spaces()
402 q = p + strlen(p) - 1; in strip_spaces()
455 for (p = (unsigned char *)str, q = hexbuf; *p;) { in x509v3_hex_to_bytes()
742 for (p = wildcard_start; p != wildcard_end; ++p) { in wildcard_match()
743 if (!OPENSSL_isalnum(*p) && *p != '-') { in wildcard_match()
1075 p = iptmp + (p - ipasc); in a2i_IPADDRESS_NC()
1320 for (const char *p = type; *p; p++) { in X509V3_NAME_from_section() local
[all …]
A Dx509_obj.cc37 char *p; in X509_NAME_oneline() local
128 *(p++) = '/'; in X509_NAME_oneline()
130 p += l1; in X509_NAME_oneline()
131 *(p++) = '='; in X509_NAME_oneline()
142 *(p++) = 'x'; in X509_NAME_oneline()
146 *(p++) = n; in X509_NAME_oneline()
149 *p = '\0'; in X509_NAME_oneline()
152 p = b->data; in X509_NAME_oneline()
155 p = buf; in X509_NAME_oneline()
158 *p = '\0'; in X509_NAME_oneline()
[all …]
A Dv3_conf.cc192 const char *p = *value; in v3_check_critical() local
193 if ((strlen(p) < 9) || strncmp(p, "critical,", 9)) { in v3_check_critical()
196 p += 9; in v3_check_critical()
198 p++; in v3_check_critical()
200 *value = p; in v3_check_critical()
208 if ((strlen(p) >= 4) && !strncmp(p, "DER:", 4)) { in v3_check_generic()
209 p += 4; in v3_check_generic()
211 } else if ((strlen(p) >= 5) && !strncmp(p, "ASN1:", 5)) { in v3_check_generic()
212 p += 5; in v3_check_generic()
219 p++; in v3_check_generic()
[all …]
/crypto/asn1/
A Dtasn_dec.cc206 p = *in; in asn1_item_ex_d2i()
470 p = *in; in asn1_template_ex_d2i()
479 q = p; in asn1_template_ex_d2i()
507 *in = p; in asn1_template_ex_d2i()
527 p = *in; in asn1_template_noexp_d2i()
607 *in = p; in asn1_template_noexp_d2i()
649 p = *in; in asn1_d2i_ex_primitive()
694 p = *in; in asn1_d2i_ex_primitive()
733 *in = p; in asn1_d2i_ex_primitive()
927 p = *in; in asn1_check_tlen()
[all …]
A Dasn1_lib.cc127 p[i] = tag & 0x7f; in ASN1_put_object()
129 p[i] |= 0x80; in ASN1_put_object()
133 p += ttag; in ASN1_put_object()
136 *(p++) = 0x80; in ASN1_put_object()
140 *pp = p; in ASN1_put_object()
147 *p++ = 0; in ASN1_put_eoc()
148 *p++ = 0; in ASN1_put_eoc()
149 *pp = p; in ASN1_put_eoc()
163 *(p++) = i | 0x80; in asn1_put_length()
169 p += l; in asn1_put_length()
[all …]
A Da_bitstr.cc87 uint8_t *p = *pp; in i2c_ASN1_BIT_STRING() local
88 *(p++) = bits; in i2c_ASN1_BIT_STRING()
89 OPENSSL_memcpy(p, a->data, len); in i2c_ASN1_BIT_STRING()
91 p[len - 1] &= (0xff << bits); in i2c_ASN1_BIT_STRING()
93 p += len; in i2c_ASN1_BIT_STRING()
94 *pp = p; in i2c_ASN1_BIT_STRING()
116 const unsigned char *p; in c2i_ASN1_BIT_STRING() local
139 p = *pp; in c2i_ASN1_BIT_STRING()
140 padding = *(p++); in c2i_ASN1_BIT_STRING()
164 p += len; in c2i_ASN1_BIT_STRING()
[all …]
/crypto/dh/
A Ddh_test.cc173 bssl::UniquePtr<BIGNUM> p( in TEST() local
179 ASSERT_TRUE(p); in TEST()
311 ASSERT_TRUE(p); in TEST()
347 ASSERT_TRUE(p); in TEST()
366 ASSERT_TRUE(p); in TEST()
373 ASSERT_TRUE(p); in TEST()
381 p.release(); in TEST()
397 ASSERT_TRUE(p); in TEST()
440 ASSERT_TRUE(p); in TEST()
460 dh = NewDHGroup(p.get(), /*q=*/nullptr, p.get()); in TEST()
[all …]
/crypto/fipsmodule/ec/
A Dec_test.cc317 ASSERT_TRUE(p); in TEST()
556 ASSERT_TRUE(p); in TEST_P()
597 ASSERT_TRUE(p); in TEST_P()
602 OPENSSL_memset(&p->raw.X, 0, sizeof(p->raw.X)); in TEST_P()
607 OPENSSL_memset(&p->raw.Z, 0, sizeof(p->raw.Z)); in TEST_P()
631 ASSERT_TRUE(p); in TEST_P()
639 ASSERT_TRUE(EC_POINT_add(group(), p.get(), p.get(), pub2, nullptr)); in TEST_P()
800 ASSERT_TRUE(p); in TEST_P()
900 ASSERT_TRUE(p); in TEST_P()
918 ASSERT_TRUE(p); in TEST_P()
[all …]
A Dp256-nistz.cc.inc437 OPENSSL_memcpy(p.X, t.X, sizeof(p.X));
438 OPENSSL_memcpy(p.Y, t.Y, sizeof(p.Y));
439 OPENSSL_memset(p.Z, 0, sizeof(p.Z));
453 ecp_nistz256_point_add_affine(&p, &p, &t);
486 OPENSSL_memcpy(p.Z, ONE_MONT, sizeof(p.Z));
488 OPENSSL_memset(p.X, 0, sizeof(p.X));
489 OPENSSL_memset(p.Y, 0, sizeof(p.Y));
490 OPENSSL_memset(p.Z, 0, sizeof(p.Z));
494 ecp_nistz256_neg(p.Y, p.Y);
513 ecp_nistz256_point_add_affine(&p, &p, &t);
[all …]
A Dec.cc.inc176 if (BN_num_bytes(p) > EC_MAX_BYTES) {
531 out->X = p->X;
532 out->Y = p->Y;
677 (p != NULL && EC_GROUP_cmp(group, p->group, NULL) != 0)) {
765 if (p == NULL || scalar == NULL) {
893 // assuming p is not tiny (p >= 17).
901 // |order - (p + 1)| <= 2×sqrt(p)
902 // p + 1 - order <= 2×sqrt(p)
903 // p + 1 - 2×sqrt(p) <= order
904 // p + 1 - 2×(p/4) < order (p/4 > sqrt(p) for p >= 17)
[all …]
A Dinternal.h229 const EC_AFFINE *p);
239 const EC_JACOBIAN *p);
314 const EC_JACOBIAN *p);
349 const EC_JACOBIAN *p,
381 int ec_cmp_x_coordinate(const EC_GROUP *group, const EC_JACOBIAN *p,
388 const EC_JACOBIAN *p);
396 const EC_JACOBIAN *p);
465 const EC_SCALAR *g_scalar, const EC_JACOBIAN *p,
474 const EC_JACOBIAN *p);
592 const EC_JACOBIAN *p, const EC_SCALAR *scalar);
[all …]
/crypto/hrss/
A Dhrss.cc479 poly3_word_mul(&p->s.v[i], &p->a.v[i], p->s.v[i], p->a.v[i], ms, ma); in poly3_mul_const()
508 poly3_word_sub(&p->s.v[i], &p->a.v[i], p->s.v[i], p->a.v[i], factor_s, in poly3_mod_phiN()
1291 p->v[i] = p->v[i - 1] - p->v[i]; in poly_mul_x_minus_1()
1293 p->v[0] = orig_final_coefficient - p->v[0]; in poly_mul_x_minus_1()
1571 out[3] = (3 & (p[1] >> 11)) | ((p[2] & 0x3f) << 2); in poly_marshal()
1576 out[8] = (1 & (p[4] >> 12)) | ((p[5] & 0x7f) << 1); in poly_marshal()
1582 p += 8; in poly_marshal()
1588 out[1] = (0x1f & (p[0] >> 8)) | ((p[1] & 0x07) << 5); in poly_marshal()
1590 out[3] = (3 & (p[1] >> 11)) | ((p[2] & 0x3f) << 2); in poly_marshal()
1591 out[4] = (0x7f & (p[2] >> 6)) | ((p[3] & 0x01) << 7); in poly_marshal()
[all …]
A Dhrss_test.cc33 p->a.v[j] |= p->s.v[j]; in poly3_rand()
47 memset(&p, 0, sizeof(p)); in TEST()
51 p.s.v[0] = 0; in TEST()
52 p.a.v[0] = 1; in TEST()
62 Bytes(reinterpret_cast<const uint8_t *>(&p), sizeof(p)), in TEST()
67 p.s.v[0] = 1; in TEST()
68 p.a.v[0] = 1; in TEST()
70 EXPECT_EQ(Bytes(reinterpret_cast<const uint8_t*>(&p), sizeof(p)), in TEST()
74 p.s.v[0] = 0; in TEST()
75 p.a.v[0] = 1; in TEST()
[all …]
/crypto/fipsmodule/aes/asm/
A Daesni-x86.pl164 &jb (&label("${p}128"));
166 &je (&label("${p}192"));
172 &set_label("${p}192");
177 &set_label("${p}128");
256 { my $p=shift;
269 &set_label("${p}2_loop");
287 { my $p=shift;
301 &set_label("${p}3_loop");
327 { my $p=shift;
343 &set_label("${p}4_loop");
[all …]
/crypto/bn/
A Dexponentiation.cc27 if (r == a || r == p) { in BN_exp()
41 int bits = BN_num_bits(p); in BN_exp()
43 if (BN_is_odd(p)) { in BN_exp()
57 if (BN_is_bit_set(p, i)) { in BN_exp()
76 int bits = BN_num_bits(p); in mod_exp_even()
88 assert(BN_is_bit_set(p, bits - 1)); in mod_exp_even()
95 (BN_is_bit_set(p, i) && !BN_mod_mul(r, r, tmp, m, ctx))) { in mod_exp_even()
117 return BN_mod_exp_mont(r, a, p, m, ctx, NULL); in BN_mod_exp()
120 return mod_exp_even(r, a, p, m, ctx); in BN_mod_exp()
123 int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p, in BN_mod_exp_mont_word() argument
[all …]
/crypto/dsa/
A Ddsa.cc71 BN_clear_free(dsa->p); in DSA_free()
112 *out_p = dsa->p; in DSA_get0_pqg()
140 if ((dsa->p == NULL && p == NULL) || (dsa->q == NULL && q == NULL) || in DSA_set0_pqg()
145 if (p != NULL) { in DSA_set0_pqg()
146 BN_free(dsa->p); in DSA_set0_pqg()
147 dsa->p = p; in DSA_set0_pqg()
216 p = BN_CTX_get(ctx.get()); in DSA_generate_parameters_ex()
388 BN_free(dsa->p); in DSA_generate_parameters_ex()
391 dsa->p = BN_dup(p); in DSA_generate_parameters_ex()
412 ret->p = BN_dup(dsa->p); in DSAparams_dup()
[all …]
/crypto/fipsmodule/rsa/
A Drsa_impl.cc.inc679 if ( // Reduce mod p with Montgomery reduction. This computes I * R^-1 mod p.
687 // By precomputing R^3 mod p (normally |BN_MONT_CTX| only uses R^2 mod p) and
703 assert(rsa->p != NULL);
735 // Compute r0 = r0 - m1 mod p. |m1| is reduced mod |q|, not |p|, so we
748 // it is correct mod p. Reducing modulo p gives (r0-m1)*iqmp*q + m1 = r0,
874 // two, we take logs. -log_2((1-p)^limit) = -limit * ln(1-p) / ln(2).
914 if (p != NULL) {
1092 BIGNUM *tmp = rsa->p;
1093 rsa->p = rsa->q;
1137 // Calculate q^-1 mod p.
[all …]

Completed in 66 milliseconds

12345