// Copyright (c) 2014-2024, The Monero Project

//

// All rights reserved.

//

// Redistribution and use in source and binary forms, with or without modification, are

// permitted provided that the following conditions are met:

//

// 1. Redistributions of source code must retain the above copyright notice, this list of

// conditions and the following disclaimer.

//

// 2. Redistributions in binary form must reproduce the above copyright notice, this list

// of conditions and the following disclaimer in the documentation and/or other

// materials provided with the distribution.

//

// 3. Neither the name of the copyright holder nor the names of its contributors may be

// used to endorse or promote products derived from this software without specific

// prior written permission.

//

// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY

// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF

// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL

// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,

// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,

// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF

// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

//

// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers

#pragma once

#include <cstddef>

#include <iostream>

#include <boost/optional.hpp>

#include <type_traits>

#include <vector>

#include <random>

#include "common/pod-class.h"

#include "memwipe.h"

#include "mlocker.h"

#include "generic-ops.h"

#include "hex.h"

#include "span.h"

#include "hash.h"

namespace crypto {

extern "C" {

#include "random.h"

}

#pragma pack(push, 1)

POD_CLASS ec_point {

char data[32];

};

POD_CLASS ec_scalar {

char data[32];

};

POD_CLASS public_key: ec_point {

friend class crypto_ops;

};

POD_CLASS public_key_memsafe : epee::mlocked<tools::scrubbed<public_key>> {

public_key_memsafe() = default;

public_key_memsafe(const public_key &original) { memcpy(this->data, original.data, 32); }

};

using secret_key = epee::mlocked<tools::scrubbed<ec_scalar>>;

POD_CLASS public_keyV {

std::vector<public_key> keys;

int rows;

};

POD_CLASS secret_keyV {

std::vector<secret_key> keys;

int rows;

};

POD_CLASS public_keyM {

int cols;

int rows;

std::vector<secret_keyV> column_vectors;

};

POD_CLASS key_derivation: ec_point {

friend class crypto_ops;

};

POD_CLASS key_image: ec_point {

friend class crypto_ops;

};

POD_CLASS signature {

ec_scalar c, r;

friend class crypto_ops;

};

POD_CLASS view_tag {

char data;

};

#pragma pack(pop)

void hash_to_scalar(const void *data, size_t length, ec_scalar &res);

void random32_unbiased(unsigned char *bytes);

static_assert(sizeof(ec_point) == 32 && sizeof(ec_scalar) == 32 &&

sizeof(public_key) == 32 && sizeof(public_key_memsafe) == 32 && sizeof(secret_key) == 32 &&

sizeof(key_derivation) == 32 && sizeof(key_image) == 32 &&

sizeof(signature) == 64 && sizeof(view_tag) == 1, "Invalid structure size");

class crypto_ops {

};

void generate_random_bytes_thread_safe(size_t N, uint8_t *bytes);

void add_extra_entropy_thread_safe(const void *ptr, size_t bytes);

/* Generate N random bytes

*/

inline void rand(size_t N, uint8_t *bytes) {

generate_random_bytes_thread_safe(N, bytes);

}

/* Generate a value filled with random bytes.

*/

template<typename T>

typename std::enable_if<std::is_pod<T>::value, T>::type rand() {

}

/* UniformRandomBitGenerator using crypto::rand<uint64_t>()

*/

struct random_device

};

/* Generate a random value between range_min and range_max

*/

template<typename T>

typename std::enable_if<std::is_integral<T>::value, T>::type rand_range(T range_min, T range_max) {

}

/* Generate a random index between 0 and sz-1

*/

template<typename T>

typename std::enable_if<std::is_unsigned<T>::value, T>::type rand_idx(T sz) {

return crypto::rand_range<T>(0, sz-1);

}

/* Generate a new key pair

*/

inline secret_key generate_keys(public_key &pub, secret_key &sec, const secret_key& recovery_key = secret_key(), bool recover = false) {

return crypto_ops::generate_keys(pub, sec, recovery_key, recover);

}

/* Check a public key. Returns true if it is valid, false otherwise.

*/

inline bool check_key(const public_key &key) {

return crypto_ops::check_key(key);

}

/* Checks a private key and computes the corresponding public key.

*/

inline bool secret_key_to_public_key(const secret_key &sec, public_key &pub) {

return crypto_ops::secret_key_to_public_key(sec, pub);

}

/* To generate an ephemeral key used to send money to:

* * The sender generates a new key pair, which becomes the transaction key. The public transaction key is included in "extra" field.

* * Both the sender and the receiver generate key derivation from the transaction key, the receivers' "view" key and the output index.

* * The sender uses key derivation and the receivers' "spend" key to derive an ephemeral public key.

* * The receiver can either derive the public key (to check that the transaction is addressed to him) or the private key (to spend the money).

*/

inline bool generate_key_derivation(const public_key &key1, const secret_key &key2, key_derivation &derivation) {

return crypto_ops::generate_key_derivation(key1, key2, derivation);

}

inline bool derive_public_key(const key_derivation &derivation, std::size_t output_index,

const public_key &base, public_key &derived_key) {

return crypto_ops::derive_public_key(derivation, output_index, base, derived_key);

}

inline void derivation_to_scalar(const key_derivation &derivation, size_t output_index, ec_scalar &res) {

return crypto_ops::derivation_to_scalar(derivation, output_index, res);

}

inline void derive_secret_key(const key_derivation &derivation, std::size_t output_index,

const secret_key &base, secret_key &derived_key) {

crypto_ops::derive_secret_key(derivation, output_index, base, derived_key);

}

inline bool derive_subaddress_public_key(const public_key &out_key, const key_derivation &derivation, std::size_t output_index, public_key &result) {

return crypto_ops::derive_subaddress_public_key(out_key, derivation, output_index, result);

}

