package mec

You can search for identifiers within the package.

in-package search v0.2.0

Mec - Mini Elliptic Curve library

Install

Dune Dependency

gitlab.com Readme Edit opam file Versions (1)

Authors

D

Danny Willems <be.danny.willems@gmail.com>

Maintainers

D

Danny Willems <be.danny.willems@gmail.com>

Sources

ocaml-ec-0.1.0.tar.bz2

md5=7c68b531c8011b5d032f0a0d8523e8c5

sha512=f428751c5f2b7c7fc07548551bea0277c9c8c32c1052aecf22787188e7678939dbb091844e29178b2819d724cf843c65774d9211c0a0ede5bf71caff3f2dd1bc

doc/mec.curve/Mec_curve/Tweedledum/Jacobian/index.html

Module `Tweedledum.Jacobian`

include Mec_curve_sig.Ec_sig.WeierstrassT

include Mec_curve_sig.Ec_sig.BASE

exception Not_on_curve of Bytes.t

type t

Represents an element on the curve. In the case of a curve with a cofactor, the element is not necessarily in the prime subgroup.

val size_in_bytes : int

The size of a point representation, in bytes

module Scalar : Ff_sig.PRIME

module Base : Ff_sig.PRIME

val check_bytes : Bytes.t -> bool

Check if a point, represented as a byte array, is on the curve *

val of_bytes_opt : Bytes.t -> t option

Attempt to construct a point from a byte array

val of_bytes_exn : Bytes.t -> t

Attempt to construct a point from a byte array. Raise Not_on_curve if the point is not on the curve

val to_bytes : t -> Bytes.t

Return a representation in bytes

val zero : t

Zero of the elliptic curve

val one : t

A fixed generator of the elliptic curve

val is_zero : t -> bool

Return true if the given element is zero

val random : ?state:Random.State.t -> unit -> t

Generate a random element

val add : t -> t -> t

Return the addition of two element

val double : t -> t

Double the element

val negate : t -> t

Return the opposite of the element

val eq : t -> t -> bool

Return true if the two elements are algebraically the same

val mul : t -> Scalar.t -> t

Multiply an element by a scalar

val a : Base.t

val b : Base.t

val cofactor : Z.t

val is_on_curve : x:Base.t -> y:Base.t -> z:Base.t -> bool

is_on_curve ~x ~y ~z returns true if the coordinates (x, y, z) represents a point on the curve. It does not check the point is in the prime subgroup.

val is_in_prime_subgroup : x:Base.t -> y:Base.t -> z:Base.t -> bool

is_in_prime_subgroup ~x ~y ~z returns true if the coordinates (x, y, z) represents a point in the prime subgroup. The coordinates must be a point on the curve

val get_x_coordinate : t -> Base.t

val get_y_coordinate : t -> Base.t

val get_z_coordinate : t -> Base.t

val from_coordinates_opt : x:Base.t -> y:Base.t -> z:Base.t -> t option

Build a point from the projective coordinates. If the point is not on the curve and in the subgroup, returns None

val from_coordinates_exn : x:Base.t -> y:Base.t -> z:Base.t -> t

Build a point from the projective coordinates. If the point is not on the curve and in the subgroup, raise Not_on_curve.

val get_affine_x_coordinate : t -> Base.t

val get_affine_y_coordinate : t -> Base.t

val from_affine_coordinates_exn : x:Base.t -> y:Base.t -> t

val from_affine_coordinates_opt : x:Base.t -> y:Base.t -> t