From 3a2e859acd5bb3f1c11a8cce758759afd803feba Mon Sep 17 00:00:00 2001 From: Bart van Strien Date: Sat, 2 Apr 2016 18:39:53 +0200 Subject: [PATCH] Add love.math.hash, which supports MD5/SHA-1/SHA-2. --HG-- branch : minor --- CMakeLists.txt | 2 + changes.txt | 1 + .../xcode/liblove.xcodeproj/project.pbxproj | 8 + src/modules/math/HashFunction.cpp | 632 ++++++++++++++++++ src/modules/math/HashFunction.h | 91 +++ src/modules/math/MathModule.cpp | 14 + src/modules/math/MathModule.h | 13 + src/modules/math/wrap_Math.cpp | 25 + 8 files changed, 786 insertions(+) create mode 100644 src/modules/math/HashFunction.cpp create mode 100644 src/modules/math/HashFunction.h diff --git a/CMakeLists.txt b/CMakeLists.txt index cddf70019..d25bcd54f 100755 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -460,6 +460,8 @@ set(LOVE_SRC_MODULE_MATH src/modules/math/CompressedData.h src/modules/math/Compressor.cpp src/modules/math/Compressor.h + src/modules/math/HashFunction.cpp + src/modules/math/HashFunction.h src/modules/math/MathModule.cpp src/modules/math/MathModule.h src/modules/math/RandomGenerator.cpp diff --git a/changes.txt b/changes.txt index d252995d9..39cedd3b6 100644 --- a/changes.txt +++ b/changes.txt @@ -7,6 +7,7 @@ Released: N/A * Added love.filesystem.get/setCRequirePath, and use that to find c libraries for require. * Added Channel:hasRead, which checks if a message has been read. Takes an id, which Channel:push will now return. * Added love.math.encode/decode, which support hex and base64. + * Added love.math.hash, which supports MD5, SHA-1 and the SHA-2 family. * Changed all color values to be in the range 0-1, rather than 0-255. * Changed love.graphics.print and friends to ignore carriage returns. diff --git a/platform/xcode/liblove.xcodeproj/project.pbxproj b/platform/xcode/liblove.xcodeproj/project.pbxproj index d21bd683c..d55c1ee8a 100644 --- a/platform/xcode/liblove.xcodeproj/project.pbxproj +++ b/platform/xcode/liblove.xcodeproj/project.pbxproj @@ -819,6 +819,8 @@ FA19C4C51B4B0BD50059B0B3 /* wrap_Video.cpp in Sources */ = {isa = PBXBuildFile; fileRef = FA19C4C21B4B0BD50059B0B3 /* wrap_Video.cpp */; }; FA19C4C61B4B0BD50059B0B3 /* wrap_Video.cpp in Sources */ = {isa = PBXBuildFile; fileRef = FA19C4C21B4B0BD50059B0B3 /* wrap_Video.cpp */; }; FA19C4C71B4B0BD50059B0B3 /* wrap_Video.h in Headers */ = {isa = PBXBuildFile; fileRef = FA19C4C31B4B0BD50059B0B3 /* wrap_Video.h */; }; + FA1DC2631C5D9555008F99A0 /* HashFunction.cpp in Sources */ = {isa = PBXBuildFile; fileRef = FA1DC2611C5D9555008F99A0 /* HashFunction.cpp */; }; + FA1DC2641C5D9555008F99A0 /* HashFunction.h in Headers */ = {isa = PBXBuildFile; fileRef = FA1DC2621C5D9555008F99A0 /* HashFunction.h */; }; FA27B39D1B498151008A9DCE /* Video.cpp in Sources */ = {isa = PBXBuildFile; fileRef = FA27B38A1B498151008A9DCE /* Video.cpp */; }; FA27B39E1B498151008A9DCE /* Video.cpp in Sources */ = {isa = PBXBuildFile; fileRef = FA27B38A1B498151008A9DCE /* Video.cpp */; }; FA27B39F1B498151008A9DCE /* Video.h in Headers */ = {isa = PBXBuildFile; fileRef = FA27B38B1B498151008A9DCE /* Video.h */; }; @@ -1502,6 +1504,8 @@ FA19C4C21B4B0BD50059B0B3 /* wrap_Video.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = wrap_Video.cpp; sourceTree = ""; }; FA19C4C31B4B0BD50059B0B3 /* wrap_Video.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = wrap_Video.h; sourceTree = ""; }; FA19C4C41B4B0BD50059B0B3 /* wrap_Video.lua */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = wrap_Video.lua; sourceTree = ""; }; + FA1DC2611C5D9555008F99A0 /* HashFunction.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = HashFunction.cpp; sourceTree = ""; }; + FA1DC2621C5D9555008F99A0 /* HashFunction.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = HashFunction.h; sourceTree = ""; }; FA27B38A1B498151008A9DCE /* Video.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = Video.cpp; sourceTree = ""; }; FA27B38B1B498151008A9DCE /* Video.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = Video.h; sourceTree = ""; }; FA27B38C1B498151008A9DCE /* VideoStream.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = VideoStream.cpp; sourceTree = ""; }; @@ -2450,6 +2454,8 @@ FAB17BEA1ABFAF1800F9BA27 /* CompressedData.h */, FAB17BDE1ABFAA2000F9BA27 /* Compressor.cpp */, FAB17BDF1ABFAA2000F9BA27 /* Compressor.h */, + FA1DC2611C5D9555008F99A0 /* HashFunction.cpp */, + FA1DC2621C5D9555008F99A0 /* HashFunction.h */, FA0B7C031A95902C000E1D17 /* MathModule.cpp */, FA0B7C041A95902C000E1D17 /* MathModule.h */, FA0B7C051A95902C000E1D17 /* RandomGenerator.cpp */, @@ -3032,6 +3038,7 @@ FA0B7AAF1A958EA3000E1D17 /* b2WheelJoint.h in Headers */, FA0B7D1A1A95902C000E1D17 /* TrueTypeRasterizer.h in Headers */, FA0B7EA81A95902C000E1D17 /* wrap_Decoder.h in Headers */, + FA1DC2641C5D9555008F99A0 /* HashFunction.h in Headers */, FA0B7AC51A958EA3000E1D17 /* time.h in Headers */, FA0B793E1A958E3B000E1D17 /* StringMap.h in Headers */, FA0B793A1A958E3B000E1D17 /* Reference.h in Headers */, @@ -3848,6 +3855,7 @@ FA0B7B1B1A958EA3000E1D17 /* usocket.c in Sources */, FA0B7E3C1A95902C000E1D17 /* wrap_Body.cpp in Sources */, FA0B7D791A95902C000E1D17 /* Quad.cpp in Sources */, + FA1DC2631C5D9555008F99A0 /* HashFunction.cpp in Sources */, FA620A3A1AA305F6005DB4C2 /* types.cpp in Sources */, FA0B7DD31A95902C000E1D17 /* BezierCurve.cpp in Sources */, FA0B7E7B1A95902C000E1D17 /* wrap_World.cpp in Sources */, diff --git a/src/modules/math/HashFunction.cpp b/src/modules/math/HashFunction.cpp new file mode 100644 index 000000000..c738a6721 --- /dev/null +++ b/src/modules/math/HashFunction.cpp @@ -0,0 +1,632 @@ +/** + * Copyright (c) 2006-2016 LOVE Development Team + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any damages + * arising from the use of this software. + * + * Permission is granted to anyone to use this software for any purpose, + * including commercial applications, and to alter it and redistribute it + * freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you must not + * claim that you wrote the original software. If you use this software + * in a product, an acknowledgment in the product documentation would be + * appreciated but is not required. + * 2. Altered source versions must be plainly marked as such, and must not be + * misrepresented as being the original software. + * 3. This notice may not be removed or altered from any source distribution. + **/ + +#include "HashFunction.h" + +// FIXME: Probably trivial by having tole and tobe functions, which can be ifdeffed to being identity functions +#ifdef LOVE_BIG_ENDIAN +# error Hashing not yet implemented for big endian +#endif + +namespace love +{ +namespace math +{ + +namespace +{ +namespace impl +{ + +inline uint32_t leftrot(uint32_t x, uint8_t amount) +{ + return (x << amount) | (x >> (32 - amount)); +} + +inline uint32_t rightrot(uint32_t x, uint8_t amount) +{ + return (x >> amount) | (x << (32 - amount)); +} + +inline uint64_t rightrot(uint64_t x, uint8_t amount) +{ + return (x >> amount) | (x << (64 - amount)); +} + +/** + * The following implementation is based on the pseudocode provided by multiple + * authors on wikipedia: https://en.wikipedia.org/wiki/MD5 + * The pseudocode is licensed under the CC-BY-SA license, but no authorship + * information is present. I believe this note, and the zlib license of this + * project satisfy the conditions of the license. + **/ +class MD5 : public HashFunction +{ +private: + const uint8_t shifts[64] = { + 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, + 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, + 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, + 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, + }; + const uint32_t constants[64] = { + 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, + 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501, + 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, + 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821, + 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, + 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8, + 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, + 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a, + 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, + 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, + 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05, + 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665, + 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, + 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1, + 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, + 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391, + }; + +public: + bool isSupported(Function function) const override + { + return function == FUNCTION_MD5; + } + + std::string hash(Function function, const char *input, uint64_t length) const override + { + if (function != FUNCTION_MD5) + throw love::Exception("Hash function not supported by MD5 implementation"); + + uint32_t a0 = 0x67452301; + uint32_t b0 = 0xefcdab89; + uint32_t c0 = 0x98badcfe; + uint32_t d0 = 0x10325476; + + // Do the required padding + uint64_t paddedLength = length; + if (length % 64 < 56) + paddedLength += 56-length%64; + if (length % 64 > 56) + paddedLength += 120-length%64; + uint8_t *padded = new uint8_t[paddedLength+8]; + memcpy(padded, input, length); + memset(padded+length, 0, paddedLength-length); + padded[length] = 0x80; + *((uint64_t*) &padded[paddedLength]) = length*8; + paddedLength += 8; + + for (uint64_t i = 0; i < paddedLength; i += 64) + { + uint32_t *chunk = (uint32_t*) &padded[i]; + + uint32_t A = a0; + uint32_t B = b0; + uint32_t C = c0; + uint32_t D = d0; + uint32_t F; + uint32_t g; + + for (int j = 0; j < 64; j++) + { + if (j < 16) + { + F = (B & C) | (~B & D); + g = j; + } + else if (j < 32) + { + F = (D & B) | (~D & C); + g = (5*j + 1) % 16; + } + else if (j < 48) + { + F = B ^ C ^ D; + g = (3*j + 5) % 16; + } + else + { + F = C ^ (B | ~D); + g = (7*j) % 16; + } + + uint32_t temp = D; + D = C; + C = B; + B += leftrot(A + F + constants[j] + chunk[g], shifts[j]); + A = temp; + } + + a0 += A; + b0 += B; + c0 += C; + d0 += D; + } + + delete[] padded; + + std::string hash(16, ' '); + hash.replace( 0, 4, (const char*) &a0, 4); + hash.replace( 4, 4, (const char*) &b0, 4); + hash.replace( 8, 4, (const char*) &c0, 4); + hash.replace(12, 4, (const char*) &d0, 4); + return hash; + } +} md5; + +/** + * The following implementation was based on the text, not the code listings, + * in RFC3174. I believe this means no copyright other than that of the LÖVE + * Development Team applies. + **/ +class SHA1 : public HashFunction +{ +public: + bool isSupported(Function function) const override + { + return function == FUNCTION_SHA1; + } + + std::string hash(Function function, const char *input, uint64_t length) const override + { + if (function != FUNCTION_SHA1) + throw love::Exception("Hash function not supported by SHA1 implementation"); + + uint32_t intermediate[5] = { + 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0 + }; + + // Same padding as for md5, but then big-endian + uint64_t paddedLength = length; + if (length % 64 < 56) + paddedLength += 56-length%64; + if (length % 64 > 56) + paddedLength += 120-length%64; + uint8_t *padded = new uint8_t[paddedLength+8]; + memcpy(padded, input, length); + memset(padded+length, 0, paddedLength-length); + padded[length] = 0x80; + + // Now we need the length in bits + length *= 8; + for (int i = 0; i < 8; ++i, ++paddedLength) + padded[paddedLength] = (length >> (56-i*8)) & 0xFF; + + // Allocate our extended words + uint32_t *words = new uint32_t[80]; + + for (uint64_t i = 0; i < paddedLength; i += 64) + { + uint32_t *chunk = (uint32_t*) &padded[i]; + for (int j = 0; j < 16; j++) + { + char *c = (char*) &words[j]; + c[0] = (chunk[j] >> 24) & 0xFF; + c[1] = (chunk[j] >> 16) & 0xFF; + c[2] = (chunk[j] >> 8) & 0xFF; + c[3] = (chunk[j] >> 0) & 0xFF; + } + for (int j = 16; j < 80; j++) + words[j] = leftrot(words[j-3] ^ words[j-8] ^ words[j-14] ^ words[j-16], 1); + + uint32_t A = intermediate[0]; + uint32_t B = intermediate[1]; + uint32_t C = intermediate[2]; + uint32_t D = intermediate[3]; + uint32_t E = intermediate[4]; + + for (int j = 0; j < 80; j++) + { + uint32_t temp = leftrot(A, 5) + E + words[j]; + + if (j < 20) + temp += 0x5A827999 + ((B & C) | (~B & D)); + else if (j < 40) + temp += 0x6ED9EBA1 + (B ^ C ^ D); + else if (j < 60) + temp += 0x8F1BBCDC + ((B & C) | (B & D) | (C & D)); + else + temp += 0xCA62C1D6 + (B ^ C ^ D); + + E = D; + D = C; + C = leftrot(B, 30); + B = A; + A = temp; + } + + intermediate[0] += A; + intermediate[1] += B; + intermediate[2] += C; + intermediate[3] += D; + intermediate[4] += E; + } + + delete[] words; + delete[] padded; + + std::string hash(20, ' '); + for (int i = 0; i < 20; i += 4) + { + hash[i+0] = (intermediate[i/4] >> 24) & 0xFF; + hash[i+1] = (intermediate[i/4] >> 16) & 0xFF; + hash[i+2] = (intermediate[i/4] >> 8) & 0xFF; + hash[i+3] = (intermediate[i/4] >> 0) & 0xFF; + } + + return hash; + } +} sha1; + +/** + * This implementation was based on the description in RFC-6234. + **/ +// SHA-2: SHA-224 and SHA-256 +class SHA256 : public HashFunction +{ +private: + const uint32_t initial224[8] = { + 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, + 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4, + }; + + const uint32_t initial256[8] = { + 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, + 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19, + }; + + const uint32_t constants[64] = { + 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, + 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, + 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, + 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, + 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, + 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, + 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, + 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, + 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, + 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, + 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, + 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, + 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, + 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, + 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, + 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2, + }; + +public: + bool isSupported(Function function) const override + { + return function == FUNCTION_SHA224 || function == FUNCTION_SHA256; + } + + std::string hash(Function function, const char *input, uint64_t length) const override + { + if (!isSupported(function)) + throw love::Exception("Hash function not supported by SHA-224/SHA-256 implementation"); + + // Same padding as for sha1 + uint64_t paddedLength = length; + if (length % 64 < 56) + paddedLength += 56-length%64; + if (length % 64 > 56) + paddedLength += 120-length%64; + uint8_t *padded = new uint8_t[paddedLength+8]; + memcpy(padded, input, length); + memset(padded+length, 0, paddedLength-length); + padded[length] = 0x80; + + // Now we need the length in bits + length *= 8; + for (int i = 0; i < 8; ++i, ++paddedLength) + padded[paddedLength] = (length >> (56-i*8)) & 0xFF; + + uint32_t intermediate[8]; + if (function == FUNCTION_SHA224) + memcpy(intermediate, initial224, sizeof(intermediate)); + else + memcpy(intermediate, initial256, sizeof(intermediate)); + + // Allocate our extended words + uint32_t *words = new uint32_t[64]; + + for (uint64_t i = 0; i < paddedLength; i += 64) + { + uint32_t *chunk = (uint32_t*) &padded[i]; + for (int j = 0; j < 16; j++) + { + char *c = (char*) &words[j]; + c[0] = (chunk[j] >> 24) & 0xFF; + c[1] = (chunk[j] >> 16) & 0xFF; + c[2] = (chunk[j] >> 8) & 0xFF; + c[3] = (chunk[j] >> 0) & 0xFF; + } + for (int j = 16; j < 64; j++) + { + words[j] = rightrot(words[j-2], 17) ^ rightrot(words[j-2], 19) ^ (words[j-2] >> 10); + words[j] += rightrot(words[j-15], 7) ^ rightrot(words[j-15], 18) ^ (words[j-15] >> 3); + words[j] += words[j-7] + words[j-16]; + } + + uint32_t A = intermediate[0]; + uint32_t B = intermediate[1]; + uint32_t C = intermediate[2]; + uint32_t D = intermediate[3]; + uint32_t E = intermediate[4]; + uint32_t F = intermediate[5]; + uint32_t G = intermediate[6]; + uint32_t H = intermediate[7]; + + for (int j = 0; j < 64; j++) + { + uint32_t temp1 = H + constants[j] + words[j]; + temp1 += rightrot(E, 6) ^ rightrot(E, 11) ^ rightrot(E, 25); + temp1 += (E & F) ^ (~E & G); + uint32_t temp2 = rightrot(A, 2) ^ rightrot(A, 13) ^ rightrot(A, 22); + temp2 += (A & B) ^ (A & C) ^ (B & C); + + H = G; + G = F; + F = E; + E = D + temp1; + D = C; + C = B; + B = A; + A = temp1 + temp2; + } + + intermediate[0] += A; + intermediate[1] += B; + intermediate[2] += C; + intermediate[3] += D; + intermediate[4] += E; + intermediate[5] += F; + intermediate[6] += G; + intermediate[7] += H; + } + + + delete[] words; + delete[] padded; + + int hashlength = 32; + if (function == FUNCTION_SHA224) + hashlength = 28; + + std::string hash(hashlength, ' '); + for (int i = 0; i < hashlength; i += 4) + { + hash[i+0] = (intermediate[i/4] >> 24) & 0xFF; + hash[i+1] = (intermediate[i/4] >> 16) & 0xFF; + hash[i+2] = (intermediate[i/4] >> 8) & 0xFF; + hash[i+3] = (intermediate[i/4] >> 0) & 0xFF; + } + + return hash; + } +} sha256; + +/** + * This implementation was based on the description in RFC-6234. + **/ +// SHA-2: SHA-224 and SHA-256 +class SHA512 : public HashFunction +{ +private: + const uint64_t initial384[8] = { + 0xcbbb9d5dc1059ed8, 0x629a292a367cd507, 0x9159015a3070dd17, 0x152fecd8f70e5939, + 0x67332667ffc00b31, 0x8eb44a8768581511, 0xdb0c2e0d64f98fa7, 0x47b5481dbefa4fa4, + }; + + const uint64_t initial512[8] = { + 0x6a09e667f3bcc908, 0xbb67ae8584caa73b, 0x3c6ef372fe94f82b, 0xa54ff53a5f1d36f1, + 0x510e527fade682d1, 0x9b05688c2b3e6c1f, 0x1f83d9abfb41bd6b, 0x5be0cd19137e2179, + }; + + const uint64_t constants[80] = { + 0x428a2f98d728ae22, 0x7137449123ef65cd, 0xb5c0fbcfec4d3b2f, 0xe9b5dba58189dbbc, + 0x3956c25bf348b538, 0x59f111f1b605d019, 0x923f82a4af194f9b, 0xab1c5ed5da6d8118, + 0xd807aa98a3030242, 0x12835b0145706fbe, 0x243185be4ee4b28c, 0x550c7dc3d5ffb4e2, + 0x72be5d74f27b896f, 0x80deb1fe3b1696b1, 0x9bdc06a725c71235, 0xc19bf174cf692694, + 0xe49b69c19ef14ad2, 0xefbe4786384f25e3, 0x0fc19dc68b8cd5b5, 0x240ca1cc77ac9c65, + 0x2de92c6f592b0275, 0x4a7484aa6ea6e483, 0x5cb0a9dcbd41fbd4, 0x76f988da831153b5, + 0x983e5152ee66dfab, 0xa831c66d2db43210, 0xb00327c898fb213f, 0xbf597fc7beef0ee4, + 0xc6e00bf33da88fc2, 0xd5a79147930aa725, 0x06ca6351e003826f, 0x142929670a0e6e70, + 0x27b70a8546d22ffc, 0x2e1b21385c26c926, 0x4d2c6dfc5ac42aed, 0x53380d139d95b3df, + 0x650a73548baf63de, 0x766a0abb3c77b2a8, 0x81c2c92e47edaee6, 0x92722c851482353b, + 0xa2bfe8a14cf10364, 0xa81a664bbc423001, 0xc24b8b70d0f89791, 0xc76c51a30654be30, + 0xd192e819d6ef5218, 0xd69906245565a910, 0xf40e35855771202a, 0x106aa07032bbd1b8, + 0x19a4c116b8d2d0c8, 0x1e376c085141ab53, 0x2748774cdf8eeb99, 0x34b0bcb5e19b48a8, + 0x391c0cb3c5c95a63, 0x4ed8aa4ae3418acb, 0x5b9cca4f7763e373, 0x682e6ff3d6b2b8a3, + 0x748f82ee5defb2fc, 0x78a5636f43172f60, 0x84c87814a1f0ab72, 0x8cc702081a6439ec, + 0x90befffa23631e28, 0xa4506cebde82bde9, 0xbef9a3f7b2c67915, 0xc67178f2e372532b, + 0xca273eceea26619c, 0xd186b8c721c0c207, 0xeada7dd6cde0eb1e, 0xf57d4f7fee6ed178, + 0x06f067aa72176fba, 0x0a637dc5a2c898a6, 0x113f9804bef90dae, 0x1b710b35131c471b, + 0x28db77f523047d84, 0x32caab7b40c72493, 0x3c9ebe0a15c9bebc, 0x431d67c49c100d4c, + 0x4cc5d4becb3e42b6, 0x597f299cfc657e2a, 0x5fcb6fab3ad6faec, 0x6c44198c4a475817, + }; + +public: + bool isSupported(Function function) const override + { + return function == FUNCTION_SHA384 || function == FUNCTION_SHA512; + } + + std::string hash(Function function, const char *input, uint64_t length) const override + { + if (!isSupported(function)) + throw love::Exception("Hash function not supported by SHA-384/SHA-512 implementation"); + + uint64_t intermediates[8]; + if (function == FUNCTION_SHA384) + memcpy(intermediates, initial384, sizeof(intermediates)); + else + memcpy(intermediates, initial512, sizeof(intermediates)); + + uint64_t paddedLength = length; + if (length % 128 < 112) + paddedLength += 112-length%128; + if (length % 128 > 112) + paddedLength += 240-length%128; + uint8_t *padded = new uint8_t[paddedLength+16]; + paddedLength += 8; + memcpy(padded, input, length); + memset(padded+length, 0, paddedLength-length); + padded[length] = 0x80; + + // Now we need the length in bits, note we only write a 64-bit int, so + // we have filled the first 8 bytes with zeroes + length *= 8; + for (int i = 0; i < 8; ++i, ++paddedLength) + padded[paddedLength] = (length >> (56-i*8)) & 0xFF; + + // Allocate our extended words + uint64_t *words = new uint64_t[80]; + + for (uint64_t i = 0; i < paddedLength; i += 128) + { + uint64_t *chunk = (uint64_t*) &padded[i]; + for (int j = 0; j < 16; ++j) + { + char *c = (char*) &words[j]; + c[0] = (chunk[j] >> 56) & 0xFF; + c[1] = (chunk[j] >> 48) & 0xFF; + c[2] = (chunk[j] >> 40) & 0xFF; + c[3] = (chunk[j] >> 32) & 0xFF; + c[4] = (chunk[j] >> 24) & 0xFF; + c[5] = (chunk[j] >> 16) & 0xFF; + c[6] = (chunk[j] >> 8) & 0xFF; + c[7] = (chunk[j] >> 0) & 0xFF; + } + for (int j = 16; j < 80; ++j) + { + words[j] = words[j-7] + words[j-16]; + words[j] += rightrot(words[j-2], 19) ^ rightrot(words[j-2], 61) ^ (words[j-2] >> 6); + words[j] += rightrot(words[j-15], 1) ^ rightrot(words[j-15], 8) ^ (words[j-15] >> 7); + } + + uint64_t A = intermediates[0]; + uint64_t B = intermediates[1]; + uint64_t C = intermediates[2]; + uint64_t D = intermediates[3]; + uint64_t E = intermediates[4]; + uint64_t F = intermediates[5]; + uint64_t G = intermediates[6]; + uint64_t H = intermediates[7]; + + for (int j = 0; j < 80; ++j) + { + uint64_t temp1 = H + constants[j] + words[j]; + temp1 += rightrot(E, 14) ^ rightrot(E, 18) ^ rightrot(E, 41); + temp1 += (E & F) ^ (~E & G); + uint64_t temp2 = rightrot(A, 28) ^ rightrot(A, 34) ^ rightrot(A, 39); + temp2 += (A & B) ^ (A & C) ^ (B & C); + H = G; + G = F; + F = E; + E = D + temp1; + D = C; + C = B; + B = A; + A = temp1 + temp2; + } + + intermediates[0] += A; + intermediates[1] += B; + intermediates[2] += C; + intermediates[3] += D; + intermediates[4] += E; + intermediates[5] += F; + intermediates[6] += G; + intermediates[7] += H; + } + + delete[] words; + delete[] padded; + + int hashlength = 64; + if (function == FUNCTION_SHA384) + hashlength = 48; + + std::string hash(hashlength, ' '); + for (int i = 0; i < hashlength; i += 8) + { + hash[i+0] = (intermediates[i/8] >> 56) & 0xFF; + hash[i+1] = (intermediates[i/8] >> 48) & 0xFF; + hash[i+2] = (intermediates[i/8] >> 40) & 0xFF; + hash[i+3] = (intermediates[i/8] >> 32) & 0xFF; + hash[i+4] = (intermediates[i/8] >> 24) & 0xFF; + hash[i+5] = (intermediates[i/8] >> 16) & 0xFF; + hash[i+6] = (intermediates[i/8] >> 8) & 0xFF; + hash[i+7] = (intermediates[i/8] >> 0) & 0xFF; + } + + return hash; + } +} sha512; + +} // impl +} + +HashFunction *HashFunction::getHashFunction(Function function) +{ + switch(function) + { + case FUNCTION_MD5: + return &impl::md5; + case FUNCTION_SHA1: + return &impl::sha1; + case FUNCTION_SHA224: + case FUNCTION_SHA256: + return &impl::sha256; + case FUNCTION_SHA384: + case FUNCTION_SHA512: + return &impl::sha512; + case FUNCTION_MAX_ENUM: + return nullptr; + // No default for compiler warnings + } +} + +bool HashFunction::getConstant(const char *in, Function &out) +{ + return functionNames.find(in, out); +} + +bool HashFunction::getConstant(const Function &in, const char *&out) +{ + return functionNames.find(in, out); +} + +StringMap::Entry HashFunction::functionEntries[] = +{ + {"md5", FUNCTION_MD5}, + {"sha1", FUNCTION_SHA1}, + {"sha224", FUNCTION_SHA224}, + {"sha256", FUNCTION_SHA256}, + {"sha384", FUNCTION_SHA384}, + {"sha512", FUNCTION_SHA512}, +}; + +StringMap HashFunction::functionNames(HashFunction::functionEntries, sizeof(HashFunction::functionEntries)); + +} // math +} // love diff --git a/src/modules/math/HashFunction.h b/src/modules/math/HashFunction.h new file mode 100644 index 000000000..3322253fe --- /dev/null +++ b/src/modules/math/HashFunction.h @@ -0,0 +1,91 @@ +/** + * Copyright (c) 2006-2016 LOVE Development Team + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any damages + * arising from the use of this software. + * + * Permission is granted to anyone to use this software for any purpose, + * including commercial applications, and to alter it and redistribute it + * freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you must not + * claim that you wrote the original software. If you use this software + * in a product, an acknowledgment in the product documentation would be + * appreciated but is not required. + * 2. Altered source versions must be plainly marked as such, and must not be + * misrepresented as being the original software. + * 3. This notice may not be removed or altered from any source distribution. + **/ + +#ifndef LOVE_MATH_HASH_FUNCTION_H +#define LOVE_MATH_HASH_FUNCTION_H + +// LOVE +#include "common/Data.h" +#include "common/StringMap.h" + +// STL +#include + +namespace love +{ +namespace math +{ + +class HashFunction +{ +public: + enum Function + { + FUNCTION_MD5, + FUNCTION_SHA1, + FUNCTION_SHA224, + FUNCTION_SHA256, + FUNCTION_SHA384, + FUNCTION_SHA512, + FUNCTION_MAX_ENUM + }; + + /** + * Get a HashFunction instance for the given function. + * + * @param[in] function The selected hash function. + * @return An instance of HashFunction for the given function, or NULL if + * not available. + **/ + static HashFunction *getHashFunction(Function function); + + virtual ~HashFunction() {} + + /** + * Hash the input, producing an set of bytes as output. + * + * @param[in] function The selected hash function. + * @param[in] input The input data to hash. + * @param[in] length The length of the input data. + * @return A string of bytes, representing the result of the hash function. + **/ + virtual std::string hash(Function function, const char *input, uint64_t length) const = 0; + + /** + * @param[in] function The requested hash function. + * @return Whether this HashFunction instance implements the given function. + **/ + virtual bool isSupported(Function function) const = 0; + + static bool getConstant(const char *in, Function &out); + static bool getConstant(const Function &in, const char *&out); + +protected: + HashFunction() {} + +private: + static StringMap::Entry functionEntries[]; + static StringMap functionNames; +}; // HashFunction + +} // math +} // love + +#endif // LOVE_MATH_HASH_FUNCTION_H diff --git a/src/modules/math/MathModule.cpp b/src/modules/math/MathModule.cpp index 79417e758..2c41f9608 100644 --- a/src/modules/math/MathModule.cpp +++ b/src/modules/math/MathModule.cpp @@ -377,6 +377,20 @@ BezierCurve *Math::newBezierCurve(const vector &points) return new BezierCurve(points); } +std::string hash(HashFunction::Function function, Data *input) +{ + return hash(function, (const char*) input->getData(), input->getSize()); +} + +std::string hash(HashFunction::Function function, const char *input, uint64_t size) +{ + HashFunction *hashfunction = HashFunction::getHashFunction(function); + if (hashfunction == nullptr) + throw love::Exception("Invalid hash function."); + + return hashfunction->hash(function, input, size); +} + static StringMap::Entry encoderEntries[] = { { "base64", ENCODE_BASE64 }, diff --git a/src/modules/math/MathModule.h b/src/modules/math/MathModule.h index 5ef0a7397..b2b141d05 100644 --- a/src/modules/math/MathModule.h +++ b/src/modules/math/MathModule.h @@ -24,6 +24,7 @@ #include "RandomGenerator.h" #include "CompressedData.h" #include "Compressor.h" +#include "HashFunction.h" // LOVE #include "common/Module.h" @@ -126,6 +127,18 @@ char *decompress(Compressor::Format format, const char *cbytes, size_t compresse char *encode(EncodeFormat format, const char *src, size_t srclen, size_t &dstlen, size_t linelen = 0); char *decode(EncodeFormat format, const char *src, size_t srclen, size_t &dstlen); +/** + * Hash the input, producing an set of bytes as output. + * + * @param[in] function The selected hash function. + * @param[in] input The input data to hash. + * @return An std::string of bytes, representing the result of the hash + * function. + **/ +std::string hash(HashFunction::Function function, Data *input); +std::string hash(HashFunction::Function function, const char *input, uint64_t size); + + bool getConstant(const char *in, EncodeFormat &out); bool getConstant(EncodeFormat in, const char *&out); diff --git a/src/modules/math/wrap_Math.cpp b/src/modules/math/wrap_Math.cpp index 3094d4c8e..255cd4c19 100644 --- a/src/modules/math/wrap_Math.cpp +++ b/src/modules/math/wrap_Math.cpp @@ -452,6 +452,30 @@ int w_decode(lua_State *L) return 1; } +int w_hash(lua_State *L) +{ + const char *fstr = luaL_checkstring(L, 1); + HashFunction::Function function; + if (!HashFunction::getConstant(fstr, function)) + return luaL_error(L, "Invalid hash function: %s", fstr); + + std::string hash; + if (lua_isstring(L, 2)) + { + size_t rawsize = 0; + const char *rawbytes = luaL_checklstring(L, 2, &rawsize); + luax_catchexcept(L, [&](){ hash = love::math::hash(function, rawbytes, rawsize); }); + } + else + { + Data *rawdata = luax_checktype(L, 2, DATA_ID); + luax_catchexcept(L, [&](){ hash = love::math::hash(function, rawdata); }); + } + + luax_pushstring(L, hash); + return 1; +} + // C functions in a struct, necessary for the FFI versions of math functions. struct FFI_Math { @@ -492,6 +516,7 @@ static const luaL_Reg functions[] = { "decompress", w_decompress }, { "encode", w_encode }, { "decode", w_decode }, + { "hash", w_hash }, { 0, 0 } };