>> (p.1)
    Author Topic: WifSolverCuda - new project for solving WIFs on GPU  (Read 1618 times)
    PawGo (OP)
    Legendary
    *
    Offline Offline

    Activity: 952
    Merit: 1467


    View Profile
    January 19, 2022, 07:48:26 PM
    Last edit: January 24, 2022, 03:54:23 PM by PawGo
    Merited by ABCbits (73), OmegaStarScream (12), Welsh (10), malevolent (10), hugeblack (10), Quickseller (5), LeGaulois (5), Halab (2), albert0bsd (2), BitMaxz (1), SFR10 (1), khaled0111 (1), dkbit98 (1), digaran (1)
     #1

    Hello

    It took me a long time to start, but I hope that now, after the first step it will be much easier. Motivated by topic https://bt.irlbtc.com/view/5380095.msg58913560#msg58913560 I decided to start migrating my CPU WifSolver into GPU.
    And here it is: https://github.com/PawelGorny/WifSolverCuda

    I will not repeat description from ReadMe file because all the important information are there - and it is easier to update one place.

    Currently it covers only needs of the aforementioned topic (and similar).
    Yes, yes I know... It is a long way to Tipperary. Code maybe does not look beautiful, lot of libraries (anyway JLP rulez), but it WORKS! Probably some CUDA masters will know how to improve it - please let me know any of your ideas. I may also say that it was a painful journey in time for me, as I did not use c++ for years. But finally I am happy the first step is done.
    And - what is the most important - it is the solution for the cases which cannot be solved with BitCrack (stride collides with checksum). And it is slightly faster than BitCrack - at least for the cases I tested. As it is CUDA - sky is the limit if you know how to configure a given program for your card.

    TODO list is long, if you have any ideas, requests - let me know, here or on github.


    edit
    v 0.3.1

    I have added worker for compressed address and improved general performance.
    Now it is possible to work on WIFs with missing characters at the beginning (static checksum, param: -checksum) and in the middle (checksum changed by stride).
    It looks like my algorithm is almost twice as fast as BitCrack, at least for the cases where BitCrack could be used.
    (On my card I had 690MKeys on regular Bitcrack and 790MKeys on patched versions, my WifSolver produces 1300MKeys. For compressed WIFs where missing characters are in the middle and compression flag is impacted, speed is around 3600MKeys).


    edit
    v 0.4.3

    I have added a small helper - WIF decoder.
    Some minor changes in algorithm and program itself, performance improved, especially for compressed keys with missing characters in the middle (x3 faster now, 10.000 MKeys on my test machine, solving 19*6 missing characters in 1:10 min).
    Added Makefile for linux builds.

Page 1
Viewing Page: 1