| 1 | /* |
| 2 | ** Copyright 2007 Double Precision, Inc. |
| 3 | ** See COPYING for distribution information. |
| 4 | */ |
| 5 | |
| 6 | #include "md5.h" |
| 7 | #include <string.h> |
| 8 | #include <stdio.h> |
| 9 | |
| 10 | |
| 11 | static const char base64tab[]= |
| 12 | "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; |
| 13 | |
| 14 | const char *md5_hash_courier(const char *passw) |
| 15 | { |
| 16 | MD5_DIGEST md5buf; |
| 17 | static char hash_buffer[1+(sizeof(md5buf)+2)/3*4]; |
| 18 | int a=0,b=0,c=0; |
| 19 | int i, j; |
| 20 | int d, e, f, g; |
| 21 | |
| 22 | md5_digest(passw, strlen(passw), md5buf); |
| 23 | |
| 24 | j=0; |
| 25 | |
| 26 | for (i=0; i<sizeof(md5buf); i += 3) |
| 27 | { |
| 28 | a=md5buf[i]; |
| 29 | b= i+1 < sizeof(md5buf) ? md5buf[i+1]:0; |
| 30 | c= i+2 < sizeof(md5buf) ? md5buf[i+2]:0; |
| 31 | |
| 32 | d=base64tab[ a >> 2 ]; |
| 33 | e=base64tab[ ((a & 3 ) << 4) | (b >> 4)]; |
| 34 | f=base64tab[ ((b & 15) << 2) | (c >> 6)]; |
| 35 | g=base64tab[ c & 63 ]; |
| 36 | if (i + 1 >= sizeof(md5buf)) f='='; |
| 37 | if (i + 2 >= sizeof(md5buf)) g='='; |
| 38 | hash_buffer[j++]=d; |
| 39 | hash_buffer[j++]=e; |
| 40 | hash_buffer[j++]=f; |
| 41 | hash_buffer[j++]=g; |
| 42 | } |
| 43 | |
| 44 | hash_buffer[j]=0; |
| 45 | return (hash_buffer); |
| 46 | } |
| 47 | |
| 48 | const char *md5_hash_raw(const char *passw) |
| 49 | { |
| 50 | MD5_DIGEST digest; |
| 51 | static char hash_buffer[sizeof(digest)*2+1]; |
| 52 | size_t j=0,i=0; |
| 53 | |
| 54 | char |
| 55 | tmp_buf[3]; |
| 56 | |
| 57 | md5_digest(passw, strlen(passw), digest); |
| 58 | for (j=0; j<sizeof(digest); j++) |
| 59 | { |
| 60 | sprintf(tmp_buf,"%02x",digest[j]); |
| 61 | hash_buffer[i++]=tmp_buf[0]; |
| 62 | hash_buffer[i++]=tmp_buf[1]; |
| 63 | } |
| 64 | hash_buffer[i]=0; |
| 65 | |
| 66 | return(hash_buffer); |
| 67 | } |