mirror of
https://github.com/henrydcase/pqc.git
synced 2024-11-22 15:39:07 +00:00
53 lines
1.4 KiB
C++
53 lines
1.4 KiB
C++
#include <algorithm>
|
|
#include <vector>
|
|
#include <gtest/gtest.h>
|
|
#include <pqc/pqc.h>
|
|
#include <random>
|
|
|
|
TEST(KEM,OneOff) {
|
|
|
|
for (int i=0; i<PQC_ALG_KEM_MAX; i++) {
|
|
const pqc_ctx_t *p = pqc_kem_alg_by_id(i);
|
|
|
|
std::vector<uint8_t> ct(pqc_ciphertext_bsz(p));
|
|
std::vector<uint8_t> ss1(pqc_shared_secret_bsz(p));
|
|
std::vector<uint8_t> ss2(pqc_shared_secret_bsz(p));
|
|
std::vector<uint8_t> sk(pqc_private_key_bsz(p));
|
|
std::vector<uint8_t> pk(pqc_public_key_bsz(p));
|
|
|
|
ASSERT_TRUE(
|
|
pqc_keygen(p, pk.data(), sk.data()));
|
|
ASSERT_TRUE(
|
|
pqc_kem_encapsulate(p, ct.data(), ss1.data(), pk.data()));
|
|
ASSERT_TRUE(
|
|
pqc_kem_decapsulate(p, ss2.data(), ct.data(), sk.data()));
|
|
ASSERT_TRUE(
|
|
std::equal(ss1.begin(), ss1.end(), ss2.begin()));
|
|
}
|
|
}
|
|
|
|
TEST(SIGN,OneOff) {
|
|
|
|
std::random_device rd;
|
|
std::uniform_int_distribution<uint8_t> dist(0, 0xFF);
|
|
uint8_t msg[1234] = {0};
|
|
|
|
for (int i=0; i<PQC_ALG_SIG_MAX; i++) {
|
|
const pqc_ctx_t *p = pqc_sig_alg_by_id(i);
|
|
// generate some random msg
|
|
for (auto &x : msg) {x = dist(rd);}
|
|
|
|
std::vector<uint8_t> sig(pqc_signature_bsz(p));
|
|
std::vector<uint8_t> sk(pqc_private_key_bsz(p));
|
|
std::vector<uint8_t> pk(pqc_public_key_bsz(p));
|
|
|
|
ASSERT_TRUE(
|
|
pqc_keygen(p, pk.data(), sk.data()));
|
|
uint64_t sigsz = sig.size();
|
|
ASSERT_TRUE(
|
|
pqc_sig_create(p, sig.data(), &sigsz, msg, 1234, sk.data()));
|
|
ASSERT_TRUE(
|
|
pqc_sig_verify(p, sig.data(), sigsz, msg, 1234, pk.data()));
|
|
}
|
|
}
|