IdHashMessageDigest.pas 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500
  1. { $HDR$}
  2. {**********************************************************************}
  3. { Unit archived using Team Coherence }
  4. { Team Coherence is Copyright 2002 by Quality Software Components }
  5. { }
  6. { For further information / comments, visit our WEB site at }
  7. { http://www.TeamCoherence.com }
  8. {**********************************************************************}
  9. {}
  10. { $Log: 10183: IdHashMessageDigest.pas
  11. {
  12. { Rev 1.0 2002.11.12 10:40:22 PM czhower
  13. }
  14. {
  15. Implementation of the MD2, MD4 and MD5 Message-Digest Algorithm
  16. as specified in RFC 1319 (1115), 1320 (1186), 1321
  17. (See NOTE below for details of what is exactly implemented)
  18. Author: Pete Mee
  19. Port to Indy 8.1 Doychin Bondzhev ([email protected])
  20. Copyright: (c) Chad Z. Hower and The Winshoes Working Group.
  21. NOTE:
  22. All MDx are ready and bug free.
  23. }
  24. unit IdHashMessageDigest;
  25. {
  26. 2002-Feb-07 Pete Me
  27. - Fixed MD4 and MD5 for cases where n mod 512 = 448 where n is the number of
  28. bits processed. An extra zero byte was being added to the input which
  29. offset the bit-size entry.
  30. 2001-Oct-24 Pete Mee
  31. - Fixed MD4 and MD5 for cases where n mod 512 >= 448 where n is the number of
  32. bits processed. This situation requires an additional block to be
  33. processed.
  34. }
  35. interface
  36. uses
  37. Classes,
  38. IdGlobal,
  39. IdHash;
  40. type
  41. T16x4LongWordRecord = array[0..15] of LongWord;
  42. T4x4x4LongWordRecord = array[0..3] of T4x4LongWordRecord;
  43. T384BitRecord = array [0..47] of byte;
  44. T128BitRecord = array [0..15] of byte;
  45. TIdHashMessageDigest = class(TIdHash128);
  46. TIdHashMessageDigest2 = class(TIdHashMessageDigest)
  47. protected
  48. FX: T384BitRecord;
  49. FCBuffer: T128BitRecord;
  50. FCheckSum: T128BitRecord;
  51. procedure MDCoder;
  52. procedure Reset;
  53. public
  54. function HashValue(AStream: TStream): T4x4LongWordRecord; override;
  55. end;
  56. TIdHashMessageDigest4 = class(TIdHashMessageDigest)
  57. protected
  58. FBuffer: T4x4LongWordRecord;
  59. FCBuffer: T16x4LongWordRecord;
  60. procedure MDCoder; virtual;
  61. function func_f(x, y, z : LongWord) : LongWord; virtual;
  62. function func_g(x, y, z : LongWord) : LongWord; virtual;
  63. function func_h(x, y, z : LongWord) : LongWord; virtual;
  64. public
  65. function HashValue(AStream: TStream): T4x4LongWordRecord; override;
  66. end;
  67. TIdHashMessageDigest5 = class(TIdHashMessageDigest4)
  68. protected
  69. procedure MDCoder; override;
  70. function func_g(x, y, z : LongWord) : LongWord; override;
  71. function func_i(x, y, z : LongWord) : LongWord; virtual;
  72. public
  73. end;
  74. implementation
  75. { TIdHashMessageDigest2 }
  76. const
  77. MD2_PI_SUBST : array [0..255] of byte = (
  78. 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240,
  79. 6, 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217,
  80. 188, 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66,
  81. 111, 24, 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73,
  82. 160, 251, 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178,
  83. 7, 63, 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154,
  84. 90, 144, 50, 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25,
  85. 48, 179, 72, 165, 181, 209, 215, 94, 146, 42, 172, 86, 170, 198,
  86. 79, 184, 56, 210, 150, 164, 125, 182, 118, 252, 107, 226, 156, 116,
  87. 4, 241, 69, 157, 112, 89, 100, 113, 135, 32, 134, 91, 207, 101,
  88. 230, 45, 168, 2, 27, 96, 37, 173, 174, 176, 185, 246, 28, 70,
  89. 97, 105, 52, 64, 126, 15, 85, 71, 163, 35, 221, 81, 175, 58,
  90. 195, 92, 249, 206, 186, 197, 234, 38, 44, 83, 13, 110, 133, 40,
  91. 132, 9, 211, 223, 205, 244, 65, 129, 77, 82, 106, 220, 55, 200,
  92. 108, 193, 171, 250, 36, 225, 123, 8, 12, 189, 177, 74, 120, 136,
  93. 149, 139, 227, 99, 232, 109, 233, 203, 213, 254, 59, 0, 29, 57,
  94. 242, 239, 183, 14, 102, 88, 208, 228, 166, 119, 114, 248, 235, 117,
  95. 75, 10, 49, 68, 80, 180, 143, 237, 31, 26, 219, 153, 141, 51,
  96. 159, 17, 131, 20);
  97. procedure TIdHashMessageDigest2.MDCoder;
  98. const
  99. NumRounds = 18;
  100. Var
  101. i, j: Byte;
  102. T: Word;
  103. LCheckSumScore: Byte;
  104. begin
  105. // Move the next 16 bytes into the second 16 bytes of X.
  106. Move(FCBuffer[0], FX[16], 16);
  107. for i := 0 to 15 do
  108. begin
  109. FX[i + 32] := FCBuffer[i] xor FX[i];
  110. end;
  111. { Do 18 rounds. }
  112. T := 0;
  113. for i := 0 to NumRounds - 1 do
  114. begin
  115. for j := 0 to 47 do
  116. begin
  117. T := FX[j] xor MD2_PI_SUBST[T];
  118. FX[j] := T and $FF;
  119. end;
  120. T := (T + i) and $FF;
  121. end;
  122. LCheckSumScore := FChecksum[15];
  123. for i := 0 to 15 do
  124. begin
  125. LCheckSumScore := FChecksum[i] xor MD2_PI_SUBST[FCBuffer[i]
  126. xor LCheckSumScore];
  127. FChecksum[i] := LCheckSumScore;
  128. end;
  129. end;
  130. // Clear Buffer and Checksum arrays
  131. procedure TIdHashMessageDigest2.Reset;
  132. begin
  133. FillChar(FCheckSum[0], 16, 0);
  134. FillChar(FCBuffer, 16, 0);
  135. // Initialise the X buffer to zero.
  136. FillChar(FX[0], 48, 0);
  137. end;
  138. function TIdHashMessageDigest2.HashValue(AStream: TStream): T4x4LongWordRecord;
  139. Var
  140. LStartPos: Integer;
  141. LSize: Int64;
  142. S1: String;
  143. begin
  144. Reset;
  145. LStartPos := AStream.Position;
  146. LSize := AStream.Size - LStartPos;
  147. // Code the entire file in complete 16-byte chunks.
  148. while LSize - AStream.Position >= SizeOf(FCBuffer) do
  149. begin
  150. AStream.Read(FCBuffer[0], SizeOf(FCBuffer));
  151. MDCoder;
  152. end;
  153. SetLength(S1, SizeOf(FCBuffer));
  154. LStartPos := AStream.Read(S1[1], 16);
  155. // Step 1
  156. FillChar(S1[LStartPos + 1], 16 - LStartPos, Byte(16 - LStartPos));
  157. Move(S1[1], FCBuffer[0], 16);
  158. MDCoder;
  159. // Step 2
  160. Move(FCheckSUm[0], FCBuffer[0], 16);
  161. MDCoder;
  162. Move(FX[0], result[0], 16);
  163. end;
  164. { TIdHashMessageDigest4 }
  165. const
  166. MD4_INIT_VALUES: T4x4LongWordRecord = (
  167. $67452301, $EFCDAB89, $98BADCFE, $10325476);
  168. procedure TIdHashMessageDigest4.MDCoder;
  169. var
  170. A, B, C, D, i : LongWord;
  171. I64 : Int64;
  172. buff : T4x4x4LongWordRecord; // 64-byte buffer
  173. function DoAdd(const AOne, ATwo, AThree, AFour : LongWord) : LongWord;
  174. begin
  175. I64 := AOne;
  176. I64 := ((I64 + ATwo) and $FFFFFFFF);
  177. I64 := ((I64 + AThree) and $FFFFFFFF) + AFour;
  178. result := I64 and $FFFFFFFF;
  179. end;
  180. begin
  181. A := FBuffer[0];
  182. B := FBuffer[1];
  183. C := FBuffer[2];
  184. D := FBuffer[3];
  185. System.Move(FCBuffer[0], buff[0], SizeOf(buff));
  186. // The following additions utilise Int64 to avoid integer overflow
  187. // Round 1
  188. for i := 0 to 3 do
  189. begin
  190. A := ROL(DoAdd(func_f(B, C, D), A, buff[i,0], 0), 3);
  191. D := ROL(DoAdd(func_f(A, B, C), D, buff[i,1], 0), 7);
  192. C := ROL(DoAdd(func_f(D, A, B), C, buff[i,2], 0), 11);
  193. B := ROL(DoAdd(func_f(C, D, A), B, buff[i,3], 0), 19);
  194. end;
  195. // Round 2
  196. for i := 0 to 3 do
  197. begin
  198. A := ROL(DoAdd(func_g(B, C, D), A, buff[0,i], $5A827999), 3);
  199. D := ROL(DoAdd(func_g(A, B, C), D, buff[1,i], $5A827999), 5);
  200. C := ROL(DoAdd(func_g(D, A, B), C, buff[2,i], $5A827999), 9);
  201. B := ROL(DoAdd(func_g(C, D, A), B, buff[3,i], $5A827999), 13);
  202. end;
  203. // Round 3
  204. A := ROL(DoAdd(func_h(B, C, D), A, T16x4LongWordRecord(buff)[0], $6ED9EBA1), 3);
  205. D := ROL(DoAdd(func_h(A, B, C), D, T16x4LongWordRecord(buff)[8], $6ED9EBA1), 9);
  206. C := ROL(DoAdd(func_h(D, A, B), C, T16x4LongWordRecord(buff)[4], $6ED9EBA1), 11);
  207. B := ROL(DoAdd(func_h(C, D, A), B, T16x4LongWordRecord(buff)[12], $6ED9EBA1), 15);
  208. A := ROL(DoAdd(func_h(B, C, D), A, T16x4LongWordRecord(buff)[2], $6ED9EBA1), 3);
  209. D := ROL(DoAdd(func_h(A, B, C), D, T16x4LongWordRecord(buff)[10], $6ED9EBA1), 9);
  210. C := ROL(DoAdd(func_h(D, A, B), C, T16x4LongWordRecord(buff)[6], $6ED9EBA1), 11);
  211. B := ROL(DoAdd(func_h(C, D, A), B, T16x4LongWordRecord(buff)[14], $6ED9EBA1), 15);
  212. A := ROL(DoAdd(func_h(B, C, D), A, T16x4LongWordRecord(buff)[1], $6ED9EBA1), 3);
  213. D := ROL(DoAdd(func_h(A, B, C), D, T16x4LongWordRecord(buff)[9], $6ED9EBA1), 9);
  214. C := ROL(DoAdd(func_h(D, A, B), C, T16x4LongWordRecord(buff)[5], $6ED9EBA1), 11);
  215. B := ROL(DoAdd(func_h(C, D, A), B, T16x4LongWordRecord(buff)[13], $6ED9EBA1), 15);
  216. A := ROL(DoAdd(func_h(B, C, D), A, T16x4LongWordRecord(buff)[3], $6ED9EBA1), 3);
  217. D := ROL(DoAdd(func_h(A, B, C), D, T16x4LongWordRecord(buff)[11], $6ED9EBA1), 9);
  218. C := ROL(DoAdd(func_h(D, A, B), C, T16x4LongWordRecord(buff)[7], $6ED9EBA1), 11);
  219. B := ROL(DoAdd(func_h(C, D, A), B, T16x4LongWordRecord(buff)[15], $6ED9EBA1), 15);
  220. I64 := FBuffer[0];
  221. Inc(I64, A);
  222. FBuffer[0] := I64 and $FFFFFFFF;
  223. I64 := FBuffer[1];
  224. Inc(I64, B);
  225. FBuffer[1] := I64 and $FFFFFFFF;
  226. I64 := FBuffer[2];
  227. Inc(I64, C);
  228. FBuffer[2] := I64 and $FFFFFFFF;
  229. I64 := FBuffer[3];
  230. Inc(I64, D);
  231. FBuffer[3] := I64 and $FFFFFFFF;
  232. end;
  233. function TIdHashMessageDigest4.func_f(x, y, z : LongWord) : LongWord;
  234. begin
  235. result := (x and y) or ( (not x) and z);
  236. end;
  237. function TIdHashMessageDigest4.func_g(x, y, z : LongWord) : LongWord;
  238. begin
  239. result := (x and y) or (x and z) or (y and z);
  240. end;
  241. function TIdHashMessageDigest4.func_h(x, y, z : LongWord) : LongWord;
  242. begin
  243. result := x xor y xor z;
  244. end;
  245. function TIdHashMessageDigest4.HashValue(AStream: TStream): T4x4LongWordRecord;
  246. Var
  247. LStartPos: Integer;
  248. LBitSize,
  249. LSize: Int64;
  250. S: String;
  251. S1: String;
  252. LFillSize : Integer;
  253. begin
  254. LStartPos := AStream.Position;
  255. LSize := AStream.Size - LStartPos;
  256. FBuffer := MD4_INIT_VALUES;
  257. while LSize - AStream.Position >= SizeOf(FCBuffer) do
  258. begin
  259. AStream.Read(FCBuffer[0], SizeOf(FCBuffer));
  260. MDCoder;
  261. end;
  262. // Ensure S1 has sufficient size to hold a complete 64-byte chunk
  263. SetLength(S1, SizeOf(FCBuffer));
  264. // Read the last set of bytes.
  265. LStartPos := AStream.Read(S1[1], 64);
  266. // Now adjust S1 to only hold the last set of bytes.
  267. SetLength(S1, LStartPos);
  268. // Append one bit with value 1
  269. S1 := S1 + Chr($80);
  270. // Must have sufficient space to insert the 64-bit length
  271. if Length(S1) > 64 - SizeOf(LSize) then
  272. begin
  273. SetLength(S, 64 - SizeOf(LSize));
  274. FillChar(S[1], 64 - SizeOf(LSize), #0);
  275. S1 := S1 + S;
  276. Move(S1[1], FCBuffer[0], SizeOf(FCBuffer));
  277. MDCoder;
  278. // Create a new block with only zeros.
  279. SetLength(S1, 64 - SizeOf(LSize));
  280. FillChar(S1[1], 64 - SizeOf(LSize), #0);
  281. end else
  282. begin
  283. LFillSize := 64 - ((LSize + 9) mod 64);
  284. // If the bit size will fit exact at the end (LFillSize = 64)
  285. // then S1 need not be padded.
  286. if LFillSize <> 64 then
  287. begin
  288. SetLength(S, LFillSize);
  289. FillChar(S[1], LFillSize, #0);
  290. S1 := S1 + S; // Extend the rest of the block with zeros
  291. end;
  292. end;
  293. // Append the Number of bits processed.
  294. LBitSize := LSize * 8;
  295. Setlength(S, SizeOf(LBitSize));
  296. Move(LBitSize, S[1], SizeOf(LBitSize));
  297. S1 := S1 + S; // Append the stream size
  298. Move(S1[1], FCBuffer[0], SizeOf(FCBuffer));
  299. MDCoder;
  300. result := FBuffer;
  301. end;
  302. { TIdHashMessageDigest5 }
  303. const
  304. MD5_SINE : array [1..64] of LongWord = (
  305. { Round 1. }
  306. $d76aa478, $e8c7b756, $242070db, $c1bdceee, $f57c0faf, $4787c62a,
  307. $a8304613, $fd469501, $698098d8, $8b44f7af, $ffff5bb1, $895cd7be,
  308. $6b901122, $fd987193, $a679438e, $49b40821,
  309. { Round 2. }
  310. $f61e2562, $c040b340, $265e5a51, $e9b6c7aa, $d62f105d, $02441453,
  311. $d8a1e681, $e7d3fbc8, $21e1cde6, $c33707d6, $f4d50d87, $455a14ed,
  312. $a9e3e905, $fcefa3f8, $676f02d9, $8d2a4c8a,
  313. { Round 3. }
  314. $fffa3942, $8771f681, $6d9d6122, $fde5380c, $a4beea44, $4bdecfa9,
  315. $f6bb4b60, $bebfbc70, $289b7ec6, $eaa127fa, $d4ef3085, $04881d05,
  316. $d9d4d039, $e6db99e5, $1fa27cf8, $c4ac5665,
  317. { Round 4. }
  318. $f4292244, $432aff97, $ab9423a7, $fc93a039, $655b59c3, $8f0ccc92,
  319. $ffeff47d, $85845dd1, $6fa87e4f, $fe2ce6e0, $a3014314, $4e0811a1,
  320. $f7537e82, $bd3af235, $2ad7d2bb, $eb86d391
  321. );
  322. procedure TIdHashMessageDigest5.MDCoder;
  323. var
  324. A, B, C, D : LongWord;
  325. I64 : Int64;
  326. x : T16x4LongWordRecord; // 64-byte buffer
  327. function DoAdd(const AOne, ATwo, AThree, AFour, AFive, AROL
  328. : LongWord) : LongWord;
  329. begin
  330. I64 := ATwo;
  331. I64 := I64 + AThree + AFour + AFive;
  332. I64 := ROL(I64 and $FFFFFFFF, AROL);
  333. Inc(I64, AOne);
  334. result := I64 and $FFFFFFFF;
  335. end;
  336. begin
  337. A := FBuffer[0];
  338. B := FBuffer[1];
  339. C := FBuffer[2];
  340. D := FBuffer[3];
  341. System.Move(FCBuffer[0], x[0], SizeOf(x));
  342. { Round 1 }
  343. A := DoAdd(B, A, func_f(B, C, D), x[0], MD5_SINE[1], 7);
  344. D := DoAdd(A, D, func_f(A, B, C), x[1], MD5_SINE[2], 12);
  345. C := DoAdd(D, C, func_f(D, A, B), x[2], MD5_SINE[3], 17);
  346. B := DoAdd(C, B, func_f(C, D, A), x[3], MD5_SINE[4], 22);
  347. A := DoAdd(B, A, func_f(B, C, D), x[4], MD5_SINE[5], 7);
  348. D := DoAdd(A, D, func_f(A, B, C), x[5], MD5_SINE[6], 12);
  349. C := DoAdd(D, C, func_f(D, A, B), x[6], MD5_SINE[7], 17);
  350. B := DoAdd(C, B, func_f(C, D, A), x[7], MD5_SINE[8], 22);
  351. A := DoAdd(B, A, func_f(B, C, D), x[8], MD5_SINE[9], 7);
  352. D := DoAdd(A, D, func_f(A, B, C), x[9], MD5_SINE[10], 12);
  353. C := DoAdd(D, C, func_f(D, A, B), x[10], MD5_SINE[11], 17);
  354. B := DoAdd(C, B, func_f(C, D, A), x[11], MD5_SINE[12], 22);
  355. A := DoAdd(B, A, func_f(B, C, D), x[12], MD5_SINE[13], 7);
  356. D := DoAdd(A, D, func_f(A, B, C), x[13], MD5_SINE[14], 12);
  357. C := DoAdd(D, C, func_f(D, A, B), x[14], MD5_SINE[15], 17);
  358. B := DoAdd(C, B, func_f(C, D, A), x[15], MD5_SINE[16], 22);
  359. { Round 2 }
  360. A := DoAdd(B, A, func_g(B, C, D), x[1], MD5_SINE[17], 5);
  361. D := DoAdd(A, D, func_g(A, B, C), x[6], MD5_SINE[18], 9);
  362. C := DoAdd(D, C, func_g(D, A, B), x[11], MD5_SINE[19], 14);
  363. B := DoAdd(C, B, func_g(C, D, A), x[0], MD5_SINE[20], 20);
  364. A := DoAdd(B, A, func_g(B, C, D), x[5], MD5_SINE[21], 5);
  365. D := DoAdd(A, D, func_g(A, B, C), x[10], MD5_SINE[22], 9);
  366. C := DoAdd(D, C, func_g(D, A, B), x[15], MD5_SINE[23], 14);
  367. B := DoAdd(C, B, func_g(C, D, A), x[4], MD5_SINE[24], 20);
  368. A := DoAdd(B, A, func_g(B, C, D), x[9], MD5_SINE[25], 5);
  369. D := DoAdd(A, D, func_g(A, B, C), x[14], MD5_SINE[26], 9);
  370. C := DoAdd(D, C, func_g(D, A, B), x[3], MD5_SINE[27], 14);
  371. B := DoAdd(C, B, func_g(C, D, A), x[8], MD5_SINE[28], 20);
  372. A := DoAdd(B, A, func_g(B, C, D), x[13], MD5_SINE[29], 5);
  373. D := DoAdd(A, D, func_g(A, B, C), x[2], MD5_SINE[30], 9);
  374. C := DoAdd(D, C, func_g(D, A, B), x[7], MD5_SINE[31], 14);
  375. B := DoAdd(C, B, func_g(C, D, A), x[12], MD5_SINE[32], 20);
  376. { Round 3. }
  377. A := DoAdd(B, A, func_h(B, C, D), x[5], MD5_SINE[33], 4);
  378. D := DoAdd(A, D, func_h(A, B, C), x[8], MD5_SINE[34], 11);
  379. C := DoAdd(D, C, func_h(D, A, B), x[11], MD5_SINE[35], 16);
  380. B := DoAdd(C, B, func_h(C, D, A), x[14], MD5_SINE[36], 23);
  381. A := DoAdd(B, A, func_h(B, C, D), x[1], MD5_SINE[37], 4);
  382. D := DoAdd(A, D, func_h(A, B, C), x[4], MD5_SINE[38], 11);
  383. C := DoAdd(D, C, func_h(D, A, B), x[7], MD5_SINE[39], 16);
  384. B := DoAdd(C, B, func_h(C, D, A), x[10], MD5_SINE[40], 23);
  385. A := DoAdd(B, A, func_h(B, C, D), x[13], MD5_SINE[41], 4);
  386. D := DoAdd(A, D, func_h(A, B, C), x[0], MD5_SINE[42], 11);
  387. C := DoAdd(D, C, func_h(D, A, B), x[3], MD5_SINE[43], 16);
  388. B := DoAdd(C, B, func_h(C, D, A), x[6], MD5_SINE[44], 23);
  389. A := DoAdd(B, A, func_h(B, C, D), x[9], MD5_SINE[45], 4);
  390. D := DoAdd(A, D, func_h(A, B, C), x[12], MD5_SINE[46], 11);
  391. C := DoAdd(D, C, func_h(D, A, B), x[15], MD5_SINE[47], 16);
  392. B := DoAdd(C, B, func_h(C, D, A), x[2], MD5_SINE[48], 23);
  393. { Round 4. }
  394. A := DoAdd(B, A, func_i(B, C, D), x[0], MD5_SINE[49], 6);
  395. D := DoAdd(A, D, func_i(A, B, C), x[7], MD5_SINE[50], 10);
  396. C := DoAdd(D, C, func_i(D, A, B), x[14], MD5_SINE[51], 15);
  397. B := DoAdd(C, B, func_i(C, D, A), x[5], MD5_SINE[52], 21);
  398. A := DoAdd(B, A, func_i(B, C, D), x[12], MD5_SINE[53], 6);
  399. D := DoAdd(A, D, func_i(A, B, C), x[3], MD5_SINE[54], 10);
  400. C := DoAdd(D, C, func_i(D, A, B), x[10], MD5_SINE[55], 15);
  401. B := DoAdd(C, B, func_i(C, D, A), x[1], MD5_SINE[56], 21);
  402. A := DoAdd(B, A, func_i(B, C, D), x[8], MD5_SINE[57], 6);
  403. D := DoAdd(A, D, func_i(A, B, C), x[15], MD5_SINE[58], 10);
  404. C := DoAdd(D, C, func_i(D, A, B), x[6], MD5_SINE[59], 15);
  405. B := DoAdd(C, B, func_i(C, D, A), x[13], MD5_SINE[60], 21);
  406. A := DoAdd(B, A, func_i(B, C, D), x[4], MD5_SINE[61], 6);
  407. D := DoAdd(A, D, func_i(A, B, C), x[11], MD5_SINE[62], 10);
  408. C := DoAdd(D, C, func_i(D, A, B), x[2], MD5_SINE[63], 15);
  409. B := DoAdd(C, B, func_i(C, D, A), x[9], MD5_SINE[64], 21);
  410. I64 := FBuffer[0];
  411. Inc(I64, A);
  412. FBuffer[0] := I64 and $FFFFFFFF;
  413. I64 := FBuffer[1];
  414. Inc(I64, B);
  415. FBuffer[1] := I64 and $FFFFFFFF;
  416. I64 := FBuffer[2];
  417. Inc(I64, C);
  418. FBuffer[2] := I64 and $FFFFFFFF;
  419. I64 := FBuffer[3];
  420. Inc(I64, D);
  421. FBuffer[3] := I64 and $FFFFFFFF;
  422. end;
  423. function TIdHashMessageDigest5.func_g(x, y, z : LongWord) : LongWord;
  424. begin
  425. result := (x and z) or (y and (not z));
  426. end;
  427. function TIdHashMessageDigest5.func_i(x, y, z : LongWord) : LongWord;
  428. begin
  429. result := y xor (x or (not z));
  430. end;
  431. end.