| /prebuilts/go/linux-x86/src/crypto/elliptic/ |
| elliptic_test.go | 26 t.Errorf("FAIL: point off curve is claimed to be on the curve")
31 t.Errorf("FAIL: unmarshaling a point not on the curve succeeded")
423 curve Curve
430 curve := test.curve
431 x, y := curve.ScalarBaseMult(nil)
438 x2, y2 := curve.Double(x, y)
443 baseX := curve.Params().G
[all...] |
| /prebuilts/go/linux-x86/src/crypto/tls/ |
| key_agreement.go | 167 func curveForCurveID(id CurveID) (elliptic.Curve, bool) {
228 curve, ok := curveForCurveID(ka.curveid)
230 return nil, errors.New("tls: preferredCurves includes unsupported curve")
235 ka.privateKey, x, y, err = elliptic.GenerateKey(curve, config.rand())
239 ecdhePublic = elliptic.Marshal(curve, x, y)
244 serverECDHParams[0] = 3 // named curve
326 curve, ok := curveForCurveID(ka.curveid)
330 x, y := elliptic.Unmarshal(curve, ckx.ciphertext[1:]) // Unmarshal also checks whether the given point is on the curve
334 x, _ = curve.ScalarMult(x, y, ka.privateKey
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/ecdsa/ |
| ecdsa.go | 5 // Package ecdsa implements the Elliptic Curve Digital Signature Algorithm, as
31 // A invertible implements fast inverse mod Curve.Params().N
48 elliptic.Curve
86 // curve using the procedure given in [NSA] A.2.1.
87 func randFieldElement(c elliptic.Curve, rand io.Reader) (k *big.Int, err error) {
103 func GenerateKey(c elliptic.Curve, rand io.Reader) (*PrivateKey, error) {
110 priv.PublicKey.Curve = c
118 // manner, but [SECG] truncates the hash to the bit-length of the curve order
122 func hashToInt(hash []byte, c elliptic.Curve) *big.Int {
151 // private key's curve order, the hash will be truncated to that length. I
[all...] |
| /prebuilts/go/linux-x86/src/crypto/ecdsa/ |
| ecdsa.go | 5 // Package ecdsa implements the Elliptic Curve Digital Signature Algorithm, as
31 // A invertible implements fast inverse mod Curve.Params().N
48 elliptic.Curve
86 // curve using the procedure given in [NSA] A.2.1.
87 func randFieldElement(c elliptic.Curve, rand io.Reader) (k *big.Int, err error) {
103 func GenerateKey(c elliptic.Curve, rand io.Reader) (*PrivateKey, error) {
110 priv.PublicKey.Curve = c
118 // manner, but [SECG] truncates the hash to the bit-length of the curve order
122 func hashToInt(hash []byte, c elliptic.Curve) *big.Int {
151 // private key's curve order, the hash will be truncated to that length. I
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| JCEECPublicKey.java | 88 ECCurve curve = spec.getParams().getCurve(); local
89 EllipticCurve ellipticCurve = EC5Util.convertCurve(curve, spec.getParams().getSeed());
225 ECCurve curve = spec.getCurve();
226 EllipticCurve ellipticCurve = EC5Util.convertCurve(curve, spec.getSeed());
228 this.q = curve.createPoint(new BigInteger(1, x), new BigInteger(1, y), false);
244 ECCurve curve; local
252 curve = ecP.getCurve();
253 ellipticCurve = EC5Util.convertCurve(curve, ecP.getSeed());
267 curve = BouncyCastleProvider.CONFIGURATION.getEcImplicitlyCa().getCurve();
273 curve = ecP.getCurve()
396 ECCurve curve = EC5Util.convertCurve(ecSpec.getCurve()); local
408 ECCurve curve = this.engineGetQ().getCurve(); local
[all...] |
| /external/wpa_supplicant_8/src/common/ |
| dpp.c | 52 /* The mandatory to support and the default NIST P-256 curve needs to
275 static int dpp_hash_vector(const struct dpp_curve_params *curve,
279 if (curve->hash_len == 32)
281 if (curve->hash_len == 48)
283 if (curve->hash_len == 64)
838 bi->curve = dpp_get_curve_oid(poid);
839 if (!bi->curve) {
841 "DPP: Unsupported SubjectPublicKeyInfo curve: %s",
980 static EVP_PKEY * dpp_gen_keypair(const struct dpp_curve_params *curve)
994 nid = OBJ_txt2nid(curve->name)
3062 const struct dpp_curve_params *curve; local
3631 const struct dpp_curve_params *curve; local
3791 const struct dpp_curve_params *curve; local
3969 const struct dpp_curve_params *curve; local
4629 const struct dpp_curve_params *curve, *own_curve; local
5001 const struct dpp_curve_params *curve = pkex->own_bi->curve; local
5139 const struct dpp_curve_params *curve = bi->curve; local
5413 const struct dpp_curve_params *curve = pkex->own_bi->curve; local
5623 const struct dpp_curve_params *curve = pkex->own_bi->curve; local
5859 const struct dpp_curve_params *curve = pkex->own_bi->curve; local
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| Tnaf.java | 24 * e.g. "Guide to Elliptic Curve Cryptography", Darrel Hankerson,
77 * @param mu The parameter <code>μ</code> of the elliptic curve.
116 * @param mu The parameter <code>μ</code> of the elliptic curve.
160 * @param mu The parameter <code>μ</code> of the elliptic curve. Must
272 * @param s The curve parameter <code>s<sub>0</sub></code> or
275 * @param a The parameter <code>a</code> of the elliptic curve.
309 * @param mu The parameter <code>μ</code> of the elliptic curve.
399 * Returns the parameter <code>μ</code> of the elliptic curve.
400 * @param curve The elliptic curve from which to obtain <code>μ</code>
656 ECCurve.AbstractF2m curve = (ECCurve.AbstractF2m) p.getCurve(); local
677 ECCurve.AbstractF2m curve = (ECCurve.AbstractF2m)p.getCurve(); local
697 ECCurve curve = p.getCurve(); local
[all...] |
| WTauNafMultiplier.java | 31 ECCurve.AbstractF2m curve = (ECCurve.AbstractF2m)p.getCurve(); local
32 int m = curve.getFieldSize();
33 byte a = curve.getA().toBigInteger().byteValue();
35 BigInteger[] s = curve.getSi();
39 return multiplyWTnaf(p, rho, curve.getPreCompInfo(p, PRECOMP_NAME), a, mu);
76 ECCurve.AbstractF2m curve = (ECCurve.AbstractF2m)p.getCurve(); local
77 byte a = curve.getA().toBigInteger().byteValue();
86 curve.setPreCompInfo(p, PRECOMP_NAME, pre);
|
| /external/adhd/cras/src/server/config/ |
| cras_card_config.h | 28 /* Returns the apporpriate volume curve to use for the control given by name.
32 * The specialized curve for the control if there is one, otherwise NULL.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| package.html | 20 This package provides classes to perform curve fitting.
22 <p>Curve fitting is a special case of a least squares problem
|
| /external/boringssl/src/ssl/test/runner/curve25519/ |
| doc.go | 6 // the elliptic curve known as curve25519. See http://cr.yp.to/ecdh.html
9 // basePoint is the x coordinate of the generator of the curve.
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/ |
| ECDSASigner.java | 173 * If possible, avoid normalizing the point (to save a modular inversion in the curve field).
175 * There are ~cofactor elements of the curve field that reduce (modulo the group order) to 'r'.
185 ECCurve curve = point.getCurve(); local
186 if (curve != null)
188 BigInteger cofactor = curve.getCofactor();
191 ECFieldElement D = getDenominator(curve.getCoordinateSystem(), point);
195 while (curve.isValidFieldElement(r))
197 ECFieldElement R = curve.fromBigInteger(r).multiply(D);
|
| /external/pdfium/third_party/lcms/ |
| 0017-memory-leak-ReadSegmentedCurve.patch | 16 cmsSignalError(self->ContextID, cmsERROR_UNKNOWN_EXTENSION, "Unknown curve element type '%s' found.", String);
24 return Curve;
|
| /external/tpm2/ |
| Commit.c | 16 // TPM_RC_ECC_POINT either P1 or the point derived from s2 is not on the curve of
60 // Get prime modulus for the curve. This is needed later but getting this now
61 // allows confirmation that the curve exists
64 // if no p, then the curve ID is bad
84 // do the hash operation on s2 with the size of curve 'p'
107 // If there is a P1, make sure that it is on the curve
119 // with the same curve. There is significant optimization by not
120 // having to reload the curve parameters multiple times.
|
| /packages/apps/Camera2/src/com/android/camera/ui/motion/ |
| UnitCurve.java | 20 * Simple functions that produce values along a curve for any given input and can compute input
26 * Produce a unit value of this curve at time t. The function should always return a valid
|
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/crypto/curve25519/ |
| doc.go | 6 // the elliptic curve known as curve25519. See http://cr.yp.to/ecdh.html
9 // basePoint is the x coordinate of the generator of the curve.
|
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/crypto/curve25519/ |
| doc.go | 6 // the elliptic curve known as curve25519. See http://cr.yp.to/ecdh.html
9 // basePoint is the x coordinate of the generator of the curve.
|
| /external/eigen/unsupported/Eigen/src/Splines/ |
| SplineFwd.h | 28 typedef _Scalar Scalar; /*!< The spline curve's scalar type. */
29 enum { Dimension = _Dim /*!< The spline curve's dimension. */ };
30 enum { Degree = _Degree /*!< The spline curve's degree. */ };
32 enum { OrderAtCompileTime = _Degree==Dynamic ? Dynamic : _Degree+1 /*!< The spline curve's order at compile-time. */ };
68 enum { OrderAtCompileTime = _Degree==Dynamic ? Dynamic : _Degree+1 /*!< The spline curve's order at compile-time. */ };
|
| /external/mesa3d/src/mesa/math/ |
| m_eval.h | 41 * Since stability is not important for displaying curve
44 * A cubic Bezier curve with control points b0, b1, b2, b3 can be
68 * TP Bezier surface. First a control polygon for a curve
70 * then the point on the curve for the other parameter
73 * To store the curve control polygon additional storage
|
| /system/keymaster/km_openssl/ |
| nist_curve_key_exchange.cpp | 38 NistCurveKeyExchange* NistCurveKeyExchange::GenerateKeyExchange(keymaster_ec_curve_t curve) {
40 switch (curve) {
54 LOG_E("Not a NIST curve: %d", curve);
103 !EC_POINT_oct2point(/* also test if point is on curve */
|
| /frameworks/base/services/core/java/com/android/server/display/ |
| BrightnessMappingStrategy.java | 188 * correct the brightness curve.
213 * This data point <b>must</b> exist on the brightness curve as a result of this call. This is
218 * curve.
223 * Removes any short term adjustments made to the curve from user interactions.
231 /** @return True if there are any short term adjustments applied to the curve. */
292 PLOG.logCurve("unsmoothed curve", lux, brightness);
296 // Smooth curve for data points above the newly introduced point
310 // Smooth curve for data points below the newly introduced point
327 PLOG.logCurve("smoothed curve", lux, brightness);
342 // affects the curve rather drastically
389 Pair<float[], float[]> curve = insertControlPoint(newLux, newBrightness, userLux, local
548 Pair<float[], float[]> curve = getAdjustedCurve(mLux, mBrightness, mUserLux, local
745 Pair<float[], float[]> curve = getAdjustedCurve(defaultLux, defaultBacklight, mUserLux, local
757 Pair<float[], float[]> curve = mConfig.getCurve(); local
[all...] |
| /external/iproute2/man/man7/ |
| tc-hfsc.7 | 3 tc-hfcs \- Hierarchical Fair Service Curve
7 HFSC (Hierarchical Fair Service Curve) is a network packet scheduling algorithm that was first presented at
25 minimize any discrepancy between the service curve and the actual amount of
58 SC \- service curve
63 To understand how HFSC works, we must first introduce a service curve.
68 allowed to transfer not less than the amount specified by its service curve,
69 then the service curve is not violated.
79 the ability to "look back", so if during current active period the service curve is violated, maybe it
108 than the service curve, then it might compensate for smaller service during
117 when should we start transferring packets, so a service curve of a class is no
[all...] |
| /external/boringssl/src/ssl/test/runner/ |
| sign.go | 129 curve elliptic.Curve
133 func (e *ecdsaSigner) isCurveValid(curve elliptic.Curve) bool {
140 return e.curve != nil && curve == e.curve
145 return ok && e.isCurveValid(ecdsaKey.Curve)
171 if !e.isCurveValid(ecdsaKey.Curve) {
172 return nil, errors.New("invalid curve for ECDSA"
[all...] |
| /cts/apps/CameraITS/tests/scene1/ |
| test_param_tonemap_mode.py | 65 req["android.tonemap.curve"] = {
85 # Test 2: that the length of the tonemap curve (i.e. number of control
91 curve = sum([[i/m, i/m] for i in range(size)], [])
94 req["android.tonemap.curve"] = {
95 "red": curve, "green": curve, "blue": curve}
|
| /external/conscrypt/common/src/main/java/org/conscrypt/ |
| OpenSSLECGroupContext.java | 76 // Try to find recognise the underlying curve from the parameters.
77 final EllipticCurve curve = params.getCurve(); local
78 final ECField field = curve.getField();
89 final BigInteger b = curve.getB();
134 final BigInteger a = curve.getA();
167 final EllipticCurve curve = new EllipticCurve(field, a, b); local
176 ECParameterSpec spec = new ECParameterSpec(curve, generator, order, cofactor.intValue());
|
