mp64: generate total random words
M@LIK
Beta Tester
****

Posts: 414
Joined: Mar 2012
#1
04-22-2012, 05:36 PM

how can i generate words in random??
let's say::
Code:
mp64 -1 ?l?d ?1?1?1?1?1?1?1?1
i think this is impossible to complete.. but what if i want only 1M from that range.. using::
Code:
mp64 -1 ?l?d ?1?1?1?1?1?1?1?1 -s10000000 -l11000000
its not so efficient coz it will generate only a specific range.. like::
Code:
100001q0
100001q1
100001q2
100001q3
100001q4
100001q5
100001q6
100001q7
100001q8

what i want to see is::
Code:
1w6675qE
F825quGq
qbfjB622
n9H219Aq
RL0of595
xP836q4w
r5b3324v
NorOr6j9
Reply
atom
Administrator
*******

Posts: 3,492
Joined: Apr 2010
#2
04-23-2012, 10:20 AM

You can not generate random words with maskprocessor.
Reply
M@LIK
Beta Tester
****

Posts: 414
Joined: Mar 2012
#3
04-23-2012, 11:38 AM

this wasnt what i wanted to hear.. : /
any idea how to do that even without mp??
Reply
en-tee-el-em
Junior Member
**

Posts: 2
Joined: Apr 2012
#4
04-23-2012, 11:58 AM

<random gibberish>
Could you take any small binary on your system , send it through the "octal dump" unix util "od -c" > trap the output in a text file, clean it up, send half of that through a rot13 and have through a rot20 , then pipe through "translate" tool tr [A-Z] [a-z] then through "cut -c1-8" ??
</random gibberish>
Reply
M@LIK
Beta Tester
****

Posts: 414
Joined: Mar 2012
#5
04-23-2012, 12:28 PM

@en-tee-el-em::
could be.. thanks.. i'll try to do that : )

i also thought about this::
Code:
mp64 -oOUT.out -1 MGUI -2 4193 -3 yoct -4 2568 ?1?2?3?4?1?2?3?4
sort -R OUT.out > OUT_s.out

