Open GoogleCodeExporter opened 9 years ago
I guess that even better solution might be this one.
instead of going one by one from the start of the range
go like this:
one from the start, one from the end and so on
instead of
0000
0001
0002
0003
0004
0005
go like
0000
9999
0001
9998
in this case, you'll get the results independent of which half the pin is in
the longest time it will take to crack pins that are close to the middle of the
interval
Original comment by jcdento...@gmail.com
on 31 Jan 2012 at 2:55
Great idea! That would be nice!
Original comment by mo.latte...@gmail.com
on 31 Jan 2012 at 3:34
0000
9999
0001
9998
this solution can be done by editing the keys.c in the src directory
e.g.
struct key k1[P1_SIZE] = {
{ "0000", 0 },
{ "9999", 0 },
{ "0001", 0 },
{ "9998", 0 },
{ "0002", 0 },
{ "9997", 0 },
{ "0003", 0 },
{ "9996", 0 },
...
Original comment by kirly...@gmail.com
on 1 Feb 2012 at 4:01
Personally I think that all should be added basically changed by parameter (all
starting with the common ones, ie. 1234,,0123,0000,1111,2222,...,9999 and then
doing the following:).
0 = Sorted least to greatest (0001 to 9998) (default when no parameter).
1 = Sorted greatest to least (9998 to 0001)
2 = Out to middle (0001,9998,0002,9997...)
3 = Middle to outside (5000,5001,4999...)
4 = Random
Original comment by nexdem...@gmail.com
on 25 Mar 2012 at 7:33
this needs to be done
Original comment by extraw...@gmail.com
on 9 Jul 2012 at 8:27
Was this done? Does anyone have a edited version of it?
Original comment by thezakmangf
on 25 Jul 2013 at 2:22
This should be added to the reaver with the parameter -p as the user can set
the pin order like 9875023451.
But reaver stopped updating.
Original comment by anteros2...@gmail.com
on 25 Jan 2014 at 6:33
Original issue reported on code.google.com by
kirly...@gmail.com
on 29 Jan 2012 at 10:46