Added sha512 encoded functionHEADmaster

The code is stolen from https://github.com/LeFroid/sha256-512

1 files changed, 262 insertions, 1 deletions

diff --git a/script/entry.c b/script/entry.c
index a8f3b68..27e91d3 100644
--- a/script/entry.c
+++ b/script/entry.c
@@ -1,5 +1,246 @@
+// SHA 512 Implementation by Timothy Vaccarelli
+// Based on the hashing algorithm details from http://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf
+// and http://www.iwar.org.uk/comsec/resources/cipher/sha256-384-512.pdf
+
+#include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
+#include <stdint.h>
+
+// Padded message structure, contains message length + message 
+typedef struct PaddedMsg {
+    size_t length;
+    uint8_t *msg;
+} PaddedMsg;
+
+// Swaps the byte order of the 32 bit unsigned integer x
+static inline void endianSwap32(uint32_t *x)
+{
+    char *y = (char*)x;
+    for (size_t low = 0, high = sizeof(uint32_t) - 1; high > low; ++low, --high)
+    {
+        y[low]  ^= y[high];
+        y[high] ^= y[low];
+        y[low]  ^= y[high];
+    }
+}
+
+// Swaps the byte order of the 64 bit unsigned integer x
+static inline void endianSwap64(uint64_t *x)
+{
+    char *y = (char*)x;
+    for (size_t low = 0, high = sizeof(uint64_t) - 1; high > low; ++low, --high)
+    {
+        y[low]  ^= y[high];
+        y[high] ^= y[low];
+        y[low]  ^= y[high];
+    }
+}
+
+// Swaps the byte order of the 128 bit unsigned integer x
+static inline void endianSwap128(__uint128_t *x)
+{
+    char *y = (char*)x;
+    for (size_t low = 0, high = sizeof(__uint128_t) - 1; high > low; ++low, --high)
+    {
+        y[low]  ^= y[high];
+        y[high] ^= y[low];
+        y[low]  ^= y[high];
+    }
+}
+
+#define SHA512_MESSAGE_BLOCK_SIZE 128
+#define SHA512_HASH_SIZE 64
+#define HASH_ARRAY_LEN 8
+#define MAX_VAL 0xFFFFFFFFFFFFFFFFLLU
+
+/// Preprocesses the given message of len bytes
+PaddedMsg preprocess(uint8_t *msg, size_t len);
+
+/// Returns the sha-512 hash corresponding to the padded message: Return value must be free()'d
+uint64_t *getHash(PaddedMsg *p);
+
+/// Wrapper for hashing methods, up to caller to free the return value
+uint64_t *SHA512Hash(uint8_t *input, size_t len);
+
+// K: first 64 bits of the fractional parts of the cube roots of the first 80 primes
+const static uint64_t K[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
+ }; 
+
+// Utility functions
+// Rotate x to the right by numBits
+#define ROTR(x, numBits) ( (x >> numBits) | (x << (64 - numBits)) )
+
+// Compression functions
+#define Ch(x,y,z) ( (x & y) ^ ((~x) & z) )
+#define Maj(x,y,z) ( (x & y) ^ (x & z) ^ (y & z) )
+
+#define BigSigma0(x) ( ROTR(x,28) ^ ROTR(x,34) ^ ROTR(x,39) )
+#define BigSigma1(x) ( ROTR(x,14) ^ ROTR(x,18) ^ ROTR(x,41) )
+
+#define SmallSigma0(x) ( ROTR(x,1) ^ ROTR(x,8) ^ (x >> 7) )
+#define SmallSigma1(x) ( ROTR(x,19) ^ ROTR(x,61) ^ (x >> 6) )
+
+// SHA512 message schedule
+// Calculate the Nth block of W
+uint64_t *W(int N, uint64_t *M)
+{
+    uint64_t *w = (uint64_t*) malloc(sizeof(uint64_t) * 80);
+    uint64_t *mPtr = &M[(N * 16)];
+    
+    //printf("Message block %d : ", N);
+    for (int i = 0; i < 16; ++i)
+    {
+        w[i] = *mPtr;
+        ++mPtr;
+        
+    //printf("%" PRIx64 , w[i]);
+    }
+    //printf("\n");
+    for (int i = 16; i < 80; ++i)
+    {
+        w[i] = SmallSigma1(w[i - 2]) + w[i - 7] + SmallSigma0(w[i - 15]) + w[i - 16];
+    }
+    return w;
+}
+
+// Step 1:
+// Preprocesses a given message of l bits.
+// Appends "1" to end of msg, then k 0 bits such that l + 1 + k = 896 mod 1024
+// and k is the smallest nonnegative solution to said equation. To this is appended
+// the 128 bit block equal to the bit length l.
+//char *preprocess(char *msg)
+PaddedMsg preprocess(uint8_t *msg, size_t len)
+{    
+    PaddedMsg padded;
+    
+    // resulting msg wll be multiple of 1024 bits
+    //size_t len = strlen(msg);
+    if (msg == NULL || len == 0)
+    {
+        padded.length = 0;
+        padded.msg = NULL;
+        return padded;
+    }
+    
+    size_t l = len * 8;
+    size_t k = (896 - ( (l  + 1) % 1024 )) % 1024;
+    //printf("k = %zu\n", k);
+    //printf("l = %zu\n", l);
+    //printf("l + k + 1 = %zu bits, %zu bytes\n", (l+k+1), ((l+k+1)/8));
+    
+    padded.length = ((l + k + 1) / 8) + 16;
+    //printf("padded.length = %zu\n", padded.length);
+    padded.msg = (uint8_t*) malloc(sizeof(uint8_t) * padded.length);
+    memset(&padded.msg[0], 0, padded.length);
+    for (size_t i = 0; i < len; ++i)
+        padded.msg[i] = msg[i];
+    // append to the binary string a 1 followed by k zeros
+    padded.msg[len] = 0x80;
+    
+    // last 16 bytes reserved for length
+    __uint128_t bigL = l;
+    endianSwap128(&bigL);
+    memcpy(&padded.msg[padded.length - sizeof(__uint128_t)], &bigL, sizeof(__uint128_t));
+    
+    return padded;
+}
+
+// Step 2:
+// Parse the padded message into N 1024-bit blocks
+// Each block separated into 64-bit words (therefore 16 per block)
+// Returns an array of 8 64 bit words corresponding to the hashed value
+uint64_t *getHash(PaddedMsg *p)
+{
+    size_t N = p->length / SHA512_MESSAGE_BLOCK_SIZE;
+    //printf("Number of blocks = %zu\n", N);
+    
+    // initial hash value
+    uint64_t h[8] = {
+        0x6A09E667F3BCC908,
+        0xBB67AE8584CAA73B,
+        0x3C6EF372FE94F82B,
+        0xA54FF53A5F1D36F1,
+        0x510E527FADE682D1,
+        0x9B05688C2B3E6C1F,
+        0x1F83D9ABFB41BD6B,
+        0x5BE0CD19137E2179
+    };
+    
+#if MACHINE_BYTE_ORDER == LITTLE_ENDIAN
+    // Convert byte order of message to big endian
+    uint64_t *msg = ((uint64_t*)&p->msg[0]);
+    for (int i = 0; i < N * 16; ++i)
+        endianSwap64(msg++);
+#endif
+
+    for (size_t i = 0; i < N; ++i)
+    {
+        uint64_t T1, T2;
+        // initialize registers
+        uint64_t reg[HASH_ARRAY_LEN];
+        for (int i = 0; i < HASH_ARRAY_LEN; ++i)
+            reg[i] = h[i];
+        
+        uint64_t *w = W(i, ((uint64_t*)(p->msg)));
+        
+        // Apply the SHA512 compression function to update registers
+        for (int j = 0; j < 80; ++j)
+        {   
+            T1 = reg[7] + BigSigma1(reg[4]) + Ch(reg[4], reg[5], reg[6]) + K[j] + w[j];
+            T2 = BigSigma0(reg[0]) + Maj(reg[0], reg[1], reg[2]);
+            
+            reg[7] = reg[6];
+            reg[6] = reg[5];
+            reg[5] = reg[4];
+            reg[4] = reg[3] + T1;
+            reg[3] = reg[2];
+            reg[2] = reg[1];
+            reg[1] = reg[0];
+            reg[0] = T1 + T2;
+        }
+        
+        // Compute the ith intermediate hash values 
+        for (int i = 0; i < HASH_ARRAY_LEN; ++i)
+            h[i] += reg[i];
+        
+        free(w);
+    }
+    free(p->msg);
+    
+    // Now the array h is the hash of the original message M
+    uint64_t *retVal = (uint64_t*) malloc(sizeof(uint64_t) * HASH_ARRAY_LEN);
+    memcpy(retVal, h, sizeof(uint64_t) * HASH_ARRAY_LEN);
+    return retVal;
+}
+
+/// Wrapper for hashing methods, up to caller to free the return value
+uint64_t *SHA512Hash(uint8_t *input, size_t len)
+{
+    PaddedMsg paddedMsg = preprocess(input, len);
+    return getHash(&paddedMsg);
+}
 
 void* allocate(size_t size) {
     return malloc(size);
@@ -12,5 +253,25 @@ void deallocate(void* ptr) {
 
 
 const char *entry(const char *input) {
-    return strdup(input);
+    if (!input) return NULL;
+
+    uint64_t *encoded_raw = SHA512Hash(input, strlen(input));
+    if (!encoded_raw) return NULL;
+
+    char *outp = malloc(129);
+    if (!outp) {
+        free(encoded_raw);
+        return NULL;
+    }
+
+    char *ptr = outp;
+    for (int i = 0; i < 8; i++) {
+        sprintf(ptr, "%016llx", (unsigned long long)encoded_raw[i]);
+        ptr += 16;
+    }
+    *ptr = '\0'; 
+
+    free(encoded_raw); 
+
+    return outp;
 }