ULONG inline H(ULONG X, ULONG Y, ULONG Z) {
return X ^ Y ^ Z;
}
ULONG inline I(ULONG X, ULONG Y, ULONG Z) {
return Y ^ (X | (~Z));
}
#define ROLIT(xx) case xx: __asm{rol z, xx} break;
// Одна операция хэширования
template <NLF func, ULONG s> void inline Operation(ULONG& a, ULONG b, ULONG c, ULONG d, ULONG M, ULONG t) {
ULONG z;
z = a + func(b, c, d) + M + t;
#ifdef _MSC_VER
switch (s) { // Хитрый трюк для компилятора MSVC++
ROLIT(7) ROLIT(12) ROLIT(17) ROLIT(22)
ROLIT(5) ROLIT(9) ROLIT(14) ROLIT(20)
ROLIT(4) ROLIT(11) ROLIT(16) ROLIT(23)
ROLIT(6) ROLIT(10) ROLIT(15) ROLIT(21)
}
#else
z = (z << s) | (z >>(32-s)); // Для остальных компиляторов менее оптимизированный код
#endif
a = b + z;
}
void inline MD5(char* s, ULONG len, ULONG len2, ULONG& A, ULONG& B, ULONG& C, ULONG& D) {
*(ULONG*)(s + len2 - 8) = len * 8; // Записываем длину в последние 64 бита
*(ULONG*)(s + len2 - 4) = 0;
*(UCHAR*)(s + len) = 0x80; // Заполнение единицей и нулями
memset(s + len + 1, '\0', len2 - 8 - len - 1);
A = 0x67452301, B = 0xefcdab89, C = 0x98badcfe, D = 0x10325476;
for(ULONG* m = (ULONG*)s; m < (ULONG*)(s + len2); m += 16) { // Основной цикл
ULONG a = A, b = B, c = C, d = D;
for(int i = 0; i < 16; i+=4) { // 16 операций на первом этапе
Operation<F, 7>(a, b, c, d, *(m+i+0), _F[i+0]); // 1-й этап
Operation<F, 12>(d, a, b, c, *(m+i+1),_F[i+1]);
Operation<F, 17>(c, d, a, b, *(m+i+2),_F[i+2]);
Operation<F, 22>(b, c, d, a, *(m+i+3),_F[i+3]);
}
for(int i = 0; i < 16; i+=4) { // 16 операций на втором этапе
Operation<G, 5>(a, b, c, d, *(m+_g[i+0]), _G[i+0]);
Operation<G, 9>(d, a, b, c, *(m+_g[i+1]), _G[i+1]);
Operation<G, 14>(c, d, a, b, *(m+_g[i+2]), _G[i+2]);
Operation<G, 20>(b, c, d, a, *(m+_g[i+3]), _G[i+3]);
}
for(int i = 0; i < 16; i+=4) { // 16 операций на третьем этапе
Operation<H, 4>(a, b, c, d, *(m+_h[i+0]), _H[i+0]);
Operation<H, 11>(d, a, b, c, *(m+_h[i+1]), _H[i+1]);
Operation<H, 16>(c, d, a, b, *(m+_h[i+2]), _H[i+2]);
Operation<H, 23>(b, c, d, a, *(m+_h[i+3]), _H[i+3]);
}
for(int i = 0; i < 16; i+=4) { // 16 операций на четвертом этапе
Operation<I, 6>(a, b, c, d, *(m+_i[i+0]), _I[i+0]);
Operation<I, 10>(d, a, b, c, *(m+_i[i+1]), _I[i+1]);
Operation<I, 15>(c, d, a, b, *(m+_i[i+2]), _I[i+2]);
Operation<I, 21>(b, c, d, a, *(m+_i[i+3]), _I[i+3]);
}
A += a, B += b, C += c, D += d;
}
}
1. Никому с таким кол-вом кода за так возиться не охото
2. И второе, главное - многие алгоритмы, в частности MD5 и CRC точно есть на VB6 готовые... вот на счет SHA точно не знаю, но думаю что тоже имеются.
'/******************************************************************************
' * Copyright (C) 2000 by Robert Hubley. *
' * All rights reserved. *
' * *
' * This software is provided ``AS IS'' and any express or implied *
' * warranties, including, but not limited to, the implied warranties of *
' * merchantability and fitness for a particular purpose, are disclaimed. *
' * In no event shall the authors be liable for any direct, indirect, *
' * incidental, special, exemplary, or consequential damages (including, but *
' * not limited to, procurement of substitute goods or services; loss of use, *
' * data, or profits; or business interruption) however caused and on any *
' * theory of liability, whether in contract, strict liability, or tort *
' *  including negligence or otherwise) arising in any way out of the use of *
' * this software, even if advised of the possibility of such damage. *
' * *
' ******************************************************************************
'
' CLASS: MD5
'
'  ESCRIPTION:
' This is a class which encapsulates a set of MD5 Message Digest functions.
' MD5 algorithm produces a 128 bit digital fingerprint (signature) from an
' dataset of arbitrary length. For details see RFC 1321 (summarized below).
' This implementation is derived from the RSA Data Security, Inc. MD5 Message-Digest
' algorithm reference implementation (originally written in C)
'
' AUTHOR:
' Robert M. Hubley 12/1999
'
'
' NOTES:
' Network Working Group R. Rivest
' Request for Comments: 1321 MIT Laboratory for Computer Science
' and RSA Data Security, Inc.
' April 1992
'
'
' The MD5 Message-Digest Algorithm
'
' Summary
'
' This document describes the MD5 message-digest algorithm. The
' algorithm takes as input a message of arbitrary length and produces
' as output a 128-bit "fingerprint" or "message digest" of the input.
' It is conjectured that it is computationally infeasible to produce
' two messages having the same message digest, or to produce any
' message having a given prespecified target message digest. The MD5
' algorithm is intended for digital signature applications, where a
' large file must be "compressed" in a secure manner before being
' encrypted with a private (secret) key under a public-key cryptosystem
' such as RSA.
'
' The MD5 algorithm is designed to be quite fast on 32-bit machines. In
' addition, the MD5 algorithm does not require any large substitution
' tables; the algorithm can be coded quite compactly.
'
' The MD5 algorithm is an extension of the MD4 message-digest algorithm
' 1,2]. MD5 is slightly slower than MD4, but is more "conservative" in
' design. MD5 was designed because it was felt that MD4 was perhaps
' being adopted for use more quickly than justified by the existing
' critical review; because MD4 was designed to be exceptionally fast,
' it is "at the edge" in terms of risking successful cryptanalytic
' attack. MD5 backs off a bit, giving up a little in speed for a much
' greater likelihood of ultimate security. It incorporates some
' suggestions made by various reviewers, and contains additional
' optimizations. The MD5 algorithm is being placed in the public domain
' for review and possible adoption as a standard.
'
' RFC Author:
' Ronald L.Rivest
' Massachusetts Institute of Technology
' Laboratory for Computer Science
' NE43 -324545 Technology Square
' Cambridge, MA 02139-1986
' Phone: (617) 253-5880
' EMail: Rivest@ theory.lcs.mit.edu
'
'
'
' CHANGE HISTORY:
'
' 0.1.0 RMH 1999/12/29 Original version
'
'
'=
'= Class Variables
'=
Private State(4) As Long
Private ByteCounter As Long
Private ByteBuffer(63) As Byte
Private fbObject As Object, fbProc As String, fbpMin As Single, fbpMax As Single, fbpGrades As Long
'=
'= Class Properties
'=
Property Get RegisterA() As String
RegisterA = State(1)
End Property
Property Get RegisterB() As String
RegisterB = State(2)
End Property
Property Get RegisterC() As String
RegisterC = State(3)
End Property
Property Get RegisterD() As String
RegisterD = State(4)
End Property
'=
'= Class Functions
'=
'
' Function to quickly digest a file into a hex string
'
Public Function DigestFileToHexStr(FileName As String) As String
Dim FN As Integer, C As Long, N As Long
FN = FreeFile
Open FileName For Binary Access Read As #FN
N = -Int(-LOF(FN) / 64)
If Not fbObject Is Nothing Then CallByName fbObject, fbProc, VbMethod, fbpMin
MD5Init
Do While Not EOF(FN)
Get #FN, , ByteBuffer
C = C + 1
If Not fbObject Is Nothing Then
If fbpGrades > N Then
CallByName fbObject, fbProc, VbMethod, fbpMin + (fbpMax - fbpMin) * (Loc(FN) / LOF(FN))
Else
If C Mod (N / fbpGrades) = 0 Then CallByName fbObject, fbProc, VbMethod, fbpMin + (fbpMax - fbpMin) * (Loc(FN) / LOF(FN))
End If
End If
If Loc(FN) < LOF(FN) Then
ByteCounter = ByteCounter + 64
MD5Transform ByteBuffer
End If
Loop
ByteCounter = ByteCounter + (LOF(FN) Mod 64)
Close #FN
MD5Final
If Not fbObject Is Nothing Then CallByName fbObject, fbProc, VbMethod, fbpMax
 igestFileToHexStr = GetValues
