package
2.0.0
Repository: https://github.com/starkbank/ecdsa-go.git
Documentation: pkg.go.dev

# Functions

Fast way to add two points in elliptic curves Params: - `p`: First Point you want to add - `q`: Second Point you want to add - `A`: Coefficient of the first-order term of the equation Y^2 = X^3 + A*X + B (mod P) - `P`: Prime number in the module of the equation Y^2 = X^3 + A*X + B (mod P) Returns: - Point that represents the sum of First and Second Point .
Extended Euclidean Algorithm.
Fast way to multily point and scalar in elliptic curves Params: - `p`: First Point to mutiply - `n`: Scalar to mutiply - `N`: Order of the elliptic curve - `A`: Coefficient of the first-order term of the equation Y^2 = X^3 + A*X + B (mod P) - `P`: Prime number in the module of the equation Y^2 = X^3 + A*X + B (mod P) Returns: - Point that represents the multiplication of a point and a scalar .

# Structs

No description provided by the author

# Interfaces

No description provided by the author