/* Generation and checking of a standard signature.

*/

inline void generate_signature(const hash &prefix_hash, const public_key &pub, const secret_key &sec, signature &sig) {

crypto_ops::generate_signature(prefix_hash, pub, sec, sig);

}

inline bool check_signature(const hash &prefix_hash, const public_key &pub, const signature &sig) {

return crypto_ops::check_signature(prefix_hash, pub, sig);

}

/* Generation and checking of a tx proof; given a tx pubkey R, the recipient's view pubkey A, and the key

* derivation D, the signature proves the knowledge of the tx secret key r such that R=r*G and D=r*A

* When the recipient's address is a subaddress, the tx pubkey R is defined as R=r*B where B is the recipient's spend pubkey

*/

inline void generate_tx_proof(const hash &prefix_hash, const public_key &R, const public_key &A, const boost::optional<public_key> &B, const public_key &D, const secret_key &r, signature &sig) {

crypto_ops::generate_tx_proof(prefix_hash, R, A, B, D, r, sig);

}

inline void generate_tx_proof_v1(const hash &prefix_hash, const public_key &R, const public_key &A, const boost::optional<public_key> &B, const public_key &D, const secret_key &r, signature &sig) {

crypto_ops::generate_tx_proof_v1(prefix_hash, R, A, B, D, r, sig);

}

inline bool check_tx_proof(const hash &prefix_hash, const public_key &R, const public_key &A, const boost::optional<public_key> &B, const public_key &D, const signature &sig, const int version) {

return crypto_ops::check_tx_proof(prefix_hash, R, A, B, D, sig, version);

}

/* To send money to a key:

* * The sender generates an ephemeral key and includes it in transaction output.

* * To spend the money, the receiver generates a key image from it.

* * Then he selects a bunch of outputs, including the one he spends, and uses them to generate a ring signature.

* To check the signature, it is necessary to collect all the keys that were used to generate it. To detect double spends, it is necessary to check that each key image is used at most once.

*/

inline void generate_key_image(const public_key &pub, const secret_key &sec, key_image &image) {

crypto_ops::generate_key_image(pub, sec, image);

}

inline void generate_ring_signature(const hash &prefix_hash, const key_image &image,

}

inline bool check_ring_signature(const hash &prefix_hash, const key_image &image,

}

/* Variants with vector<const public_key *> parameters.

*/

inline void generate_ring_signature(const hash &prefix_hash, const key_image &image,

}

inline bool check_ring_signature(const hash &prefix_hash, const key_image &image,

}

/* Derive a 1-byte view tag from the sender-receiver shared secret to reduce scanning time.

* When scanning outputs that were not sent to the user, checking the view tag for a match removes the need to proceed with expensive EC operations

* for an expected 99.6% of outputs (expected false positive rate = 1/2^8 = 1/256 = 0.4% = 100% - 99.6%).

*/

inline void derive_view_tag(const key_derivation &derivation, std::size_t output_index, view_tag &vt) {

crypto_ops::derive_view_tag(derivation, output_index, vt);

}

inline std::ostream &operator <<(std::ostream &o, const crypto::public_key &v) {

epee::to_hex::formatted(o, epee::as_byte_span(v)); return o;

}

inline std::ostream &operator <<(std::ostream &o, const crypto::secret_key &v) {

epee::to_hex::formatted(o, epee::as_byte_span(v)); return o;

}

inline std::ostream &operator <<(std::ostream &o, const crypto::key_derivation &v) {

epee::to_hex::formatted(o, epee::as_byte_span(v)); return o;

}

inline std::ostream &operator <<(std::ostream &o, const crypto::key_image &v) {

epee::to_hex::formatted(o, epee::as_byte_span(v)); return o;

}

inline std::ostream &operator <<(std::ostream &o, const crypto::signature &v) {

epee::to_hex::formatted(o, epee::as_byte_span(v)); return o;

}

inline std::ostream &operator <<(std::ostream &o, const crypto::view_tag &v) {

epee::to_hex::formatted(o, epee::as_byte_span(v)); return o;

}

const extern crypto::public_key null_pkey;

const extern crypto::secret_key null_skey;

inline bool operator<(const public_key &p1, const public_key &p2) { return memcmp(&p1, &p2, sizeof(public_key)) < 0; }

inline bool operator>(const public_key &p1, const public_key &p2) { return p2 < p1; }

inline bool operator<(const key_image &p1, const key_image &p2) { return memcmp(&p1, &p2, sizeof(key_image)) < 0; }

inline bool operator>(const key_image &p1, const key_image &p2) { return p2 < p1; }

}

// type conversions for easier calls to sc_add(), sc_sub(), hash functions

inline unsigned char* to_bytes(crypto::ec_scalar &scalar) { return &reinterpret_cast<unsigned char&>(scalar); }

inline const unsigned char* to_bytes(const crypto::ec_scalar &scalar) { return &reinterpret_cast<const unsigned char&>(scalar); }

inline unsigned char* to_bytes(crypto::ec_point &point) { return &reinterpret_cast<unsigned char&>(point); }

inline const unsigned char* to_bytes(const crypto::ec_point &point) { return &reinterpret_cast<const unsigned char&>(point); }

CRYPTO_MAKE_HASHABLE(public_key)

CRYPTO_MAKE_HASHABLE_CONSTANT_TIME(secret_key)

CRYPTO_MAKE_HASHABLE_CONSTANT_TIME(public_key_memsafe)

CRYPTO_MAKE_HASHABLE(key_image)

CRYPTO_MAKE_COMPARABLE(signature)

CRYPTO_MAKE_COMPARABLE(view_tag)