Sponsored Content
Special Forums Cybersecurity swordfish --- a password generator Post 59404 by Perderabo on Saturday 18th of December 2004 03:29:15 PM
Old 12-18-2004
If I do this:
Code:
$ ./swordfish
>>}###@>---- define X=(n{ABCDEF})
>>}###@>---- XXXXXX
0F5C7E
9833F3
9713BE
1EBE49
195969

>>}###@>----

I can generate random hexadecimal numbers. Password generators are very close to being random number generators. So it is fair to ask a password generator to pass tests intended for a random number generator. I did this:
Code:
$ ./swordfish "define X=(n{ABCDEF})" "format 1000000" "X<80>" > hex.txt
This command took 13711 seconds.
$

At that point I had one million lines of hexadecimal numbers, each 80 characters in length. This is exactly the input format needed by the asc2bin program of the diehard test suite. I ran diehard on the data file, selecting all 15 tests. The data passes all 15 tests. The results are attached.

Last edited by Perderabo; 07-06-2005 at 09:41 AM.. Reason: Fix typo
 

7 More Discussions You Might Find Interesting

1. Cybersecurity

Password Generator

I need a great Password Generator program. I looked at a few of them, but none of them seemed to be what I wanted. So I have decided to write my own. (That's the cool thing about being a programmer....I always get what I want in software :) ) Do you have any password generators that you... (13 Replies)
Discussion started by: Perderabo
13 Replies

2. UNIX for Dummies Questions & Answers

date generator

Is there a command to generate the unix date that is in theshadow file?>? (2 Replies)
Discussion started by: BG_JrAdmin
2 Replies

3. Shell Programming and Scripting

time generator

Hi experts, I'd like to generate the table/file containing: number of milliseconds elapsed since midnight till midnight. It should contain 5 columns (hours minutes seconds milliseconds): Table will have theoretically 86 400 000 rows. My question is , is there somewhere the file or source... (7 Replies)
Discussion started by: hernand
7 Replies

4. Shell Programming and Scripting

Sequence generator

Thanks Guys This really helped (5 Replies)
Discussion started by: robert89
5 Replies

5. UNIX for Beginners Questions & Answers

Password generator with user inputs

Hi, I am new to bash scripting and i wanted to make a bash script that will generate a password for a user. The user must enter his/her name and the url of the site the password is used for. And the script will generate a password with those two elements in the password. So if the url is... (0 Replies)
Discussion started by: Kvr123
0 Replies

6. Shell Programming and Scripting

Random Password generator with 2 digits and 6 characters

I am using the below to random generate a password but I need to have 2 numeric characters and 6 alphabetic chars head /dev/urandom | tr -dc A-Za-z0-9 | head -c 8 ; echo '' 6USUvqRB ------ Post updated at 04:43 PM ------ Any Help folks - Can the output be passed onto a sed command to... (9 Replies)
Discussion started by: infernalhell
9 Replies

7. Forum Support Area for Unregistered Users & Account Problems

Password sent via reset password email is 'weak' and won't allow me to change my password

I was unable to login and so used the "Forgotten Password' process. I was sent a NEWLY-PROVIDED password and a link through which my password could be changed. The NEWLY-PROVIDED password allowed me to login. Following the provided link I attempted to update my password to one of my own... (1 Reply)
Discussion started by: Rich Marton
1 Replies
random(3)						     Library Functions Manual							 random(3)

Name
       random, srandom, initstate, setstate - better random number generator; routines for changing generators

Syntax
       long random()

       void srandom(seed)
       int seed;

       char *initstate(seed, state, n)
       unsigned seed;
       char *state;
       int n;

       char *setstate(state)
       char *state;

Description
       The  subroutine	uses  a  non-linear additive feedback random number generator employing a default table of size 31 long integers to return
       successive pseudo-random numbers in the range from 0 to (2**31)-1.  The period of this random number generator is very large, approximately
       16*((2**31)-1).

       The  subroutines  have  (almost)  the same calling sequence and initialization properties as The difference is that rand(3) produces a much
       less random sequence - in fact, the low dozen bits generated by rand go through a cyclic pattern.  All the bits generated  by  are  usable.
       For example, "random()&01" will produce a random binary value.

       Unlike  does  not  return  the  old seed; the reason for this is that the amount of state information used is much more than a single word.
       (Two other routines are provided to deal with restarting/changing random number generators.)  Like  however,  will  by  default	produce  a
       sequence of numbers that can be duplicated by calling with 1 as the seed.

       The  routine  allows  a state array, passed in as an argument, to be initialized for future use.  The size of the state array (in bytes) is
       used by to decide how sophisticated a random number generator it should use - the more state, the better the random numbers will be.  (Cur-
       rent  "optimal"	values	for  the  amount of state information are 8, 32, 64, 128, and 256 bytes; other amounts will be rounded down to the
       nearest known amount.  Using less than 8 bytes will cause an error).  The seed for the initialization (which specifies a starting point for
       the  random  number  sequence, and provides for restarting at the same point) is also an argument.  returns a pointer to the previous state
       information array.

       Once a state has been initialized, the routine provides for rapid switching between states.  The subroutine returns a pointer to the previ-
       ous state array; its argument state array is used for further random number generation until the next call to or

       Once  a	state  array  has  been  initialized, it may be restarted at a different point either by calling (with the desired seed, the state
       array, and its size) or by calling both (with the state array) and (with the desired seed).  The advantage of calling both and is that  the
       size of the state array does not have to be remembered after it is initialized.

       With  256  bytes  of  state information, the period of the random number generator is greater than 269, which should be sufficient for most
       purposes.

Diagnostics
       If is called with less than 8 bytes of state information, or if detects that the state information has been  garbled,  error  messages  are
       printed on the standard error output.

See Also
       rand(3)

																	 random(3)
All times are GMT -4. The time now is 12:03 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy