Re: Word lists for passphrases

I have a util that will create a word list starting from aaaaaaaaaaa on up to
anythingggggggg
basically you could do every combination. Let me know if ya want it.

AwakenToMe@aol.com writes:
> I have a util that will create a word list starting from aaaaaaaaaaa on up to
> anythingggggggg
> basically you could do every combination. Let me know if ya want it.

That would really be of great use for doing wordlist crack runs. It
must have taken you a long time to write -- generous of you to offer
it.

"Perry E. Metzger" writes:
> 
> AwakenToMe@aol.com writes:
> > I have a util that will create a word list starting from
> > aaaaaaaaaaa on up to anythingggggggg basically you could do every
> > combination. Let me know if ya want it.
> 
> That would really be of great use for doing wordlist crack runs. It
> must have taken you a long time to write -- generous of you to offer
> it.

I want to apologize to everyone for being gratuitously nasty
here. It wasn't called for.

"Perry E. Metzger" <perry@piermont.com> writes:
> AwakenToMe@aol.com writes:
> > I have a util that will create a word list starting from aaaaaaaaaaa on up
> > anythingggggggg
> > basically you could do every combination. Let me know if ya want it.
>
> That would really be of great use for doing wordlist crack runs. It
> must have taken you a long time to write -- generous of you to offer
> it.

K3wl Hack, D00dz!  Why don't you post it to coderpunks - it's probably way
too technical for cypherpunks.  I wonder if the util comes with the source
code, and what language it's written in.

---

Dr.Dimitri Vulis KOTM
Brighton Beach Boardwalk BBS, Forest Hills, N.Y.: +1-718-261-2013, 14.4Kbps

On Sat, 6 Jul 1996, Dr.Dimitri Vulis KOTM wrote:

> K3wl Hack, D00dz!  Why don't you post it to coderpunks - it's probably way
> too technical for cypherpunks.  I wonder if the util comes with the source
> code, and what language it's written in.

	It's 10K long (the exe file), so it's probably programmed in
Pascal, not Assembler, which would probably be more efficient.

Ryan A. Rowe - Montreal, Quebec        /Seeking Internet-related job!/ 
aka CyberEyes, Rubik'S Cube              I will relocate _ANYWHERE_.

Tel. -> +1-514-626-0328                |                 __o         o
E-Mail -> cyberia@cam.org              |               _ \<_        <\
WWW -> http://www.cam.org/~cyberia     | __/\o_       (_)/(_)       />
IRC -> #CAli4NiA, #Triathlon, #Surfing |
FTP -> ftp.cam.org /users/cyberia      |  swim          bike       run

          Read my C.V. at http://www.cam.org/~cyberia/resume-e.html 
           "In lieu of experience, I have a willingness to learn."

             "Everyone has their day, mine is July 15th, 1998."

AwakenToMe@aol.com wrote:
> 
> I have a util that will create a word list starting from aaaaaaaaaaa on up to
> anythingggggggg
> basically you could do every combination. Let me know if ya want it.
> 

Here's the C++ prog that I wrote 1.5 yrs ago for my friend who needed it
for genetic experiments on evidence in OJ "ZAEBAL" Simpson trial:


void nested_loops(int max_depth, int *lower,
      int *upper, void (*action)(int *indexes, int depth))
/*
   calls (*action) for every combination of numbers of size max_depth
   o max_depth - size of all combinations
   o lower     - lower boundaries for indices 0 -- max_depth - 1
   o upper     - upper boundaries for indices 0 -- max_depth - 1
   o action    - called for every combination

  Example:

   int lwr[] = { 'a', 'a' };
   int upr[] = { 'b', 'b' };
   nested_loops( 2, lwr, upr, some_action );

  calls some_action for every combination
  aa ab ba bb
*/
{
  int *indexes = new int[max_depth];
  int cur_depth = 0;
  indexes[cur_depth] = lower[cur_depth];
  do {
     if( indexes[cur_depth] < upper[cur_depth] ) {
       if( cur_depth == max_depth - 1 ) {
         (*action)( indexes, cur_depth ); // Acting only deep enough
         indexes[cur_depth]++;
       } else {
         cur_depth++;
         indexes[cur_depth]=lower[cur_depth];
       }
     } else {
       if( --cur_depth >= 0 )
         indexes[cur_depth]++;
     }
  } while( cur_depth >= 0 );
  delete [] indexes;
}

	- Igor.