rules in combination attack

[xeb]

Thanks for this first idea :-)
... I slept over the problem, there should be much more possible optimisation. The first file looked like

Code:

.
+
-
#
!
{...}
pass1
pass2
pass3
{...}
passn

before I ran my own shell script (didn't know hashcat that time) on it.
The password should look like 
passx{one or two concats}passy{one or two concats}passz
I'm quite sure if there are two concats between passx and passy there should be only one betweeen passy and passz (or only one concat in both cases? argh!) so I used the two dictionarys up to depth 3.
passx passy and passz are different passphrases, no passx passx passy combination.
There are ~15 different possible concats (!"$%&/\?=+#'-_.:, and ~40 possible passwords.
I think it should be possible to create a dictionary using the utilites, but it won't fit on any harddisk :-(
The Number of combinations would shrink dramatically, from
55^6 = 27680640625 to
40 * 15 * 40 * 15 * 40 + 40 * 15 * 15 * 40 * 15 *40 = 230400000, that's less than 1%
I read the wiki but have no idea how to realize this on runtime...
Edit: even less since it would be 40*39*38, no two same passwords...

Edit2: ok, think I got it - lot of manual work, passwords one file, seperators other file and massive use of combinator and combinator3 into new files which are then combinator3ed to hashcat...