Wordlist numeric mangling question

[TessierAshpool]

Assuming it's possible, how would one do the following given the wordlist below:

example wordlist:
password1
apple78

Given another wordlist or parameter with sequence 0-100, can oclHashcat dynamically generate the following passwords to try against hashes?

password0-100 (ie. password0, password1, password2, ... password100)
apple0-100 (ie. apple0, apple1, apple2, ... apple100)

So in other words, if the word in the wordlist already has a number on the end of it, oclhashcat would substitute that number with the numeric sequence provided and try every sequence. If the word in the wordlist doesn't end in a number, oclhashcat would ignore it. Another sequence example would be years (2000-2016)

password2000-2016 (ie. password2000, password2001, password2002, ... password2016)
etc...

Is this possible with oclhashcat?

[epixoip]

No, this is not possible. Instead strip your wordlist down to basewords and do hybrid attacks.

[HRob1n]

i wrote a simple rule to do the first part where you start substituting alternative digits to find variances on existing bases with simple swaps, but you would need to expand on it to do the full sets you outlined above or follow epixoip's advice.

digit_expander.rule

Code:

## rule: digits expander ## limits: none ## example: john0 ---> john1, john2, john3, john4, ... s01 s02 s03 s04 s05 s06 s07 s08 s09 s10 s12 s13 s14 s14 s15 s16 s17 s18 s19 s20 s21 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99

Hope that helps