Counter Strike : Global Offensive Source Code
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

118 lines
3.3 KiB

  1. // rc2.cpp - written and placed in the public domain by Wei Dai
  2. #include "pch.h"
  3. #include "rc2.h"
  4. #include "misc.h"
  5. #include "argnames.h"
  6. NAMESPACE_BEGIN(CryptoPP)
  7. void RC2::Base::UncheckedSetKey(const byte *key, unsigned int keyLen, const NameValuePairs &params)
  8. {
  9. AssertValidKeyLength(keyLen);
  10. int effectiveLen = params.GetIntValueWithDefault(Name::EffectiveKeyLength(), DEFAULT_EFFECTIVE_KEYLENGTH);
  11. if (effectiveLen > MAX_EFFECTIVE_KEYLENGTH)
  12. throw InvalidArgument("RC2: effective key length parameter exceeds maximum");
  13. static const unsigned char PITABLE[256] = {
  14. 217,120,249,196, 25,221,181,237, 40,233,253,121, 74,160,216,157,
  15. 198,126, 55,131, 43,118, 83,142, 98, 76,100,136, 68,139,251,162,
  16. 23,154, 89,245,135,179, 79, 19, 97, 69,109,141, 9,129,125, 50,
  17. 189,143, 64,235,134,183,123, 11,240,149, 33, 34, 92,107, 78,130,
  18. 84,214,101,147,206, 96,178, 28,115, 86,192, 20,167,140,241,220,
  19. 18,117,202, 31, 59,190,228,209, 66, 61,212, 48,163, 60,182, 38,
  20. 111,191, 14,218, 70,105, 7, 87, 39,242, 29,155,188,148, 67, 3,
  21. 248, 17,199,246,144,239, 62,231, 6,195,213, 47,200,102, 30,215,
  22. 8,232,234,222,128, 82,238,247,132,170,114,172, 53, 77,106, 42,
  23. 150, 26,210,113, 90, 21, 73,116, 75,159,208, 94, 4, 24,164,236,
  24. 194,224, 65,110, 15, 81,203,204, 36,145,175, 80,161,244,112, 57,
  25. 153,124, 58,133, 35,184,180,122,252, 2, 54, 91, 37, 85,151, 49,
  26. 45, 93,250,152,227,138,146,174, 5,223, 41, 16,103,108,186,201,
  27. 211, 0,230,207,225,158,168, 44, 99, 22, 1, 63, 88,226,137,169,
  28. 13, 56, 52, 27,171, 51,255,176,187, 72, 12, 95,185,177,205, 46,
  29. 197,243,219, 71,229,165,156,119, 10,166, 32,104,254,127,193,173};
  30. SecByteBlock L(128);
  31. memcpy(L, key, keyLen);
  32. int i;
  33. for (i=keyLen; i<128; i++)
  34. L[i] = PITABLE[(L[i-1] + L[i-keyLen]) & 255];
  35. unsigned int T8 = (effectiveLen+7) / 8;
  36. byte TM = 255 >> ((8-(effectiveLen%8))%8);
  37. L[128-T8] = PITABLE[L[128-T8] & TM];
  38. for (i=127-T8; i>=0; i--)
  39. L[i] = PITABLE[L[i+1] ^ L[i+T8]];
  40. for (i=0; i<64; i++)
  41. K[i] = L[2*i] + (L[2*i+1] << 8);
  42. }
  43. typedef BlockGetAndPut<word16, LittleEndian> Block;
  44. void RC2::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const
  45. {
  46. word16 R0, R1, R2, R3;
  47. Block::Get(inBlock)(R0)(R1)(R2)(R3);
  48. for (int i = 0; i < 16; i++)
  49. {
  50. R0 += (R1 & ~R3) + (R2 & R3) + K[4*i+0];
  51. R0 = rotlFixed(R0, 1);
  52. R1 += (R2 & ~R0) + (R3 & R0) + K[4*i+1];
  53. R1 = rotlFixed(R1, 2);
  54. R2 += (R3 & ~R1) + (R0 & R1) + K[4*i+2];
  55. R2 = rotlFixed(R2, 3);
  56. R3 += (R0 & ~R2) + (R1 & R2) + K[4*i+3];
  57. R3 = rotlFixed(R3, 5);
  58. if (i == 4 || i == 10)
  59. {
  60. R0 += K[R3 & 63];
  61. R1 += K[R0 & 63];
  62. R2 += K[R1 & 63];
  63. R3 += K[R2 & 63];
  64. }
  65. }
  66. Block::Put(xorBlock, outBlock)(R0)(R1)(R2)(R3);
  67. }
  68. void RC2::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const
  69. {
  70. word16 R0, R1, R2, R3;
  71. Block::Get(inBlock)(R0)(R1)(R2)(R3);
  72. for (int i = 15; i >= 0; i--)
  73. {
  74. if (i == 4 || i == 10)
  75. {
  76. R3 -= K[R2 & 63];
  77. R2 -= K[R1 & 63];
  78. R1 -= K[R0 & 63];
  79. R0 -= K[R3 & 63];
  80. }
  81. R3 = rotrFixed(R3, 5);
  82. R3 -= (R0 & ~R2) + (R1 & R2) + K[4*i+3];
  83. R2 = rotrFixed(R2, 3);
  84. R2 -= (R3 & ~R1) + (R0 & R1) + K[4*i+2];
  85. R1 = rotrFixed(R1, 2);
  86. R1 -= (R2 & ~R0) + (R3 & R0) + K[4*i+1];
  87. R0 = rotrFixed(R0, 1);
  88. R0 -= (R1 & ~R3) + (R2 & R3) + K[4*i+0];
  89. }
  90. Block::Put(xorBlock, outBlock)(R0)(R1)(R2)(R3);
  91. }
  92. NAMESPACE_END