Crypto.ECC

Generate a new random scalar on the curve. The scalar will represent a number between 1 and the order of the curve non included

Generate a new random keypair

Get the curve size in bits

Encode a elliptic curve point into binary form

Try to decode the binary form of an elliptic curve point

Generate a Diffie hellman secret value.

This is generally just the .x coordinate of the resulting point, that is not hashed.

use pointSmul to keep the result in Point format.

WARNING: Curve implementations may return a special value or an exception when the public point lies in a subgroup of small order. This function is adequate when the scalar is in expected range and contributory behaviour is not needed. Otherwise use ecdh.

Generate a Diffie hellman secret value and verify that the result is not the point at infinity.

This additional test avoids risks existing with function ecdhRaw. Implementations always return a CryptoError instead of a special value or an exception.

Add points on a curve

Negate a curve point

Scalar Multiplication on a curve

Get the curve order size in bits

Multiply a scalar with the curve base point

Multiply the point p with s2 and add a lifted to curve value s1

Encode an elliptic curve scalar into big-endian form

Try to decode the big-endian form of an elliptic curve scalar

Convert an elliptic curve scalar to an integer

Try to create an elliptic curve scalar from an integer

Add two scalars and reduce modulo the curve order

Multiply two scalars and reduce modulo the curve order