arcis-compiler 0.9.7

A framework for writing secure multi-party computation (MPC) circuits to be executed on the Arcium network.
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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

use crate::{
    traits::{Reveal, ToMontgomery},
    utils::{
        elliptic_curve::AffineEdwardsPoint,
        field::{BaseField, ScalarField},
    },
};
use curve25519_dalek_arcium_fork::{
    field::FieldElement,
    EdwardsPoint,
    RistrettoPoint as ArcisRistrettoPoint,
};
use primitives::algebra::elliptic_curve::{Curve25519Ristretto, Point, Scalar};
use std::ops::Mul;

pub trait Curve: Clone + Copy + Reveal {
    fn generator() -> Self;
}

pub type CurvePoint = Point<Curve25519Ristretto>;

impl Mul<CurvePoint> for ScalarField {
    type Output = CurvePoint;

    fn mul(self, rhs: CurvePoint) -> Self::Output {
        rhs * Scalar::<Curve25519Ristretto>::from_le_bytes(&self.to_le_bytes()).unwrap()
    }
}

impl Reveal for CurvePoint {
    fn reveal(self) -> Self {
        self
    }
}

impl ToMontgomery for CurvePoint {
    type Output = BaseField;

    fn to_montgomery(self, _is_expected_non_identity: bool) -> (BaseField, BaseField) {
        // on plaintext points we simply set is_expected_non_identity = true
        AffineEdwardsPoint::from(self).to_montgomery(true)
    }
}

impl Curve for CurvePoint {
    fn generator() -> Self {
        Self::generator()
    }
}

impl From<AffineEdwardsPoint<BaseField>> for CurvePoint {
    fn from(value: AffineEdwardsPoint<BaseField>) -> Self {
        let x = FieldElement::from_bytes(&value.x.to_le_bytes());
        let y = FieldElement::from_bytes(&value.y.to_le_bytes());
        let xy = FieldElement::from_bytes(&(value.x * value.y).to_le_bytes());
        Self::new(ArcisRistrettoPoint::new_unchecked(
            EdwardsPoint::new_unchecked(x, y, FieldElement::ONE, xy),
        ))
    }
}