IdHashMessageDigest.pas 18 KB

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