r.rule
Code:
:
}
}}
}}}
}}}}
{
{{
{{{
{{{{


Code:
hc64 OUT_s.out -rr.rule --stdout nul nul > OUT_s_r.out
sort -Ru OUT_s_r.out > OUT_s_r_s.out

results??
Code:
4c5G1y2G
8I4o8M9t
9y5I4t2U
2G4t2I4t
9y5I4t8G
M1y8M3t6
5G4o5U1c
6I4o5M3y
y5I4o5M9
o5I9o2M4
8G1t6M9c
t8I3t5U9
9o8M3o2I
4o5I9o8I
y6I4o8G3
o8U3t8M9
y2I9y5G9
5M9o8U3o
cool enough.. huh =D

its like "in ur face atom".. LOL just joking pal..

PS:: it needs more work.. coz its showing only certain characters.. but i believe that could be done also!!
(This post was last modified: 04-23-2012, 12:42 PM by M@LIK.)
Reply
undeath
Sneaky Bastard
****

Posts: 793
Joined: Jul 2010
#6
04-23-2012, 12:47 PM

you might be interested in the fingerprint attack. Take a close look at the expander. (hashcat-utils)
Reply
atom
Administrator
*******

Posts: 3,492
Joined: Apr 2010
#7
04-23-2012, 12:49 PM

(04-23-2012, 12:28 PM)M@LIK Wrote: its like "in ur face atom".. LOL just joking pal..

nah, love to see when hashcat user are creative.
Reply
M@LIK
Beta Tester
****

Posts: 414
Joined: Mar 2012
#8
04-23-2012, 01:01 PM

@undeath::
wacthed purehate's video couple of times + read the wiki couple of times = never understood it... maybe now i can?? lol

@atom::
: )
Reply
en-tee-el-em
Junior Member
**

Posts: 2
Joined: Apr 2012
#9
04-23-2012, 02:16 PM

could you butcher this python found on tintertubes

import string
import random

FILE = open("test.txt","a")
i = 0
while i <= 1000:
i+=1
d = [random.choice(string.letters) for x in xrange(8)]
s = "".join(d)
writing= s.lower()+"\n"
FILE.write(writing)
FILE.close()
Reply
M@LIK
Beta Tester
****

Posts: 414
Joined: Mar 2012
#10
05-05-2012, 01:17 AM

After more than a week of researches : P...
I believe I found the best way to do this.
Unique, pure, random words xD
All in one liner (Only for Linux) (On Windows you can use Cygwin):
Code:
cat /dev/urandom | tr -cd '[charset]' | head -c[size_of_output_in_bytes] | fold -w[string_length] | sort -u | awk "length==[string_length]"
(awk is used only to verfiy the length [optional])
(sort -u is not necessary too, you would rarely find dupes [optional])

charset = is the desired character-set:
Code:
a-z = ?l
A-Z = ?u
0-9 = ?d
\ -~ = ?s

size_of_output_in_bytes = is the maximum output size:
Code:
1024=1024 (1 kilobyte)
1024^2=1048576 (1 megabyte)
1024^3=1073741824 (1 gigabyte)
Note: size might increase due to line endings (fold).

string_length = is the desired length.


Examples:
Code:
cat /dev/urandom | tr -cd 'a-z' | head -c1048576 | fold -w8 | sort -u | awk "length==8"
This outputs 1 megabyte of 8-length words (All in lower-case).
Code:
...
dnwvbzdh
wkgnhnub
iigbbpjd
pmjnrbaw
iqfltfrm
liaakmnb
pimrhdlo
shgtkwnx
rmizhqzt
ojhukfdl
fxcsznbi
...


Code:
cat /dev/urandom | tr -cd 'a-zA-Z0-9' | head -c2048 | fold -w15 | sort -u | awk "length==15"
This outputs 2 kilobyte of 15-length words (All ?u?l?d) (very nasty xD).
Code:
...
FMQdpOPW4kUDJ8X
GfbFV093R76ksvU
GSXYlvhcHZ1zMhW
I5wdEUeAtipBSD3
i9CwDdmcPkj755t
Ic6XEEhnJKEWu9Q
IR0H8mfsliFBsRq
IzutBcjruiDspa7
J7knLbBd7QV6rdg
jfNY2c6k5i93x0p
KvK6eAWxAmSw4UD
kwqcNvpIh1KIqgt
kWvH1ZP9zp9l0wE
lFM1rCh545M88fC
...


Let's go HARDCORE!
Code:
cat /dev/urandom | tr -cd 'a-zA-Z0-9\ -~' | head -c2048 | fold -w32 | sort -u | awk "length==32"
Code:
...
-<%2p?e6E<~?Ov7M=B*hR(1-@GZO:lxn
1lP 4<^7+s-@ 60M\SfG1=2HO^mJGF;,
1N mi4XHk+/r0%8XaI7UdC$L`bi: "-G
1NACv-cdB5&ONn>/A/Gm_x+^Wdm',?tp
2!*8_>&-Ik6|\ae+kLy;RG?&>~*@Gz(0
2LnsHQ ?TTaZxj@+UB"AHCw #qIbKqid
6???[1i}vI#CrOuxY0ehK2.297]N6gh+
7w|{a0gYX;Q>sm#g@{Z! >rs>lUo$LkO
7wiH` ,8KOkeshfYv7;^Z~u(ed4PfQ&E
9q(%^2MA$JS05A9.,e-mQJ2B[E~5#|af
AE/QEyy0@I'oN.V&{a?:6*{l@;phcY^s
AF[8*%i?InMU7d,_Gf@'Lo{OD=?{|u&k
...

LOL

I must say, I'm loving the rubbish this is giving me. xD
Reply