Cryptography.cpp 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214
  1. #include "Cryptography.h"
  2. #include <random>
  3. #include "Utility.h"
  4. #include "natLinq.h"
  5. #undef min
  6. #undef max
  7. using namespace NatsuLib;
  8. using namespace QQBot::Cryptography;
  9. namespace
  10. {
  11. std::array<std::uint32_t, 4> FormatKey(gsl::span<const std::byte> const& key)
  12. {
  13. if (key.empty())
  14. {
  15. nat_Throw(CryptoException, u8"key is empty."_nv);
  16. }
  17. std::array<std::uint32_t, 4> result{ 0x20202020, 0x20202020, 0x20202020, 0x20202020 };
  18. std::memcpy(result.data(), key.data(), std::min<std::size_t>(key.size(), 16));
  19. return result;
  20. }
  21. constexpr std::uint32_t TeaDelta = 0x9E3779B9;
  22. constexpr std::size_t TeaIterationTimes = 16;
  23. constexpr std::uint32_t TeaDecryptInitSum = TeaDelta << 4;
  24. void Encrypt(gsl::span<const std::uint32_t, 2> const& input, gsl::span<std::uint32_t, 2> const& output, gsl::span<const std::uint32_t, 4> const& key)
  25. {
  26. auto left = input[0], right = input[1];
  27. const auto a = key[0], b = key[1], c = key[2], d = key[3];
  28. std::uint32_t sum = 0;
  29. for (std::size_t i = 0; i < TeaIterationTimes; ++i)
  30. {
  31. sum += TeaDelta;
  32. left += ((right << 4) + a) ^ (right + sum) ^ ((right >> 5) + b);
  33. right += ((left << 4) + c) ^ (left + sum) ^ ((left >> 5) + d);
  34. }
  35. output[0] = left;
  36. output[1] = right;
  37. }
  38. void Decrypt(gsl::span<const std::uint32_t, 2> const& input, gsl::span<std::uint32_t, 2> const& output, gsl::span<const std::uint32_t, 4> const& key)
  39. {
  40. auto left = input[0], right = input[1];
  41. const auto a = key[0], b = key[1], c = key[2], d = key[3];
  42. auto sum = TeaDecryptInitSum;
  43. for (std::size_t i = 0; i < TeaIterationTimes; i++)
  44. {
  45. right -= ((left << 4) + c) ^ (left + sum) ^ ((left >> 5) + d);
  46. left -= ((right << 4) + a) ^ (right + sum) ^ ((right >> 5) + b);
  47. sum -= TeaDelta;
  48. }
  49. output[0] = left;
  50. output[1] = right;
  51. }
  52. }
  53. /// @see https://baike.baidu.com/item/TEA%E5%8A%A0%E5%AF%86%E7%AE%97%E6%B3%95
  54. std::size_t Tea::Encrypt(gsl::span<const std::byte> const& input, gsl::span<std::byte> const& output, gsl::span<const std::byte> const& key)
  55. {
  56. const auto totalProcessSize = CalculateOutputSize(input.size());
  57. assert(totalProcessSize % TeaProcessUnitSize == 0);
  58. if (static_cast<std::size_t>(output.size()) < totalProcessSize)
  59. {
  60. nat_Throw(CryptoException, u8"No enough space to output."_nv);
  61. }
  62. const auto paddingSize = totalProcessSize - input.size();
  63. const auto frontPaddingSize = paddingSize - 7;
  64. const auto formattedKey = FormatKey(key);
  65. std::random_device randomDevice;
  66. std::default_random_engine randomEngine{ randomDevice() };
  67. const std::uniform_int_distribution<nuInt> dist{ 0x00, 0xFF };
  68. std::uint32_t inputBuffer[2];
  69. std::uint32_t outputBuffer[2];
  70. auto inputPtr = input.data();
  71. for (std::size_t processedLength = 0; processedLength < totalProcessSize; processedLength += TeaProcessUnitSize)
  72. {
  73. if (processedLength == totalProcessSize - TeaProcessUnitSize)
  74. {
  75. reinterpret_cast<std::byte&>(inputBuffer[0]) = *inputPtr++;
  76. std::memset(reinterpret_cast<std::byte*>(inputBuffer) + 1, 0, 7);
  77. }
  78. else
  79. {
  80. auto writePointer = reinterpret_cast<std::byte*>(inputBuffer);
  81. const auto writeEndPointer = reinterpret_cast<std::byte*>(std::end(inputBuffer));
  82. if (processedLength < frontPaddingSize)
  83. {
  84. const auto paddingEndPointer = std::next(writePointer, std::min((sizeof inputBuffer) / sizeof(std::byte), frontPaddingSize - processedLength));
  85. if (processedLength == 0)
  86. {
  87. *writePointer++ = static_cast<std::byte>((dist(randomEngine) & 0xF8) | (paddingSize - 10));
  88. }
  89. std::generate(writePointer, paddingEndPointer, [&]
  90. {
  91. return static_cast<std::byte>(dist(randomEngine));
  92. });
  93. writePointer = paddingEndPointer;
  94. }
  95. const auto readSize = std::distance(writePointer, writeEndPointer);
  96. std::memcpy(writePointer, inputPtr, readSize);
  97. inputPtr += readSize;
  98. }
  99. if (processedLength > 0)
  100. {
  101. const auto inputBytePtr = reinterpret_cast<std::byte*>(inputBuffer);
  102. const auto outputBytePtr = reinterpret_cast<std::byte*>(outputBuffer);
  103. for (std::size_t i = 0; i < (sizeof inputBuffer) / sizeof(std::byte); ++i)
  104. {
  105. inputBytePtr[i] ^= outputBytePtr[i];
  106. }
  107. }
  108. ::Encrypt(inputBuffer, outputBuffer, formattedKey);
  109. std::memcpy(&output[processedLength], outputBuffer, TeaProcessUnitSize);
  110. }
  111. return totalProcessSize;
  112. }
  113. std::size_t Tea::Decrypt(gsl::span<const std::byte> const& input, gsl::span<std::byte> const& output, gsl::span<const std::byte> const& key)
  114. {
  115. const auto inputSize = static_cast<std::size_t>(input.size());
  116. if (inputSize % TeaProcessUnitSize != 0 || inputSize < 16)
  117. {
  118. nat_Throw(CryptoException, u8"Invalid input data."_nv);
  119. }
  120. const auto formattedKey = FormatKey(key);
  121. std::uint32_t inputBuffer[2];
  122. std::uint32_t outputBuffer[2];
  123. std::uint32_t lastInputBuffer[2];
  124. std::size_t frontPaddingSize;
  125. auto outputPtr = output.data();
  126. for (std::size_t processedLength = 0; processedLength < inputSize; processedLength += TeaProcessUnitSize)
  127. {
  128. std::memcpy(inputBuffer, &input[processedLength], TeaProcessUnitSize);
  129. ::Decrypt(inputBuffer, outputBuffer, formattedKey);
  130. if (processedLength > 0)
  131. {
  132. const auto inputBytePtr = reinterpret_cast<std::byte*>(lastInputBuffer);
  133. const auto outputBytePtr = reinterpret_cast<std::byte*>(outputBuffer);
  134. for (std::size_t i = 0; i < (sizeof inputBuffer) / sizeof(std::byte); ++i)
  135. {
  136. outputBytePtr[i] ^= inputBytePtr[i];
  137. }
  138. }
  139. std::memcpy(lastInputBuffer, inputBuffer, sizeof lastInputBuffer);
  140. if (processedLength == 0)
  141. {
  142. const auto outputBufferPtr = reinterpret_cast<nByte*>(outputBuffer);
  143. const std::size_t paddingSize = (outputBufferPtr[0] & 7u) + 10u;
  144. if (static_cast<std::size_t>(output.size()) < inputSize - paddingSize)
  145. {
  146. nat_Throw(CryptoException, u8"No enough space to output."_nv);
  147. }
  148. frontPaddingSize = paddingSize - 7;
  149. if (frontPaddingSize < TeaProcessUnitSize)
  150. {
  151. const auto dataSize = TeaProcessUnitSize - frontPaddingSize;
  152. std::memcpy(outputPtr, outputBufferPtr + frontPaddingSize, dataSize);
  153. outputPtr += dataSize;
  154. }
  155. }
  156. else if (processedLength == inputSize - TeaProcessUnitSize)
  157. {
  158. *outputPtr = reinterpret_cast<std::byte*>(outputBuffer)[0];
  159. }
  160. else
  161. {
  162. if (processedLength + TeaProcessUnitSize <= frontPaddingSize)
  163. {
  164. continue;
  165. }
  166. auto outputSize = TeaProcessUnitSize;
  167. auto outputBufferPtr = reinterpret_cast<std::byte*>(outputBuffer);
  168. if (processedLength < frontPaddingSize)
  169. {
  170. outputSize = processedLength + TeaProcessUnitSize - frontPaddingSize;
  171. outputBufferPtr += TeaProcessUnitSize - outputSize;
  172. }
  173. std::memcpy(outputPtr, outputBufferPtr, outputSize);
  174. outputPtr += outputSize;
  175. }
  176. }
  177. return inputSize - frontPaddingSize - 7;
  178. }