End Function
'
' Function to digest a text string and output the result as a string
' of hexadecimal characters.
'
Public Function DigestStrToHexStr(SourceString As String) As String
MD5Init
MD5Update Len(SourceString), StringToArray(SourceString)
MD5Final
 igestStrToHexStr = GetValues
End Function
'
' A utility function which converts a string into an array of
' bytes.
'
Private Function StringToArray(InString As String) As Byte()
Dim I As Integer
Dim bytBuffer() As Byte
ReDim bytBuffer(Len(InString))
For I = 0 To Len(InString) - 1
bytBuffer(I) = Asc(Mid(InString, I + 1, 1))
Next I
StringToArray = bytBuffer
End Function
'
' Concatenate the four state vaules into one string
'
Public Function GetValues() As String
GetValues = LongToString(State(1)) & LongToString(State(2)) & LongToString(State(3)) & LongToString(State(4))
End Function
'
' Convert a Long to a Hex string
'
Private Function LongToString(Num As Long) As String
Dim A As Byte
Dim b As Byte
Dim C As Byte
Dim D As Byte
A = Num And &HFF&
If A < 16 Then
LongToString = "0" & Hex
Else
LongToString = Hex
End If
b = (Num And &HFF00& \ 256
If b < 16 Then
LongToString = LongToString & "0" & Hex(b)
Else
LongToString = LongToString & Hex(b)
End If
C = (Num And &HFF0000) \ 65536
If C < 16 Then
LongToString = LongToString & "0" & Hex(C)
Else
LongToString = LongToString & Hex(C)
End If
If Num < 0 Then
  = ((Num And &H7F000000) \ 16777216) Or &H80&
Else
  = (Num And &HFF000000) \ 16777216
End If
If D < 16 Then
LongToString = LongToString & "0" & Hex(D)
Else
LongToString = LongToString & Hex(D)
End If
End Function
'
' Initialize the class
' This must be called before a digest calculation is started
'
Public Sub MD5Init()
ByteCounter = 0
State(1) = UnsignedToLong(1732584193#)
State(2) = UnsignedToLong(4023233417#)
State(3) = UnsignedToLong(2562383102#)
State(4) = UnsignedToLong(271733878#)
End Sub
'
' MD5 Final
'
Public Sub MD5Final()
Dim dblBits As Double
Dim padding(72) As Byte
Dim lngBytesBuffered As Long
padding(0) = &H80
dblBits = ByteCounter * 8
' Pad out
lngBytesBuffered = ByteCounter Mod 64
If lngBytesBuffered <= 56 Then
MD5Update 56 - lngBytesBuffered, padding
Else
MD5Update 120 - ByteCounter, padding
End If
padding(0) = UnsignedToLong(dblBits) And &HFF&
padding(1) = UnsignedToLong(dblBits) \ 256 And &HFF&
padding(2) = UnsignedToLong(dblBits) \ 65536 And &HFF&
padding(3) = UnsignedToLong(dblBits) \ 16777216 And &HFF&
padding(4) = 0
padding(5) = 0
padding(6) = 0
padding(7) = 0
MD5Update 8, padding
End Sub
'
' Break up input stream into 64 byte chunks
'
Public Sub MD5Update(InputLen As Long, InputBuffer() As Byte)
Dim II As Integer
Dim I As Integer
Dim J As Integer
Dim K As Integer
Dim lngBufferedBytes As Long
Dim lngBufferRemaining As Long
Dim lngRem As Long
lngBufferedBytes = ByteCounter Mod 64
lngBufferRemaining = 64 - lngBufferedBytes
ByteCounter = ByteCounter + InputLen
' Use up old buffer results first
If InputLen >= lngBufferRemaining Then
For II = 0 To lngBufferRemaining - 1
ByteBuffer(lngBufferedBytes + II) = InputBuffer(II)
Next II
MD5Transform ByteBuffer
lngRem = (InputLen) Mod 64
' The transfer is a multiple of 64 lets do some transformations
For I = lngBufferRemaining To InputLen - II - lngRem Step 64
For J = 0 To 63
ByteBuffer(J) = InputBuffer(I + J)
Next J
MD5Transform ByteBuffer
Next I
lngBufferedBytes = 0
Else
I = 0
End If
' Buffer any remaining input
For K = 0 To InputLen - I - 1
ByteBuffer(lngBufferedBytes + K) = InputBuffer(I + K)
Next K
End Sub
'
' MD5 Transform
'
Private Sub MD5Transform(Buffer() As Byte)
Dim X(16) As Long
Dim A As Long
Dim b As Long
Dim C As Long
Dim D As Long
A = State(1)
b = State(2)
C = State(3)
  = State(4)
 ecode 64, X, Buffer
' Round 1
FF A, b, C, D, X(0), S11, -680876936
FF D, A, b, C, X(1), S12, -389564586
FF C, D, A, b, X(2), S13, 606105819
FF b, C, D, A, X(3), S14, -1044525330
FF A, b, C, D, X(4), S11, -176418897
FF D, A, b, C, X(5), S12, 1200080426
FF C, D, A, b, X(6), S13, -1473231341
FF b, C, D, A, X(7), S14, -45705983
FF A, b, C, D, X(8), S11, 1770035416
FF D, A, b, C, X(9), S12, -1958414417
FF C, D, A, b, X(10), S13, -42063
FF b, C, D, A, X(11), S14, -1990404162
FF A, b, C, D, X(12), S11, 1804603682
FF D, A, b, C, X(13), S12, -40341101
FF C, D, A, b, X(14), S13, -1502002290
FF b, C, D, A, X(15), S14, 1236535329
' Round 2
GG A, b, C, D, X(1), S21, -165796510
GG D, A, b, C, X(6), S22, -1069501632
GG C, D, A, b, X(11), S23, 643717713
GG b, C, D, A, X(0), S24, -373897302
GG A, b, C, D, X(5), S21, -701558691
GG D, A, b, C, X(10), S22, 38016083
GG C, D, A, b, X(15), S23, -660478335
GG b, C, D, A, X(4), S24, -405537848
GG A, b, C, D, X(9), S21, 568446438
GG D, A, b, C, X(14), S22, -1019803690
GG C, D, A, b, X(3), S23, -187363961
GG b, C, D, A, X(8), S24, 1163531501
GG A, b, C, D, X(13), S21, -1444681467
GG D, A, b, C, X(2), S22, -51403784
GG C, D, A, b, X(7), S23, 1735328473
GG b, C, D, A, X(12), S24, -1926607734
' Round 3
HH A, b, C, D, X(5), S31, -378558
HH D, A, b, C, X(8), S32, -2022574463
HH C, D, A, b, X(11), S33, 1839030562
HH b, C, D, A, X(14), S34, -35309556
HH A, b, C, D, X(1), S31, -1530992060
HH D, A, b, C, X(4), S32, 1272893353
HH C, D, A, b, X(7), S33, -155497632
HH b, C, D, A, X(10), S34, -1094730640
HH A, b, C, D, X(13), S31, 681279174
HH D, A, b, C, X(0), S32, -358537222
HH C, D, A, b, X(3), S33, -722521979
HH b, C, D, A, X(6), S34, 76029189
HH A, b, C, D, X(9), S31, -640364487
HH D, A, b, C, X(12), S32, -421815835
HH C, D, A, b, X(15), S33, 530742520
HH b, C, D, A, X(2), S34, -995338651
' Round 4
II A, b, C, D, X(0), S41, -198630844
II D, A, b, C, X(7), S42, 1126891415
II C, D, A, b, X(14), S43, -1416354905
II b, C, D, A, X(5), S44, -57434055
II A, b, C, D, X(12), S41, 1700485571
II D, A, b, C, X(3), S42, -1894986606
II C, D, A, b, X(10), S43, -1051523
II b, C, D, A, X(1), S44, -2054922799
II A, b, C, D, X(8), S41, 1873313359
II D, A, b, C, X(15), S42, -30611744
II C, D, A, b, X(6), S43, -1560198380
II b, C, D, A, X(13), S44, 1309151649
II A, b, C, D, X(4), S41, -145523070
II D, A, b, C, X(11), S42, -1120210379
II C, D, A, b, X(2), S43, 718787259
II b, C, D, A, X(9), S44, -343485551
State(1) = LongOverflowAdd(State(1), A)
State(2) = LongOverflowAdd(State(2), b)
State(3) = LongOverflowAdd(State(3), C)
State(4) = LongOverflowAdd(State(4), D)
Private Sub Decode(Length As Integer, OutputBuffer() As Long, InputBuffer() As Byte)
Dim intDblIndex As Integer
Dim intByteIndex As Integer
Dim dblSum As Double
intDblIndex = 0
For intByteIndex = 0 To Length - 1 Step 4
dblSum = InputBuffer(intByteIndex) + _
InputBuffer(intByteIndex + 1) * 256# + _
InputBuffer(intByteIndex + 2) * 65536# + _
InputBuffer(intByteIndex + 3) * 16777216#
OutputBuffer(intDblIndex) = UnsignedToLong(dblSum)
intDblIndex = intDblIndex + 1
Next intByteIndex
End Sub
'
' FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
' Rotation is separate from addition to prevent recomputation.
'
Private Function FF(A As Long, _
b As Long, _
C As Long, _
  As Long, _
X As Long, _
s As Long, _
ac As Long) As Long
A = LongOverflowAdd4(A, (b And C) Or (Not (b) And D), X, ac)
A = LongLeftRotate(A, s)
A = LongOverflowAdd(A, b)
End Function
Private Function GG(A As Long, _
b As Long, _
C As Long, _
  As Long, _
X As Long, _
s As Long, _
ac As Long) As Long
A = LongOverflowAdd4(A, (b And D) Or (C And Not (D)), X, ac)
A = LongLeftRotate(A, s)
A = LongOverflowAdd(A, b)
End Function
Private Function HH(A As Long, _
b As Long, _
C As Long, _
  As Long, _
X As Long, _
s As Long, _
ac As Long) As Long
A = LongOverflowAdd4(A, b Xor C Xor D, X, ac)
A = LongLeftRotate(A, s)
A = LongOverflowAdd(A, b)
End Function
Private Function II(A As Long, _
b As Long, _
C As Long, _
  As Long, _
X As Long, _
s As Long, _
ac As Long) As Long
A = LongOverflowAdd4(A, C Xor (b Or Not (D)), X, ac)
A = LongLeftRotate(A, s)
A = LongOverflowAdd(A, b)
End Function
'
' Rotate a long to the right
'
Function LongLeftRotate(Value As Long, Bits As Long) As Long
Dim lngSign As Long
Dim lngI As Long
Bits = Bits Mod 32
If Bits = 0 Then LongLeftRotate = Value: Exit Function
For lngI = 1 To Bits
lngSign = Value And &HC0000000
Value = (Value And &H3FFFFFFF) * 2
Value = Value Or ((lngSign < 0) And 1) Or (CBool(lngSign And _
&H40000000) And &H80000000)
Next
LongLeftRotate = Value
End Function
'
' Function to add two unsigned numbers together as in C.
' Overflows are ignored!
'
Private Function LongOverflowAdd(Val1 As Long, Val2 As Long) As Long
Dim lngHighWord As Long
Dim lngLowWord As Long
Dim lngOverflow As Long
lngLowWord = (Val1 And &HFFFF& + (Val2 And &HFFFF&
lngOverflow = lngLowWord \ 65536
lngHighWord = (((Val1 And &HFFFF0000) \ 65536) + ((Val2 And &HFFFF0000) \ 65536) + lngOverflow) And &HFFFF&
LongOverflowAdd = UnsignedToLong((lngHighWord * 65536#) + (lngLowWord And &HFFFF&)
End Function
'
' Function to add two unsigned numbers together as in C.
' Overflows are ignored!
'
Private Function LongOverflowAdd4(Val1 As Long, Val2 As Long, val3 As Long, val4 As Long) As Long
Dim lngHighWord As Long
Dim lngLowWord As Long
Dim lngOverflow As Long
lngLowWord = (Val1 And &HFFFF& + (Val2 And &HFFFF& + (val3 And &HFFFF& + (val4 And &HFFFF&
lngOverflow = lngLowWord \ 65536
lngHighWord = (((Val1 And &HFFFF0000) \ 65536) + _
 (Val2 And &HFFFF0000) \ 65536) + _
 (val3 And &HFFFF0000) \ 65536) + _
 (val4 And &HFFFF0000) \ 65536) + _
lngOverflow) And &HFFFF&
LongOverflowAdd4 = UnsignedToLong((lngHighWord * 65536#) + (lngLowWord And &HFFFF&)
End Function
'
' Convert an unsigned double into a long
'
Private Function UnsignedToLong(Value As Double) As Long
If Value < 0 Or Value >= OFFSET_4 Then Error 6 ' Overflow
If Value <= MAXINT_4 Then
UnsignedToLong = Value
Else
UnsignedToLong = Value - OFFSET_4
End If
End Function
'
' Convert a long to an unsigned Double
'
Private Function LongToUnsigned(Value As Long) As Double
If Value < 0 Then
LongToUnsigned = Value + OFFSET_4
Else
LongToUnsigned = Value
End If
End Function
'=
'= Class Properties
'=
Public Property Get ProgressObject() As Object
Set ProgressObject = fbObject
End Property
Public Property Set ProgressObject(ByVal NewValue As Object)
Set fbObject = Nothing
Set fbObject = NewValue
End Property
Public Property Get ProgressProc() As String
ProgressProc = fbProc
End Property
Public Property Let ProgressProc(ByVal NewValue As String)
fbProc = NewValue
End Property
Public Property Get ProgressMin() As Single
ProgressMin = fbpMin
End Property
Public Property Let ProgressMin(ByVal NewValue As Single)
fbpMin = NewValue
End Property
Public Property Get ProgressMax() As Single
ProgressMin = fbpMax
End Property
Public Property Let ProgressMax(ByVal NewValue As Single)
fbpMax = NewValue
End Property
Public Sub SetProgressProc(ByVal NewProgressObject As Object, Optional ByVal NewProgressProc As String, Optional ByVal NewProgressMin As Single = 0!, Optional ByVal NewProgressMax As Single = 1!, Optional ByVal NewProgressGrades As Long)
If NewProgressObject Is Nothing Then
Set fbObject = Nothing
fbProc = vbNullString
Else
Set fbObject = Nothing
Set fbObject = NewProgressObject
fbProc = NewProgressProc
End If
fbpMin = NewProgressMin
fbpMax = NewProgressMax
fbpGrades = NewProgressGrades
End Sub
Private Sub Class_Initialize()
Set fbObject = Nothing
End Sub
Private Sub Class_Terminate()
Set fbObject = Nothing
End Sub