DSTU7564Digest.cs 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534
  1. #if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
  2. #pragma warning disable
  3. using System;
  4. using BestHTTP.SecureProtocol.Org.BouncyCastle.Crypto.Engines;
  5. using BestHTTP.SecureProtocol.Org.BouncyCastle.Crypto.Parameters;
  6. using BestHTTP.SecureProtocol.Org.BouncyCastle.Crypto.Utilities;
  7. using BestHTTP.SecureProtocol.Org.BouncyCastle.Utilities;
  8. using BestHTTP.SecureProtocol.Org.BouncyCastle.Utilities.Encoders;
  9. namespace BestHTTP.SecureProtocol.Org.BouncyCastle.Crypto.Digests
  10. {
  11. /**
  12. * implementation of Ukrainian DSTU 7564 hash function
  13. */
  14. public class Dstu7564Digest
  15. : IDigest, IMemoable
  16. {
  17. private const int NB_512 = 8; //Number of 8-byte words in state for <=256-bit hash code.
  18. private const int NB_1024 = 16; //Number of 8-byte words in state for <=512-bit hash code.
  19. private const int NR_512 = 10; //Number of rounds for 512-bit state.
  20. private const int NR_1024 = 14; //Number of rounds for 1024-bit state.
  21. private int hashSize;
  22. private int blockSize;
  23. private int columns;
  24. private int rounds;
  25. private ulong[] state;
  26. private ulong[] tempState1;
  27. private ulong[] tempState2;
  28. // TODO Guard against 'inputBlocks' overflow (2^64 blocks)
  29. private ulong inputBlocks;
  30. private int bufOff;
  31. private byte[] buf;
  32. public Dstu7564Digest(Dstu7564Digest digest)
  33. {
  34. CopyIn(digest);
  35. }
  36. private void CopyIn(Dstu7564Digest digest)
  37. {
  38. this.hashSize = digest.hashSize;
  39. this.blockSize = digest.blockSize;
  40. this.rounds = digest.rounds;
  41. if (columns > 0 && columns == digest.columns)
  42. {
  43. Array.Copy(digest.state, 0, state, 0, columns);
  44. Array.Copy(digest.buf, 0, buf, 0, blockSize);
  45. }
  46. else
  47. {
  48. this.columns = digest.columns;
  49. this.state = Arrays.Clone(digest.state);
  50. this.tempState1 = new ulong[columns];
  51. this.tempState2 = new ulong[columns];
  52. this.buf = Arrays.Clone(digest.buf);
  53. }
  54. this.inputBlocks = digest.inputBlocks;
  55. this.bufOff = digest.bufOff;
  56. }
  57. public Dstu7564Digest(int hashSizeBits)
  58. {
  59. if (hashSizeBits == 256 || hashSizeBits == 384 || hashSizeBits == 512)
  60. {
  61. this.hashSize = hashSizeBits / 8;
  62. }
  63. else
  64. {
  65. throw new ArgumentException("Hash size is not recommended. Use 256/384/512 instead");
  66. }
  67. if (hashSizeBits > 256)
  68. {
  69. this.columns = NB_1024;
  70. this.rounds = NR_1024;
  71. }
  72. else
  73. {
  74. this.columns = NB_512;
  75. this.rounds = NR_512;
  76. }
  77. this.blockSize = columns << 3;
  78. this.state = new ulong[columns];
  79. this.state[0] = (ulong)blockSize;
  80. this.tempState1 = new ulong[columns];
  81. this.tempState2 = new ulong[columns];
  82. this.buf = new byte[blockSize];
  83. }
  84. public virtual string AlgorithmName
  85. {
  86. get { return "DSTU7564"; }
  87. }
  88. public virtual int GetDigestSize()
  89. {
  90. return hashSize;
  91. }
  92. public virtual int GetByteLength()
  93. {
  94. return blockSize;
  95. }
  96. public virtual void Update(byte input)
  97. {
  98. buf[bufOff++] = input;
  99. if (bufOff == blockSize)
  100. {
  101. ProcessBlock(buf, 0);
  102. bufOff = 0;
  103. ++inputBlocks;
  104. }
  105. }
  106. public virtual void BlockUpdate(byte[] input, int inOff, int length)
  107. {
  108. while (bufOff != 0 && length > 0)
  109. {
  110. Update(input[inOff++]);
  111. --length;
  112. }
  113. if (length > 0)
  114. {
  115. while (length >= blockSize)
  116. {
  117. ProcessBlock(input, inOff);
  118. inOff += blockSize;
  119. length -= blockSize;
  120. ++inputBlocks;
  121. }
  122. while (length > 0)
  123. {
  124. Update(input[inOff++]);
  125. --length;
  126. }
  127. }
  128. }
  129. public virtual int DoFinal(byte[] output, int outOff)
  130. {
  131. // Apply padding: terminator byte and 96-bit length field
  132. {
  133. int inputBytes = bufOff;
  134. buf[bufOff++] = (byte)0x80;
  135. int lenPos = blockSize - 12;
  136. if (bufOff > lenPos)
  137. {
  138. while (bufOff < blockSize)
  139. {
  140. buf[bufOff++] = 0;
  141. }
  142. bufOff = 0;
  143. ProcessBlock(buf, 0);
  144. }
  145. while (bufOff < lenPos)
  146. {
  147. buf[bufOff++] = 0;
  148. }
  149. ulong c = ((inputBlocks & 0xFFFFFFFFUL) * (ulong)blockSize + (uint)inputBytes) << 3;
  150. Pack.UInt32_To_LE((uint)c, buf, bufOff);
  151. bufOff += 4;
  152. c >>= 32;
  153. c += ((inputBlocks >> 32) * (ulong)blockSize) << 3;
  154. Pack.UInt64_To_LE(c, buf, bufOff);
  155. // bufOff += 8;
  156. ProcessBlock(buf, 0);
  157. }
  158. {
  159. Array.Copy(state, 0, tempState1, 0, columns);
  160. P(tempState1);
  161. for (int col = 0; col < columns; ++col)
  162. {
  163. state[col] ^= tempState1[col];
  164. }
  165. }
  166. int neededColumns = hashSize / 8;
  167. for (int col = columns - neededColumns; col < columns; ++col)
  168. {
  169. Pack.UInt64_To_LE(state[col], output, outOff);
  170. outOff += 8;
  171. }
  172. Reset();
  173. return hashSize;
  174. }
  175. public virtual void Reset()
  176. {
  177. Array.Clear(state, 0, state.Length);
  178. state[0] = (ulong)blockSize;
  179. inputBlocks = 0;
  180. bufOff = 0;
  181. }
  182. protected virtual void ProcessBlock(byte[] input, int inOff)
  183. {
  184. int pos = inOff;
  185. for (int col = 0; col < columns; ++col)
  186. {
  187. ulong word = Pack.LE_To_UInt64(input, pos);
  188. pos += 8;
  189. tempState1[col] = state[col] ^ word;
  190. tempState2[col] = word;
  191. }
  192. P(tempState1);
  193. Q(tempState2);
  194. for (int col = 0; col < columns; ++col)
  195. {
  196. state[col] ^= tempState1[col] ^ tempState2[col];
  197. }
  198. }
  199. private void P(ulong[] s)
  200. {
  201. for (int round = 0; round < rounds; ++round)
  202. {
  203. ulong rc = (ulong)round;
  204. /* AddRoundConstants */
  205. for (int col = 0; col < columns; ++col)
  206. {
  207. s[col] ^= rc;
  208. rc += 0x10L;
  209. }
  210. ShiftRows(s);
  211. SubBytes(s);
  212. MixColumns(s);
  213. }
  214. }
  215. private void Q(ulong[] s)
  216. {
  217. for (int round = 0; round < rounds; ++round)
  218. {
  219. /* AddRoundConstantsQ */
  220. ulong rc = ((ulong)(((columns - 1) << 4) ^ round) << 56) | 0x00F0F0F0F0F0F0F3UL;
  221. for (int col = 0; col < columns; ++col)
  222. {
  223. s[col] += rc;
  224. rc -= 0x1000000000000000L;
  225. }
  226. ShiftRows(s);
  227. SubBytes(s);
  228. MixColumns(s);
  229. }
  230. }
  231. private static ulong MixColumn(ulong c)
  232. {
  233. //// Calculate column multiplied by powers of 'x'
  234. //ulong x0 = c;
  235. //ulong x1 = ((x0 & 0x7F7F7F7F7F7F7F7FUL) << 1) ^ (((x0 & 0x8080808080808080UL) >> 7) * 0x1DUL);
  236. //ulong x2 = ((x1 & 0x7F7F7F7F7F7F7F7FUL) << 1) ^ (((x1 & 0x8080808080808080UL) >> 7) * 0x1DUL);
  237. //ulong x3 = ((x2 & 0x7F7F7F7F7F7F7F7FUL) << 1) ^ (((x2 & 0x8080808080808080UL) >> 7) * 0x1DUL);
  238. //// Calculate products with circulant matrix from (0x01, 0x01, 0x05, 0x01, 0x08, 0x06, 0x07, 0x04)
  239. //ulong m0 = x0;
  240. //ulong m1 = x0;
  241. //ulong m2 = x0 ^ x2;
  242. //ulong m3 = x0;
  243. //ulong m4 = x3;
  244. //ulong m5 = x1 ^ x2;
  245. //ulong m6 = x0 ^ x1 ^ x2;
  246. //ulong m7 = x2;
  247. //// Assemble the rotated products
  248. //return m0
  249. // ^ Rotate(8, m1)
  250. // ^ Rotate(16, m2)
  251. // ^ Rotate(24, m3)
  252. // ^ Rotate(32, m4)
  253. // ^ Rotate(40, m5)
  254. // ^ Rotate(48, m6)
  255. // ^ Rotate(56, m7);
  256. // Multiply elements by 'x'
  257. ulong x1 = ((c & 0x7F7F7F7F7F7F7F7FUL) << 1) ^ (((c & 0x8080808080808080UL) >> 7) * 0x1DUL);
  258. ulong u, v;
  259. u = Rotate(8, c) ^ c;
  260. u ^= Rotate(16, u);
  261. u ^= Rotate(48, c);
  262. v = u ^ c ^ x1;
  263. // Multiply elements by 'x^2'
  264. v = ((v & 0x3F3F3F3F3F3F3F3FUL) << 2) ^ (((v & 0x8080808080808080UL) >> 6) * 0x1DUL) ^ (((v & 0x4040404040404040UL) >> 6) * 0x1DUL);
  265. return u ^ Rotate(32, v) ^ Rotate(40, x1) ^ Rotate(48, x1);
  266. }
  267. private void MixColumns(ulong[] s)
  268. {
  269. for (int col = 0; col < columns; ++col)
  270. {
  271. s[col] = MixColumn(s[col]);
  272. }
  273. }
  274. private static ulong Rotate(int n, ulong x)
  275. {
  276. return (x >> n) | (x << -n);
  277. }
  278. private void ShiftRows(ulong[] s)
  279. {
  280. switch (columns)
  281. {
  282. case NB_512:
  283. {
  284. ulong c0 = s[0], c1 = s[1], c2 = s[2], c3 = s[3];
  285. ulong c4 = s[4], c5 = s[5], c6 = s[6], c7 = s[7];
  286. ulong d;
  287. d = (c0 ^ c4) & 0xFFFFFFFF00000000UL; c0 ^= d; c4 ^= d;
  288. d = (c1 ^ c5) & 0x00FFFFFFFF000000UL; c1 ^= d; c5 ^= d;
  289. d = (c2 ^ c6) & 0x0000FFFFFFFF0000UL; c2 ^= d; c6 ^= d;
  290. d = (c3 ^ c7) & 0x000000FFFFFFFF00UL; c3 ^= d; c7 ^= d;
  291. d = (c0 ^ c2) & 0xFFFF0000FFFF0000UL; c0 ^= d; c2 ^= d;
  292. d = (c1 ^ c3) & 0x00FFFF0000FFFF00UL; c1 ^= d; c3 ^= d;
  293. d = (c4 ^ c6) & 0xFFFF0000FFFF0000UL; c4 ^= d; c6 ^= d;
  294. d = (c5 ^ c7) & 0x00FFFF0000FFFF00UL; c5 ^= d; c7 ^= d;
  295. d = (c0 ^ c1) & 0xFF00FF00FF00FF00UL; c0 ^= d; c1 ^= d;
  296. d = (c2 ^ c3) & 0xFF00FF00FF00FF00UL; c2 ^= d; c3 ^= d;
  297. d = (c4 ^ c5) & 0xFF00FF00FF00FF00UL; c4 ^= d; c5 ^= d;
  298. d = (c6 ^ c7) & 0xFF00FF00FF00FF00UL; c6 ^= d; c7 ^= d;
  299. s[0] = c0; s[1] = c1; s[2] = c2; s[3] = c3;
  300. s[4] = c4; s[5] = c5; s[6] = c6; s[7] = c7;
  301. break;
  302. }
  303. case NB_1024:
  304. {
  305. ulong c00 = s[0], c01 = s[1], c02 = s[2], c03 = s[3];
  306. ulong c04 = s[4], c05 = s[5], c06 = s[6], c07 = s[7];
  307. ulong c08 = s[8], c09 = s[9], c10 = s[10], c11 = s[11];
  308. ulong c12 = s[12], c13 = s[13], c14 = s[14], c15 = s[15];
  309. ulong d;
  310. // NOTE: Row 7 is shifted by 11
  311. d = (c00 ^ c08) & 0xFF00000000000000UL; c00 ^= d; c08 ^= d;
  312. d = (c01 ^ c09) & 0xFF00000000000000UL; c01 ^= d; c09 ^= d;
  313. d = (c02 ^ c10) & 0xFFFF000000000000UL; c02 ^= d; c10 ^= d;
  314. d = (c03 ^ c11) & 0xFFFFFF0000000000UL; c03 ^= d; c11 ^= d;
  315. d = (c04 ^ c12) & 0xFFFFFFFF00000000UL; c04 ^= d; c12 ^= d;
  316. d = (c05 ^ c13) & 0x00FFFFFFFF000000UL; c05 ^= d; c13 ^= d;
  317. d = (c06 ^ c14) & 0x00FFFFFFFFFF0000UL; c06 ^= d; c14 ^= d;
  318. d = (c07 ^ c15) & 0x00FFFFFFFFFFFF00UL; c07 ^= d; c15 ^= d;
  319. d = (c00 ^ c04) & 0x00FFFFFF00000000UL; c00 ^= d; c04 ^= d;
  320. d = (c01 ^ c05) & 0xFFFFFFFFFF000000UL; c01 ^= d; c05 ^= d;
  321. d = (c02 ^ c06) & 0xFF00FFFFFFFF0000UL; c02 ^= d; c06 ^= d;
  322. d = (c03 ^ c07) & 0xFF0000FFFFFFFF00UL; c03 ^= d; c07 ^= d;
  323. d = (c08 ^ c12) & 0x00FFFFFF00000000UL; c08 ^= d; c12 ^= d;
  324. d = (c09 ^ c13) & 0xFFFFFFFFFF000000UL; c09 ^= d; c13 ^= d;
  325. d = (c10 ^ c14) & 0xFF00FFFFFFFF0000UL; c10 ^= d; c14 ^= d;
  326. d = (c11 ^ c15) & 0xFF0000FFFFFFFF00UL; c11 ^= d; c15 ^= d;
  327. d = (c00 ^ c02) & 0xFFFF0000FFFF0000UL; c00 ^= d; c02 ^= d;
  328. d = (c01 ^ c03) & 0x00FFFF0000FFFF00UL; c01 ^= d; c03 ^= d;
  329. d = (c04 ^ c06) & 0xFFFF0000FFFF0000UL; c04 ^= d; c06 ^= d;
  330. d = (c05 ^ c07) & 0x00FFFF0000FFFF00UL; c05 ^= d; c07 ^= d;
  331. d = (c08 ^ c10) & 0xFFFF0000FFFF0000UL; c08 ^= d; c10 ^= d;
  332. d = (c09 ^ c11) & 0x00FFFF0000FFFF00UL; c09 ^= d; c11 ^= d;
  333. d = (c12 ^ c14) & 0xFFFF0000FFFF0000UL; c12 ^= d; c14 ^= d;
  334. d = (c13 ^ c15) & 0x00FFFF0000FFFF00UL; c13 ^= d; c15 ^= d;
  335. d = (c00 ^ c01) & 0xFF00FF00FF00FF00UL; c00 ^= d; c01 ^= d;
  336. d = (c02 ^ c03) & 0xFF00FF00FF00FF00UL; c02 ^= d; c03 ^= d;
  337. d = (c04 ^ c05) & 0xFF00FF00FF00FF00UL; c04 ^= d; c05 ^= d;
  338. d = (c06 ^ c07) & 0xFF00FF00FF00FF00UL; c06 ^= d; c07 ^= d;
  339. d = (c08 ^ c09) & 0xFF00FF00FF00FF00UL; c08 ^= d; c09 ^= d;
  340. d = (c10 ^ c11) & 0xFF00FF00FF00FF00UL; c10 ^= d; c11 ^= d;
  341. d = (c12 ^ c13) & 0xFF00FF00FF00FF00UL; c12 ^= d; c13 ^= d;
  342. d = (c14 ^ c15) & 0xFF00FF00FF00FF00UL; c14 ^= d; c15 ^= d;
  343. s[0] = c00; s[1] = c01; s[2] = c02; s[3] = c03;
  344. s[4] = c04; s[5] = c05; s[6] = c06; s[7] = c07;
  345. s[8] = c08; s[9] = c09; s[10] = c10; s[11] = c11;
  346. s[12] = c12; s[13] = c13; s[14] = c14; s[15] = c15;
  347. break;
  348. }
  349. default:
  350. {
  351. throw new InvalidOperationException("unsupported state size: only 512/1024 are allowed");
  352. }
  353. }
  354. }
  355. private void SubBytes(ulong[] s)
  356. {
  357. for (int i = 0; i < columns; ++i)
  358. {
  359. ulong u = s[i];
  360. uint lo = (uint)u, hi = (uint)(u >> 32);
  361. byte t0 = S0[lo & 0xFF];
  362. byte t1 = S1[(lo >> 8) & 0xFF];
  363. byte t2 = S2[(lo >> 16) & 0xFF];
  364. byte t3 = S3[lo >> 24];
  365. lo = (uint)t0 | ((uint)t1 << 8) | ((uint)t2 << 16) | ((uint)t3 << 24);
  366. byte t4 = S0[hi & 0xFF];
  367. byte t5 = S1[(hi >> 8) & 0xFF];
  368. byte t6 = S2[(hi >> 16) & 0xFF];
  369. byte t7 = S3[hi >> 24];
  370. hi = (uint)t4 | ((uint)t5 << 8) | ((uint)t6 << 16) | ((uint)t7 << 24);
  371. s[i] = (ulong)lo | ((ulong)hi << 32);
  372. }
  373. }
  374. private static readonly byte[] S0 = new byte[] {
  375. 0xa8, 0x43, 0x5f, 0x06, 0x6b, 0x75, 0x6c, 0x59, 0x71, 0xdf, 0x87, 0x95, 0x17, 0xf0, 0xd8, 0x09,
  376. 0x6d, 0xf3, 0x1d, 0xcb, 0xc9, 0x4d, 0x2c, 0xaf, 0x79, 0xe0, 0x97, 0xfd, 0x6f, 0x4b, 0x45, 0x39,
  377. 0x3e, 0xdd, 0xa3, 0x4f, 0xb4, 0xb6, 0x9a, 0x0e, 0x1f, 0xbf, 0x15, 0xe1, 0x49, 0xd2, 0x93, 0xc6,
  378. 0x92, 0x72, 0x9e, 0x61, 0xd1, 0x63, 0xfa, 0xee, 0xf4, 0x19, 0xd5, 0xad, 0x58, 0xa4, 0xbb, 0xa1,
  379. 0xdc, 0xf2, 0x83, 0x37, 0x42, 0xe4, 0x7a, 0x32, 0x9c, 0xcc, 0xab, 0x4a, 0x8f, 0x6e, 0x04, 0x27,
  380. 0x2e, 0xe7, 0xe2, 0x5a, 0x96, 0x16, 0x23, 0x2b, 0xc2, 0x65, 0x66, 0x0f, 0xbc, 0xa9, 0x47, 0x41,
  381. 0x34, 0x48, 0xfc, 0xb7, 0x6a, 0x88, 0xa5, 0x53, 0x86, 0xf9, 0x5b, 0xdb, 0x38, 0x7b, 0xc3, 0x1e,
  382. 0x22, 0x33, 0x24, 0x28, 0x36, 0xc7, 0xb2, 0x3b, 0x8e, 0x77, 0xba, 0xf5, 0x14, 0x9f, 0x08, 0x55,
  383. 0x9b, 0x4c, 0xfe, 0x60, 0x5c, 0xda, 0x18, 0x46, 0xcd, 0x7d, 0x21, 0xb0, 0x3f, 0x1b, 0x89, 0xff,
  384. 0xeb, 0x84, 0x69, 0x3a, 0x9d, 0xd7, 0xd3, 0x70, 0x67, 0x40, 0xb5, 0xde, 0x5d, 0x30, 0x91, 0xb1,
  385. 0x78, 0x11, 0x01, 0xe5, 0x00, 0x68, 0x98, 0xa0, 0xc5, 0x02, 0xa6, 0x74, 0x2d, 0x0b, 0xa2, 0x76,
  386. 0xb3, 0xbe, 0xce, 0xbd, 0xae, 0xe9, 0x8a, 0x31, 0x1c, 0xec, 0xf1, 0x99, 0x94, 0xaa, 0xf6, 0x26,
  387. 0x2f, 0xef, 0xe8, 0x8c, 0x35, 0x03, 0xd4, 0x7f, 0xfb, 0x05, 0xc1, 0x5e, 0x90, 0x20, 0x3d, 0x82,
  388. 0xf7, 0xea, 0x0a, 0x0d, 0x7e, 0xf8, 0x50, 0x1a, 0xc4, 0x07, 0x57, 0xb8, 0x3c, 0x62, 0xe3, 0xc8,
  389. 0xac, 0x52, 0x64, 0x10, 0xd0, 0xd9, 0x13, 0x0c, 0x12, 0x29, 0x51, 0xb9, 0xcf, 0xd6, 0x73, 0x8d,
  390. 0x81, 0x54, 0xc0, 0xed, 0x4e, 0x44, 0xa7, 0x2a, 0x85, 0x25, 0xe6, 0xca, 0x7c, 0x8b, 0x56, 0x80
  391. };
  392. private static readonly byte[] S1 = new byte[] {
  393. 0xce, 0xbb, 0xeb, 0x92, 0xea, 0xcb, 0x13, 0xc1, 0xe9, 0x3a, 0xd6, 0xb2, 0xd2, 0x90, 0x17, 0xf8,
  394. 0x42, 0x15, 0x56, 0xb4, 0x65, 0x1c, 0x88, 0x43, 0xc5, 0x5c, 0x36, 0xba, 0xf5, 0x57, 0x67, 0x8d,
  395. 0x31, 0xf6, 0x64, 0x58, 0x9e, 0xf4, 0x22, 0xaa, 0x75, 0x0f, 0x02, 0xb1, 0xdf, 0x6d, 0x73, 0x4d,
  396. 0x7c, 0x26, 0x2e, 0xf7, 0x08, 0x5d, 0x44, 0x3e, 0x9f, 0x14, 0xc8, 0xae, 0x54, 0x10, 0xd8, 0xbc,
  397. 0x1a, 0x6b, 0x69, 0xf3, 0xbd, 0x33, 0xab, 0xfa, 0xd1, 0x9b, 0x68, 0x4e, 0x16, 0x95, 0x91, 0xee,
  398. 0x4c, 0x63, 0x8e, 0x5b, 0xcc, 0x3c, 0x19, 0xa1, 0x81, 0x49, 0x7b, 0xd9, 0x6f, 0x37, 0x60, 0xca,
  399. 0xe7, 0x2b, 0x48, 0xfd, 0x96, 0x45, 0xfc, 0x41, 0x12, 0x0d, 0x79, 0xe5, 0x89, 0x8c, 0xe3, 0x20,
  400. 0x30, 0xdc, 0xb7, 0x6c, 0x4a, 0xb5, 0x3f, 0x97, 0xd4, 0x62, 0x2d, 0x06, 0xa4, 0xa5, 0x83, 0x5f,
  401. 0x2a, 0xda, 0xc9, 0x00, 0x7e, 0xa2, 0x55, 0xbf, 0x11, 0xd5, 0x9c, 0xcf, 0x0e, 0x0a, 0x3d, 0x51,
  402. 0x7d, 0x93, 0x1b, 0xfe, 0xc4, 0x47, 0x09, 0x86, 0x0b, 0x8f, 0x9d, 0x6a, 0x07, 0xb9, 0xb0, 0x98,
  403. 0x18, 0x32, 0x71, 0x4b, 0xef, 0x3b, 0x70, 0xa0, 0xe4, 0x40, 0xff, 0xc3, 0xa9, 0xe6, 0x78, 0xf9,
  404. 0x8b, 0x46, 0x80, 0x1e, 0x38, 0xe1, 0xb8, 0xa8, 0xe0, 0x0c, 0x23, 0x76, 0x1d, 0x25, 0x24, 0x05,
  405. 0xf1, 0x6e, 0x94, 0x28, 0x9a, 0x84, 0xe8, 0xa3, 0x4f, 0x77, 0xd3, 0x85, 0xe2, 0x52, 0xf2, 0x82,
  406. 0x50, 0x7a, 0x2f, 0x74, 0x53, 0xb3, 0x61, 0xaf, 0x39, 0x35, 0xde, 0xcd, 0x1f, 0x99, 0xac, 0xad,
  407. 0x72, 0x2c, 0xdd, 0xd0, 0x87, 0xbe, 0x5e, 0xa6, 0xec, 0x04, 0xc6, 0x03, 0x34, 0xfb, 0xdb, 0x59,
  408. 0xb6, 0xc2, 0x01, 0xf0, 0x5a, 0xed, 0xa7, 0x66, 0x21, 0x7f, 0x8a, 0x27, 0xc7, 0xc0, 0x29, 0xd7
  409. };
  410. private static readonly byte[] S2 = new byte[] {
  411. 0x93, 0xd9, 0x9a, 0xb5, 0x98, 0x22, 0x45, 0xfc, 0xba, 0x6a, 0xdf, 0x02, 0x9f, 0xdc, 0x51, 0x59,
  412. 0x4a, 0x17, 0x2b, 0xc2, 0x94, 0xf4, 0xbb, 0xa3, 0x62, 0xe4, 0x71, 0xd4, 0xcd, 0x70, 0x16, 0xe1,
  413. 0x49, 0x3c, 0xc0, 0xd8, 0x5c, 0x9b, 0xad, 0x85, 0x53, 0xa1, 0x7a, 0xc8, 0x2d, 0xe0, 0xd1, 0x72,
  414. 0xa6, 0x2c, 0xc4, 0xe3, 0x76, 0x78, 0xb7, 0xb4, 0x09, 0x3b, 0x0e, 0x41, 0x4c, 0xde, 0xb2, 0x90,
  415. 0x25, 0xa5, 0xd7, 0x03, 0x11, 0x00, 0xc3, 0x2e, 0x92, 0xef, 0x4e, 0x12, 0x9d, 0x7d, 0xcb, 0x35,
  416. 0x10, 0xd5, 0x4f, 0x9e, 0x4d, 0xa9, 0x55, 0xc6, 0xd0, 0x7b, 0x18, 0x97, 0xd3, 0x36, 0xe6, 0x48,
  417. 0x56, 0x81, 0x8f, 0x77, 0xcc, 0x9c, 0xb9, 0xe2, 0xac, 0xb8, 0x2f, 0x15, 0xa4, 0x7c, 0xda, 0x38,
  418. 0x1e, 0x0b, 0x05, 0xd6, 0x14, 0x6e, 0x6c, 0x7e, 0x66, 0xfd, 0xb1, 0xe5, 0x60, 0xaf, 0x5e, 0x33,
  419. 0x87, 0xc9, 0xf0, 0x5d, 0x6d, 0x3f, 0x88, 0x8d, 0xc7, 0xf7, 0x1d, 0xe9, 0xec, 0xed, 0x80, 0x29,
  420. 0x27, 0xcf, 0x99, 0xa8, 0x50, 0x0f, 0x37, 0x24, 0x28, 0x30, 0x95, 0xd2, 0x3e, 0x5b, 0x40, 0x83,
  421. 0xb3, 0x69, 0x57, 0x1f, 0x07, 0x1c, 0x8a, 0xbc, 0x20, 0xeb, 0xce, 0x8e, 0xab, 0xee, 0x31, 0xa2,
  422. 0x73, 0xf9, 0xca, 0x3a, 0x1a, 0xfb, 0x0d, 0xc1, 0xfe, 0xfa, 0xf2, 0x6f, 0xbd, 0x96, 0xdd, 0x43,
  423. 0x52, 0xb6, 0x08, 0xf3, 0xae, 0xbe, 0x19, 0x89, 0x32, 0x26, 0xb0, 0xea, 0x4b, 0x64, 0x84, 0x82,
  424. 0x6b, 0xf5, 0x79, 0xbf, 0x01, 0x5f, 0x75, 0x63, 0x1b, 0x23, 0x3d, 0x68, 0x2a, 0x65, 0xe8, 0x91,
  425. 0xf6, 0xff, 0x13, 0x58, 0xf1, 0x47, 0x0a, 0x7f, 0xc5, 0xa7, 0xe7, 0x61, 0x5a, 0x06, 0x46, 0x44,
  426. 0x42, 0x04, 0xa0, 0xdb, 0x39, 0x86, 0x54, 0xaa, 0x8c, 0x34, 0x21, 0x8b, 0xf8, 0x0c, 0x74, 0x67
  427. };
  428. private static readonly byte[] S3 = new byte[] {
  429. 0x68, 0x8d, 0xca, 0x4d, 0x73, 0x4b, 0x4e, 0x2a, 0xd4, 0x52, 0x26, 0xb3, 0x54, 0x1e, 0x19, 0x1f,
  430. 0x22, 0x03, 0x46, 0x3d, 0x2d, 0x4a, 0x53, 0x83, 0x13, 0x8a, 0xb7, 0xd5, 0x25, 0x79, 0xf5, 0xbd,
  431. 0x58, 0x2f, 0x0d, 0x02, 0xed, 0x51, 0x9e, 0x11, 0xf2, 0x3e, 0x55, 0x5e, 0xd1, 0x16, 0x3c, 0x66,
  432. 0x70, 0x5d, 0xf3, 0x45, 0x40, 0xcc, 0xe8, 0x94, 0x56, 0x08, 0xce, 0x1a, 0x3a, 0xd2, 0xe1, 0xdf,
  433. 0xb5, 0x38, 0x6e, 0x0e, 0xe5, 0xf4, 0xf9, 0x86, 0xe9, 0x4f, 0xd6, 0x85, 0x23, 0xcf, 0x32, 0x99,
  434. 0x31, 0x14, 0xae, 0xee, 0xc8, 0x48, 0xd3, 0x30, 0xa1, 0x92, 0x41, 0xb1, 0x18, 0xc4, 0x2c, 0x71,
  435. 0x72, 0x44, 0x15, 0xfd, 0x37, 0xbe, 0x5f, 0xaa, 0x9b, 0x88, 0xd8, 0xab, 0x89, 0x9c, 0xfa, 0x60,
  436. 0xea, 0xbc, 0x62, 0x0c, 0x24, 0xa6, 0xa8, 0xec, 0x67, 0x20, 0xdb, 0x7c, 0x28, 0xdd, 0xac, 0x5b,
  437. 0x34, 0x7e, 0x10, 0xf1, 0x7b, 0x8f, 0x63, 0xa0, 0x05, 0x9a, 0x43, 0x77, 0x21, 0xbf, 0x27, 0x09,
  438. 0xc3, 0x9f, 0xb6, 0xd7, 0x29, 0xc2, 0xeb, 0xc0, 0xa4, 0x8b, 0x8c, 0x1d, 0xfb, 0xff, 0xc1, 0xb2,
  439. 0x97, 0x2e, 0xf8, 0x65, 0xf6, 0x75, 0x07, 0x04, 0x49, 0x33, 0xe4, 0xd9, 0xb9, 0xd0, 0x42, 0xc7,
  440. 0x6c, 0x90, 0x00, 0x8e, 0x6f, 0x50, 0x01, 0xc5, 0xda, 0x47, 0x3f, 0xcd, 0x69, 0xa2, 0xe2, 0x7a,
  441. 0xa7, 0xc6, 0x93, 0x0f, 0x0a, 0x06, 0xe6, 0x2b, 0x96, 0xa3, 0x1c, 0xaf, 0x6a, 0x12, 0x84, 0x39,
  442. 0xe7, 0xb0, 0x82, 0xf7, 0xfe, 0x9d, 0x87, 0x5c, 0x81, 0x35, 0xde, 0xb4, 0xa5, 0xfc, 0x80, 0xef,
  443. 0xcb, 0xbb, 0x6b, 0x76, 0xba, 0x5a, 0x7d, 0x78, 0x0b, 0x95, 0xe3, 0xad, 0x74, 0x98, 0x3b, 0x36,
  444. 0x64, 0x6d, 0xdc, 0xf0, 0x59, 0xa9, 0x4c, 0x17, 0x7f, 0x91, 0xb8, 0xc9, 0x57, 0x1b, 0xe0, 0x61
  445. };
  446. public virtual IMemoable Copy()
  447. {
  448. return new Dstu7564Digest(this);
  449. }
  450. public virtual void Reset(IMemoable other)
  451. {
  452. Dstu7564Digest d = (Dstu7564Digest)other;
  453. CopyIn(d);
  454. }
  455. }
  456. }
  457. #pragma warning restore
  458. #endif