Brandon Fictorie
/
BF_Websocket
Important changes to repositories hosted on mbed.com
Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.
To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.
It is also possible to export all your personal repositories from the account settings page.
NetServices/services/mysql/mycrypt.c@0:8cdad1c73e8e, 2012-03-25 (annotated)
- Committer:
- bfictorie
- Date:
- Sun Mar 25 17:26:30 2012 +0000
- Revision:
- 0:8cdad1c73e8e
Who changed what in which revision?
| User | Revision | Line number | New contents of line |
|---|---|---|---|
| bfictorie | 0:8cdad1c73e8e | 1 | /* Copyright (C) 2007 MySQL AB & Michael Widenius |
| bfictorie | 0:8cdad1c73e8e | 2 | |
| bfictorie | 0:8cdad1c73e8e | 3 | This program is free software; you can redistribute it and/or modify |
| bfictorie | 0:8cdad1c73e8e | 4 | it under the terms of the GNU General Public License as published by |
| bfictorie | 0:8cdad1c73e8e | 5 | the Free Software Foundation; version 2 of the License. |
| bfictorie | 0:8cdad1c73e8e | 6 | |
| bfictorie | 0:8cdad1c73e8e | 7 | This program is distributed in the hope that it will be useful, |
| bfictorie | 0:8cdad1c73e8e | 8 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| bfictorie | 0:8cdad1c73e8e | 9 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| bfictorie | 0:8cdad1c73e8e | 10 | GNU General Public License for more details. |
| bfictorie | 0:8cdad1c73e8e | 11 | |
| bfictorie | 0:8cdad1c73e8e | 12 | You should have received a copy of the GNU General Public License |
| bfictorie | 0:8cdad1c73e8e | 13 | along with this program; if not, write to the Free Software |
| bfictorie | 0:8cdad1c73e8e | 14 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ |
| bfictorie | 0:8cdad1c73e8e | 15 | |
| bfictorie | 0:8cdad1c73e8e | 16 | #define SCRAMBLE_LENGTH_323 8 |
| bfictorie | 0:8cdad1c73e8e | 17 | |
| bfictorie | 0:8cdad1c73e8e | 18 | #include <string.h> |
| bfictorie | 0:8cdad1c73e8e | 19 | #include <math.h> |
| bfictorie | 0:8cdad1c73e8e | 20 | |
| bfictorie | 0:8cdad1c73e8e | 21 | typedef unsigned int uint; |
| bfictorie | 0:8cdad1c73e8e | 22 | typedef unsigned long ulong; |
| bfictorie | 0:8cdad1c73e8e | 23 | typedef unsigned char uchar; |
| bfictorie | 0:8cdad1c73e8e | 24 | |
| bfictorie | 0:8cdad1c73e8e | 25 | struct my_rnd_struct { |
| bfictorie | 0:8cdad1c73e8e | 26 | unsigned long seed1,seed2,max_value; |
| bfictorie | 0:8cdad1c73e8e | 27 | double max_value_dbl; |
| bfictorie | 0:8cdad1c73e8e | 28 | }; |
| bfictorie | 0:8cdad1c73e8e | 29 | |
| bfictorie | 0:8cdad1c73e8e | 30 | static void my_rnd_init(struct my_rnd_struct *rand_st, ulong seed1, ulong seed2); |
| bfictorie | 0:8cdad1c73e8e | 31 | static double my_rnd(struct my_rnd_struct *rand_st); |
| bfictorie | 0:8cdad1c73e8e | 32 | static void hash_password(ulong *result, const char *password, uint password_len); |
| bfictorie | 0:8cdad1c73e8e | 33 | |
| bfictorie | 0:8cdad1c73e8e | 34 | /* |
| bfictorie | 0:8cdad1c73e8e | 35 | Initialize random generator |
| bfictorie | 0:8cdad1c73e8e | 36 | |
| bfictorie | 0:8cdad1c73e8e | 37 | NOTES |
| bfictorie | 0:8cdad1c73e8e | 38 | MySQL's password checks depends on this, so don't do any changes |
| bfictorie | 0:8cdad1c73e8e | 39 | that changes the random numbers that are generated! |
| bfictorie | 0:8cdad1c73e8e | 40 | */ |
| bfictorie | 0:8cdad1c73e8e | 41 | |
| bfictorie | 0:8cdad1c73e8e | 42 | static void my_rnd_init(struct my_rnd_struct *rand_st, ulong seed1, ulong seed2) |
| bfictorie | 0:8cdad1c73e8e | 43 | { |
| bfictorie | 0:8cdad1c73e8e | 44 | rand_st->max_value= 0x3FFFFFFFL; |
| bfictorie | 0:8cdad1c73e8e | 45 | rand_st->max_value_dbl=(double) rand_st->max_value; |
| bfictorie | 0:8cdad1c73e8e | 46 | rand_st->seed1=seed1%rand_st->max_value ; |
| bfictorie | 0:8cdad1c73e8e | 47 | rand_st->seed2=seed2%rand_st->max_value; |
| bfictorie | 0:8cdad1c73e8e | 48 | } |
| bfictorie | 0:8cdad1c73e8e | 49 | |
| bfictorie | 0:8cdad1c73e8e | 50 | /* |
| bfictorie | 0:8cdad1c73e8e | 51 | Generate random number. |
| bfictorie | 0:8cdad1c73e8e | 52 | |
| bfictorie | 0:8cdad1c73e8e | 53 | SYNOPSIS |
| bfictorie | 0:8cdad1c73e8e | 54 | my_rnd() |
| bfictorie | 0:8cdad1c73e8e | 55 | rand_st INOUT Structure used for number generation |
| bfictorie | 0:8cdad1c73e8e | 56 | |
| bfictorie | 0:8cdad1c73e8e | 57 | RETURN VALUE |
| bfictorie | 0:8cdad1c73e8e | 58 | generated pseudo random number |
| bfictorie | 0:8cdad1c73e8e | 59 | */ |
| bfictorie | 0:8cdad1c73e8e | 60 | |
| bfictorie | 0:8cdad1c73e8e | 61 | static double my_rnd(struct my_rnd_struct *rand_st) |
| bfictorie | 0:8cdad1c73e8e | 62 | { |
| bfictorie | 0:8cdad1c73e8e | 63 | rand_st->seed1=(rand_st->seed1*3+rand_st->seed2) % rand_st->max_value; |
| bfictorie | 0:8cdad1c73e8e | 64 | rand_st->seed2=(rand_st->seed1+rand_st->seed2+33) % rand_st->max_value; |
| bfictorie | 0:8cdad1c73e8e | 65 | return (((double) rand_st->seed1)/rand_st->max_value_dbl); |
| bfictorie | 0:8cdad1c73e8e | 66 | } |
| bfictorie | 0:8cdad1c73e8e | 67 | |
| bfictorie | 0:8cdad1c73e8e | 68 | /* |
| bfictorie | 0:8cdad1c73e8e | 69 | Generate binary hash from raw text string |
| bfictorie | 0:8cdad1c73e8e | 70 | Used for Pre-4.1 password handling |
| bfictorie | 0:8cdad1c73e8e | 71 | SYNOPSIS |
| bfictorie | 0:8cdad1c73e8e | 72 | hash_password() |
| bfictorie | 0:8cdad1c73e8e | 73 | result OUT store hash in this location |
| bfictorie | 0:8cdad1c73e8e | 74 | password IN plain text password to build hash |
| bfictorie | 0:8cdad1c73e8e | 75 | password_len IN password length (password may be not null-terminated) |
| bfictorie | 0:8cdad1c73e8e | 76 | */ |
| bfictorie | 0:8cdad1c73e8e | 77 | |
| bfictorie | 0:8cdad1c73e8e | 78 | static void hash_password(ulong *result, const char *password, uint password_len) |
| bfictorie | 0:8cdad1c73e8e | 79 | { |
| bfictorie | 0:8cdad1c73e8e | 80 | register ulong nr=1345345333L, add=7, nr2=0x12345671L; |
| bfictorie | 0:8cdad1c73e8e | 81 | ulong tmp; |
| bfictorie | 0:8cdad1c73e8e | 82 | const char *password_end= password + password_len; |
| bfictorie | 0:8cdad1c73e8e | 83 | for (; password < password_end; password++) |
| bfictorie | 0:8cdad1c73e8e | 84 | { |
| bfictorie | 0:8cdad1c73e8e | 85 | if (*password == ' ' || *password == '\t') |
| bfictorie | 0:8cdad1c73e8e | 86 | continue; /* skip space in password */ |
| bfictorie | 0:8cdad1c73e8e | 87 | tmp= (ulong) (uchar) *password; |
| bfictorie | 0:8cdad1c73e8e | 88 | nr^= (((nr & 63)+add)*tmp)+ (nr << 8); |
| bfictorie | 0:8cdad1c73e8e | 89 | nr2+=(nr2 << 8) ^ nr; |
| bfictorie | 0:8cdad1c73e8e | 90 | add+=tmp; |
| bfictorie | 0:8cdad1c73e8e | 91 | } |
| bfictorie | 0:8cdad1c73e8e | 92 | result[0]=nr & (((ulong) 1L << 31) -1L); /* Don't use sign bit (str2int) */; |
| bfictorie | 0:8cdad1c73e8e | 93 | result[1]=nr2 & (((ulong) 1L << 31) -1L); |
| bfictorie | 0:8cdad1c73e8e | 94 | } |
| bfictorie | 0:8cdad1c73e8e | 95 | |
| bfictorie | 0:8cdad1c73e8e | 96 | |
| bfictorie | 0:8cdad1c73e8e | 97 | |
| bfictorie | 0:8cdad1c73e8e | 98 | /* |
| bfictorie | 0:8cdad1c73e8e | 99 | Scramble string with password. |
| bfictorie | 0:8cdad1c73e8e | 100 | Used in pre 4.1 authentication phase. |
| bfictorie | 0:8cdad1c73e8e | 101 | SYNOPSIS |
| bfictorie | 0:8cdad1c73e8e | 102 | scramble_323() |
| bfictorie | 0:8cdad1c73e8e | 103 | to OUT Store scrambled message here. Buffer must be at least |
| bfictorie | 0:8cdad1c73e8e | 104 | SCRAMBLE_LENGTH_323+1 bytes long |
| bfictorie | 0:8cdad1c73e8e | 105 | message IN Message to scramble. Message must be at least |
| bfictorie | 0:8cdad1c73e8e | 106 | SRAMBLE_LENGTH_323 bytes long. |
| bfictorie | 0:8cdad1c73e8e | 107 | password IN Password to use while scrambling |
| bfictorie | 0:8cdad1c73e8e | 108 | */ |
| bfictorie | 0:8cdad1c73e8e | 109 | |
| bfictorie | 0:8cdad1c73e8e | 110 | void scramble_323(char *to, const char *message, const char *password) |
| bfictorie | 0:8cdad1c73e8e | 111 | { |
| bfictorie | 0:8cdad1c73e8e | 112 | struct my_rnd_struct rand_st; |
| bfictorie | 0:8cdad1c73e8e | 113 | ulong hash_pass[2], hash_message[2]; |
| bfictorie | 0:8cdad1c73e8e | 114 | |
| bfictorie | 0:8cdad1c73e8e | 115 | if (password && password[0]) |
| bfictorie | 0:8cdad1c73e8e | 116 | { |
| bfictorie | 0:8cdad1c73e8e | 117 | char extra, *to_start=to; |
| bfictorie | 0:8cdad1c73e8e | 118 | const char *message_end= message + SCRAMBLE_LENGTH_323; |
| bfictorie | 0:8cdad1c73e8e | 119 | hash_password(hash_pass,password, (uint) strlen(password)); |
| bfictorie | 0:8cdad1c73e8e | 120 | hash_password(hash_message, message, SCRAMBLE_LENGTH_323); |
| bfictorie | 0:8cdad1c73e8e | 121 | my_rnd_init(&rand_st,hash_pass[0] ^ hash_message[0], |
| bfictorie | 0:8cdad1c73e8e | 122 | hash_pass[1] ^ hash_message[1]); |
| bfictorie | 0:8cdad1c73e8e | 123 | for (; message < message_end; message++) |
| bfictorie | 0:8cdad1c73e8e | 124 | *to++= (char) (floor(my_rnd(&rand_st)*31)+64); |
| bfictorie | 0:8cdad1c73e8e | 125 | extra=(char) (floor(my_rnd(&rand_st)*31)); |
| bfictorie | 0:8cdad1c73e8e | 126 | while (to_start != to) |
| bfictorie | 0:8cdad1c73e8e | 127 | *(to_start++)^=extra; |
| bfictorie | 0:8cdad1c73e8e | 128 | } |
| bfictorie | 0:8cdad1c73e8e | 129 | *to= 0; |
| bfictorie | 0:8cdad1c73e8e | 130 | } |
| bfictorie | 0:8cdad1c73e8e | 131 |