mirror of
https://github.com/monero-project/research-lab.git
synced 2024-12-22 19:49:35 +00:00
258 lines
9.3 KiB
C++
258 lines
9.3 KiB
C++
#pragma once
|
|
|
|
#include <cstddef>
|
|
#include <mutex>
|
|
#include <vector>
|
|
|
|
#include "generic-ops.h"
|
|
|
|
#include "crypto-ops.h"
|
|
#include "random.h"
|
|
#include "keccak.h"
|
|
|
|
|
|
|
|
#include "hash-ops.h"
|
|
|
|
namespace crypto {
|
|
|
|
extern "C" {
|
|
#include "random.h"
|
|
|
|
}
|
|
|
|
extern std::mutex random_lock;
|
|
|
|
|
|
|
|
#pragma pack(push, 1)
|
|
|
|
struct hash {
|
|
char data[HASH_SIZE]; //HASH_SIZE = 32 I believe..
|
|
};
|
|
struct hash8 {
|
|
char data[8];
|
|
};
|
|
|
|
static_assert(sizeof(hash) == HASH_SIZE, "Invalid structure size");
|
|
static_assert(sizeof(hash8) == 8, "Invalid structure size");
|
|
|
|
/*
|
|
Cryptonight hash functions
|
|
*/
|
|
|
|
inline void hash_permutation(union hash_state *state) {
|
|
keccakf((uint64_t*)state, 24);
|
|
}
|
|
|
|
inline void hash_process(union hash_state *state, const uint8_t *buf, size_t count) {
|
|
|
|
keccak1600(buf, count, (uint8_t*)state);
|
|
}
|
|
|
|
inline void cn_fast_hash(const void *data, size_t length, char * hash) {
|
|
uint8_t md2[32];
|
|
int j = 0;
|
|
//printf("length: %d\n", (int)sizeof(data));
|
|
keccak((uint8_t *) data, (int)sizeof(data), md2, 32); //note for signatures, you need 96, for just hashing a key you need 32, so it's really best to be able to detect
|
|
for (j= 0 ; j < 32 ; j++) {
|
|
hash[j] = (unsigned char)md2[j];
|
|
}
|
|
}
|
|
|
|
|
|
|
|
inline void cn_fast_hashh(const void *data, std::size_t length, hash &hash) {
|
|
cn_fast_hash(data, length, reinterpret_cast<char *>(&hash));
|
|
}
|
|
|
|
inline hash cn_fast_hash2(const void *data, std::size_t length) {
|
|
hash h;
|
|
cn_fast_hash(data, length, reinterpret_cast<char *>(&h));
|
|
return h;
|
|
}
|
|
|
|
|
|
|
|
struct ec_point {
|
|
char data[32];
|
|
};
|
|
|
|
struct ec_scalar {
|
|
char data[32];
|
|
};
|
|
|
|
struct public_key: ec_point {
|
|
friend class crypto_ops;
|
|
};
|
|
|
|
struct secret_key: ec_scalar {
|
|
friend class crypto_ops;
|
|
};
|
|
|
|
struct public_keyV {
|
|
std::vector<public_key> keys;
|
|
int rows;
|
|
};
|
|
|
|
struct secret_keyV {
|
|
std::vector<secret_key> keys;
|
|
int rows;
|
|
};
|
|
|
|
struct public_keyM {
|
|
int cols;
|
|
int rows;
|
|
std::vector<secret_keyV> column_vectors;
|
|
};
|
|
|
|
struct key_derivation: ec_point {
|
|
friend class crypto_ops;
|
|
};
|
|
|
|
struct key_image: ec_point {
|
|
friend class crypto_ops;
|
|
};
|
|
|
|
struct signature {
|
|
ec_scalar c, r;
|
|
friend class crypto_ops;
|
|
};
|
|
#pragma pack(pop)
|
|
|
|
static_assert(sizeof(ec_point) == 32 && sizeof(ec_scalar) == 32 &&
|
|
sizeof(public_key) == 32 && sizeof(secret_key) == 32 &&
|
|
sizeof(key_derivation) == 32 && sizeof(key_image) == 32 &&
|
|
sizeof(signature) == 64, "Invalid structure size");
|
|
|
|
class crypto_ops {
|
|
crypto_ops();
|
|
crypto_ops(const crypto_ops &);
|
|
void operator=(const crypto_ops &);
|
|
~crypto_ops();
|
|
|
|
static secret_key generate_keys(public_key &pub, secret_key &sec, const secret_key& recovery_key = secret_key(), bool recover = false);
|
|
friend secret_key generate_keys(public_key &pub, secret_key &sec, const secret_key& recovery_key, bool recover);
|
|
static bool check_key(const public_key &);
|
|
friend bool check_key(const public_key &);
|
|
static bool secret_key_to_public_key(const secret_key &, public_key &);
|
|
friend bool secret_key_to_public_key(const secret_key &, public_key &);
|
|
static bool generate_key_derivation(const public_key &, const secret_key &, key_derivation &);
|
|
friend bool generate_key_derivation(const public_key &, const secret_key &, key_derivation &);
|
|
static bool derive_public_key(const key_derivation &, std::size_t, const public_key &, public_key &);
|
|
friend bool derive_public_key(const key_derivation &, std::size_t, const public_key &, public_key &);
|
|
static void derive_secret_key(const key_derivation &, std::size_t, const secret_key &, secret_key &);
|
|
friend void derive_secret_key(const key_derivation &, std::size_t, const secret_key &, secret_key &);
|
|
static void generate_signature(const hash &, const public_key &, const secret_key &, signature &);
|
|
friend void generate_signature(const hash &, const public_key &, const secret_key &, signature &);
|
|
static bool check_signature(const hash &, const public_key &, const signature &);
|
|
friend bool check_signature(const hash &, const public_key &, const signature &);
|
|
static void generate_key_image(const public_key &, const secret_key &, key_image &);
|
|
friend void generate_key_image(const public_key &, const secret_key &, key_image &);
|
|
static void generate_ring_signature(const hash &, const key_image &,
|
|
const public_key *const *, std::size_t, const secret_key &, std::size_t, signature *);
|
|
friend void generate_ring_signature(const hash &, const key_image &,
|
|
const public_key *const *, std::size_t, const secret_key &, std::size_t, signature *);
|
|
static bool check_ring_signature(const hash &, const key_image &,
|
|
const public_key *const *, std::size_t, const signature *);
|
|
friend bool check_ring_signature(const hash &, const key_image &,
|
|
const public_key *const *, std::size_t, const signature *);
|
|
};
|
|
|
|
/* Generate a value filled with random bytes.
|
|
*/
|
|
template<typename T>
|
|
typename std::enable_if<std::is_pod<T>::value, T>::type rand() {
|
|
typename std::remove_cv<T>::type res;
|
|
std::lock_guard<std::mutex> lock(random_lock);
|
|
generate_random_bytes(sizeof(T), &res);
|
|
return res;
|
|
}
|
|
|
|
/* 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 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);
|
|
}
|
|
|
|
/* 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);
|
|
}
|
|
|
|
/* 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,
|
|
const public_key *const *pubs, std::size_t pubs_count,
|
|
const secret_key &sec, std::size_t sec_index,
|
|
signature *sig) {
|
|
crypto_ops::generate_ring_signature(prefix_hash, image, pubs, pubs_count, sec, sec_index, sig);
|
|
}
|
|
inline bool check_ring_signature(const hash &prefix_hash, const key_image &image,
|
|
const public_key *const *pubs, std::size_t pubs_count,
|
|
const signature *sig) {
|
|
return crypto_ops::check_ring_signature(prefix_hash, image, pubs, pubs_count, sig);
|
|
}
|
|
|
|
/* Variants with vector<const public_key *> parameters.
|
|
*/
|
|
inline void generate_ring_signature(const hash &prefix_hash, const key_image &image,
|
|
const std::vector<const public_key *> &pubs,
|
|
const secret_key &sec, std::size_t sec_index,
|
|
signature *sig) {
|
|
generate_ring_signature(prefix_hash, image, pubs.data(), pubs.size(), sec, sec_index, sig);
|
|
}
|
|
inline bool check_ring_signature(const hash &prefix_hash, const key_image &image,
|
|
const std::vector<const public_key *> &pubs,
|
|
const signature *sig) {
|
|
return check_ring_signature(prefix_hash, image, pubs.data(), pubs.size(), sig);
|
|
}
|
|
|
|
|
|
}
|
|
|
|
CRYPTO_MAKE_COMPARABLE(public_key)
|
|
CRYPTO_MAKE_HASHABLE(key_image)
|
|
CRYPTO_MAKE_COMPARABLE(signature)
|