1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407
|
/*
* This file is part of PowerDNS or weakforced.
* Copyright -- PowerDNS.COM B.V. and its contributors
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 3 of the GNU General Public License as
* published by the Free Software Foundation.
*
* In addition, for the avoidance of any doubt, permission is granted to
* link this program with OpenSSL and to (re)distribute the binaries
* produced as the result of such linking.
*
* 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include <iostream>
#include <sstream>
#include "namespaces.hh"
#include "misc.hh"
#include "base64.hh"
#include "sodcrypto.hh"
#ifdef HAVE_LIBSODIUM
string newKeyStr()
{
string key;
key.resize(crypto_secretbox_KEYBYTES);
randombytes_buf(key.data(), crypto_secretbox_KEYBYTES);
return key;
}
string newKey()
{
return "\""+Base64Encode(newKeyStr())+"\"";
}
std::string sodEncryptSym(const std::string& msg, const std::string& key, SodiumNonce& nonce)
{
std::string ciphertext;
ciphertext.resize(msg.length() + crypto_secretbox_MACBYTES);
crypto_secretbox_easy((unsigned char*)ciphertext.data(), (unsigned char*)msg.c_str(), msg.length(), nonce.value, (unsigned char*)key.c_str());
nonce.increment();
return ciphertext;
}
std::string sodDecryptSym(const std::string& msg, const std::string& key, SodiumNonce& nonce)
{
std::string decrypted;
// It's fine if there's no data to decrypt
if ((msg.length() - crypto_secretbox_MACBYTES) > 0) {
decrypted.resize(msg.length() - crypto_secretbox_MACBYTES);
if (crypto_secretbox_open_easy((unsigned char*)decrypted.data(), (const unsigned char*)msg.c_str(),
msg.length(), nonce.value, (const unsigned char*)key.c_str()) != 0) {
throw std::runtime_error("Could not decrypt message");
}
nonce.increment();
return decrypted;
}
else {
nonce.increment();
return string();
}
}
#else
#define POLY1305_BLOCK_SIZE 16
string newKeyStr()
{
string key;
key.resize(CHACHA20_POLY1305_KEY_SIZE);
if (RAND_priv_bytes((unsigned char*)key.data(), CHACHA20_POLY1305_KEY_SIZE) != 1) {
throw std::runtime_error(
"Could not initialize random number generator for cryptographic functions - this is not recoverable");
}
return key;
}
string newKey()
{
return "\"" + Base64Encode(newKeyStr()) + "\"";
}
std::string sodEncryptSym(const std::string& msg, const std::string& key, SodiumNonce& nonce)
{
std::string ciphertext;
ciphertext.resize(msg.length() + POLY1305_BLOCK_SIZE);
int len;
// Each thread gets its own cipher context
static thread_local auto ctx = std::unique_ptr<EVP_CIPHER_CTX, decltype(&EVP_CIPHER_CTX_free)>(nullptr, EVP_CIPHER_CTX_free);
if (key.length() != CHACHA20_POLY1305_KEY_SIZE) {
ostringstream err;
err << "sodEncryptSym: key length is not 32 bytes (actual length=" << key.length() << ")";
throw std::runtime_error(err.str().c_str());
}
if (ctx.get() == nullptr) {
if (!(ctx = std::unique_ptr<EVP_CIPHER_CTX, decltype(&EVP_CIPHER_CTX_free)>(EVP_CIPHER_CTX_new(), EVP_CIPHER_CTX_free)))
throw std::runtime_error("sodEncryptSym: EVP_CIPHER_CTX_new() could not initialize cipher context");
/* Initialise the encryption operation. */
if (1 != EVP_EncryptInit_ex(ctx.get(), EVP_chacha20_poly1305(), NULL, NULL, NULL))
throw std::runtime_error("sodEncryptSym: EVP_EncryptInit_ex() could not initialize encryption operation");
}
if (1 != EVP_EncryptInit_ex(ctx.get(), NULL, NULL, (unsigned char*) key.c_str(), nonce.value))
throw std::runtime_error("sodEncryptSym: EVP_EncryptInit_ex() could not initialize encryption key and IV");
if (1 !=
EVP_EncryptUpdate(ctx.get(), (unsigned char*)ciphertext.data() + POLY1305_BLOCK_SIZE, &len, (unsigned char*) msg.c_str(), msg.length()))
throw std::runtime_error("sodEncryptSym: EVP_EncryptUpdate() could not encrypt message");
if (1 != EVP_EncryptFinal_ex(ctx.get(), (unsigned char*)ciphertext.data() + len + POLY1305_BLOCK_SIZE, &len))
throw std::runtime_error("sodEncryptSym: EVP_EncryptFinal_ex() could finalize message encryption");;
/* Get the tag */
if (1 != EVP_CIPHER_CTX_ctrl(ctx.get(), EVP_CTRL_AEAD_GET_TAG, POLY1305_BLOCK_SIZE, ciphertext.data()))
throw std::runtime_error("sodEncryptSym: EVP_CIPHER_CTX_ctrl() could not get tag");
nonce.increment();
return ciphertext;
}
std::string sodDecryptSym(const std::string& msg, const std::string& key, SodiumNonce& nonce)
{
std::string plaintext;
int len;
// Each thread gets its own cipher context
static thread_local auto ctx = std::unique_ptr<EVP_CIPHER_CTX, decltype(&EVP_CIPHER_CTX_free)>(nullptr, EVP_CIPHER_CTX_free);
if (key.length() != CHACHA20_POLY1305_KEY_SIZE) {
ostringstream err;
err << "sodDecryptSym: key length is not 32 bytes (actual length=" << key.length() << ")";
throw std::runtime_error(err.str().c_str());
}
if ((msg.length() - POLY1305_BLOCK_SIZE) > 0) {
string tag = msg.substr(0, POLY1305_BLOCK_SIZE);
plaintext.resize(msg.length() - POLY1305_BLOCK_SIZE);
if (ctx.get() == nullptr) {
if (!(ctx = std::unique_ptr<EVP_CIPHER_CTX, decltype(&EVP_CIPHER_CTX_free)>(EVP_CIPHER_CTX_new(), EVP_CIPHER_CTX_free)))
throw std::runtime_error("sodDecryptSym: EVP_CIPHER_CTX_new() could not initialize cipher context");
if (1 != EVP_DecryptInit_ex(ctx.get(), EVP_chacha20_poly1305(), NULL, NULL, NULL))
throw std::runtime_error("sodDecryptSym: EVP_DecryptInit_ex() could not initialize decryption operation");
}
if (1 != EVP_DecryptInit_ex(ctx.get(), NULL, NULL, (unsigned char*) key.c_str(), nonce.value))
throw std::runtime_error("sodDecryptSym: EVP_DecryptInit_ex() could not initialize decryption key and IV");
if (!EVP_DecryptUpdate(ctx.get(), (unsigned char*) plaintext.data(), &len,
(unsigned char*) (msg.c_str() + POLY1305_BLOCK_SIZE), msg.length() - POLY1305_BLOCK_SIZE))
throw std::runtime_error("sodDecryptSym: EVP_DecryptUpdate() could not decrypt message");
/* Set expected tag value. Works in OpenSSL 1.0.1d and later */
if (!EVP_CIPHER_CTX_ctrl(ctx.get(), EVP_CTRL_AEAD_SET_TAG, POLY1305_BLOCK_SIZE, (void*) tag.c_str()))
throw std::runtime_error("sodDecryptSym: EVP_CIPHER_CTX_ctrl() AEAD tag could not be validated");
if (!EVP_DecryptFinal_ex(ctx.get(), (unsigned char*) (plaintext.data() + len), &len))
throw std::runtime_error("sodDecryptSym: EVP_DecryptFinal_ex() failed - plaintext cannot be trusted");
nonce.increment();
return plaintext;
}
else {
nonce.increment();
return string();
}
}
#endif
#include "base64.hh"
#include <inttypes.h>
namespace anonpdns {
char B64Decode1(char cInChar)
{
// The incoming character will be A-Z, a-z, 0-9, +, /, or =.
// The idea is to quickly determine which grouping the
// letter belongs to and return the associated value
// without having to search the global encoding string
// (the value we're looking for would be the resulting
// index into that string).
//
// To do that, we'll play some tricks...
unsigned char iIndex = '\0';
switch (cInChar) {
case '+':
iIndex = 62;
break;
case '/':
iIndex = 63;
break;
case '=':
iIndex = 0;
break;
default:
// Must be 'A'-'Z', 'a'-'z', '0'-'9', or an error...
//
// Numerically, small letters are "greater" in value than
// capital letters and numerals (ASCII value), and capital
// letters are "greater" than numerals (again, ASCII value),
// so we check for numerals first, then capital letters,
// and finally small letters.
iIndex = '9' - cInChar;
if (iIndex > 0x3F) {
// Not from '0' to '9'...
iIndex = 'Z' - cInChar;
if (iIndex > 0x3F) {
// Not from 'A' to 'Z'...
iIndex = 'z' - cInChar;
if (iIndex > 0x3F) {
// Invalid character...cannot
// decode!
iIndex = 0x80; // set the high bit
} // if
else {
// From 'a' to 'z'
iIndex = (('z' - iIndex) - 'a') + 26;
} // else
} // if
else {
// From 'A' to 'Z'
iIndex = ('Z' - iIndex) - 'A';
} // else
} // if
else {
// Adjust the index...
iIndex = (('9' - iIndex) - '0') + 52;
} // else
break;
} // switch
return iIndex;
}
inline char B64Encode1(unsigned char uc)
{
if (uc < 26) {
return 'A' + uc;
}
if (uc < 52) {
return 'a' + (uc - 26);
}
if (uc < 62) {
return '0' + (uc - 52);
}
if (uc == 62) {
return '+';
}
return '/';
};
}
using namespace anonpdns;
int B64Decode(const std::string& strInput, std::string& strOutput)
{
// Set up a decoding buffer
long cBuf = 0;
char* pBuf = (char*) &cBuf;
// Decoding management...
int iBitGroup = 0, iInNum = 0;
// While there are characters to process...
//
// We'll decode characters in blocks of 4, as
// there are 4 groups of 6 bits in 3 bytes. The
// incoming Base64 character is first decoded, and
// then it is inserted into the decode buffer
// (with any relevant shifting, as required).
// Later, after all 3 bytes have been reconstituted,
// we assign them to the output string, ultimately
// to be returned as the original message.
int iInSize = strInput.size();
unsigned char cChar = '\0';
uint8_t pad = 0;
while (iInNum < iInSize) {
// Fill the decode buffer with 4 groups of 6 bits
cBuf = 0; // clear
pad = 0;
for (iBitGroup = 0; iBitGroup < 4; ++iBitGroup) {
if (iInNum < iInSize) {
// Decode a character
if (strInput.at(iInNum) == '=')
pad++;
while (isspace(strInput.at(iInNum)))
iInNum++;
cChar = B64Decode1(strInput.at(iInNum++));
} // if
else {
// Decode a padded zero
cChar = '\0';
} // else
// Check for valid decode
if (cChar > 0x7F)
return -1;
// Adjust the bits
switch (iBitGroup) {
case 0:
// The first group is copied into
// the least significant 6 bits of
// the decode buffer...these 6 bits
// will eventually shift over to be
// the most significant bits of the
// third byte.
cBuf = cBuf | cChar;
break;
default:
// For groupings 1-3, simply shift
// the bits in the decode buffer over
// by 6 and insert the 6 from the
// current decode character.
cBuf = (cBuf << 6) | cChar;
break;
} // switch
} // for
// Interpret the resulting 3 bytes...note there
// may have been padding, so those padded bytes
// are actually ignored.
strOutput += pBuf[2];
strOutput += pBuf[1];
strOutput += pBuf[0];
} // while
if (pad)
strOutput.resize(strOutput.length() - pad);
return 1;
}
/*
www.kbcafe.com
Copyright 2001-2002 Randy Charles Morin
The Encode static method takes an array of 8-bit values and returns a base-64 stream.
*/
std::string Base64Encode(const std::string& vby)
{
std::string retval;
if (vby.size() == 0) {
return retval;
};
for (unsigned int i = 0; i < vby.size(); i += 3) {
unsigned char by1 = 0, by2 = 0, by3 = 0;
by1 = vby[i];
if (i + 1 < vby.size()) {
by2 = vby[i + 1];
};
if (i + 2 < vby.size()) {
by3 = vby[i + 2];
}
unsigned char by4 = 0, by5 = 0, by6 = 0, by7 = 0;
by4 = by1 >> 2;
by5 = ((by1 & 0x3) << 4) | (by2 >> 4);
by6 = ((by2 & 0xf) << 2) | (by3 >> 6);
by7 = by3 & 0x3f;
retval += B64Encode1(by4);
retval += B64Encode1(by5);
if (i + 1 < vby.size()) {
retval += B64Encode1(by6);
}
else {
retval += "=";
};
if (i + 2 < vby.size()) {
retval += B64Encode1(by7);
}
else {
retval += "=";
};
/* if ((i % (76 / 4 * 3)) == 0)
{
retval += "\r\n";
}*/
};
return retval;
};
|