test_speed.c

跟rainbow table结合破解windoes登陆密码及各种hash密码

/*

    This file is part of Ophcrack (Time-Memory-Trade-Off-crack).

    Ophcrack is a Lanmanager/NTLM hash cracker based on the faster time-memory
    trade-off using rainbow tables. 
    
    Created with the help of: Maxime Mueller, Luca Wullschleger, Claude
    Hochreutiner and Andreas Huber.

    Copyright 2004 Philippe Oechslin

    Ophcrack is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    Ophcrack is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with Ophcrack; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/

#include <stdio.h>
#include "make_hash.h"
#include "make_redux.h"
#include <string.h>
#include <ctype.h>
#include <sys/times.h>
#include <unistd.h>

static char rcsid[] = "$Id: test_speed.c,v 1.0 2004/07/09 12:54:15 oechslin Exp $";

/* 
 * $Log: test_speed.c,v $
 * Revision 1.0  2004/07/09 12:54:15  oechslin
 * Initial revision
 *
 *
 */

int main(int argc, char **argv)
{

  unsigned char in2[8]={1,4,6,7,5,0,0,0};
  unsigned char hash2[8];
  int i;

  clock_t t1,t2,t3,t4;
  struct tms n_times;
  long ticks_per_second;

  ticks_per_second = sysconf(_SC_CLK_TCK);

  t1 = times(&n_times);   
  for (i=0;i<11000000;i++)
    make_hash(in2,hash2);
  t2 = times(&n_times);
  printf(" Hashes per second: %.0f\n\n", 11000000.0/(t2-t1)*ticks_per_second);

  t3 = times(&n_times);   
  for (i=0; i<11000000; i++) 
    make_redux(hash2,in2);
  t4 = times(&n_times);
  printf(" Redux per second: %.0f\n\n", 11000000.0/(t4-t3)*ticks_per_second);
  printf(" Hash-reductions per second: %.0f\n\n", 
  11000000.0/(t2-t1+t4-t3)*ticks_per_second);
  return 0;
}