Advertisement
minimite

md5

Jul 23rd, 2015
291
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Lua 10.39 KB | None | 0 0
  1. --[[
  2.   _VERSION     = "md5.lua 1.0.2",
  3.   _DESCRIPTION = "MD5 computation in Lua (5.1-3, LuaJIT)",
  4.   _URL         = "https://github.com/kikito/md5.lua",
  5.   _LICENSE     = [=[
  6.     MIT LICENSE
  7.  
  8.     Copyright (c) 2013 Enrique García Cota + Adam Baldwin + hanzao + Equi 4 Software
  9.  
  10.     Permission is hereby granted, free of charge, to any person obtaining a
  11.     copy of this software and associated documentation files (the
  12.     "Software"), to deal in the Software without restriction, including
  13.     without limitation the rights to use, copy, modify, merge, publish,
  14.     distribute, sublicense, and/or sell copies of the Software, and to
  15.     permit persons to whom the Software is furnished to do so, subject to
  16.     the following conditions:
  17.  
  18.     The above copyright notice and this permission notice shall be included
  19.     in all copies or substantial portions of the Software.
  20.  
  21.     THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  22.     OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  23.     MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
  24.     IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
  25.     CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  26.     TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
  27.     SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  28.   ]=]
  29. ]]
  30.  
  31. -- bit lib implementions
  32.  
  33. local char, byte, format, rep, sub =
  34.   string.char, string.byte, string.format, string.rep, string.sub
  35. local bit_or, bit_and, bit_not, bit_xor, bit_rshift, bit_lshift
  36.  
  37. local ok, bit = pcall(require, 'bit')
  38. if ok then
  39.   bit_or, bit_and, bit_not, bit_xor, bit_rshift, bit_lshift = bit.bor, bit.band, bit.bnot, bit.bxor, bit.rshift, bit.lshift
  40. else
  41.   ok, bit = pcall(require, 'bit32')
  42.  
  43.   if ok then
  44.  
  45.     bit_not = bit.bnot
  46.  
  47.     local tobit = function(n)
  48.       return n <= 0x7fffffff and n or -(bit_not(n) + 1)
  49.     end
  50.  
  51.     local normalize = function(f)
  52.       return function(a,b) return tobit(f(tobit(a), tobit(b))) end
  53.     end
  54.  
  55.     bit_or, bit_and, bit_xor = normalize(bit.bor), normalize(bit.band), normalize(bit.bxor)
  56.     bit_rshift, bit_lshift = normalize(bit.rshift), normalize(bit.lshift)
  57.  
  58.   else
  59.  
  60.     local function tbl2number(tbl)
  61.       local result = 0
  62.       local power = 1
  63.       for i = 1, #tbl do
  64.         result = result + tbl[i] * power
  65.         power = power * 2
  66.       end
  67.       return result
  68.     end
  69.  
  70.     local function expand(t1, t2)
  71.       local big, small = t1, t2
  72.       if(#big < #small) then
  73.         big, small = small, big
  74.       end
  75.       -- expand small
  76.       for i = #small + 1, #big do
  77.         small[i] = 0
  78.       end
  79.     end
  80.  
  81.     local to_bits -- needs to be declared before bit_not
  82.  
  83.     bit_not = function(n)
  84.       local tbl = to_bits(n)
  85.       local size = math.max(#tbl, 32)
  86.       for i = 1, size do
  87.         if(tbl[i] == 1) then
  88.           tbl[i] = 0
  89.         else
  90.           tbl[i] = 1
  91.         end
  92.       end
  93.       return tbl2number(tbl)
  94.     end
  95.  
  96.     -- defined as local above
  97.     to_bits = function (n)
  98.       if(n < 0) then
  99.         -- negative
  100.         return to_bits(bit_not(math.abs(n)) + 1)
  101.       end
  102.       -- to bits table
  103.       local tbl = {}
  104.       local cnt = 1
  105.       local last
  106.       while n > 0 do
  107.         last      = n % 2
  108.         tbl[cnt]  = last
  109.         n         = (n-last)/2
  110.         cnt       = cnt + 1
  111.       end
  112.  
  113.       return tbl
  114.     end
  115.  
  116.     bit_or = function(m, n)
  117.       local tbl_m = to_bits(m)
  118.       local tbl_n = to_bits(n)
  119.       expand(tbl_m, tbl_n)
  120.  
  121.       local tbl = {}
  122.       for i = 1, #tbl_m do
  123.         if(tbl_m[i]== 0 and tbl_n[i] == 0) then
  124.           tbl[i] = 0
  125.         else
  126.           tbl[i] = 1
  127.         end
  128.       end
  129.  
  130.       return tbl2number(tbl)
  131.     end
  132.  
  133.     bit_and = function(m, n)
  134.       local tbl_m = to_bits(m)
  135.       local tbl_n = to_bits(n)
  136.       expand(tbl_m, tbl_n)
  137.  
  138.       local tbl = {}
  139.       for i = 1, #tbl_m do
  140.         if(tbl_m[i]== 0 or tbl_n[i] == 0) then
  141.           tbl[i] = 0
  142.         else
  143.           tbl[i] = 1
  144.         end
  145.       end
  146.  
  147.       return tbl2number(tbl)
  148.     end
  149.  
  150.     bit_xor = function(m, n)
  151.       local tbl_m = to_bits(m)
  152.       local tbl_n = to_bits(n)
  153.       expand(tbl_m, tbl_n)
  154.  
  155.       local tbl = {}
  156.       for i = 1, #tbl_m do
  157.         if(tbl_m[i] ~= tbl_n[i]) then
  158.           tbl[i] = 1
  159.         else
  160.           tbl[i] = 0
  161.         end
  162.       end
  163.  
  164.       return tbl2number(tbl)
  165.     end
  166.  
  167.     bit_rshift = function(n, bits)
  168.       local high_bit = 0
  169.       if(n < 0) then
  170.         -- negative
  171.         n = bit_not(math.abs(n)) + 1
  172.         high_bit = 0x80000000
  173.       end
  174.  
  175.       local floor = math.floor
  176.  
  177.       for i=1, bits do
  178.         n = n/2
  179.         n = bit_or(floor(n), high_bit)
  180.       end
  181.       return floor(n)
  182.     end
  183.  
  184.     bit_lshift = function(n, bits)
  185.       if(n < 0) then
  186.         -- negative
  187.         n = bit_not(math.abs(n)) + 1
  188.       end
  189.  
  190.       for i=1, bits do
  191.         n = n*2
  192.       end
  193.       return bit_and(n, 0xFFFFFFFF)
  194.     end
  195.   end
  196. end
  197.  
  198. -- convert little-endian 32-bit int to a 4-char string
  199. local function lei2str(i)
  200.   local f=function (s) return char( bit_and( bit_rshift(i, s), 255)) end
  201.   return f(0)..f(8)..f(16)..f(24)
  202. end
  203.  
  204. -- convert raw string to big-endian int
  205. local function str2bei(s)
  206.   local v=0
  207.   for i=1, #s do
  208.     v = v * 256 + byte(s, i)
  209.   end
  210.   return v
  211. end
  212.  
  213. -- convert raw string to little-endian int
  214. local function str2lei(s)
  215.   local v=0
  216.   for i = #s,1,-1 do
  217.     v = v*256 + byte(s, i)
  218.   end
  219.   return v
  220. end
  221.  
  222. -- cut up a string in little-endian ints of given size
  223. local function cut_le_str(s,...)
  224.   local o, r = 1, {}
  225.   local args = {...}
  226.   for i=1, #args do
  227.     table.insert(r, str2lei(sub(s, o, o + args[i] - 1)))
  228.     o = o + args[i]
  229.   end
  230.   return r
  231. end
  232.  
  233. local swap = function (w) return str2bei(lei2str(w)) end
  234.  
  235. local function hex2binaryaux(hexval)
  236.   return char(tonumber(hexval, 16))
  237. end
  238.  
  239. local function hex2binary(hex)
  240.   local result, _ = hex:gsub('..', hex2binaryaux)
  241.   return result
  242. end
  243.  
  244. -- An MD5 mplementation in Lua, requires bitlib (hacked to use LuaBit from above, ugh)
  245. -- 10/02/2001 jcw@equi4.com
  246.  
  247. local CONSTS = {
  248.   0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
  249.   0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  250.   0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  251.   0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  252.   0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
  253.   0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
  254.   0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  255.   0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  256.   0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
  257.   0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  258.   0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
  259.   0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  260.   0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
  261.   0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  262.   0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  263.   0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
  264.   0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476
  265. }
  266.  
  267. local f=function (x,y,z) return bit_or(bit_and(x,y),bit_and(-x-1,z)) end
  268. local g=function (x,y,z) return bit_or(bit_and(x,z),bit_and(y,-z-1)) end
  269. local h=function (x,y,z) return bit_xor(x,bit_xor(y,z)) end
  270. local i=function (x,y,z) return bit_xor(y,bit_or(x,-z-1)) end
  271. local z=function (f,a,b,c,d,x,s,ac)
  272.   a=bit_and(a+f(b,c,d)+x+ac,0xFFFFFFFF)
  273.   -- be *very* careful that left shift does not cause rounding!
  274.   return bit_or(bit_lshift(bit_and(a,bit_rshift(0xFFFFFFFF,s)),s),bit_rshift(a,32-s))+b
  275. end
  276.  
  277. local function transform(A,B,C,D,X)
  278.   local a,b,c,d=A,B,C,D
  279.   local t=CONSTS
  280.  
  281.   a=z(f,a,b,c,d,X[ 0], 7,t[ 1])
  282.   d=z(f,d,a,b,c,X[ 1],12,t[ 2])
  283.   c=z(f,c,d,a,b,X[ 2],17,t[ 3])
  284.   b=z(f,b,c,d,a,X[ 3],22,t[ 4])
  285.   a=z(f,a,b,c,d,X[ 4], 7,t[ 5])
  286.   d=z(f,d,a,b,c,X[ 5],12,t[ 6])
  287.   c=z(f,c,d,a,b,X[ 6],17,t[ 7])
  288.   b=z(f,b,c,d,a,X[ 7],22,t[ 8])
  289.   a=z(f,a,b,c,d,X[ 8], 7,t[ 9])
  290.   d=z(f,d,a,b,c,X[ 9],12,t[10])
  291.   c=z(f,c,d,a,b,X[10],17,t[11])
  292.   b=z(f,b,c,d,a,X[11],22,t[12])
  293.   a=z(f,a,b,c,d,X[12], 7,t[13])
  294.   d=z(f,d,a,b,c,X[13],12,t[14])
  295.   c=z(f,c,d,a,b,X[14],17,t[15])
  296.   b=z(f,b,c,d,a,X[15],22,t[16])
  297.  
  298.   a=z(g,a,b,c,d,X[ 1], 5,t[17])
  299.   d=z(g,d,a,b,c,X[ 6], 9,t[18])
  300.   c=z(g,c,d,a,b,X[11],14,t[19])
  301.   b=z(g,b,c,d,a,X[ 0],20,t[20])
  302.   a=z(g,a,b,c,d,X[ 5], 5,t[21])
  303.   d=z(g,d,a,b,c,X[10], 9,t[22])
  304.   c=z(g,c,d,a,b,X[15],14,t[23])
  305.   b=z(g,b,c,d,a,X[ 4],20,t[24])
  306.   a=z(g,a,b,c,d,X[ 9], 5,t[25])
  307.   d=z(g,d,a,b,c,X[14], 9,t[26])
  308.   c=z(g,c,d,a,b,X[ 3],14,t[27])
  309.   b=z(g,b,c,d,a,X[ 8],20,t[28])
  310.   a=z(g,a,b,c,d,X[13], 5,t[29])
  311.   d=z(g,d,a,b,c,X[ 2], 9,t[30])
  312.   c=z(g,c,d,a,b,X[ 7],14,t[31])
  313.   b=z(g,b,c,d,a,X[12],20,t[32])
  314.  
  315.   a=z(h,a,b,c,d,X[ 5], 4,t[33])
  316.   d=z(h,d,a,b,c,X[ 8],11,t[34])
  317.   c=z(h,c,d,a,b,X[11],16,t[35])
  318.   b=z(h,b,c,d,a,X[14],23,t[36])
  319.   a=z(h,a,b,c,d,X[ 1], 4,t[37])
  320.   d=z(h,d,a,b,c,X[ 4],11,t[38])
  321.   c=z(h,c,d,a,b,X[ 7],16,t[39])
  322.   b=z(h,b,c,d,a,X[10],23,t[40])
  323.   a=z(h,a,b,c,d,X[13], 4,t[41])
  324.   d=z(h,d,a,b,c,X[ 0],11,t[42])
  325.   c=z(h,c,d,a,b,X[ 3],16,t[43])
  326.   b=z(h,b,c,d,a,X[ 6],23,t[44])
  327.   a=z(h,a,b,c,d,X[ 9], 4,t[45])
  328.   d=z(h,d,a,b,c,X[12],11,t[46])
  329.   c=z(h,c,d,a,b,X[15],16,t[47])
  330.   b=z(h,b,c,d,a,X[ 2],23,t[48])
  331.  
  332.   a=z(i,a,b,c,d,X[ 0], 6,t[49])
  333.   d=z(i,d,a,b,c,X[ 7],10,t[50])
  334.   c=z(i,c,d,a,b,X[14],15,t[51])
  335.   b=z(i,b,c,d,a,X[ 5],21,t[52])
  336.   a=z(i,a,b,c,d,X[12], 6,t[53])
  337.   d=z(i,d,a,b,c,X[ 3],10,t[54])
  338.   c=z(i,c,d,a,b,X[10],15,t[55])
  339.   b=z(i,b,c,d,a,X[ 1],21,t[56])
  340.   a=z(i,a,b,c,d,X[ 8], 6,t[57])
  341.   d=z(i,d,a,b,c,X[15],10,t[58])
  342.   c=z(i,c,d,a,b,X[ 6],15,t[59])
  343.   b=z(i,b,c,d,a,X[13],21,t[60])
  344.   a=z(i,a,b,c,d,X[ 4], 6,t[61])
  345.   d=z(i,d,a,b,c,X[11],10,t[62])
  346.   c=z(i,c,d,a,b,X[ 2],15,t[63])
  347.   b=z(i,b,c,d,a,X[ 9],21,t[64])
  348.  
  349.   return A+a,B+b,C+c,D+d
  350. end
  351.  
  352. ----------------------------------------------------------------
  353.  
  354. function sumhexa(s)
  355.   local msgLen = #s
  356.   local padLen = 56 - msgLen % 64
  357.  
  358.   if msgLen % 64 > 56 then padLen = padLen + 64 end
  359.  
  360.   if padLen == 0 then padLen = 64 end
  361.  
  362.   s = s .. char(128) .. rep(char(0),padLen-1) .. lei2str(8*msgLen) .. lei2str(0)
  363.  
  364.   assert(#s % 64 == 0)
  365.  
  366.   local t = CONSTS
  367.   local a,b,c,d = t[65],t[66],t[67],t[68]
  368.  
  369.   for i=1,#s,64 do
  370.     local X = cut_le_str(sub(s,i,i+63),4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4)
  371.     assert(#X == 16)
  372.     X[0] = table.remove(X,1) -- zero based!
  373.     a,b,c,d = transform(a,b,c,d,X)
  374.   end
  375.  
  376.   return format("%08x%08x%08x%08x",swap(a),swap(b),swap(c),swap(d))
  377. end
  378.  
  379. function sum(s)
  380.   return hex2binary(md5.sumhexa(s))
  381. end
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement