lokinet/llarp/crypto/types.cpp

157 lines
3.2 KiB
C++
Raw Normal View History

#include "types.hpp"
#include <llarp/util/buffer.hpp>
#include <fstream>
#include <llarp/util/fs.hpp>
2019-06-24 16:26:15 +00:00
#include <iterator>
#include <oxenc/hex.h>
2020-01-27 21:30:41 +00:00
#include <sodium/crypto_sign.h>
#include <sodium/crypto_sign_ed25519.h>
2020-01-28 21:55:36 +00:00
#include <sodium/crypto_scalarmult_ed25519.h>
2020-01-27 21:30:41 +00:00
namespace llarp
{
bool
PubKey::FromString(const std::string& str)
{
if (str.size() != 2 * size())
return false;
oxenc::from_hex(str.begin(), str.end(), begin());
return true;
}
std::string
PubKey::ToString() const
{
return oxenc::to_hex(begin(), end());
}
bool
SecretKey::LoadFromFile(const fs::path& fname)
{
std::ifstream f(fname.string(), std::ios::in | std::ios::binary);
if (!f.is_open())
{
return false;
}
2019-01-15 00:42:50 +00:00
f.seekg(0, std::ios::end);
2019-01-15 00:42:50 +00:00
const size_t sz = f.tellg();
f.seekg(0, std::ios::beg);
2019-01-15 00:42:50 +00:00
if (sz == size())
{
// is raw buffer
std::copy_n(std::istreambuf_iterator<char>(f), sz, begin());
return true;
}
std::array<byte_t, 128> tmp;
2019-02-02 23:12:42 +00:00
llarp_buffer_t buf(tmp);
if (sz > sizeof(tmp))
{
return false;
}
f.read(reinterpret_cast<char*>(tmp.data()), sz);
return BDecode(&buf);
}
2020-01-27 21:30:41 +00:00
bool
SecretKey::Recalculate()
{
PrivateKey key;
PubKey pubkey;
if (!toPrivate(key) || !key.toPublic(pubkey))
return false;
std::memcpy(data() + 32, pubkey.data(), 32);
return true;
2020-01-27 21:30:41 +00:00
}
bool
SecretKey::toPrivate(PrivateKey& key) const
{
2020-01-31 21:05:50 +00:00
// Ed25519 calculates a 512-bit hash from the seed; the first half (clamped)
// is the private key; the second half is the hash that gets used in
// signing.
unsigned char h[crypto_hash_sha512_BYTES];
if (crypto_hash_sha512(h, data(), 32) < 0)
return false;
h[0] &= 248;
h[31] &= 63;
h[31] |= 64;
std::memcpy(key.data(), h, 64);
return true;
}
bool
PrivateKey::toPublic(PubKey& pubkey) const
{
return crypto_scalarmult_ed25519_base_noclamp(pubkey.data(), data()) != -1;
}
bool
SecretKey::SaveToFile(const fs::path& fname) const
{
std::array<byte_t, 128> tmp;
2019-02-02 23:12:42 +00:00
llarp_buffer_t buf(tmp);
if (!BEncode(&buf))
{
return false;
}
auto optional_f = llarp::util::OpenFileStream<std::ofstream>(fname, std::ios::binary);
if (!optional_f)
2019-06-24 16:26:15 +00:00
return false;
auto& f = *optional_f;
if (!f.is_open())
return false;
f.write((char*)buf.base, buf.cur - buf.base);
2019-06-24 17:36:25 +00:00
return f.good();
}
bool
IdentitySecret::LoadFromFile(const fs::path& fname)
{
auto optional = util::OpenFileStream<std::ifstream>(fname, std::ios::binary | std::ios::in);
if (!optional)
return false;
auto& f = *optional;
f.seekg(0, std::ios::end);
const size_t sz = f.tellg();
f.seekg(0, std::ios::beg);
if (sz != 32)
{
llarp::LogError("service node seed size invalid: ", sz, " != 32");
return false;
}
std::copy_n(std::istreambuf_iterator<char>(f), sz, begin());
return true;
}
byte_t*
2020-01-27 21:30:41 +00:00
Signature::Lo()
{
return data();
}
const byte_t*
2020-01-27 21:30:41 +00:00
Signature::Lo() const
{
return data();
}
byte_t*
2020-01-27 21:30:41 +00:00
Signature::Hi()
{
return data() + 32;
}
const byte_t*
2020-01-27 21:30:41 +00:00
Signature::Hi() const
{
return data() + 32;
}
} // namespace llarp