CRYPTO ciphers md4, md5, sha

Cryptography/SHA/sha1.py

@@ -0,0 +1,81 @@
+# SHA1 Python 2 implementation
+# Copyright (C) 2013  Filippo Valsorda
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+#
+# Based on a MIT licensed work by Stefano Palazzo (C) 2011
+# https://github.com/sfstpala/SlowSHA/blob/master/slowsha.py
+
+import struct
+import binascii
+
+lrot = lambda x, n: (x << n) | (x >> (32 - n))
+
+
+class SHA1():
+
+    _h0, _h1, _h2, _h3, _h4, = (
+        0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0)
+
+    def __init__(self, message):
+        length = struct.pack('>Q', len(message) * 8)
+        while len(message) > 64:
+            self._handle(message[:64])
+            message = message[64:]
+        message += '\x80'
+        message += '\x00' * ((56 - len(message) % 64) % 64)
+        message += length
+        while len(message):
+            self._handle(message[:64])
+            message = message[64:]
+
+    def _handle(self, chunk):
+        w = list(struct.unpack('>' + 'I' * 16, chunk))
+
+        for i in range(16, 80):
+            w.append(lrot(w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16], 1)
+                     & 0xffffffff)
+
+        a = self._h0
+        b = self._h1
+        c = self._h2
+        d = self._h3
+        e = self._h4
+
+        for i in range(80):
+
+            if i <= i <= 19:
+                f, k = d ^ (b & (c ^ d)), 0x5a827999
+            elif 20 <= i <= 39:
+                f, k = b ^ c ^ d, 0x6ed9eba1
+            elif 40 <= i <= 59:
+                f, k = (b & c) | (d & (b | c)), 0x8f1bbcdc
+            elif 60 <= i <= 79:
+                f, k = b ^ c ^ d, 0xca62c1d6
+
+            temp = lrot(a, 5) + f + e + k + w[i] & 0xffffffff
+            a, b, c, d, e = temp, a, lrot(b, 30), c, d
+
+        self._h0 = (self._h0 + a) & 0xffffffff
+        self._h1 = (self._h1 + b) & 0xffffffff
+        self._h2 = (self._h2 + c) & 0xffffffff
+        self._h3 = (self._h3 + d) & 0xffffffff
+        self._h4 = (self._h4 + e) & 0xffffffff
+
+    def digest(self):
+        return struct.pack('>IIIII', self._h0, self._h1,
+                           self._h2, self._h3, self._h4)
+
+    def hexdigest(self):
+        return binascii.hexlify(self.digest()).decode()