Open the door to gameos means that some developers will start to know the Cell/BE and its architecture, we all know its potentials.
Of curse, we are seeking the return of linux, with one more spu for us.
Now that I've gain some C basis and finally nvidia-toolkit 3.2 can compile fine (the stock pyrit opencl kernel back to run on my cl_developing mobile 8400gs, I can't develop on PS3 only everytime) I'm back focusing to improve performance of OpenCL implementation of PMK hash on the Cell/BE, existing implementation computes 1200 pmk/s;
Correctly improve that is possible, we have tools.
Some stuff
WPA password cracking
fedora12-ps3 setup
Cell Architecture Explained
Hints from IBM forum
CUDA/OpenCL differences
OpenCL implementation of Sha1 hashing algo
opensource resources still hackin', bruteforge, OpenCL, PS3 and many SHA1 rounds...
Friday, January 14, 2011
Friday, December 10, 2010
...bruteforge has been C revamped!
I've completed the first C version, time to release;
All features of bruteforge 0.56 are implemented, with less skips, I've added full support to Extended ASCII Codes; (you can use your favourite 'èòàìù...')
bruteforge 0.6x, linux/elf386 here
documentation will be posted here
I was focused on a new function, the 'Filter Mode', from now you can pass your favourite wordlist to trim down over your favourite criteria mix...
So, not only generate wordlist in conditional way, but we can start filtering huge wordlists! (...this project seems moving like a squid...)
A diff about performance versions, I've done a simpe test, generating 100.000.000 words in a lowercasealpha, starting from 'a':
0.56 generates those in real 18m25.013s, doing 90.496 words/sec;
0.612 do the same job in real 0m24.451s, doing 4.089.812 words/sec;
In this test performance gain is 45.19x, I have no reason to maintain the python version,
anyway, script is open...
All features of bruteforge 0.56 are implemented, with less skips, I've added full support to Extended ASCII Codes; (you can use your favourite 'èòàìù...')
bruteforge 0.6x, linux/elf386 here
documentation will be posted here
I was focused on a new function, the 'Filter Mode', from now you can pass your favourite wordlist to trim down over your favourite criteria mix...
So, not only generate wordlist in conditional way, but we can start filtering huge wordlists! (...this project seems moving like a squid...)
A diff about performance versions, I've done a simpe test, generating 100.000.000 words in a lowercasealpha, starting from 'a':
0.56 generates those in real 18m25.013s, doing 90.496 words/sec;
0.612 do the same job in real 0m24.451s, doing 4.089.812 words/sec;
In this test performance gain is 45.19x, I have no reason to maintain the python version,
anyway, script is open...
Monday, November 15, 2010
...quietly...
First part is over, with something added like full support to Extended ASCII Codes, less skips and more speed, (almost x16 faster of python code when prints to terminal), code is running;
user have to define a 'template' text file like previously for advanced, program reads first 4 lines as:
charset
maxchars
starting word
ending word
it summarizes criteria to understand those combinations that will be skipped;
you can have multiple 'settingfiles' to run bruteforge over, it prints out generated words;
I've to made -lp -n -v -q customizables from commandline, add the fixed mode and more...
here a snapshot, follow a short demo from the cold North! Thanks!
user have to define a 'template' text file like previously for advanced, program reads first 4 lines as:
charset
maxchars
starting word
ending word
it summarizes criteria to understand those combinations that will be skipped;
you can have multiple 'settingfiles' to run bruteforge over, it prints out generated words;
I've to made -lp -n -v -q customizables from commandline, add the fixed mode and more...
here a snapshot, follow a short demo from the cold North! Thanks!
Thursday, October 21, 2010
Meanwhile, at lower levels...
Writing OpenCL code needs some C knowledges, in time I've thinked about PMK algo, Cell/BE, python, and C...
How can C code run faster, pointers, arrays and structs, ints, memory allocation/alignment and more...
Time to see what can be done in C, so how easy can be porting mine bruteforge python script other than code written by others?
I've wrote this time ago, code and algorithms are in my mind! I want to see the diffs, and learning C for my needs, of course.
As expected, C uses less memory (68kb over 1990Kb) and runs moOore faster, it generates 10.000.000 words in 3.384s, the python version computes the same numbers of words in 1m46.062s, so I've got a x31 speedup in front of 1/31 in memory!
My new code isn't well optimized, I'll spend some more time with it, but actual results are impressive; so I'm working to complete the C port of bruteforge with renewed logics; all will be in function of the -so called- 'advanced mode', so users can sets a custom charset (including special and spaces characters) and assign a maximum number of use for every char to compose a word!
Patterns eventually excluded like 'abc', 'stuv'... due to consecutiveness will be ever skipped by setting pattern's length, this also for consecutive repetition of same char like 'aaa', 'rrrr'... but I'm re-evaluating others skips like inversed consecutives that in case can skip too often probable words!
When completed, maybe I'll learned C better (a little bit) to expand functionalities, like transform words to compute some kind of hash...
Mine PS3 don't play games, but is hungry of ints!
How can C code run faster, pointers, arrays and structs, ints, memory allocation/alignment and more...
Time to see what can be done in C, so how easy can be porting mine bruteforge python script other than code written by others?
I've wrote this time ago, code and algorithms are in my mind! I want to see the diffs, and learning C for my needs, of course.
As expected, C uses less memory (68kb over 1990Kb) and runs moOore faster, it generates 10.000.000 words in 3.384s, the python version computes the same numbers of words in 1m46.062s, so I've got a x31 speedup in front of 1/31 in memory!
My new code isn't well optimized, I'll spend some more time with it, but actual results are impressive; so I'm working to complete the C port of bruteforge with renewed logics; all will be in function of the -so called- 'advanced mode', so users can sets a custom charset (including special and spaces characters) and assign a maximum number of use for every char to compose a word!
Patterns eventually excluded like 'abc', 'stuv'... due to consecutiveness will be ever skipped by setting pattern's length, this also for consecutive repetition of same char like 'aaa', 'rrrr'... but I'm re-evaluating others skips like inversed consecutives that in case can skip too often probable words!
When completed, maybe I'll learned C better (a little bit) to expand functionalities, like transform words to compute some kind of hash...
Mine PS3 don't play games, but is hungry of ints!
Thursday, May 20, 2010
"Cops can't stop me!", but I need fuel!

Can't release anything yet, I've tested, but sometimes got wrong results!
Too busy at the moment, I'm not a real programmer, I've to spend some time working now...
I'm not surrendered, but working changes needs study.
By the way, IBM has released an upgrade to OpenCL, with big changes about device control and more, but I haven't test yet.
I've to end up with a simple host code to run the cpyrit_opencl alone and setup timing to see if any changes are good!
Subscribe to:
Posts (Atom)