Module group

Traits and implementations for prime-order groups in which the decisional Diffie–Hellman (DDH), computational Diffie–Hellman (CDH) and discrete log (DL) problems are believed to be hard.

(Decisional Diffie–Hellman assumption is considered stronger than both CDH and DL, so if DDH is believed to hold for a certain group, it should be good to go.)

Such groups can be applied for ElGamal encryption and other cryptographic protocols from this crate.

Structs

• Curve25519Subgroup
  Prime-order subgroup of Curve25519 without any transforms performed for EC points.
• Generic
  Generic Group implementation for elliptic curves defined in terms of the traits from the elliptic-curve crate.
• RandomBytesProvider
  Provides an arbitrary number of random bytes.
• Ristretto
  Ristretto transform of Curve25519, also known as ristretto255.

Traits

• ElementOps
  Helper trait for Group that describes operations on group elements (i.e., EC points for elliptic curve groups).
• Group
  Prime-order group in which the discrete log problem and decisional / computational Diffie–Hellman problems are believed to be hard.
• ScalarOps
  Helper trait for Group that describes operations on group scalars.