I know, this js-crackme is pretty lame by any standard, however, it's purpose was for me to see who was interested in Javascript Reversing and who wasn't..   Can you write a better js-crackme than this lame one I wrote in five minutes?.  If your game, then why not email me with your js-crackme and give everyone else a chance to bust it!.

Typically, this type of script is still used on the web, normally though, it will use between three & four digits for the password.  As you saw, the weak part of this script is it's use of the magic 'key' number, which can be quickly found in the source code.. Once you have this 'Key' number, the script is good as cracked. Well almost... there are literaly thousands of valid passwords you can use on this script but there are only 6 CORRECT passwords that will get you here..

In this JS-Crackme I've used eight digits instead of four, the idea being that I have tried to wear you down trying to find the right numbers so that you would be inclined to 'give up' before you had found one of the six correct passwords..

Please email me with the password to this crackme and I will place your handle on this page.

This JS-crackme has been cracked by:-

Eternal Bliss    (Feb 12 1999) found 1 correct password
Roxy             (Feb 13 1999) found 1 correct password
SnakeByte        (Feb 14 1999) found 1 correct password
Jeff             (Feb 14 1999) found 2 correct password
Laurent          (Feb 15 1999) found 6 correct passwords
Phantom_Stranger (Feb 15 1999) found 1 correct password
Litvin           (Feb 16 1999) found 1 correct password
ReCkLeSs         (Feb 16 1999) found 1 correct password
MetalSouL        (Feb 17 1999) found 1 correct password
Just the Wizzzzz (Feb 17 1999) found 3 correct passwords
JT Rodman        (Feb 18 1999) found 1 correct password
Andy             (Feb 18 1999) found 2 correct passwords
xtreme           (Feb 20 1999) found 1 correct password
GeniuX           (Feb 20 1999) found 1 correct password
The Beer Munster (Feb 22 1999) found 1 correct password
Joseph           (Mar 17 1999) found 1 correct password
vrstalker        (May 04 1999) found 1 correct password
Christer_Ericson (Jan 27 2000) found 2 correct passwords
phrack           (Feb 05 2000) Found 1 correct password
 
 

Here is a selection of programs written by some of the students to help them generate all the possible passwords for this js-crackme.

SnakeByte's solution to finding all the possible combinations of digits for the magic 'key' 45360 was to use the following 'C' program...

#include <io.h>
#include <conio.h>
#include <stdio.h>
#include <stdlib.h>
#include <dos.h>
#include <bios.h>
#include <fcntl.h>
#include <memory.h>
#include <malloc.h>
#include <math.h>
#include <string.h>

#include <conio.h>
#include <stdio.h>

main()
{

  unsigned int bingo = 45360;
  unsigned answer;
  int a,b,c,d,e,f,g,h;
 

  while(answer!=bingo)
   {

     a = rand()%9;
     b = rand()%9;
     c =  rand()%9;
     d =  rand()%9;
     e = rand()%9;
     f = rand()%9;
     g = rand()%9;
     h = rand()%9;
 
 

   answer=(a*b*c*d*e*f*g*h);
   printf("%d%d%d%d%d%d%d%d\n",a,b,c,d,e,f,g,h,answer);
 

   }
  printf("complete");
  getch();
  printf("%d%d%d%d%d%d%d%d\n%u",a,b,c,d,e,f,g,h,answer);
  getch();
return 0;

}
* note compiled with borland c++ 3.1 *
 

Andy used Pascal to generate all the valid passwords ..

var fo:text;
    s,s1:longint;
    n:array[1..8] of byte;

procedure go(p:integer);
var i:integer;
    s:longint;
begin
s:=1;
for i:=1 to p-1 do s:=s*n[i];
if (p>8) and (s=45360) then begin
   write(fo,'http://www.idca.com/~thesandman/JS-Crackmes/');
   for i:=1 to 8 do write(fo,n[i]);
   writeln(fo,'.htm');
   end
   else
   if (p<=8) then begin
   if s<=45360 then
      for i:=1 to 9 do begin
       n[p]:=i;
       go(p+1);
      end;
   end;
end;

begin
assign(fo,'c:\temp\x.tmp');
rewrite(fo);
go(1);
close(fo);
end.