RipeMD320Digest.cs 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463
  1. #if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
  2. #pragma warning disable
  3. using System;
  4. using BestHTTP.SecureProtocol.Org.BouncyCastle.Utilities;
  5. namespace BestHTTP.SecureProtocol.Org.BouncyCastle.Crypto.Digests
  6. {
  7. /// <remarks>
  8. /// <p>Implementation of RipeMD 320.</p>
  9. /// <p><b>Note:</b> this algorithm offers the same level of security as RipeMD160.</p>
  10. /// </remarks>
  11. public class RipeMD320Digest
  12. : GeneralDigest
  13. {
  14. public override string AlgorithmName
  15. {
  16. get { return "RIPEMD320"; }
  17. }
  18. public override int GetDigestSize()
  19. {
  20. return DigestLength;
  21. }
  22. private const int DigestLength = 40;
  23. private int H0, H1, H2, H3, H4, H5, H6, H7, H8, H9; // IV's
  24. private int[] X = new int[16];
  25. private int xOff;
  26. /// <summary> Standard constructor</summary>
  27. public RipeMD320Digest()
  28. {
  29. Reset();
  30. }
  31. /// <summary> Copy constructor. This will copy the state of the provided
  32. /// message digest.
  33. /// </summary>
  34. public RipeMD320Digest(RipeMD320Digest t)
  35. : base(t)
  36. {
  37. CopyIn(t);
  38. }
  39. private void CopyIn(RipeMD320Digest t)
  40. {
  41. base.CopyIn(t);
  42. H0 = t.H0;
  43. H1 = t.H1;
  44. H2 = t.H2;
  45. H3 = t.H3;
  46. H4 = t.H4;
  47. H5 = t.H5;
  48. H6 = t.H6;
  49. H7 = t.H7;
  50. H8 = t.H8;
  51. H9 = t.H9;
  52. Array.Copy(t.X, 0, X, 0, t.X.Length);
  53. xOff = t.xOff;
  54. }
  55. internal override void ProcessWord(
  56. byte[] input,
  57. int inOff)
  58. {
  59. X[xOff++] = (input[inOff] & 0xff) | ((input[inOff + 1] & 0xff) << 8)
  60. | ((input[inOff + 2] & 0xff) << 16) | ((input[inOff + 3] & 0xff) << 24);
  61. if (xOff == 16)
  62. {
  63. ProcessBlock();
  64. }
  65. }
  66. internal override void ProcessLength(
  67. long bitLength)
  68. {
  69. if (xOff > 14)
  70. {
  71. ProcessBlock();
  72. }
  73. X[14] = (int)(bitLength & 0xffffffff);
  74. X[15] = (int)((ulong)bitLength >> 32);
  75. }
  76. private void UnpackWord(
  77. int word,
  78. byte[] outBytes,
  79. int outOff)
  80. {
  81. outBytes[outOff] = (byte)word;
  82. outBytes[outOff + 1] = (byte)((uint)word >> 8);
  83. outBytes[outOff + 2] = (byte)((uint)word >> 16);
  84. outBytes[outOff + 3] = (byte)((uint)word >> 24);
  85. }
  86. public override int DoFinal(byte[] output, int outOff)
  87. {
  88. Finish();
  89. UnpackWord(H0, output, outOff);
  90. UnpackWord(H1, output, outOff + 4);
  91. UnpackWord(H2, output, outOff + 8);
  92. UnpackWord(H3, output, outOff + 12);
  93. UnpackWord(H4, output, outOff + 16);
  94. UnpackWord(H5, output, outOff + 20);
  95. UnpackWord(H6, output, outOff + 24);
  96. UnpackWord(H7, output, outOff + 28);
  97. UnpackWord(H8, output, outOff + 32);
  98. UnpackWord(H9, output, outOff + 36);
  99. Reset();
  100. return DigestLength;
  101. }
  102. /// <summary> reset the chaining variables to the IV values.</summary>
  103. public override void Reset()
  104. {
  105. base.Reset();
  106. H0 = unchecked((int) 0x67452301);
  107. H1 = unchecked((int) 0xefcdab89);
  108. H2 = unchecked((int) 0x98badcfe);
  109. H3 = unchecked((int) 0x10325476);
  110. H4 = unchecked((int) 0xc3d2e1f0);
  111. H5 = unchecked((int) 0x76543210);
  112. H6 = unchecked((int) 0xFEDCBA98);
  113. H7 = unchecked((int) 0x89ABCDEF);
  114. H8 = unchecked((int) 0x01234567);
  115. H9 = unchecked((int) 0x3C2D1E0F);
  116. xOff = 0;
  117. for (int i = 0; i != X.Length; i++)
  118. {
  119. X[i] = 0;
  120. }
  121. }
  122. /*
  123. * rotate int x left n bits.
  124. */
  125. private int RL(
  126. int x,
  127. int n)
  128. {
  129. return (x << n) | (int)(((uint)x) >> (32 - n));
  130. }
  131. /*
  132. * f1,f2,f3,f4,f5 are the basic RipeMD160 functions.
  133. */
  134. /*
  135. * rounds 0-15
  136. */
  137. private int F1(int x, int y, int z)
  138. {
  139. return x ^ y ^ z;
  140. }
  141. /*
  142. * rounds 16-31
  143. */
  144. private int F2(int x, int y, int z)
  145. {
  146. return (x & y) | (~ x & z);
  147. }
  148. /*
  149. * rounds 32-47
  150. */
  151. private int F3(int x, int y, int z)
  152. {
  153. return (x | ~ y) ^ z;
  154. }
  155. /*
  156. * rounds 48-63
  157. */
  158. private int F4(int x, int y, int z)
  159. {
  160. return (x & z) | (y & ~ z);
  161. }
  162. /*
  163. * rounds 64-79
  164. */
  165. private int F5(int x, int y, int z)
  166. {
  167. return x ^ (y | ~z);
  168. }
  169. internal override void ProcessBlock()
  170. {
  171. int a, aa;
  172. int b, bb;
  173. int c, cc;
  174. int d, dd;
  175. int e, ee;
  176. int t;
  177. a = H0;
  178. b = H1;
  179. c = H2;
  180. d = H3;
  181. e = H4;
  182. aa = H5;
  183. bb = H6;
  184. cc = H7;
  185. dd = H8;
  186. ee = H9;
  187. //
  188. // Rounds 1 - 16
  189. //
  190. // left
  191. a = RL(a + F1(b, c, d) + X[0], 11) + e; c = RL(c, 10);
  192. e = RL(e + F1(a, b, c) + X[1], 14) + d; b = RL(b, 10);
  193. d = RL(d + F1(e, a, b) + X[2], 15) + c; a = RL(a, 10);
  194. c = RL(c + F1(d, e, a) + X[3], 12) + b; e = RL(e, 10);
  195. b = RL(b + F1(c, d, e) + X[4], 5) + a; d = RL(d, 10);
  196. a = RL(a + F1(b, c, d) + X[5], 8) + e; c = RL(c, 10);
  197. e = RL(e + F1(a, b, c) + X[6], 7) + d; b = RL(b, 10);
  198. d = RL(d + F1(e, a, b) + X[7], 9) + c; a = RL(a, 10);
  199. c = RL(c + F1(d, e, a) + X[8], 11) + b; e = RL(e, 10);
  200. b = RL(b + F1(c, d, e) + X[9], 13) + a; d = RL(d, 10);
  201. a = RL(a + F1(b, c, d) + X[10], 14) + e; c = RL(c, 10);
  202. e = RL(e + F1(a, b, c) + X[11], 15) + d; b = RL(b, 10);
  203. d = RL(d + F1(e, a, b) + X[12], 6) + c; a = RL(a, 10);
  204. c = RL(c + F1(d, e, a) + X[13], 7) + b; e = RL(e, 10);
  205. b = RL(b + F1(c, d, e) + X[14], 9) + a; d = RL(d, 10);
  206. a = RL(a + F1(b, c, d) + X[15], 8) + e; c = RL(c, 10);
  207. // right
  208. aa = RL(aa + F5(bb, cc, dd) + X[5] + unchecked((int)0x50a28be6), 8) + ee; cc = RL(cc, 10);
  209. ee = RL(ee + F5(aa, bb, cc) + X[14] + unchecked((int)0x50a28be6), 9) + dd; bb = RL(bb, 10);
  210. dd = RL(dd + F5(ee, aa, bb) + X[7] + unchecked((int)0x50a28be6), 9) + cc; aa = RL(aa, 10);
  211. cc = RL(cc + F5(dd, ee, aa) + X[0] + unchecked((int)0x50a28be6), 11) + bb; ee = RL(ee, 10);
  212. bb = RL(bb + F5(cc, dd, ee) + X[9] + unchecked((int)0x50a28be6), 13) + aa; dd = RL(dd, 10);
  213. aa = RL(aa + F5(bb, cc, dd) + X[2] + unchecked((int)0x50a28be6), 15) + ee; cc = RL(cc, 10);
  214. ee = RL(ee + F5(aa, bb, cc) + X[11] + unchecked((int)0x50a28be6), 15) + dd; bb = RL(bb, 10);
  215. dd = RL(dd + F5(ee, aa, bb) + X[4] + unchecked((int)0x50a28be6), 5) + cc; aa = RL(aa, 10);
  216. cc = RL(cc + F5(dd, ee, aa) + X[13] + unchecked((int)0x50a28be6), 7) + bb; ee = RL(ee, 10);
  217. bb = RL(bb + F5(cc, dd, ee) + X[6] + unchecked((int)0x50a28be6), 7) + aa; dd = RL(dd, 10);
  218. aa = RL(aa + F5(bb, cc, dd) + X[15] + unchecked((int)0x50a28be6), 8) + ee; cc = RL(cc, 10);
  219. ee = RL(ee + F5(aa, bb, cc) + X[8] + unchecked((int)0x50a28be6), 11) + dd; bb = RL(bb, 10);
  220. dd = RL(dd + F5(ee, aa, bb) + X[1] + unchecked((int)0x50a28be6), 14) + cc; aa = RL(aa, 10);
  221. cc = RL(cc + F5(dd, ee, aa) + X[10] + unchecked((int)0x50a28be6), 14) + bb; ee = RL(ee, 10);
  222. bb = RL(bb + F5(cc, dd, ee) + X[3] + unchecked((int)0x50a28be6), 12) + aa; dd = RL(dd, 10);
  223. aa = RL(aa + F5(bb, cc, dd) + X[12] + unchecked((int)0x50a28be6), 6) + ee; cc = RL(cc, 10);
  224. t = a; a = aa; aa = t;
  225. //
  226. // Rounds 16-31
  227. //
  228. // left
  229. e = RL(e + F2(a, b, c) + X[7] + unchecked((int)0x5a827999), 7) + d; b = RL(b, 10);
  230. d = RL(d + F2(e, a, b) + X[4] + unchecked((int)0x5a827999), 6) + c; a = RL(a, 10);
  231. c = RL(c + F2(d, e, a) + X[13] + unchecked((int)0x5a827999), 8) + b; e = RL(e, 10);
  232. b = RL(b + F2(c, d, e) + X[1] + unchecked((int)0x5a827999), 13) + a; d = RL(d, 10);
  233. a = RL(a + F2(b, c, d) + X[10] + unchecked((int)0x5a827999), 11) + e; c = RL(c, 10);
  234. e = RL(e + F2(a, b, c) + X[6] + unchecked((int)0x5a827999), 9) + d; b = RL(b, 10);
  235. d = RL(d + F2(e, a, b) + X[15] + unchecked((int)0x5a827999), 7) + c; a = RL(a, 10);
  236. c = RL(c + F2(d, e, a) + X[3] + unchecked((int)0x5a827999), 15) + b; e = RL(e, 10);
  237. b = RL(b + F2(c, d, e) + X[12] + unchecked((int)0x5a827999), 7) + a; d = RL(d, 10);
  238. a = RL(a + F2(b, c, d) + X[0] + unchecked((int)0x5a827999), 12) + e; c = RL(c, 10);
  239. e = RL(e + F2(a, b, c) + X[9] + unchecked((int)0x5a827999), 15) + d; b = RL(b, 10);
  240. d = RL(d + F2(e, a, b) + X[5] + unchecked((int)0x5a827999), 9) + c; a = RL(a, 10);
  241. c = RL(c + F2(d, e, a) + X[2] + unchecked((int)0x5a827999), 11) + b; e = RL(e, 10);
  242. b = RL(b + F2(c, d, e) + X[14] + unchecked((int)0x5a827999), 7) + a; d = RL(d, 10);
  243. a = RL(a + F2(b, c, d) + X[11] + unchecked((int)0x5a827999), 13) + e; c = RL(c, 10);
  244. e = RL(e + F2(a, b, c) + X[8] + unchecked((int)0x5a827999), 12) + d; b = RL(b, 10);
  245. // right
  246. ee = RL(ee + F4(aa, bb, cc) + X[6] + unchecked((int)0x5c4dd124), 9) + dd; bb = RL(bb, 10);
  247. dd = RL(dd + F4(ee, aa, bb) + X[11] + unchecked((int)0x5c4dd124), 13) + cc; aa = RL(aa, 10);
  248. cc = RL(cc + F4(dd, ee, aa) + X[3] + unchecked((int)0x5c4dd124), 15) + bb; ee = RL(ee, 10);
  249. bb = RL(bb + F4(cc, dd, ee) + X[7] + unchecked((int)0x5c4dd124), 7) + aa; dd = RL(dd, 10);
  250. aa = RL(aa + F4(bb, cc, dd) + X[0] + unchecked((int)0x5c4dd124), 12) + ee; cc = RL(cc, 10);
  251. ee = RL(ee + F4(aa, bb, cc) + X[13] + unchecked((int)0x5c4dd124), 8) + dd; bb = RL(bb, 10);
  252. dd = RL(dd + F4(ee, aa, bb) + X[5] + unchecked((int)0x5c4dd124), 9) + cc; aa = RL(aa, 10);
  253. cc = RL(cc + F4(dd, ee, aa) + X[10] + unchecked((int)0x5c4dd124), 11) + bb; ee = RL(ee, 10);
  254. bb = RL(bb + F4(cc, dd, ee) + X[14] + unchecked((int)0x5c4dd124), 7) + aa; dd = RL(dd, 10);
  255. aa = RL(aa + F4(bb, cc, dd) + X[15] + unchecked((int)0x5c4dd124), 7) + ee; cc = RL(cc, 10);
  256. ee = RL(ee + F4(aa, bb, cc) + X[8] + unchecked((int)0x5c4dd124), 12) + dd; bb = RL(bb, 10);
  257. dd = RL(dd + F4(ee, aa, bb) + X[12] + unchecked((int)0x5c4dd124), 7) + cc; aa = RL(aa, 10);
  258. cc = RL(cc + F4(dd, ee, aa) + X[4] + unchecked((int)0x5c4dd124), 6) + bb; ee = RL(ee, 10);
  259. bb = RL(bb + F4(cc, dd, ee) + X[9] + unchecked((int)0x5c4dd124), 15) + aa; dd = RL(dd, 10);
  260. aa = RL(aa + F4(bb, cc, dd) + X[1] + unchecked((int)0x5c4dd124), 13) + ee; cc = RL(cc, 10);
  261. ee = RL(ee + F4(aa, bb, cc) + X[2] + unchecked((int)0x5c4dd124), 11) + dd; bb = RL(bb, 10);
  262. t = b; b = bb; bb = t;
  263. //
  264. // Rounds 32-47
  265. //
  266. // left
  267. d = RL(d + F3(e, a, b) + X[3] + unchecked((int)0x6ed9eba1), 11) + c; a = RL(a, 10);
  268. c = RL(c + F3(d, e, a) + X[10] + unchecked((int)0x6ed9eba1), 13) + b; e = RL(e, 10);
  269. b = RL(b + F3(c, d, e) + X[14] + unchecked((int)0x6ed9eba1), 6) + a; d = RL(d, 10);
  270. a = RL(a + F3(b, c, d) + X[4] + unchecked((int)0x6ed9eba1), 7) + e; c = RL(c, 10);
  271. e = RL(e + F3(a, b, c) + X[9] + unchecked((int)0x6ed9eba1), 14) + d; b = RL(b, 10);
  272. d = RL(d + F3(e, a, b) + X[15] + unchecked((int)0x6ed9eba1), 9) + c; a = RL(a, 10);
  273. c = RL(c + F3(d, e, a) + X[8] + unchecked((int)0x6ed9eba1), 13) + b; e = RL(e, 10);
  274. b = RL(b + F3(c, d, e) + X[1] + unchecked((int)0x6ed9eba1), 15) + a; d = RL(d, 10);
  275. a = RL(a + F3(b, c, d) + X[2] + unchecked((int)0x6ed9eba1), 14) + e; c = RL(c, 10);
  276. e = RL(e + F3(a, b, c) + X[7] + unchecked((int)0x6ed9eba1), 8) + d; b = RL(b, 10);
  277. d = RL(d + F3(e, a, b) + X[0] + unchecked((int)0x6ed9eba1), 13) + c; a = RL(a, 10);
  278. c = RL(c + F3(d, e, a) + X[6] + unchecked((int)0x6ed9eba1), 6) + b; e = RL(e, 10);
  279. b = RL(b + F3(c, d, e) + X[13] + unchecked((int)0x6ed9eba1), 5) + a; d = RL(d, 10);
  280. a = RL(a + F3(b, c, d) + X[11] + unchecked((int)0x6ed9eba1), 12) + e; c = RL(c, 10);
  281. e = RL(e + F3(a, b, c) + X[5] + unchecked((int)0x6ed9eba1), 7) + d; b = RL(b, 10);
  282. d = RL(d + F3(e, a, b) + X[12] + unchecked((int)0x6ed9eba1), 5) + c; a = RL(a, 10);
  283. // right
  284. dd = RL(dd + F3(ee, aa, bb) + X[15] + unchecked((int)0x6d703ef3), 9) + cc; aa = RL(aa, 10);
  285. cc = RL(cc + F3(dd, ee, aa) + X[5] + unchecked((int)0x6d703ef3), 7) + bb; ee = RL(ee, 10);
  286. bb = RL(bb + F3(cc, dd, ee) + X[1] + unchecked((int)0x6d703ef3), 15) + aa; dd = RL(dd, 10);
  287. aa = RL(aa + F3(bb, cc, dd) + X[3] + unchecked((int)0x6d703ef3), 11) + ee; cc = RL(cc, 10);
  288. ee = RL(ee + F3(aa, bb, cc) + X[7] + unchecked((int)0x6d703ef3), 8) + dd; bb = RL(bb, 10);
  289. dd = RL(dd + F3(ee, aa, bb) + X[14] + unchecked((int)0x6d703ef3), 6) + cc; aa = RL(aa, 10);
  290. cc = RL(cc + F3(dd, ee, aa) + X[6] + unchecked((int)0x6d703ef3), 6) + bb; ee = RL(ee, 10);
  291. bb = RL(bb + F3(cc, dd, ee) + X[9] + unchecked((int)0x6d703ef3), 14) + aa; dd = RL(dd, 10);
  292. aa = RL(aa + F3(bb, cc, dd) + X[11] + unchecked((int)0x6d703ef3), 12) + ee; cc = RL(cc, 10);
  293. ee = RL(ee + F3(aa, bb, cc) + X[8] + unchecked((int)0x6d703ef3), 13) + dd; bb = RL(bb, 10);
  294. dd = RL(dd + F3(ee, aa, bb) + X[12] + unchecked((int)0x6d703ef3), 5) + cc; aa = RL(aa, 10);
  295. cc = RL(cc + F3(dd, ee, aa) + X[2] + unchecked((int)0x6d703ef3), 14) + bb; ee = RL(ee, 10);
  296. bb = RL(bb + F3(cc, dd, ee) + X[10] + unchecked((int)0x6d703ef3), 13) + aa; dd = RL(dd, 10);
  297. aa = RL(aa + F3(bb, cc, dd) + X[0] + unchecked((int)0x6d703ef3), 13) + ee; cc = RL(cc, 10);
  298. ee = RL(ee + F3(aa, bb, cc) + X[4] + unchecked((int)0x6d703ef3), 7) + dd; bb = RL(bb, 10);
  299. dd = RL(dd + F3(ee, aa, bb) + X[13] + unchecked((int)0x6d703ef3), 5) + cc; aa = RL(aa, 10);
  300. t = c; c = cc; cc = t;
  301. //
  302. // Rounds 48-63
  303. //
  304. // left
  305. c = RL(c + F4(d, e, a) + X[1] + unchecked((int)0x8f1bbcdc), 11) + b; e = RL(e, 10);
  306. b = RL(b + F4(c, d, e) + X[9] + unchecked((int)0x8f1bbcdc), 12) + a; d = RL(d, 10);
  307. a = RL(a + F4(b, c, d) + X[11] + unchecked((int)0x8f1bbcdc), 14) + e; c = RL(c, 10);
  308. e = RL(e + F4(a, b, c) + X[10] + unchecked((int)0x8f1bbcdc), 15) + d; b = RL(b, 10);
  309. d = RL(d + F4(e, a, b) + X[0] + unchecked((int)0x8f1bbcdc), 14) + c; a = RL(a, 10);
  310. c = RL(c + F4(d, e, a) + X[8] + unchecked((int)0x8f1bbcdc), 15) + b; e = RL(e, 10);
  311. b = RL(b + F4(c, d, e) + X[12] + unchecked((int)0x8f1bbcdc), 9) + a; d = RL(d, 10);
  312. a = RL(a + F4(b, c, d) + X[4] + unchecked((int)0x8f1bbcdc), 8) + e; c = RL(c, 10);
  313. e = RL(e + F4(a, b, c) + X[13] + unchecked((int)0x8f1bbcdc), 9) + d; b = RL(b, 10);
  314. d = RL(d + F4(e, a, b) + X[3] + unchecked((int)0x8f1bbcdc), 14) + c; a = RL(a, 10);
  315. c = RL(c + F4(d, e, a) + X[7] + unchecked((int)0x8f1bbcdc), 5) + b; e = RL(e, 10);
  316. b = RL(b + F4(c, d, e) + X[15] + unchecked((int)0x8f1bbcdc), 6) + a; d = RL(d, 10);
  317. a = RL(a + F4(b, c, d) + X[14] + unchecked((int)0x8f1bbcdc), 8) + e; c = RL(c, 10);
  318. e = RL(e + F4(a, b, c) + X[5] + unchecked((int)0x8f1bbcdc), 6) + d; b = RL(b, 10);
  319. d = RL(d + F4(e, a, b) + X[6] + unchecked((int)0x8f1bbcdc), 5) + c; a = RL(a, 10);
  320. c = RL(c + F4(d, e, a) + X[2] + unchecked((int)0x8f1bbcdc), 12) + b; e = RL(e, 10);
  321. // right
  322. cc = RL(cc + F2(dd, ee, aa) + X[8] + unchecked((int)0x7a6d76e9), 15) + bb; ee = RL(ee, 10);
  323. bb = RL(bb + F2(cc, dd, ee) + X[6] + unchecked((int)0x7a6d76e9), 5) + aa; dd = RL(dd, 10);
  324. aa = RL(aa + F2(bb, cc, dd) + X[4] + unchecked((int)0x7a6d76e9), 8) + ee; cc = RL(cc, 10);
  325. ee = RL(ee + F2(aa, bb, cc) + X[1] + unchecked((int)0x7a6d76e9), 11) + dd; bb = RL(bb, 10);
  326. dd = RL(dd + F2(ee, aa, bb) + X[3] + unchecked((int)0x7a6d76e9), 14) + cc; aa = RL(aa, 10);
  327. cc = RL(cc + F2(dd, ee, aa) + X[11] + unchecked((int)0x7a6d76e9), 14) + bb; ee = RL(ee, 10);
  328. bb = RL(bb + F2(cc, dd, ee) + X[15] + unchecked((int)0x7a6d76e9), 6) + aa; dd = RL(dd, 10);
  329. aa = RL(aa + F2(bb, cc, dd) + X[0] + unchecked((int)0x7a6d76e9), 14) + ee; cc = RL(cc, 10);
  330. ee = RL(ee + F2(aa, bb, cc) + X[5] + unchecked((int)0x7a6d76e9), 6) + dd; bb = RL(bb, 10);
  331. dd = RL(dd + F2(ee, aa, bb) + X[12] + unchecked((int)0x7a6d76e9), 9) + cc; aa = RL(aa, 10);
  332. cc = RL(cc + F2(dd, ee, aa) + X[2] + unchecked((int)0x7a6d76e9), 12) + bb; ee = RL(ee, 10);
  333. bb = RL(bb + F2(cc, dd, ee) + X[13] + unchecked((int)0x7a6d76e9), 9) + aa; dd = RL(dd, 10);
  334. aa = RL(aa + F2(bb, cc, dd) + X[9] + unchecked((int)0x7a6d76e9), 12) + ee; cc = RL(cc, 10);
  335. ee = RL(ee + F2(aa, bb, cc) + X[7] + unchecked((int)0x7a6d76e9), 5) + dd; bb = RL(bb, 10);
  336. dd = RL(dd + F2(ee, aa, bb) + X[10] + unchecked((int)0x7a6d76e9), 15) + cc; aa = RL(aa, 10);
  337. cc = RL(cc + F2(dd, ee, aa) + X[14] + unchecked((int)0x7a6d76e9), 8) + bb; ee = RL(ee, 10);
  338. t = d; d = dd; dd = t;
  339. //
  340. // Rounds 64-79
  341. //
  342. // left
  343. b = RL(b + F5(c, d, e) + X[4] + unchecked((int)0xa953fd4e), 9) + a; d = RL(d, 10);
  344. a = RL(a + F5(b, c, d) + X[0] + unchecked((int)0xa953fd4e), 15) + e; c = RL(c, 10);
  345. e = RL(e + F5(a, b, c) + X[5] + unchecked((int)0xa953fd4e), 5) + d; b = RL(b, 10);
  346. d = RL(d + F5(e, a, b) + X[9] + unchecked((int)0xa953fd4e), 11) + c; a = RL(a, 10);
  347. c = RL(c + F5(d, e, a) + X[7] + unchecked((int)0xa953fd4e), 6) + b; e = RL(e, 10);
  348. b = RL(b + F5(c, d, e) + X[12] + unchecked((int)0xa953fd4e), 8) + a; d = RL(d, 10);
  349. a = RL(a + F5(b, c, d) + X[2] + unchecked((int)0xa953fd4e), 13) + e; c = RL(c, 10);
  350. e = RL(e + F5(a, b, c) + X[10] + unchecked((int)0xa953fd4e), 12) + d; b = RL(b, 10);
  351. d = RL(d + F5(e, a, b) + X[14] + unchecked((int)0xa953fd4e), 5) + c; a = RL(a, 10);
  352. c = RL(c + F5(d, e, a) + X[1] + unchecked((int)0xa953fd4e), 12) + b; e = RL(e, 10);
  353. b = RL(b + F5(c, d, e) + X[3] + unchecked((int)0xa953fd4e), 13) + a; d = RL(d, 10);
  354. a = RL(a + F5(b, c, d) + X[8] + unchecked((int)0xa953fd4e), 14) + e; c = RL(c, 10);
  355. e = RL(e + F5(a, b, c) + X[11] + unchecked((int)0xa953fd4e), 11) + d; b = RL(b, 10);
  356. d = RL(d + F5(e, a, b) + X[6] + unchecked((int)0xa953fd4e), 8) + c; a = RL(a, 10);
  357. c = RL(c + F5(d, e, a) + X[15] + unchecked((int)0xa953fd4e), 5) + b; e = RL(e, 10);
  358. b = RL(b + F5(c, d, e) + X[13] + unchecked((int)0xa953fd4e), 6) + a; d = RL(d, 10);
  359. // right
  360. bb = RL(bb + F1(cc, dd, ee) + X[12], 8) + aa; dd = RL(dd, 10);
  361. aa = RL(aa + F1(bb, cc, dd) + X[15], 5) + ee; cc = RL(cc, 10);
  362. ee = RL(ee + F1(aa, bb, cc) + X[10], 12) + dd; bb = RL(bb, 10);
  363. dd = RL(dd + F1(ee, aa, bb) + X[4], 9) + cc; aa = RL(aa, 10);
  364. cc = RL(cc + F1(dd, ee, aa) + X[1], 12) + bb; ee = RL(ee, 10);
  365. bb = RL(bb + F1(cc, dd, ee) + X[5], 5) + aa; dd = RL(dd, 10);
  366. aa = RL(aa + F1(bb, cc, dd) + X[8], 14) + ee; cc = RL(cc, 10);
  367. ee = RL(ee + F1(aa, bb, cc) + X[7], 6) + dd; bb = RL(bb, 10);
  368. dd = RL(dd + F1(ee, aa, bb) + X[6], 8) + cc; aa = RL(aa, 10);
  369. cc = RL(cc + F1(dd, ee, aa) + X[2], 13) + bb; ee = RL(ee, 10);
  370. bb = RL(bb + F1(cc, dd, ee) + X[13], 6) + aa; dd = RL(dd, 10);
  371. aa = RL(aa + F1(bb, cc, dd) + X[14], 5) + ee; cc = RL(cc, 10);
  372. ee = RL(ee + F1(aa, bb, cc) + X[0], 15) + dd; bb = RL(bb, 10);
  373. dd = RL(dd + F1(ee, aa, bb) + X[3], 13) + cc; aa = RL(aa, 10);
  374. cc = RL(cc + F1(dd, ee, aa) + X[9], 11) + bb; ee = RL(ee, 10);
  375. bb = RL(bb + F1(cc, dd, ee) + X[11], 11) + aa; dd = RL(dd, 10);
  376. //
  377. // do (e, ee) swap as part of assignment.
  378. //
  379. H0 += a;
  380. H1 += b;
  381. H2 += c;
  382. H3 += d;
  383. H4 += ee;
  384. H5 += aa;
  385. H6 += bb;
  386. H7 += cc;
  387. H8 += dd;
  388. H9 += e;
  389. //
  390. // reset the offset and clean out the word buffer.
  391. //
  392. xOff = 0;
  393. for (int i = 0; i != X.Length; i++)
  394. {
  395. X[i] = 0;
  396. }
  397. }
  398. public override IMemoable Copy()
  399. {
  400. return new RipeMD320Digest(this);
  401. }
  402. public override void Reset(IMemoable other)
  403. {
  404. RipeMD320Digest d = (RipeMD320Digest)other;
  405. CopyIn(d);
  406. }
  407. }
  408. }
  409. #pragma warning restore
  410. #endif