2018-11-12 16:43:40 +00:00
|
|
|
#include <llarp/messages/exit.hpp>
|
|
|
|
#include <llarp/routing/handler.hpp>
|
|
|
|
|
|
|
|
namespace llarp
|
|
|
|
{
|
|
|
|
namespace routing
|
|
|
|
{
|
|
|
|
bool
|
|
|
|
RejectExitMessage::BEncode(llarp_buffer_t* buf) const
|
|
|
|
{
|
2018-11-14 18:02:27 +00:00
|
|
|
if(!bencode_start_dict(buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictMsgType(buf, "A", "J"))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictInt("B", B, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictList("R", R, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictInt("S", S, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictInt("T", T, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictInt("V", version, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictEntry("Y", Y, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictEntry("Z", Z, buf))
|
|
|
|
return false;
|
|
|
|
return bencode_end(buf);
|
2018-11-12 16:43:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
RejectExitMessage::DecodeKey(llarp_buffer_t k, llarp_buffer_t* buf)
|
|
|
|
{
|
2018-11-14 18:02:27 +00:00
|
|
|
bool read = false;
|
|
|
|
if(!BEncodeMaybeReadDictInt("B", B, read, k, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeMaybeReadDictList("R", R, read, k, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeMaybeReadDictInt("S", S, read, k, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeMaybeReadDictInt("T", T, read, k, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeMaybeReadDictInt("V", version, read, k, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeMaybeReadDictEntry("Y", Y, read, k, buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeMaybeReadDictEntry("Z", Z, read, k, buf))
|
|
|
|
return false;
|
|
|
|
return read;
|
|
|
|
}
|
|
|
|
|
|
|
|
RejectExitMessage&
|
|
|
|
RejectExitMessage::operator=(const RejectExitMessage& other)
|
|
|
|
{
|
|
|
|
B = other.B;
|
|
|
|
R = other.R;
|
|
|
|
S = other.S;
|
|
|
|
T = other.T;
|
|
|
|
version = other.version;
|
|
|
|
Y = other.Y;
|
|
|
|
Z = other.Z;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
RejectExitMessage::Sign(llarp_crypto* c, const llarp::SecretKey& sk)
|
|
|
|
{
|
|
|
|
byte_t tmp[512] = {0};
|
|
|
|
auto buf = llarp::StackBuffer< decltype(tmp) >(tmp);
|
|
|
|
Z.Zero();
|
|
|
|
Y.Randomize();
|
|
|
|
if(!BEncode(&buf))
|
|
|
|
return false;
|
|
|
|
buf.sz = buf.cur - buf.base;
|
|
|
|
return c->sign(Z, sk, buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
RejectExitMessage::Verify(llarp_crypto* c, const llarp::PubKey& pk) const
|
|
|
|
{
|
|
|
|
byte_t tmp[512] = {0};
|
|
|
|
auto buf = llarp::StackBuffer< decltype(tmp) >(tmp);
|
|
|
|
RejectExitMessage copy;
|
|
|
|
copy = *this;
|
|
|
|
copy.Z.Zero();
|
|
|
|
if(!copy.BEncode(&buf))
|
|
|
|
return false;
|
|
|
|
buf.sz = buf.cur - buf.base;
|
|
|
|
return c->verify(pk, buf, Z);
|
2018-11-12 16:43:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
RejectExitMessage::HandleMessage(IMessageHandler* h, llarp_router* r) const
|
|
|
|
{
|
|
|
|
return h->HandleRejectExitMessage(this, r);
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace routing
|
|
|
|
} // namespace llarp
|