IdHashMessageDigest.pas 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567
  1. {
  2. $Project$
  3. $Workfile$
  4. $Revision$
  5. $DateUTC$
  6. $Id$
  7. This file is part of the Indy (Internet Direct) project, and is offered
  8. under the dual-licensing agreement described on the Indy website.
  9. (http://www.indyproject.org/)
  10. Copyright:
  11. (c) 1993-2005, Chad Z. Hower and the Indy Pit Crew. All rights reserved.
  12. }
  13. {
  14. $Log$
  15. }
  16. {
  17. Rev 1.3 24/01/2004 19:21:36 CCostelloe
  18. Cleaned up warnings
  19. Rev 1.2 1/15/2004 2:32:50 AM JPMugaas
  20. Attempt to add MD5 coder support for partial streams. THis is needed for the
  21. XMD5 command in the FTP Server.
  22. Rev 1.1 2003-10-12 22:36:40 HHellström
  23. Reimplemented, optimized and tested for both Win32 and dotNET.
  24. Rev 1.0 11/13/2002 07:53:40 AM JPMugaas
  25. }
  26. {
  27. Implementation of the MD2, MD4 and MD5 Message-Digest Algorithm
  28. as specified in RFC 1319 (1115), 1320 (1186), 1321
  29. Author: Henrick Hellström <[email protected]>
  30. Original Intellectual Property Statement:
  31. Author: Pete Mee
  32. Port to Indy 8.1 Doychin Bondzhev ([email protected])
  33. Copyright: (c) Chad Z. Hower and The Winshoes Working Group.
  34. }
  35. unit IdHashMessageDigest;
  36. interface
  37. {$i IdCompilerDefines.inc}
  38. uses
  39. IdFIPS, IdGlobal, IdHash, Classes;
  40. type
  41. T4x4LongWordRecord = array[0..3] of UInt32;
  42. T16x4LongWordRecord = array[0..15] of UInt32;
  43. T4x4x4LongWordRecord = array[0..3] of T4x4LongWordRecord;
  44. T512BitRecord = array[0..63] of Byte;
  45. T384BitRecord = array[0..47] of Byte;
  46. T128BitRecord = array[0..15] of Byte;
  47. TIdHashMessageDigest = class(TIdHashNativeAndIntF)
  48. protected
  49. FCBuffer: TIdBytes;
  50. procedure MDCoder; virtual; abstract;
  51. procedure Reset; virtual;
  52. end;
  53. TIdHashMessageDigest2 = class(TIdHashMessageDigest)
  54. protected
  55. FX: T384BitRecord;
  56. FCheckSum: T128BitRecord;
  57. procedure MDCoder; override;
  58. procedure Reset; override;
  59. function InitHash : TIdHashIntCtx; override;
  60. function NativeGetHashBytes(AStream: TStream; ASize: Int64): TIdBytes; override;
  61. function HashToHex(const AHash: TIdBytes): String; override;
  62. public
  63. constructor Create; override;
  64. class function IsIntfAvailable: Boolean; override;
  65. end;
  66. TIdHashMessageDigest4 = class(TIdHashMessageDigest)
  67. protected
  68. FState: T4x4LongWordRecord;
  69. function NativeGetHashBytes(AStream: TStream; ASize: Int64): TIdBytes; override;
  70. function HashToHex(const AHash: TIdBytes): String; override;
  71. procedure MDCoder; override;
  72. function InitHash : TIdHashIntCtx; override;
  73. public
  74. constructor Create; override;
  75. class function IsIntfAvailable: Boolean; override;
  76. end;
  77. TIdHashMessageDigest5 = class(TIdHashMessageDigest4)
  78. protected
  79. procedure MDCoder; override;
  80. function InitHash : TIdHashIntCtx; override;
  81. public
  82. class function IsIntfAvailable : Boolean; override;
  83. end;
  84. implementation
  85. uses
  86. IdGlobalProtocols;
  87. { TIdHashMessageDigest }
  88. procedure TIdHashMessageDigest.Reset;
  89. begin
  90. FillBytes(FCBuffer, Length(FCBuffer), 0);
  91. end;
  92. { TIdHashMessageDigest2 }
  93. const
  94. MD2_PI_SUBST : array [0..255] of Byte = (
  95. 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240,
  96. 6, 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217,
  97. 188, 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66,
  98. 111, 24, 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73,
  99. 160, 251, 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178,
  100. 7, 63, 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154,
  101. 90, 144, 50, 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25,
  102. 48, 179, 72, 165, 181, 209, 215, 94, 146, 42, 172, 86, 170, 198,
  103. 79, 184, 56, 210, 150, 164, 125, 182, 118, 252, 107, 226, 156, 116,
  104. 4, 241, 69, 157, 112, 89, 100, 113, 135, 32, 134, 91, 207, 101,
  105. 230, 45, 168, 2, 27, 96, 37, 173, 174, 176, 185, 246, 28, 70,
  106. 97, 105, 52, 64, 126, 15, 85, 71, 163, 35, 221, 81, 175, 58,
  107. 195, 92, 249, 206, 186, 197, 234, 38, 44, 83, 13, 110, 133, 40,
  108. 132, 9, 211, 223, 205, 244, 65, 129, 77, 82, 106, 220, 55, 200,
  109. 108, 193, 171, 250, 36, 225, 123, 8, 12, 189, 177, 74, 120, 136,
  110. 149, 139, 227, 99, 232, 109, 233, 203, 213, 254, 59, 0, 29, 57,
  111. 242, 239, 183, 14, 102, 88, 208, 228, 166, 119, 114, 248, 235, 117,
  112. 75, 10, 49, 68, 80, 180, 143, 237, 31, 26, 219, 153, 141, 51,
  113. 159, 17, 131, 20);
  114. constructor TIdHashMessageDigest2.Create;
  115. begin
  116. inherited Create;
  117. SetLength(FCBuffer, 16);
  118. end;
  119. procedure TIdHashMessageDigest2.MDCoder;
  120. const
  121. NumRounds = 18;
  122. var
  123. x: Byte;
  124. i, j: Integer;
  125. T: UInt16;
  126. LCheckSumScore: Byte;
  127. begin
  128. // Move the next 16 bytes into the second 16 bytes of X.
  129. for i := 0 to 15 do begin
  130. x := FCBuffer[i];
  131. FX[i + 16] := x;
  132. FX[i + 32] := x xor FX[i];
  133. end;
  134. { Do 18 rounds. }
  135. T := 0;
  136. for i := 0 to NumRounds - 1 do begin
  137. for j := 0 to 47 do
  138. begin
  139. T := FX[j] xor MD2_PI_SUBST[T];
  140. FX[j] := T and $FF;
  141. end;
  142. T := (T + i) and $FF;
  143. end;
  144. LCheckSumScore := FChecksum[15];
  145. for i := 0 to 15 do begin
  146. x := FCBuffer[i] xor LCheckSumScore;
  147. LCheckSumScore := FChecksum[i] xor MD2_PI_SUBST[x];
  148. FChecksum[i] := LCheckSumScore;
  149. end;
  150. end;
  151. // Clear Buffer and Checksum arrays
  152. procedure TIdHashMessageDigest2.Reset;
  153. var
  154. I: Integer;
  155. begin
  156. inherited Reset;
  157. for I := 0 to 15 do begin
  158. FCheckSum[I] := 0;
  159. FX[I] := 0;
  160. FX[I+16] := 0;
  161. FX[I+32] := 0;
  162. end;
  163. end;
  164. function TIdHashMessageDigest2.NativeGetHashBytes(AStream: TStream; ASize: Int64): TIdBytes;
  165. var
  166. LStartPos: Integer;
  167. LSize: Integer;
  168. Pad: Byte;
  169. I: Integer;
  170. begin
  171. Result := nil;
  172. Reset;
  173. // Code the entire file in complete 16-byte chunks.
  174. while ASize >= 16 do begin
  175. LSize := ReadTIdBytesFromStream(AStream, FCBuffer, 16);
  176. // TODO: handle stream read error
  177. MDCoder;
  178. Dec(ASize, LSize);
  179. end;
  180. // Read the last set of bytes.
  181. LStartPos := ReadTIdBytesFromStream(AStream, FCBuffer, ASize);
  182. // TODO: handle stream read error
  183. Pad := 16 - LStartPos;
  184. // Step 1
  185. for I := LStartPos to 15 do begin
  186. FCBuffer[I] := Pad;
  187. end;
  188. MDCoder;
  189. // Step 2
  190. for I := 0 to 15 do begin
  191. FCBuffer[I] := FCheckSum[I];
  192. end;
  193. MDCoder;
  194. SetLength(Result, SizeOf(UInt32)*4);
  195. for I := 0 to 3 do
  196. begin
  197. CopyTIdUInt32(
  198. FX[I*4] + (FX[I*4+1] shl 8) + (FX[I*4+2] shl 16) + (FX[I*4+3] shl 24),
  199. Result, SizeOf(UInt32)*I);
  200. end;
  201. end;
  202. function TIdHashMessageDigest2.HashToHex(const AHash: TIdBytes): String;
  203. begin
  204. Result := UInt32HashToHex(AHash, 4);
  205. end;
  206. function TIdHashMessageDigest2.InitHash: TIdHashIntCtx;
  207. begin
  208. Result := GetMD2HashInst;
  209. end;
  210. class function TIdHashMessageDigest2.IsIntfAvailable: Boolean;
  211. begin
  212. Result := IsHashingIntfAvail and IsMD2HashIntfAvail;
  213. end;
  214. { TIdHashMessageDigest4 }
  215. const
  216. MD4_INIT_VALUES: T4x4LongWordRecord = (
  217. $67452301, $EFCDAB89, $98BADCFE, $10325476);
  218. {$I IdOverflowCheckingOff.inc} // Arithmetic operations performed modulo $100000000
  219. {$I IdRangeCheckingOff.inc}
  220. constructor TIdHashMessageDigest4.Create;
  221. begin
  222. inherited Create;
  223. SetLength(FCBuffer, 64);
  224. end;
  225. procedure TIdHashMessageDigest4.MDCoder;
  226. var
  227. A, B, C, D, i : UInt32;
  228. buff : T16x4LongWordRecord; // 64-byte buffer
  229. begin
  230. A := FState[0];
  231. B := FState[1];
  232. C := FState[2];
  233. D := FState[3];
  234. for i := 0 to 15 do
  235. begin
  236. buff[i] := FCBuffer[i*4+0] +
  237. (FCBuffer[i*4+1] shl 8) +
  238. (FCBuffer[i*4+2] shl 16) +
  239. (FCBuffer[i*4+3] shl 24);
  240. end;
  241. // Round 1
  242. { Note:
  243. (x and y) or ( (not x) and z)
  244. is equivalent to
  245. (((z xor y) and x) xor z)
  246. -HHellström }
  247. for i := 0 to 3 do
  248. begin
  249. A := ROL((((D xor C) and B) xor D) + A + buff[i*4+0], 3);
  250. D := ROL((((C xor B) and A) xor C) + D + buff[i*4+1], 7);
  251. C := ROL((((B xor A) and D) xor B) + C + buff[i*4+2], 11);
  252. B := ROL((((A xor D) and C) xor A) + B + buff[i*4+3], 19);
  253. end;
  254. // Round 2
  255. { Note:
  256. (x and y) or (x and z) or (y and z)
  257. is equivalent to
  258. ((x and y) or (z and (x or y)))
  259. -HHellström }
  260. for i := 0 to 3 do
  261. begin
  262. A := ROL(((B and C) or (D and (B or C))) + A + buff[0*4+i] + $5A827999, 3);
  263. D := ROL(((A and B) or (C and (A or B))) + D + buff[1*4+i] + $5A827999, 5);
  264. C := ROL(((D and A) or (B and (D or A))) + C + buff[2*4+i] + $5A827999, 9);
  265. B := ROL(((C and D) or (A and (C or D))) + B + buff[3*4+i] + $5A827999, 13);
  266. end;
  267. // Round 3
  268. A := ROL((B xor C xor D) + A + buff[ 0] + $6ED9EBA1, 3);
  269. D := ROL((A xor B xor C) + D + buff[ 8] + $6ED9EBA1, 9);
  270. C := ROL((D xor A xor B) + C + buff[ 4] + $6ED9EBA1, 11);
  271. B := ROL((C xor D xor A) + B + buff[12] + $6ED9EBA1, 15);
  272. A := ROL((B xor C xor D) + A + buff[ 2] + $6ED9EBA1, 3);
  273. D := ROL((A xor B xor C) + D + buff[10] + $6ED9EBA1, 9);
  274. C := ROL((D xor A xor B) + C + buff[ 6] + $6ED9EBA1, 11);
  275. B := ROL((C xor D xor A) + B + buff[14] + $6ED9EBA1, 15);
  276. A := ROL((B xor C xor D) + A + buff[ 1] + $6ED9EBA1, 3);
  277. D := ROL((A xor B xor C) + D + buff[ 9] + $6ED9EBA1, 9);
  278. C := ROL((D xor A xor B) + C + buff[ 5] + $6ED9EBA1, 11);
  279. B := ROL((C xor D xor A) + B + buff[13] + $6ED9EBA1, 15);
  280. A := ROL((B xor C xor D) + A + buff[ 3] + $6ED9EBA1, 3);
  281. D := ROL((A xor B xor C) + D + buff[11] + $6ED9EBA1, 9);
  282. C := ROL((D xor A xor B) + C + buff[ 7] + $6ED9EBA1, 11);
  283. B := ROL((C xor D xor A) + B + buff[15] + $6ED9EBA1, 15);
  284. Inc(FState[0], A);
  285. Inc(FState[1], B);
  286. Inc(FState[2], C);
  287. Inc(FState[3], D);
  288. end;
  289. {$I IdRangeCheckingOn.inc}
  290. {$I IdOverflowCheckingOn.inc}
  291. function TIdHashMessageDigest4.NativeGetHashBytes(AStream: TStream; ASize: Int64): TidBytes;
  292. var
  293. LStartPos: Integer;
  294. LSize: Int64;
  295. LBitSize: Int64;
  296. I, LReadSize: Integer;
  297. begin
  298. Result := nil;
  299. LSize := ASize;
  300. // A straight assignment would be by ref on dotNET.
  301. for I := 0 to 3 do begin
  302. FState[I] := MD4_INIT_VALUES[I];
  303. end;
  304. while LSize >= 64 do
  305. begin
  306. LReadSize := ReadTIdBytesFromStream(AStream, FCBuffer, 64);
  307. // TODO: handle stream read error
  308. MDCoder;
  309. Dec(LSize, LReadSize);
  310. end;
  311. // Read the last set of bytes.
  312. LStartPos := ReadTIdBytesFromStream(AStream, FCBuffer, LSize);
  313. // TODO: handle stream read error
  314. // Append one bit with value 1
  315. FCBuffer[LStartPos] := $80;
  316. Inc(LStartPos);
  317. // Must have sufficient space to insert the 64-bit size value
  318. if LStartPos > 56 then
  319. begin
  320. for I := LStartPos to 63 do begin
  321. FCBuffer[I] := 0;
  322. end;
  323. MDCoder;
  324. LStartPos := 0;
  325. end;
  326. // Pad with zeroes. Leave room for the 64 bit size value.
  327. for I := LStartPos to 55 do begin
  328. FCBuffer[I] := 0;
  329. end;
  330. // Append the Number of bits processed.
  331. LBitSize := ASize * 8;
  332. for I := 56 to 63 do
  333. begin
  334. FCBuffer[I] := LBitSize and $FF;
  335. LBitSize := LBitSize shr 8;
  336. end;
  337. MDCoder;
  338. SetLength(Result, SizeOf(UInt32)*4);
  339. for I := 0 to 3 do begin
  340. CopyTIdUInt32(FState[I], Result, SizeOf(UInt32)*I);
  341. end;
  342. end;
  343. function TIdHashMessageDigest4.InitHash : TIdHashIntCtx;
  344. begin
  345. Result := GetMD4HashInst;
  346. end;
  347. function TIdHashMessageDigest4.HashToHex(const AHash: TIdBytes): String;
  348. begin
  349. Result := UInt32HashToHex(AHash, 4);
  350. end;
  351. class function TIdHashMessageDigest4.IsIntfAvailable: Boolean;
  352. begin
  353. Result := IsHashingIntfAvail and IsMD4HashIntfAvail ;
  354. end;
  355. { TIdHashMessageDigest5 }
  356. const
  357. MD5_SINE : array[1..64] of UInt32 = (
  358. { Round 1. }
  359. $d76aa478, $e8c7b756, $242070db, $c1bdceee, $f57c0faf, $4787c62a,
  360. $a8304613, $fd469501, $698098d8, $8b44f7af, $ffff5bb1, $895cd7be,
  361. $6b901122, $fd987193, $a679438e, $49b40821,
  362. { Round 2. }
  363. $f61e2562, $c040b340, $265e5a51, $e9b6c7aa, $d62f105d, $02441453,
  364. $d8a1e681, $e7d3fbc8, $21e1cde6, $c33707d6, $f4d50d87, $455a14ed,
  365. $a9e3e905, $fcefa3f8, $676f02d9, $8d2a4c8a,
  366. { Round 3. }
  367. $fffa3942, $8771f681, $6d9d6122, $fde5380c, $a4beea44, $4bdecfa9,
  368. $f6bb4b60, $bebfbc70, $289b7ec6, $eaa127fa, $d4ef3085, $04881d05,
  369. $d9d4d039, $e6db99e5, $1fa27cf8, $c4ac5665,
  370. { Round 4. }
  371. $f4292244, $432aff97, $ab9423a7, $fc93a039, $655b59c3, $8f0ccc92,
  372. $ffeff47d, $85845dd1, $6fa87e4f, $fe2ce6e0, $a3014314, $4e0811a1,
  373. $f7537e82, $bd3af235, $2ad7d2bb, $eb86d391
  374. );
  375. {$I IdOverflowCheckingOff.inc} // Arithmetic operations performed modulo $100000000
  376. {$I IdRangeCheckingOff.inc}
  377. function TIdHashMessageDigest5.InitHash: TIdHashIntCtx;
  378. begin
  379. Result := GetMD5HashInst;
  380. end;
  381. class function TIdHashMessageDigest5.IsIntfAvailable: Boolean;
  382. begin
  383. Result := IsHashingIntfAvail and IsMD5HashIntfAvail ;
  384. end;
  385. procedure TIdHashMessageDigest5.MDCoder;
  386. var
  387. A, B, C, D : UInt32;
  388. i: Integer;
  389. x : T16x4LongWordRecord; // 64-byte buffer
  390. begin
  391. A := FState[0];
  392. B := FState[1];
  393. C := FState[2];
  394. D := FState[3];
  395. for i := 0 to 15 do
  396. begin
  397. x[i] := FCBuffer[i*4+0] +
  398. (FCBuffer[i*4+1] shl 8) +
  399. (FCBuffer[i*4+2] shl 16) +
  400. (FCBuffer[i*4+3] shl 24);
  401. end;
  402. { Round 1 }
  403. { Note:
  404. (x and y) or ( (not x) and z)
  405. is equivalent to
  406. (((z xor y) and x) xor z)
  407. -HHellström }
  408. A := ROL(A + (((D xor C) and B) xor D) + x[ 0] + MD5_SINE[ 1], 7) + B;
  409. D := ROL(D + (((C xor B) and A) xor C) + x[ 1] + MD5_SINE[ 2], 12) + A;
  410. C := ROL(C + (((B xor A) and D) xor B) + x[ 2] + MD5_SINE[ 3], 17) + D;
  411. B := ROL(B + (((A xor D) and C) xor A) + x[ 3] + MD5_SINE[ 4], 22) + C;
  412. A := ROL(A + (((D xor C) and B) xor D) + x[ 4] + MD5_SINE[ 5], 7) + B;
  413. D := ROL(D + (((C xor B) and A) xor C) + x[ 5] + MD5_SINE[ 6], 12) + A;
  414. C := ROL(C + (((B xor A) and D) xor B) + x[ 6] + MD5_SINE[ 7], 17) + D;
  415. B := ROL(B + (((A xor D) and C) xor A) + x[ 7] + MD5_SINE[ 8], 22) + C;
  416. A := ROL(A + (((D xor C) and B) xor D) + x[ 8] + MD5_SINE[ 9], 7) + B;
  417. D := ROL(D + (((C xor B) and A) xor C) + x[ 9] + MD5_SINE[10], 12) + A;
  418. C := ROL(C + (((B xor A) and D) xor B) + x[10] + MD5_SINE[11], 17) + D;
  419. B := ROL(B + (((A xor D) and C) xor A) + x[11] + MD5_SINE[12], 22) + C;
  420. A := ROL(A + (((D xor C) and B) xor D) + x[12] + MD5_SINE[13], 7) + B;
  421. D := ROL(D + (((C xor B) and A) xor C) + x[13] + MD5_SINE[14], 12) + A;
  422. C := ROL(C + (((B xor A) and D) xor B) + x[14] + MD5_SINE[15], 17) + D;
  423. B := ROL(B + (((A xor D) and C) xor A) + x[15] + MD5_SINE[16], 22) + C;
  424. { Round 2 }
  425. { Note:
  426. (x and z) or (y and (not z) )
  427. is equivalent to
  428. (((y xor x) and z) xor y)
  429. -HHellström }
  430. A := ROL(A + (C xor (D and (B xor C))) + x[ 1] + MD5_SINE[17], 5) + B;
  431. D := ROL(D + (B xor (C and (A xor B))) + x[ 6] + MD5_SINE[18], 9) + A;
  432. C := ROL(C + (A xor (B and (D xor A))) + x[11] + MD5_SINE[19], 14) + D;
  433. B := ROL(B + (D xor (A and (C xor D))) + x[ 0] + MD5_SINE[20], 20) + C;
  434. A := ROL(A + (C xor (D and (B xor C))) + x[ 5] + MD5_SINE[21], 5) + B;
  435. D := ROL(D + (B xor (C and (A xor B))) + x[10] + MD5_SINE[22], 9) + A;
  436. C := ROL(C + (A xor (B and (D xor A))) + x[15] + MD5_SINE[23], 14) + D;
  437. B := ROL(B + (D xor (A and (C xor D))) + x[ 4] + MD5_SINE[24], 20) + C;
  438. A := ROL(A + (C xor (D and (B xor C))) + x[ 9] + MD5_SINE[25], 5) + B;
  439. D := ROL(D + (B xor (C and (A xor B))) + x[14] + MD5_SINE[26], 9) + A;
  440. C := ROL(C + (A xor (B and (D xor A))) + x[ 3] + MD5_SINE[27], 14) + D;
  441. B := ROL(B + (D xor (A and (C xor D))) + x[ 8] + MD5_SINE[28], 20) + C;
  442. A := ROL(A + (C xor (D and (B xor C))) + x[13] + MD5_SINE[29], 5) + B;
  443. D := ROL(D + (B xor (C and (A xor B))) + x[ 2] + MD5_SINE[30], 9) + A;
  444. C := ROL(C + (A xor (B and (D xor A))) + x[ 7] + MD5_SINE[31], 14) + D;
  445. B := ROL(B + (D xor (A and (C xor D))) + x[12] + MD5_SINE[32], 20) + C;
  446. { Round 3. }
  447. A := ROL(A + (B xor C xor D) + x[ 5] + MD5_SINE[33], 4) + B;
  448. D := ROL(D + (A xor B xor C) + x[ 8] + MD5_SINE[34], 11) + A;
  449. C := ROL(C + (D xor A xor B) + x[11] + MD5_SINE[35], 16) + D;
  450. B := ROL(B + (C xor D xor A) + x[14] + MD5_SINE[36], 23) + C;
  451. A := ROL(A + (B xor C xor D) + x[ 1] + MD5_SINE[37], 4) + B;
  452. D := ROL(D + (A xor B xor C) + x[ 4] + MD5_SINE[38], 11) + A;
  453. C := ROL(C + (D xor A xor B) + x[ 7] + MD5_SINE[39], 16) + D;
  454. B := ROL(B + (C xor D xor A) + x[10] + MD5_SINE[40], 23) + C;
  455. A := ROL(A + (B xor C xor D) + x[13] + MD5_SINE[41], 4) + B;
  456. D := ROL(D + (A xor B xor C) + x[ 0] + MD5_SINE[42], 11) + A;
  457. C := ROL(C + (D xor A xor B) + x[ 3] + MD5_SINE[43], 16) + D;
  458. B := ROL(B + (C xor D xor A) + x[ 6] + MD5_SINE[44], 23) + C;
  459. A := ROL(A + (B xor C xor D) + x[ 9] + MD5_SINE[45], 4) + B;
  460. D := ROL(D + (A xor B xor C) + x[12] + MD5_SINE[46], 11) + A;
  461. C := ROL(C + (D xor A xor B) + x[15] + MD5_SINE[47], 16) + D;
  462. B := ROL(B + (C xor D xor A) + x[ 2] + MD5_SINE[48], 23) + C;
  463. { Round 4. }
  464. A := ROL(A + ((B or not D) xor C) + x[ 0] + MD5_SINE[49], 6) + B;
  465. D := ROL(D + ((A or not C) xor B) + x[ 7] + MD5_SINE[50], 10) + A;
  466. C := ROL(C + ((D or not B) xor A) + x[14] + MD5_SINE[51], 15) + D;
  467. B := ROL(B + ((C or not A) xor D) + x[ 5] + MD5_SINE[52], 21) + C;
  468. A := ROL(A + ((B or not D) xor C) + x[12] + MD5_SINE[53], 6) + B;
  469. D := ROL(D + ((A or not C) xor B) + x[ 3] + MD5_SINE[54], 10) + A;
  470. C := ROL(C + ((D or not B) xor A) + x[10] + MD5_SINE[55], 15) + D;
  471. B := ROL(B + ((C or not A) xor D) + x[ 1] + MD5_SINE[56], 21) + C;
  472. A := ROL(A + ((B or not D) xor C) + x[ 8] + MD5_SINE[57], 6) + B;
  473. D := ROL(D + ((A or not C) xor B) + x[15] + MD5_SINE[58], 10) + A;
  474. C := ROL(C + ((D or not B) xor A) + x[ 6] + MD5_SINE[59], 15) + D;
  475. B := ROL(B + ((C or not A) xor D) + x[13] + MD5_SINE[60], 21) + C;
  476. A := ROL(A + ((B or not D) xor C) + x[ 4] + MD5_SINE[61], 6) + B;
  477. D := ROL(D + ((A or not C) xor B) + x[11] + MD5_SINE[62], 10) + A;
  478. C := ROL(C + ((D or not B) xor A) + x[ 2] + MD5_SINE[63], 15) + D;
  479. B := ROL(B + ((C or not A) xor D) + x[ 9] + MD5_SINE[64], 21) + C;
  480. Inc(FState[0], A);
  481. Inc(FState[1], B);
  482. Inc(FState[2], C);
  483. Inc(FState[3], D);
  484. end;
  485. {$I IdRangeCheckingOn.inc}
  486. {$I IdOverflowCheckingOn.inc}
  487. end.