forked from premiere/premiere-libtorrent
164 lines
4.6 KiB
C++
164 lines
4.6 KiB
C++
/*
|
|
|
|
Copyright (c) 2007, Un Shyam
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
* 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.
|
|
* Neither the name of the author 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 OWNER 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.
|
|
|
|
*/
|
|
|
|
#include <algorithm>
|
|
#include <iostream>
|
|
|
|
#include "libtorrent/hasher.hpp"
|
|
#include "libtorrent/pe_crypto.hpp"
|
|
#include "libtorrent/session.hpp"
|
|
#include "libtorrent/random.hpp"
|
|
#include "libtorrent/span.hpp"
|
|
#include "libtorrent/buffer.hpp"
|
|
|
|
#include "setup_transfer.hpp"
|
|
#include "test.hpp"
|
|
|
|
#if !defined TORRENT_DISABLE_ENCRYPTION
|
|
|
|
namespace {
|
|
|
|
void test_enc_handler(lt::crypto_plugin& a, lt::crypto_plugin& b)
|
|
{
|
|
int const repcount = 128;
|
|
for (int rep = 0; rep < repcount; ++rep)
|
|
{
|
|
std::ptrdiff_t const buf_len = rand() % (512 * 1024);
|
|
std::vector<char> buf(static_cast<std::size_t>(buf_len));
|
|
std::vector<char> cmp_buf(static_cast<std::size_t>(buf_len));
|
|
|
|
std::generate(buf.begin(), buf.end(), &std::rand);
|
|
std::copy(buf.begin(), buf.end(), cmp_buf.begin());
|
|
|
|
using namespace lt::aux;
|
|
|
|
{
|
|
lt::span<char> iovec(buf.data(), buf_len);
|
|
int next_barrier;
|
|
lt::span<lt::span<char const>> iovec_out;
|
|
std::tie(next_barrier, iovec_out) = a.encrypt(iovec);
|
|
TEST_CHECK(buf != cmp_buf);
|
|
TEST_EQUAL(iovec_out.size(), 0);
|
|
TEST_EQUAL(next_barrier, int(buf_len));
|
|
}
|
|
|
|
{
|
|
int consume = 0;
|
|
int produce = 0;
|
|
int packet_size = 0;
|
|
lt::span<char> iovec(buf.data(), buf_len);
|
|
std::tie(consume, produce, packet_size) = b.decrypt(iovec);
|
|
TEST_CHECK(buf == cmp_buf);
|
|
TEST_EQUAL(consume, 0);
|
|
TEST_EQUAL(produce, int(buf_len));
|
|
TEST_EQUAL(packet_size, 0);
|
|
}
|
|
|
|
{
|
|
lt::span<char> iovec(buf.data(), buf_len);
|
|
int next_barrier;
|
|
lt::span<lt::span<char const>> iovec_out;
|
|
std::tie(next_barrier, iovec_out) = b.encrypt(iovec);
|
|
TEST_EQUAL(iovec_out.size(), 0);
|
|
TEST_CHECK(buf != cmp_buf);
|
|
TEST_EQUAL(next_barrier, int(buf_len));
|
|
|
|
int consume = 0;
|
|
int produce = 0;
|
|
int packet_size = 0;
|
|
lt::span<char> iovec2(buf.data(), buf_len);
|
|
std::tie(consume, produce, packet_size) = a.decrypt(iovec2);
|
|
TEST_CHECK(buf == cmp_buf);
|
|
TEST_EQUAL(consume, 0);
|
|
TEST_EQUAL(produce, int(buf_len));
|
|
TEST_EQUAL(packet_size, 0);
|
|
}
|
|
}
|
|
}
|
|
|
|
} // anonymous namespace
|
|
|
|
TORRENT_TEST(diffie_hellman)
|
|
{
|
|
using namespace lt;
|
|
|
|
const int repcount = 128;
|
|
|
|
for (int rep = 0; rep < repcount; ++rep)
|
|
{
|
|
dh_key_exchange DH1, DH2;
|
|
|
|
DH1.compute_secret(DH2.get_local_key());
|
|
DH2.compute_secret(DH1.get_local_key());
|
|
|
|
TEST_EQUAL(DH1.get_secret(), DH2.get_secret());
|
|
if (!DH1.get_secret() != DH2.get_secret())
|
|
{
|
|
std::printf("DH1 local: ");
|
|
std::cout << DH1.get_local_key() << std::endl;
|
|
|
|
std::printf("DH2 local: ");
|
|
std::cout << DH2.get_local_key() << std::endl;
|
|
|
|
std::printf("DH1 shared_secret: ");
|
|
std::cout << DH1.get_secret() << std::endl;
|
|
|
|
std::printf("DH2 shared_secret: ");
|
|
std::cout << DH2.get_secret() << std::endl;
|
|
}
|
|
}
|
|
}
|
|
|
|
TORRENT_TEST(rc4)
|
|
{
|
|
using namespace lt;
|
|
|
|
sha1_hash test1_key = hasher("test1_key",8).final();
|
|
sha1_hash test2_key = hasher("test2_key",8).final();
|
|
|
|
std::printf("testing RC4 handler\n");
|
|
rc4_handler rc41;
|
|
rc41.set_incoming_key(test2_key);
|
|
rc41.set_outgoing_key(test1_key);
|
|
rc4_handler rc42;
|
|
rc42.set_incoming_key(test1_key);
|
|
rc42.set_outgoing_key(test2_key);
|
|
test_enc_handler(rc41, rc42);
|
|
}
|
|
|
|
#else
|
|
TORRENT_TEST(disabled)
|
|
{
|
|
std::printf("PE test not run because it's disabled\n");
|
|
}
|
|
#endif
|