June 2018 Update
This commit is contained in:
parent
ba8067c3b7
commit
22f33d4004
5278 changed files with 84726 additions and 14379 deletions
|
|
@ -12,7 +12,7 @@ on md5 (input)
|
|||
|
||||
-- Create list, fill with zeros...
|
||||
x = []
|
||||
x.SetAt(t_iCnt, 0)
|
||||
x[t_iCnt] = 0
|
||||
|
||||
t_fArr = [1, 256, 65536, 16777216]
|
||||
i = 0
|
||||
|
|
@ -32,18 +32,15 @@ on md5 (input)
|
|||
x[(t_iLen + 64) / 512 * 16 + 15] = t_iLen
|
||||
|
||||
-- Actual algorithm starts here...
|
||||
|
||||
a = 1732584193
|
||||
b = -271733879
|
||||
c = -1732584194
|
||||
d = 271733878
|
||||
i = 1
|
||||
|
||||
t_iWrap = the maxInteger + 1
|
||||
t_iCount = x.count + 1
|
||||
|
||||
repeat while i < t_iCount
|
||||
|
||||
olda = a
|
||||
oldb = b
|
||||
oldc = c
|
||||
|
|
@ -248,17 +245,14 @@ on md5 (input)
|
|||
n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 9] - 343485551
|
||||
if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c
|
||||
else b = bitOr(n * 2097152, n / 2048) + c
|
||||
|
||||
a = a + olda
|
||||
b = b + oldb
|
||||
c = c + oldc
|
||||
d = d + oldd
|
||||
i = i + 16
|
||||
|
||||
end repeat
|
||||
|
||||
t_iArr = [a, b, c, d]
|
||||
|
||||
ba = bytearray()
|
||||
p = 1
|
||||
repeat with i in t_iArr
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue