Requirements on an implementation of the base field.
There are many ways to implement field arithmetic in the base field of integers modulo 2**255 - 19.
This trait specifies our requirements, such that end users can experiment with their own ideas.
This crate, as of now, offers two implementations:
- TweetNaCl: a transliteration of the TweetNaCl code to Rust
- Haase: a fast implementation in assembly, due to Bjoern Haase
Planned: Schoolbook: our own attempt at a fast yet readable implementation
Originally, the plan was to have everything generic over the field implementation, so far we have not been successful in convincing the Rust compiler of this. Therefore, currently the implementations must be selected at compile time using feature flags.
Internal representation as limbs
const ZERO: Self
const ONE: Self
const D: Self
const D2: Self
const BASEPOINT_X: Self
const BASEPOINT_Y: Self
const I: Self
fn to_bytes(&self) -> [u8; 32]
to canonical representation as little-endian bytes
fn from_bytes_unchecked(bytes: &[u8; 32]) -> Self
construct from canonical representation as little-endian bytes
fn inverse(&self) -> Self
fn pow2523(&self) -> Self
fn from_bytes(bytes: &[u8; 32]) -> Result<Self>
construct from canonical representation as little-endian bytes, with validity check
fn parity(&self) -> u8
parity of field element, viewed as integer modulo 2**255 - 19
fn squared(&self) -> Self
default implementation, actual implementation may override this with a faster version