mirror of
https://github.com/keepassxreboot/keepassxc.git
synced 2024-12-17 19:54:33 -05:00
eca9c658f4
* Add source folder keeshare for sharing with corresponding define WITH_XC_KEESHARE * Move common crypto parts to src/crypto/ssh * Extended OpenSSHKey * Move filewatching to own file (currently in two related classes DelayedFileWatcher and BulkFileWatcher) * Small improvements for style and code in several classes * Sharing is secured using RSA-Keys which are generated on demand * Publisher signs the container using their private key * Client can verify the signed container and choose to decline an import, import only once or trust the publisher and automatically import all data of this source henceforth * Integration of settings into Group-Settings, Database-Settings and Application-Settings * Introduced dependency QuaZip as dependency to allow combined export of key container and the (custom format) certificate
81 lines
2.5 KiB
C++
81 lines
2.5 KiB
C++
/*
|
|
* Copyright (C) 2013 Felix Geyer <debfx@fobos.de>
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 2 or (at your option)
|
|
* version 3 of the License.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "TestRandomGenerator.h"
|
|
#include "TestGlobal.h"
|
|
#include "core/Endian.h"
|
|
#include "core/Global.h"
|
|
#include "stub/TestRandom.h"
|
|
|
|
#include <QTest>
|
|
|
|
QTEST_GUILESS_MAIN(TestRandomGenerator)
|
|
|
|
void TestRandomGenerator::initTestCase()
|
|
{
|
|
m_backend = new RandomBackendPreset();
|
|
|
|
TestRandom::setup(m_backend);
|
|
}
|
|
|
|
void TestRandomGenerator::cleanupTestCase()
|
|
{
|
|
TestRandom::teardown();
|
|
|
|
m_backend = nullptr;
|
|
}
|
|
|
|
void TestRandomGenerator::testUInt()
|
|
{
|
|
QByteArray nextBytes;
|
|
|
|
nextBytes = Endian::sizedIntToBytes(42, QSysInfo::ByteOrder);
|
|
m_backend->setNextBytes(nextBytes);
|
|
QCOMPARE(randomGen()->randomUInt(100), 42U);
|
|
|
|
nextBytes = Endian::sizedIntToBytes(117, QSysInfo::ByteOrder);
|
|
m_backend->setNextBytes(nextBytes);
|
|
QCOMPARE(randomGen()->randomUInt(100), 17U);
|
|
|
|
nextBytes = Endian::sizedIntToBytes(1001, QSysInfo::ByteOrder);
|
|
m_backend->setNextBytes(nextBytes);
|
|
QCOMPARE(randomGen()->randomUInt(1), 0U);
|
|
|
|
nextBytes.clear();
|
|
nextBytes.append(Endian::sizedIntToBytes(QUINT32_MAX, QSysInfo::ByteOrder));
|
|
nextBytes.append(Endian::sizedIntToBytes(QUINT32_MAX - 70000U, QSysInfo::ByteOrder));
|
|
m_backend->setNextBytes(nextBytes);
|
|
QCOMPARE(randomGen()->randomUInt(100000U), (QUINT32_MAX - 70000U) % 100000U);
|
|
|
|
nextBytes.clear();
|
|
for (int i = 0; i < 10000; i++) {
|
|
nextBytes.append(Endian::sizedIntToBytes((QUINT32_MAX / 2U) + 1U + i, QSysInfo::ByteOrder));
|
|
}
|
|
nextBytes.append(Endian::sizedIntToBytes(QUINT32_MAX / 2U, QSysInfo::ByteOrder));
|
|
m_backend->setNextBytes(nextBytes);
|
|
QCOMPARE(randomGen()->randomUInt((QUINT32_MAX / 2U) + 1U), QUINT32_MAX / 2U);
|
|
}
|
|
|
|
void TestRandomGenerator::testUIntRange()
|
|
{
|
|
QByteArray nextBytes;
|
|
|
|
nextBytes = Endian::sizedIntToBytes(42, QSysInfo::ByteOrder);
|
|
m_backend->setNextBytes(nextBytes);
|
|
QCOMPARE(randomGen()->randomUIntRange(100, 200), 142U);
|
|
}
|