/* * (C) 2009 Jack Lloyd * * Distributed under the terms of the Botan license */ #include #include #include #include #include #include #include #include #include #include #ifdef BOTAN_HAS_COMPRESSOR_BZIP2 #include #endif #ifdef BOTAN_HAS_COMPRESSOR_GZIP #include #endif #ifdef BOTAN_HAS_COMPRESSOR_ZLIB #include #endif #if defined(BOTAN_HAS_RANDPOOL) #include #endif #if defined(BOTAN_HAS_HMAC_RNG) #include #endif #if defined(BOTAN_HAS_X931_RNG) #include #include #endif #if defined(BOTAN_HAS_AUTO_SEEDING_RNG) #include #endif using namespace Botan; #include "common.h" /* A weird little hack to fit S2K algorithms into the validation suite You probably wouldn't ever want to actually use the S2K algorithms like this, the raw S2K interface is more convenient for actually using them */ class S2K_Filter : public Filter { public: void write(const byte in[], u32bit len) { passphrase += std::string(reinterpret_cast(in), len); } void end_msg() { s2k->change_salt(salt, salt.size()); s2k->set_iterations(iterations); SymmetricKey x = s2k->derive_key(outlen, passphrase); send(x.bits_of()); } S2K_Filter(S2K* algo, const SymmetricKey& s, u32bit o, u32bit i) { s2k = algo; outlen = o; iterations = i; salt = s.bits_of(); } ~S2K_Filter() { delete s2k; } private: std::string passphrase; S2K* s2k; SecureVector salt; u32bit outlen, iterations; }; /* Not too useful generally; just dumps random bits for benchmarking */ class RNG_Filter : public Filter { public: void write(const byte[], u32bit); RNG_Filter(RandomNumberGenerator* r) : rng(r) {} ~RNG_Filter() { delete rng; } private: RandomNumberGenerator* rng; }; class KDF_Filter : public Filter { public: void write(const byte in[], u32bit len) { secret.append(in, len); } void end_msg() { SymmetricKey x = kdf->derive_key(outlen, secret, secret.size(), salt, salt.size()); send(x.bits_of(), x.length()); } KDF_Filter(KDF* algo, const SymmetricKey& s, u32bit o) { kdf = algo; outlen = o; salt = s.bits_of(); } ~KDF_Filter() { delete kdf; } private: SecureVector secret; SecureVector salt; KDF* kdf; u32bit outlen; }; Filter* lookup_s2k(const std::string& algname, const std::vector& params) { S2K* s2k = 0; try { s2k = get_s2k(algname); } catch(...) { } if(s2k) return new S2K_Filter(s2k, params[0], to_u32bit(params[1]), to_u32bit(params[2])); return 0; } void RNG_Filter::write(const byte[], u32bit length) { if(length) { SecureVector out(length); rng->randomize(out, out.size()); send(out); } } Filter* lookup_rng(const std::string& algname, const std::string& key) { RandomNumberGenerator* prng = 0; #if defined(BOTAN_HAS_AUTO_SEEDING_RNG) if(algname == "AutoSeeded") prng = new AutoSeeded_RNG; #endif #if defined(BOTAN_HAS_X931_RNG) if(algname == "X9.31-RNG(TripleDES)") prng = new ANSI_X931_RNG(new TripleDES, new Fixed_Output_RNG(decode_hex(key))); else if(algname == "X9.31-RNG(AES-128)") prng = new ANSI_X931_RNG(new AES_128, new Fixed_Output_RNG(decode_hex(key))); else if(algname == "X9.31-RNG(AES-192)") prng = new ANSI_X931_RNG(new AES_192, new Fixed_Output_RNG(decode_hex(key))); else if(algname == "X9.31-RNG(AES-256)") prng = new ANSI_X931_RNG(new AES_256, new Fixed_Output_RNG(decode_hex(key))); #endif #if defined(BOTAN_HAS_RANDPOOL) if(algname == "Randpool") { prng = new Randpool(new AES_256, new HMAC(new SHA_256)); prng->add_entropy(reinterpret_cast(key.c_str()), key.length()); } #endif #if defined(BOTAN_HAS_X931_RNG) // these are used for benchmarking: AES-256/SHA-256 matches library // defaults, so benchmark reflects real-world performance (maybe) if(algname == "X9.31-RNG") { RandomNumberGenerator* rng = #if defined(BOTAN_HAS_HMAC_RNG) new HMAC_RNG(new HMAC(new SHA_512), new HMAC(new SHA_256)); #elif defined(BOTAN_HAS_RANDPOOL) new Randpool(new AES_256, new HMAC(new SHA_256)); #endif prng = new ANSI_X931_RNG(new AES_256, rng); } #endif #if defined(BOTAN_HAS_HMAC_RNG) if(algname == "HMAC_RNG") { prng = new HMAC_RNG(new HMAC(new SHA_512), new HMAC(new SHA_256)); } #endif if(prng) { prng->add_entropy(reinterpret_cast(key.c_str()), key.length()); return new RNG_Filter(prng); } return 0; } Filter* lookup_kdf(const std::string& algname, const std::string& salt, const std::string& params) { KDF* kdf = 0; try { kdf = get_kdf(algname); } catch(...) { return 0; } if(kdf) return new KDF_Filter(kdf, salt, to_u32bit(params)); return 0; } Filter* lookup_encoder(const std::string& algname) { if(algname == "Base64_Encode") return new Base64_Encoder; if(algname == "Base64_Decode") return new Base64_Decoder; #ifdef BOTAN_HAS_COMPRESSOR_BZIP2 if(algname == "Bzip_Compression") return new Bzip_Compression(9); if(algname == "Bzip_Decompression") return new Bzip_Decompression; #endif #ifdef BOTAN_HAS_COMPRESSOR_GZIP if(algname == "Gzip_Compression") return new Gzip_Compression(9); if(algname == "Gzip_Decompression") return new Gzip_Decompression; #endif #ifdef BOTAN_HAS_COMPRESSOR_ZLIB if(algname == "Zlib_Compression") return new Zlib_Compression(9); if(algname == "Zlib_Decompression") return new Zlib_Decompression; #endif return 0; } Filter* lookup(const std::string& algname, const std::vector& params) { std::string key = params[0]; std::string iv = params[1]; Filter* filter = 0; // The order of the lookup has to change based on how the names are // formatted and parsed. filter = lookup_kdf(algname, key, iv); if(filter) return filter; filter = lookup_rng(algname, key); if(filter) return filter; filter = lookup_encoder(algname); if(filter) return filter; filter = lookup_s2k(algname, params); if(filter) return filter; return 0; }