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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
use crate::PublicKey;
use bls12_381_plus::{G2Affine, G2Projective};
use core::{
fmt::{self, Display},
ops::{BitOr, Not},
};
use group::Curve;
use serde::{Deserialize, Deserializer, Serialize, Serializer};
use subtle::{Choice, CtOption};
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct MultiPublicKey(pub(crate) G2Projective);
impl From<&[PublicKey]> for MultiPublicKey {
fn from(keys: &[PublicKey]) -> Self {
let mut g = G2Projective::identity();
for k in keys {
g += k.0;
}
Self(g)
}
}
impl Display for MultiPublicKey {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.0.fmt(f)
}
}
impl Default for MultiPublicKey {
fn default() -> Self {
Self(G2Projective::identity())
}
}
impl Serialize for MultiPublicKey {
fn serialize<S>(&self, s: S) -> Result<S::Ok, S::Error>
where
S: Serializer,
{
self.0.serialize(s)
}
}
impl<'de> Deserialize<'de> for MultiPublicKey {
fn deserialize<D>(d: D) -> Result<Self, D::Error>
where
D: Deserializer<'de>,
{
let p = G2Projective::deserialize(d)?;
Ok(Self(p))
}
}
impl MultiPublicKey {
pub const BYTES: usize = 96;
pub fn is_valid(&self) -> Choice {
self.0.is_identity().not().bitor(self.0.is_on_curve())
}
pub fn is_invalid(&self) -> Choice {
self.0.is_identity().bitor(self.0.is_on_curve().not())
}
pub fn to_bytes(self) -> [u8; Self::BYTES] {
self.0.to_affine().to_compressed()
}
pub fn from_bytes(bytes: &[u8; Self::BYTES]) -> CtOption<Self> {
let mut t = [0u8; Self::BYTES];
t.copy_from_slice(bytes);
G2Affine::from_compressed(&t).map(|p| Self(G2Projective::from(&p)))
}
}