Home
last modified time | relevance | path

Searched full:affine (Results 1 – 25 of 78) sorted by relevance

1234

/freebsd/crypto/libecc/src/curves/
H A Daff_pt.c21 * Verify that an affine point has already been initialized. Return 0 on
76 * Uninitialize pointed affine point 'in' to prevent further use (magic field
181 * Same as previous but using an affine point instead of pair of coordinates
197 * Copy 'in' affine point into 'out'. 'out' is initialized by the function.
214 * Compare affine points 'in1' and 'in2'. On success, 0 is returned and
239 * Check if given affine points 'in1' and 'in2' on the same curve are equal
266 * Import an affine point from a buffer with the following layout; the 2
319 * Export an affine point 'pt' to a buffer with the following layout; the 2
H A Daff_pt_edwards.c19 /* Verify that an affine point has already been initialized
78 * Uninitialize pointed affine point to prevent further use (magic field
152 * Checks if affine coordinates point is on an Edwards curve. 'on_curve' is set
170 * Copy an Edwards affine point in an output. The output is initialized properly.
189 * Compares two given affine points on an Edwards curve, it returns 0 in input
217 * Import an Edwards affine point from a buffer with the following layout; the 2
264 /* Export an Edwards affine point to a buffer with the following layout; the 2
514 * - (0, 1) mapped to the point at infinity (not possible in our affine coordinates)
557 /* We do not handle point at infinity in affine coordinates */ in aff_pt_edwards_to_montgomery()
614 * - Point at infinity mapped to (0, 1) (not possible in our affine coordinates)
H A Daff_pt_montgomery.c15 /* Verify that an affine point has already been initialized.
74 * Uninitialize pointed affine point to prevent further use (magic field
143 /* Checks if affine coordinates point is on a Montgomery curve. 'on_curve' is set to 1 if yes,
160 /* Copy a Montgomery affine point in an output. The output is initialized properly.
179 * Compares two given affine points on a Montgomery curve, it returns 0 in input 'cmp' if
203 * Import an Montgomery affine point from a buffer with the following layout; the 2
250 /* Export an Montgomery affine point to a buffer with the following layout; the 2
H A Dprj_pt.c213 * Convert given projective point 'in' to affine representation in 'out'. 'out'
238 * Get the unique Z = 1 projective point representation ("equivalent" to affine
276 * Converts affine point 'in' to projective representation in 'out'. 'out' is
285 /* The input affine point must be on the curve */ in ec_shortw_aff_to_prj()
503 * Import a projective point from an affine point buffer with the following layout; the 2
592 * Export a projective point to an affine point buffer with the following
614 /* Move to the affine unique representation */ in prj_pt_export_to_aff_buf()
617 /* Export the affine point to the buffer */ in prj_pt_export_to_aff_buf()
1984 /* Use the affine mapping */ in aff_pt_edwards_to_prj_pt_shortw()
1986 /* And then map the short Weierstrass affine to projective coordinates */ in aff_pt_edwards_to_prj_pt_shortw()
[all …]
/freebsd/crypto/libecc/src/examples/basic/
H A Dcurve_ecdh.c39 * exchange affine coordinates points (and not
61 * This is a serialized affine EC point, holding
70 * This is a serialized affine EC point, holding
176 * Our export size is exactly 2 coordinates in Fp (affine point representation), in ECDH_helper()
197 /* Import the shared value as a projective point from an affine point buffer in ECDH_helper()
205 /* Compute the affine coordinates to get the unique (x, y) representation in ECDH_helper()
/freebsd/sys/dev/qat/qat_api/include/lac/
H A Dcpa_cy_ec.h34 * Input: Montgomery affine coordinate X of point P
36 * Output: Montgomery affine coordinate X of point [k]P
41 * Output: Montgomery affine coordinate X of point [k]G
45 * Input: Twisted Edwards affine coordinate X of point P
46 * Twisted Edwards affine coordinate Y of point P
48 * Output: Twisted Edwards affine coordinate X of point [k]P
49 * Twisted Edwards affine coordinate Y of point [k]P
56 * Output: Twisted Edwards affine coordinate X of point [k]G
57 * Twisted Edwards affine coordinate Y of point [k]G
63 * Input: Montgomery affine coordinate X of point P
[all …]
/freebsd/secure/lib/libcrypto/man/man3/
H A DEC_POINT_new.3188 The affine coordinates for a point describe a point in terms of its x and y
204 As well as the affine coordinates, a point can alternatively be described in
209 affine coordinates. A Jacobian projective coordinate (x, y, z) can be written
210 as an affine coordinate as (x/(z^2), y/(z^3)). Conversion to Jacobian
211 projective from affine coordinates is simple. The coordinate (x, y) is mapped
/freebsd/crypto/openssl/doc/man3/
H A DEC_POINT_new.pod127 The affine coordinates for a point describe a point in terms of its x and y
143 As well as the affine coordinates, a point can alternatively be described in
148 affine coordinates. A Jacobian projective coordinate (x, y, z) can be written
149 as an affine coordinate as (x/(z^2), y/(z^3)). Conversion to Jacobian
150 projective from affine coordinates is simple. The coordinate (x, y) is mapped
/freebsd/crypto/openssl/crypto/ec/
H A Dec2_smpl.c285 * Set the coordinates of an EC_POINT using affine coordinates. Note that
286 * the simple implementation only uses affine coordinates.
317 * Gets the affine coordinates of an EC_POINT. Note that the simple
318 * implementation only uses affine coordinates.
526 /* only support affine coordinates */ in ossl_ec_GF2m_simple_is_on_curve()
578 * 0 equal (in affine coordinates)
631 /* Forces the given EC_POINT to internally use affine coordinates. */
679 * Forces each of the EC_POINTs in the given array to use affine coordinates.
726 /* if p is not affine, something is wrong */ in ec_GF2m_simple_ladder_pre()
799 * Recover affine (x,y) result from Lopez-Dahab r and s, affine p.
H A Dec2_oct.c24 * Calculates and sets the affine coordinates of an EC_POINT from the given
26 * Note that the simple implementation only uses affine coordinates.
254 * simple implementation only uses affine coordinates.
H A Decp_sm2p256.c212 /* Point add affine: R <- P + Q */
367 * Affine point mul by scalar: k - scalar, P - affine point
415 /* Get affine point */
H A Decp_nistz256.c65 * multiplies are stored in affine form.
362 * that are bound to the affine coordinates (xi, yi) by the following in ecp_nistz256_point_add()
373 * It is easy to prove that is_equal(U1, U2) implies that the affine in ecp_nistz256_point_add()
375 * Likewise is_equal(S1, S2) implies that the affine y-coordinates are in ecp_nistz256_point_add()
382 * When both points are inverse of each other, we know that the affine in ecp_nistz256_point_add()
432 /* Point addition when b is known to be affine: r = a+b */
465 * In affine representation we encode infinity as (0,0), which is in ecp_nistz256_point_add_affine()
884 * make multiple points affine at the same time. in ecp_nistz256_mult_precompute()
1060 * Since affine infinity is encoded as (0,0) and in ecp_nistz256_points_mul()
H A Decp_nistputil.c42 * Convert an array of points into affine coordinates. (If the point at
121 * Convert point (X, Y, Z) into affine form (X/(Z^2), Y/(Z^3), 1) in ossl_ec_GFp_nistp_points_make_affine_internal()
H A Decp_smpl.c1065 * 0 equal (in affine coordinates) in ossl_ec_GFp_simple_cmp()
1480 * - p: affine coordinates
1553 * - p: affine coordinates
1631 * - p: affine coordinates
1634 * - r := (x,y): affine coordinates
1638 * projective coords, i.e. p is affine and (r,s) in projective (homogeneous)
1639 * coords, and return r in affine coordinates.
H A Decdh_ossl.c106 * exit. Note: getting affine coordinates returns 0 if point is at infinity. in ossl_ecdh_simple_compute_key()
/freebsd/contrib/bearssl/src/ec/
H A Dec_p256_m62.c601 * Points in affine and Jacobian coordinates.
603 * - In affine coordinates, the point-at-infinity cannot be encoded.
604 * - Jacobian coordinates (X,Y,Z) correspond to affine (X/Z^2,Y/Z^3);
714 * - The point is converted back to affine coordinates.
732 /* Compute affine coordinates x (in t1) and y (in t2). */ in point_encode()
945 * in affine coordinates.
956 * - P1 and P2 have the same Y (affine) coordinate.
1056 * in affine coordinates.
1097 * simplifying since P2 is affine (i.e. z2 = 1, implicitly),
1243 * provided, with points 1*P to 15*P in affine coordinates.
[all …]
H A Dec_p256_m64.c643 * Points in affine and Jacobian coordinates.
645 * - In affine coordinates, the point-at-infinity cannot be encoded.
646 * - Jacobian coordinates (X,Y,Z) correspond to affine (X/Z^2,Y/Z^3);
724 * - The point is converted back to affine coordinates.
742 /* Compute affine coordinates x (in t1) and y (in t2). */ in point_encode()
965 * in affine coordinates.
976 * - P1 and P2 have the same Y (affine) coordinate.
1076 * in affine coordinates.
1117 * simplifying since P2 is affine (i.e. z2 = 1, implicitly),
1261 * provided, with points 1*P to 15*P in affine coordinates.
[all …]
H A Dec_p256_m31.c639 * Jacobian coordinates for a point in P-256: affine coordinates (X,Y)
657 * Convert a point to affine coordinates:
661 * coordinates are the 'X' and 'Y' affine coordinates.
929 * case when P2 is a non-zero point in affine coordinate.
1097 * valid, in affine coordinates, and not the point at infinity.
1303 * points in affine coordinates; we use a constant-time lookup. in p256_mulgen()
H A Dec_prime_i31.c130 * -- affine coordinates are X = x / z^2 and Y = y / z^3
189 * for "double" and "affine").
421 * Conversion back to affine coordinates. This code snippet assumes that
/freebsd/crypto/libecc/src/ecdh/
H A Decccdh.c151 /* Export our public key as an affine point in ecccdh_serialize_pub_key()
219 /* Get the unique affine representation of the resulting point */ in ecccdh_derive_secret()
/freebsd/sys/dev/qat/qat_api/firmware/include/
H A Dicp_qat_fw_mmp.h50 uint64_t xp; /**< xP = affine coordinate X of point P (6 qwords)*/
51 uint64_t yp; /**< yP = affine coordinate Y of point P (6 qwords)*/
91 uint64_t xp; /**< xP = affine coordinate X of point P (4 qwords)*/
92 uint64_t yp; /**< yP = affine coordinate Y of point P (4 qwords)*/
2821 uint64_t xp; /**< xP = Montgomery affine coordinate X of point P (4 qwords)*/
2848 uint64_t xp; /**< xP = Twisted Edwards affine coordinate X of point P (4 qwords)*/
2849 uint64_t yp; /**< yP = Twisted Edwards affine coordinate Y of point P (4 qwords)*/
2876 uint64_t xp; /**< xP = Montgomery affine coordinate X of point P (8 qwords)*/
2903 uint64_t xp; /**< xP = Edwards affine coordinate X of point P (8 qwords)*/
2904 uint64_t yp; /**< yP = Edwards affine coordinate Y of point P (8 qwords)*/
[all …]
/freebsd/crypto/libecc/src/utils/
H A Dprint_curves.c19 * Locally convert given projective point to affine representation and
/freebsd/crypto/openssl/include/openssl/
H A Dec.h632 /** Sets the affine coordinates of an EC_POINT
644 /** Gets the affine coordinates of an EC_POINT.
656 /** Sets the affine coordinates of an EC_POINT. A synonym of
669 /** Gets the affine coordinates of an EC_POINT. A synonym of
709 /** Sets the affine coordinates of an EC_POINT. A synonym of
722 /** Gets the affine coordinates of an EC_POINT. A synonym of
1134 /** Sets a public key from affine coordinates performing
/freebsd/crypto/libecc/src/sig/
H A Deckcdsa.c230 * z is basically the concatenation of Yx and Yy (the affine coordinates in _eckcdsa_sign_init()
235 * So, we convert the public key point to its affine representation and in _eckcdsa_sign_init()
603 * z is basically the concatenation of Yx and Yy (the affine coordinates in _eckcdsa_verify_init()
608 * So, we convert the public key point to its affine representation and in _eckcdsa_verify_init()
H A Dbip0340.c83 /* This operation is only meaningful on the "affine" representative. in _bip0340_set_scalar()
214 * affine representative. in _bip0340_sign()
421 * affine representative. in _bip0340_verify_init()
526 * affine representative. in _bip0340_verify_finalize()
957 * affine representative. in _bip0340_verify_batch_no_memory()
1215 * affine representative. in _bip0340_verify_batch()

1234