snarkvm-algorithms 0.8.0

Algorithms for a decentralized virtual machine
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135

// Copyright (C) 2019-2021 Aleo Systems Inc.
// This file is part of the snarkVM library.

// The snarkVM library is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.

// The snarkVM library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with the snarkVM library. If not, see <https://www.gnu.org/licenses/>.

mod ecies {
    use crate::{encryption::ECIESPoseidonEncryption, EncryptionScheme};
    use snarkvm_curves::edwards_bls12::EdwardsParameters;
    use snarkvm_utilities::{FromBytes, ToBytes, UniformRand};

    use rand::{thread_rng, Rng};

    pub const ITERATIONS: usize = 1000;

    type TestEncryptionScheme = ECIESPoseidonEncryption<EdwardsParameters>;

    #[test]
    fn test_encrypt_and_decrypt() {
        let rng = &mut thread_rng();
        let encryption = TestEncryptionScheme::setup("simple_encryption");

        let private_key = encryption.generate_private_key(rng);
        let public_key = encryption.generate_public_key(&private_key);
        let (_randomness, _ciphertext_randomizer, symmetric_key) = encryption.generate_asymmetric_key(&public_key, rng);

        let number_of_bytes = 320;
        let message = (0..number_of_bytes).map(|_| u8::rand(rng)).collect::<Vec<u8>>();
        let ciphertext = encryption.encrypt(&symmetric_key, &message).unwrap();
        dbg!(ciphertext.len());
        let candidate_message = encryption.decrypt(&symmetric_key, &ciphertext).unwrap();
        assert_eq!(message, candidate_message);
    }

    #[test]
    fn test_encryption_public_key_to_bytes_le() {
        let rng = &mut thread_rng();
        let encryption = TestEncryptionScheme::setup("encryption_public_key_serialization");

        for _ in 0..ITERATIONS {
            let private_key = encryption.generate_private_key(rng);
            let public_key = encryption.generate_public_key(&private_key);

            let public_key_bytes = public_key.to_bytes_le().unwrap();
            let recovered_public_key =
                <TestEncryptionScheme as EncryptionScheme>::PublicKey::read_le(&public_key_bytes[..]).unwrap();
            assert_eq!(public_key, recovered_public_key);
        }
    }

    #[test]
    fn test_encryption_symmetric_key_commitment() {
        let rng = &mut thread_rng();
        let encryption = TestEncryptionScheme::setup("encryption_symmetric_key_commitment");

        // Compute the symmetric key commitment.
        let private_key = encryption.generate_private_key(rng);
        let public_key = encryption.generate_public_key(&private_key);
        let (_randomness, ciphertext_randomizer, symmetric_key) = encryption.generate_asymmetric_key(&public_key, rng);
        let symmetric_key_commitment = encryption.generate_symmetric_key_commitment(&symmetric_key);

        {
            // Sanity check that the symmetric key matches, when derived from the private key.
            let candidate_symmetric_key = encryption
                .generate_symmetric_key(&private_key, ciphertext_randomizer)
                .unwrap();
            assert_eq!(symmetric_key, candidate_symmetric_key);
        }
        {
            // Sanity check that the symmetric key commitment is deterministic.
            let candidate_symmetric_key_commitment = encryption.generate_symmetric_key_commitment(&symmetric_key);
            assert_eq!(symmetric_key_commitment, candidate_symmetric_key_commitment);
        }

        // Ensure different symmetric keys for the same public key fail to match the symmetric key commitment.
        for _ in 0..ITERATIONS {
            let (_randomness, _ciphertext_randomizer, alternate_symmetric_key) =
                encryption.generate_asymmetric_key(&public_key, rng);
            let candidate_symmetric_key_commitment =
                encryption.generate_symmetric_key_commitment(&alternate_symmetric_key);
            assert_ne!(symmetric_key_commitment, candidate_symmetric_key_commitment);
        }

        // Ensure different private keys fail to match the symmetric key commitment.
        for _ in 0..ITERATIONS {
            let alternate_private_key = encryption.generate_private_key(rng);
            let alternate_public_key = encryption.generate_public_key(&alternate_private_key);
            let (_randomness, _ciphertext_randomizer, alternate_symmetric_key) =
                encryption.generate_asymmetric_key(&alternate_public_key, rng);
            let candidate_symmetric_key_commitment =
                encryption.generate_symmetric_key_commitment(&alternate_symmetric_key);
            assert_ne!(symmetric_key_commitment, candidate_symmetric_key_commitment);
        }
    }

    #[test]
    fn test_ciphertext_random_manipulation() {
        let rng = &mut thread_rng();
        let encryption = TestEncryptionScheme::setup("simple_encryption");

        let private_key = encryption.generate_private_key(rng);
        let public_key = encryption.generate_public_key(&private_key);
        let (_randomness, _ciphertext_randomizer, symmetric_key) = encryption.generate_asymmetric_key(&public_key, rng);

        let number_of_bytes = 320;
        let message = (0..number_of_bytes).map(|_| u8::rand(rng)).collect::<Vec<u8>>();
        let ciphertext = encryption.encrypt(&symmetric_key, &message).unwrap();
        let candidate_message = encryption.decrypt(&symmetric_key, &ciphertext).unwrap();
        assert_eq!(message, candidate_message);

        // Ensure any mutation fails to match the original message.
        for _ in 0..ITERATIONS {
            // Copy the ciphertext.
            let mut ciphertext = ciphertext.clone();

            // Mutate one byte in the first 30 bytes of the ciphertext.
            let idx = rng.gen_range(0..30);
            ciphertext[idx] = ciphertext[idx].wrapping_add(rng.gen_range(1..u8::MAX));

            // This should fail.
            let candidate_message = encryption.decrypt(&symmetric_key, &ciphertext).unwrap();
            assert_ne!(message, candidate_message);
        }
    }
}