hash2curve 0.14.0

hash2curve algorithm implementation
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

//! Traits for mapping field elements to points on the curve.

use elliptic_curve::array::typenum::{NonZero, Unsigned};
use elliptic_curve::array::{Array, ArraySize};
use elliptic_curve::group::cofactor::CofactorGroup;
use elliptic_curve::ops::Reduce;
use elliptic_curve::{CurveArithmetic, ProjectivePoint};

/// Trait for converting field elements into a point via a mapping method like
/// Simplified Shallue-van de Woestijne-Ulas or Elligator.
pub trait MapToCurve:
    CurveArithmetic<ProjectivePoint: CofactorGroup<Subgroup = Self::ProjectivePoint>>
{
    /// The target security level in bytes:
    /// <https://www.rfc-editor.org/rfc/rfc9380.html#section-8.9-2.2>
    /// <https://www.rfc-editor.org/rfc/rfc9380.html#name-target-security-levels>
    type SecurityLevel: Unsigned;
    /// The field element representation for a group value with multiple elements.
    type FieldElement: Reduce<Array<u8, Self::Length>> + Default + Copy;
    /// The `L` parameter as specified in the [RFC](https://www.rfc-editor.org/rfc/rfc9380.html#section-5-6).
    type Length: ArraySize + NonZero;

    /// Map a field element into a curve point.
    fn map_to_curve(element: Self::FieldElement) -> ProjectivePoint<Self>;
}