package misc;

import java.util.Random;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;

public class PasswordGenerator {
    public static void main(String args[])throws IOException {
		final char characters[] = {
			'a','b','c','d','e','f','g',
			'h','i','j','k','l','m','n',
			'o','p','q','r','s','t','u',
			'v','w','x','y','z','A','B',
			'C','D','E','F','G','H','I',
			'J','K','L','M','N','O','P',
			'Q','R','S','T','U','V','W',
			'X','Y','Z','0','1','2','3',
			'4','5','6','7','8','9'
		};
		Random prng = new Random();
		int length = 0;
		try {
			length = Integer.parseInt(args[0]);
		}
		catch(NumberFormatException nfx) {}
		catch(ArrayIndexOutOfBoundsException ax) {}
		finally {
			while(length < 8 || length > 32) {
				System.out.print("password length(8-32): ");
				try {
					length = Integer.parseInt(
						new BufferedReader(
							new InputStreamReader(System.in)
						).readLine()
					);
				}
				catch(NumberFormatException nfx) {
					return;
				}
			}
			StringBuffer password = new StringBuffer(length);
			for(int i=0; i < password.capacity(); ++i)
				password.append(characters[prng.nextInt(characters.length)]);
			System.out.println(password);
		}
        return;
    }
}

use strict;

my $length;
do {
    print "password length(8-32): ";
    chomp($length = <STDIN>);
} while($length =~ m/[^0-9]/ || ($length > 32 || $length < 8));
my @chars = ('a'..'z', 'A'..'Z', '0'..'9');
my $password;
while($length > 0) {
    $password .= @chars[int(rand($#chars))];
    $length--;
}
print "$password\n";

/*
Copyright 2005(c) Ian Treyball

   This program 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.

   This program 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 this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <assert.h>
#include "linkedlist.h"

 
//the bigger the file, the more secure
void rndLn(const char *const filename, char *s);
void obfsct(char *s);
//a password this big is almost useless...
const size_t buf_capcty = 1024L;

int main(int argc, char **argv) {
   if(argc != 2 || argv[1][0] != '-') {
       printf("usage: %s -wordlist.txt\n", argv[0]);
       return 1;
   }
   char *s = (char *)calloc(buf_capcty, sizeof(char));
   rndLn(&argv[1][1], s);
   obfsct(s);
   printf("%s\n", s);
   free(s);
   return 0;
}
void rndLn(const char *const filename, char *s) {
   //shouts to The Dark and Lopez for
   //helping me fix the former bug in the following line
   FILE *file = fopen(filename, "rb");
   if(file == NULL) {
       fprintf(stderr, "could not open file: %s\n", filename);
       exit(1);
   }
   int c = 0;
   add_node(0);
   while((c = fgetc(file)) != EOF) {
       if(((char)c) == '\n')
           add_node(ftell(file));
   }
   srand((time(NULL)));
   unsigned int rnd = (unsigned)(rand() % count_nodes());
   assert(rnd < count_nodes());
   fseek(file, get_node(rnd)->data, SEEK_SET);
   int i;
   for(i = 0; (c = fgetc(file)) != EOF && c != '\n' && i < buf_capcty;s++)
       *s = c;
   *s = '\0';
   return;
}
void obfsct(char *s) {
   srand(time(NULL));
   for(;*s != '\0'; ++s) {
       if((rand() & 0x01) != 0) {
           switch(*s) {
               case 'e':
                   *s = '3';
                   break;
               case ' ':
                   *s = '_';
                   break;
               case 'a':
                   *s = '@';
                   break;
               case 's':
                   *s = '$';
                   break;
               default: break;
           }
       }
   }
   return;
}

/*
Copyright 2005(c) Ian Treyball

   This program 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.

   This program 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 this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/

#include <stdio.h>
#include <stdlib.h>

#ifndef _linked_list
#define _linked_list

void add_node(long data);
struct list_node *lookup_node(long data);
unsigned int count_nodes(void);
void print_nodes(void);
struct list_node *get_node(unsigned int right);


struct list_node {
   struct list_node *next_node;
   fpos_t data;
};
struct list_node *first_node = NULL;
void add_node(long data) {
   struct list_node *new_node = NULL;
   new_node = malloc(sizeof(struct list_node));
   new_node->data = data;
   new_node->next_node = first_node;
   first_node = new_node;
   return;
}
struct list_node *lookup_node(long data) {
   struct list_node *current_node = first_node;
   while(current_node != NULL) {
       if(current_node->data != data) {
           current_node = current_node->next_node;
       } else {
           return current_node;
       }
   }
   return NULL;
}
unsigned int count_nodes(void) {
   struct list_node *current_node = first_node;
   unsigned int found = 0;
   while(current_node != NULL) {
       ++found;
       current_node = current_node->next_node;
   }
   return found;
}
void print_nodes(void) {
   struct list_node *current_node = first_node;
   printf("%s", "{ ");
   while(current_node != NULL) {
       printf("%d ", current_node->data);
       current_node = current_node->next_node;
   }
   printf("%s\n", "}");
   return;
}
struct list_node *get_node(unsigned int right) {
   struct list_node *current_node = first_node;
   if(right > count_nodes())
       return NULL;
   for(;right > 0; --right)
       current_node = current_node->next_node;
   return current_node;
}
#endif

#if 0 /* in case someone actually tries to compile this */