blob: a0a3bb98a2f124de41a452b5958a0261ec2ed631 [file] [log] [blame]
/**
* Copyright (C) 2013 Regents of the University of California.
* @author: Yingdi Yu <yingdi0@cs.ucla.edu>
* See COPYING for copyright and distribution information.
*/
#if __clang__
#pragma clang diagnostic ignored "-Wtautological-compare"
#endif
#include <boost/test/unit_test.hpp>
#include "security/key-chain.hpp"
#include <cryptopp/rsa.h>
using namespace std;
namespace ndn {
BOOST_AUTO_TEST_SUITE(TestSecTpmOsx)
BOOST_AUTO_TEST_CASE (Delete)
{
SecTpmOsx tpm;
Name keyName("/tmp/ksk-123456");
BOOST_CHECK_NO_THROW(tpm.generateKeyPairInTpm(keyName, KEY_TYPE_RSA, 2048));
BOOST_REQUIRE_EQUAL(tpm.doesKeyExistInTpm(keyName, KEY_CLASS_PUBLIC), true);
BOOST_REQUIRE_EQUAL(tpm.doesKeyExistInTpm(keyName, KEY_CLASS_PRIVATE), true);
tpm.deleteKeyPairInTpm(keyName);
BOOST_REQUIRE_EQUAL(tpm.doesKeyExistInTpm(keyName, KEY_CLASS_PUBLIC), false);
BOOST_REQUIRE_EQUAL(tpm.doesKeyExistInTpm(keyName, KEY_CLASS_PRIVATE), false);
}
BOOST_AUTO_TEST_CASE (SignVerify)
{
SecTpmOsx tpm;
Name keyName("/tmp/ksk-123456");
BOOST_CHECK_NO_THROW(tpm.generateKeyPairInTpm(keyName, KEY_TYPE_RSA, 2048));
Data data("/tmp/test/1");
const uint8_t content[] = {0x01, 0x02, 0x03, 0x04};
Block sigBlock = tpm.signInTpm(content, sizeof(content), keyName, DIGEST_ALGORITHM_SHA256);
ptr_lib::shared_ptr<PublicKey> pubkeyPtr = tpm.getPublicKeyFromTpm(keyName);
{
using namespace CryptoPP;
RSA::PublicKey publicKey;
ByteQueue queue;
queue.Put(reinterpret_cast<const byte*>(pubkeyPtr->get().buf()), pubkeyPtr->get().size());
publicKey.Load(queue);
RSASS<PKCS1v15, SHA256>::Verifier verifier (publicKey);
bool result = verifier.VerifyMessage(content, sizeof(content),
sigBlock.value(), sigBlock.value_size());
BOOST_REQUIRE_EQUAL(result, true);
}
tpm.deleteKeyPairInTpm(keyName);
}
BOOST_AUTO_TEST_CASE (RandomGenerator)
{
SecTpmOsx tpm;
size_t scale = 1000;
size_t size = 256 * scale;
uint8_t* block = new uint8_t[size];
tpm.generateRandomBlock(block, size);
map<uint8_t, int> counter;
for(size_t i = 0; i < size; i++)
counter[block[i]] += 1;
float dev = 0.0;
for(size_t i = 0; i != 255; i++)
dev += ((counter[i] - scale) * (counter[i] - scale)) * 1.0 / (scale * scale);
BOOST_CHECK_CLOSE(dev / 256, 0.001, 100);
}
BOOST_AUTO_TEST_SUITE_END()
} // namespace ndn