begood

cam da dar imi place, e un toy vechi si de incredere imi amintesc cand am reusit primul meu vnc reverse tcp...

lol ? pt ce naiba ai facut asta....inutil. in curand voi compila un wordlist de 50 Gb fiti pe faza

M-am gandit...daca tot ma retrag sa dau ceva inapoi forumului... Salutare oxy,unu,dranaxum....si restul care ma cunosc... btw daca are careva nevoie de tabele/audit la un hash, ma contactati.

The idea of a cryptographic hash of a plaintext password is that you cannot 'reverse' or 'decrypt' the hash and in this way recover the original plaintext. One can only attempt to recover the plaintext password by trying many plaintexts and compare the resulting hashes to this hash (for example by regular brute forcing, dictionary attacks or by using rainbow tables). It is however possible to reverse part of the hash in such a way that a smaller part of the cryptographic algorithm has to be performed. The amount of steps that can be reversed, depends on the algorithm used. At least for MD5 an unlikely large amount of steps can be reversed. Several people have been working on reversing this algorithm and implementing these techniques into brute forcers. For example the GPU powered brute forcer BarsWF gains much speed because of the reversed steps. There is this one guy, Sc00bz, who actually wrote about reversing MD5 in detail, providing enough information for one to go and implement the reversing steps into for example a brute forcer. Later on he even provided some code snippets to work with. read more : http://blog.distracted.nl/2009/04/reversing-cryptographic-hash.html o explicatie mai completa pe hackpedia.info : http://hackpedia.info/viewtopic.php?f=139&p=85221#p85221 am tradus cate una alta.

As promised I hereby present my MD5 password brute forcer, called EmDebr. I used reversing to speed things up, see my previous blog for more information about reversing. I also gave interlacing SSE2 a try (did that after I posted my previous blog and came up with a speed improvement of about 40%. So on my own system (3.2Ghz quadcore) I got like 77 Mhashes/s before interlacing, with the current version I get around 100 Mhashes/s. Interlacing SSE2 is not my own idea and can be done (a lot) better then what I came up with. EmDebr is in this way still by far not the fastest SSE2 optimized MD5 password brute forcer around, as far as I know that's still BarsWF. As far as I know EmDebr is now the fastest open source one though I hope this helps others to understand reversing and maybe you can use my code to write a better/faster open source cracker. Feel free to leave a comment or to post some improvements!

I couldn't help optimizing SHAbr just a little more, I really wanted to get the 60 Mhashes/s on my system What did I do? A plaintext first consists of an array of characters (unsigned char[16]), then I pass it as an __m128i type to the SHA-1 function. With SSE2 I do 4 plaintexts at the same time, so actually 4 of these variables are passed to this function. The variables get split into 4 32-bit integers (I called these types UINT4). The SHA-1 function then puts these variables in an array of 80 UINT4's, this array is called W. This array is used to add a value in every one of the 80 steps of the actual hashing part. The first 16 UINT4's in this array W are just the parts of the plaintext, and as I only support plaintexts with length < 16, only the first 4 UINT4's are filled. Then W[4]...W[14] contain zero's in my case, W[15] contains the length of the plaintext in bits. So what happens with W[16]...W[79]? The previous values (the actual plaintext) are 'expanded' into these values, so every step has additional input and is dependent on the plaintext. This expanding isn't that special: W[t] = W[t-3] XOR W[t-8] XOR W[t-14] XOR W[t-16] And then ROTATE this result by one. As W[4]...W[14] contains nothing but zero's, I didn't actually want to set them. But because W[18]...W[30] depend on these zero's, they should be set. Unless we change the EXPAND function for W[18]...W[30]. But as that needs more unrolling of the loops, my code gets bigger and maybe slower (had that before). So now I unrolled certain parts in a strange way, but somehow it works I now have some strange code like: for(t = 20; t < 21; t++){ SSE_EXPAND_3(t); ROTATE(t) SSE_EXPAND_3(t+1); ROTATE(t+1) SSE_EXPAND_3(t+2); ROTATE(t+2) SSE_EXPAND_3_8(t+3); ROTATE(t+3) SSE_EXPAND_3_8(t+4); ROTATE(t+4) } This code block within the for loop gets executed only once. So you'd say that I could just write out SSE_EXPAND3(20) - (24) and such, but somehow that makes things slower... Anyway, instead of 58.5 Mhashes/s I now get: Length 5 - 55% in 8.39 s (60.29 Mhashes/s) http://blog.distracted.nl/2009/01/shabr-update-i-passed-60-mhashess.html

And hereby I also present my open source, SSE2 optimized, NTLM password brute forcer, called EnTibr. This is almost the same code as the one used in EmDebr. I also used reversing of the MD4 algorithm, skipping the full 3rd round. With my own system I get around 150 Mhashes/s using 4 cores @ 3.2Ghz. Again, I hope this helps others to understand reversing and maybe you can use my code to write a better/faster open source cracker. Feel free to leave a comment or to post some improvements! http://blog.distracted.nl/2009/05/faster-brute-forcers.html

As requested, I built an MS Cache brute forcer. The MS Cache hashes are a little harder to optimize. They are salted and need 2x MD4. This is how you built an MS Cache hash: * Built NTLM hash for the password: MD4(Unicode(password)) * Append Unicode&lowercase username to the NTLM hash * MD4 that So in short: MD4( MD4(Unicode(password)) + Unicode(tolower(username)) ) Because of this, you need the calculate the full MD4 hash for every plaintext. Because of the unknown first 16 bytes of the input for the final MD4 (the NTLM hash), you cannot really reverse steps. I only reversed partial last steps. I've been a little lazy, this version only supports usernames with a maximum length of 19 characters. You would need to do an additional MD4 for longer usernames. I interlaced SSE2 three times, getting to something like 72 Mhashes/s on my system. http://blog.distracted.nl/2009/05/cacheebr-ms-cache-password-brute-forcer.html

World's fastest on a single hash or 100,000 hashes? No.. Fastest on a typical workload of tens to 100s of hashes? I believe so. World's fastest cross platform? As far as I know. Plenty of room for improvement? Sure. The first one planning to release the source? To my knowledge, yes. Performance Some random performance stats for password length 7 (shorter passwords will be slightly faster due to lower register usage, longer will be slightly slower): Tested with a GTX260 (216 stream processors) on 64-bit Linux, full US character set. Reported rates are compares per second - so (password stepping rate * number of hashes). The time on the left is the kernel execution time. Shorter times allow a more responsive GUI, but lower performance. 10ms does not interfere with screen updates at all. 20ms is noticeable, but still very usable. 100ms and 500ms are best used either on a headless system or when the user will not be present, as they drop the screen redraw rate to unusable levels. NTLM Comparison Rates 1 hash 10 hashes 100 hashes 1000 hashes 10ms 571 M/s 4913 M/s 20536 M/s 18100 M/s 20ms 581 M/s 5003 M/s 20919 M/s 27600 M/s 100ms 590 M/s 5078 M/s 21240 M/s 30450 M/s 500ms 599 M/s 5158 M/s 21617 M/s 30800 M/s MD5 Comparison Rates 1 hash 10 hashes 100 hashes 1000 hashes 10ms 410 M/s 3665 M/s 17940 M/s 17633 M/s 20ms 418 M/s 3740 M/s 18310 M/s 17760 M/s 100ms 425 M/s 3804 M/s 18670 M/s 29850 M/s 500ms 431 M/s 3862 M/s 18970 M/s 30260 M/s System Requirements These binares require CUDA (nVidia's API for programming GPUs to do non-graphics things). You will need the following: # An nVidia GPU that supports CUDA - pretty much any 8000 series or later GPU should work # Enough video RAM - this varies. OS X uses far more video RAM than a headless Linux server. 256MB should be enough. # The appropriate drivers. This is the tricky bit. You have to have recent nVidia drivers with CUDA support. # Compatible libraries. This should only be an issue with Linux, and any decently recent Linux should be fine. Non-standard libraries are included. Driver Downloads To get the driver you need, go to Download CUDA Code - complete and free toolkit for creating derivative works and download the driver for your OS. Recent nVidia drivers for Windows and Linux should have the support built in. If it doesn't work, update your driver. Also, for OS X, download the CUDA Toolkit and ensure that you select the CUDA kext in a custom install. http://cryptohaze.com/bruteforcers.php

Ok, we have a nice name for the program, so I will have to spend some time to make it work as it is named. Right now on nVidia 9600GT/C2D 3Ghz CUDA version does 350 M keys/sec, SSE2 version does 108 M keys/sec. You may check benchmarks of all known good MD5 bruteforcers here. You may discuss it at forum. System Requirements: * CUDA version only:nVidia GeForce 8xxx and up, at least 256mb of video memory. * LATEST nVidia-driver with CUDA support.Standard drivers might be a bit older (as CUDA 2.0 is still beta) * AMD/Brook version only: ATi/AMD card 2xxx, 3xxx, 4xxx * LATEST AMD video driver. * CPU with SSE2 support (P4, Core2Duo, Athlon64, Sempron64, Phenom). * Recommended 64-bit OS (WinXP 64 or Vista64). 32-bit version is also available. http://3.14.by/en/md5 Competitors comparison: CUDA

Source code included, doing almost 300 Mhashes/s using 6 SPUs and 2 PPU cores. http://blog.distracted.nl/2009/06/psebr-md5-playstation-3-md5-password.html

Toate tabelele freerainbowtables.com le puteti gasi aici : http://thepiratebay.org/user/frtdrag0n/ Sunt seed-uite permanent de un user. http://freerainbowtables.com Tabelele sunt facute pentru urmatoarii algoritmi LM MD5 NTLM SHA1 FASTLM HALFLMCHALL lm_all-space#1-7_0 40 10.96 GB 2008-08-28 lm_all-space#1-7_1 42 11.49 GB 2008-08-28 lm_all-space#1-7_2 42 11.37 GB 2008-08-28 lm_all-space#1-7_3 40 10.87 GB 2008-07-22 lm_alpha-numeric#1-7_0 2 478.52 MB 2008-07-29 lm_alpha-numeric#1-7_1 2 473.97 MB 2008-07-29 lm_alpha-numeric#1-7_2 2 482.07 MB 2008-07-29 lm_alpha-numeric#1-7_3 2 396.32 MB 2008-11-26 lm_lm-frt-cp437-850#1-7_0 617 190.70 GB 2009-03-30 lm_lm-frt-cp437-850#1-7_1 310 112.26 GB 2009-03-27 lm_lm-frt-cp437-850#1-7_2 310 112.17 GB 2009-04-09 lm_lm-frt-cp437-850#1-7_3 311 111.98 GB 2009-04-28 md5_alpha-numeric-space#1-8_0 20 5.48 GB 2008-07-22 md5_alpha-numeric-space#1-8_1 20 5.48 GB 2008-07-22 md5_alpha-numeric-space#1-8_2 20 5.47 GB 2008-07-22 md5_alpha-numeric-space#1-8_3 20 5.56 GB 2008-07-22 md5_alpha-space#1-9_0 42 11.73 GB 2008-07-28 md5_alpha-space#1-9_1 44 11.89 GB 2008-07-28 md5_alpha-space#1-9_2 44 11.89 GB 2008-08-24 md5_alpha-space#1-9_3 44 11.88 GB 2008-08-28 md5_hybrid(loweralpha#6-6,numeric#1-3)#0-0_0 2 536.58 MB 2008-07-22 md5_hybrid(loweralpha#6-6,numeric#1-3)#0-0_1 2 537.48 MB 2008-07-22 md5_hybrid(loweralpha#6-6,numeric#1-3)#0-0_2 2 537.09 MB 2008-07-22 md5_hybrid(loweralpha#6-6,numeric#1-3)#0-0_3 2 537.29 MB 2008-07-22 md5_hybrid(loweralpha#7-7,numeric#1-3)#0-0_0 38 10.69 GB 2008-07-22 md5_hybrid(loweralpha#7-7,numeric#1-3)#0-0_1 38 10.68 GB 2008-07-22 md5_hybrid(loweralpha#7-7,numeric#1-3)#0-0_2 38 10.68 GB 2008-07-28 md5_hybrid(loweralpha#7-7,numeric#1-3)#0-0_3 36 10.28 GB 2008-07-28 md5_loweralpha-numeric-space#1-8_0 20 5.44 GB 2008-10-09 md5_loweralpha-numeric-space#1-8_1 20 5.44 GB 2008-09-05 md5_loweralpha-numeric-space#1-8_2 20 5.48 GB 2008-07-29 md5_loweralpha-numeric-space#1-8_3 20 5.43 GB 2008-07-29 md5_loweralpha-numeric-symbol32-space#1-7_0 42 11.42 GB 2008-07-29 md5_loweralpha-numeric-symbol32-space#1-7_1 42 11.43 GB 2008-07-22 md5_loweralpha-numeric-symbol32-space#1-7_2 42 11.43 GB 2008-07-30 md5_loweralpha-numeric-symbol32-space#1-7_3 40 10.90 GB 2008-10-09 md5_loweralpha-space#1-9_0 44 11.91 GB 2008-07-30 md5_loweralpha-space#1-9_1 44 11.76 GB 2008-07-31 md5_loweralpha-space#1-9_2 44 11.93 GB 2008-07-31 md5_loweralpha-space#1-9_3 44 11.93 GB 2008-07-31 md5_mixalpha-numeric-all-space#1-6_0 6 1.20 GB 2008-07-29 md5_mixalpha-numeric-all-space#1-6_1 6 1.13 GB 2008-08-28 md5_mixalpha-numeric-all-space#1-6_2 6 1.14 GB 2008-07-29 md5_mixalpha-numeric-all-space#1-6_3 6 1.13 GB 2008-08-24 md5_mixalpha-numeric-space#1-7_0 22 6.11 GB 2008-07-31 md5_mixalpha-numeric-space#1-7_1 22 5.91 GB 2008-07-22 md5_mixalpha-numeric-space#1-7_2 22 6.07 GB 2008-07-31 md5_mixalpha-numeric-space#1-7_3 22 6.07 GB 2008-07-31 md5_numeric#1-12_0 8 1.67 GB 2008-07-28 md5_numeric#1-12_1 8 1.67 GB 2008-07-28 md5_numeric#1-12_2 8 1.68 GB 2008-07-29 md5_numeric#1-12_3 8 1.71 GB 2008-07-29 ntlm_alpha-numeric-space#1-8_0 20 5.48 GB 2008-07-22 ntlm_alpha-numeric-space#1-8_1 20 5.31 GB 2008-07-22 ntlm_alpha-numeric-space#1-8_2 20 5.48 GB 2008-07-22 ntlm_alpha-numeric-space#1-8_3 20 5.48 GB 2008-07-22 ntlm_alpha-space#1-9_0 42 11.39 GB 2008-08-22 ntlm_alpha-space#1-9_1 44 11.89 GB 2008-08-22 ntlm_alpha-space#1-9_2 44 11.88 GB 2008-08-22 ntlm_alpha-space#1-9_3 42 11.50 GB 2008-11-25 ntlm_hybrid(loweralpha#6-6,numeric#1-3)#0-0_0 2 530.71 MB 2008-07-28 ntlm_hybrid(loweralpha#6-6,numeric#1-3)#0-0_1 2 530.83 MB 2008-07-28 ntlm_hybrid(loweralpha#6-6,numeric#1-3)#0-0_2 2 530.60 MB 2008-07-28 ntlm_hybrid(loweralpha#6-6,numeric#1-3)#0-0_3 2 530.41 MB 2008-07-28 ntlm_hybrid(loweralpha#7-7,numeric#1-3)#0-0_0 38 10.53 GB 2008-07-28 ntlm_hybrid(loweralpha#7-7,numeric#1-3)#0-0_1 38 10.41 GB 2008-08-01 ntlm_hybrid(loweralpha#7-7,numeric#1-3)#0-0_2 38 10.68 GB 2008-08-28 ntlm_hybrid(loweralpha#7-7,numeric#1-3)#0-0_3 38 10.69 GB 2008-08-28 ntlm_loweralpha-numeric-space#1-8_0 20 5.45 GB 2008-07-29 ntlm_loweralpha-numeric-space#1-8_1 20 5.48 GB 2008-07-29 ntlm_loweralpha-numeric-space#1-8_2 20 5.44 GB 2008-07-29 ntlm_loweralpha-numeric-space#1-8_3 20 5.44 GB 2008-09-05 ntlm_loweralpha-numeric-symbol32-space#1-7_0 42 11.43 GB 2008-07-22 ntlm_loweralpha-numeric-symbol32-space#1-7_1 42 11.42 GB 2008-07-29 ntlm_loweralpha-numeric-symbol32-space#1-7_2 42 11.39 GB 2008-07-22 ntlm_loweralpha-numeric-symbol32-space#1-7_3 42 11.38 GB 2008-08-22 ntlm_loweralpha-space#1-9_0 44 11.95 GB 2008-07-29 ntlm_loweralpha-space#1-9_1 44 12.14 GB 2008-07-29 ntlm_loweralpha-space#1-9_2 44 11.93 GB 2008-08-01 ntlm_loweralpha-space#1-9_3 44 12.27 GB 2008-08-24 ntlm_mixalpha-numeric-all-space#1-6_0 6 1.20 GB 2008-08-01 ntlm_mixalpha-numeric-all-space#1-6_1 6 1.20 GB 2008-08-01 ntlm_mixalpha-numeric-all-space#1-6_2 6 1.17 GB 2008-08-01 ntlm_mixalpha-numeric-all-space#1-6_3 6 1.17 GB 2008-08-01 ntlm_mixalpha-numeric-space#1-7_0 22 6.10 GB 2008-08-01 ntlm_mixalpha-numeric-space#1-7_1 22 6.09 GB 2008-07-22 ntlm_mixalpha-numeric-space#1-7_2 22 6.07 GB 2008-07-22 ntlm_mixalpha-numeric-space#1-7_3 22 6.06 GB 2008-08-24 ntlm_numeric#1-12_0 8 1.68 GB 2008-07-22 ntlm_numeric#1-12_1 8 1.68 GB 2008-07-22 ntlm_numeric#1-12_2 8 1.68 GB 2008-07-22 ntlm_numeric#1-12_3 6 1.67 GB 2008-07-22 fastlm_alpha-numeric#1-7_0 2 477.30 MB 2008-08-03 fastlm_alpha-numeric#1-7_1 2 476.74 MB 2008-08-03 fastlm_alpha-numeric#1-7_2 2 482.91 MB 2008-08-03 fastlm_alpha-numeric#1-7_3 2 478.02 MB 2008-08-03 halflmchall_alpha-numeric#1-7_0 2 452.73 MB 2008-08-03 halflmchall_alpha-numeric#1-7_1 2 442.30 MB 2008-08-03 halflmchall_alpha-numeric#1-7_2 2 462.49 MB 2008-08-03 halflmchall_alpha-numeric#1-7_3 2 462.46 MB 2008-08-03 sha1_loweralpha-numeric-space#1-8_0 20 5.44 GB 2008-09-15 sha1_loweralpha-numeric-space#1-8_1 20 5.44 GB 2008-09-15 sha1_loweralpha-numeric-space#1-8_2 20 5.44 GB 2008-09-15 sha1_loweralpha-numeric-space#1-8_3 20 5.44 GB 2008-09-15 sha1_loweralpha-space#1-9_0 44 11.88 GB 2008-10-03 sha1_loweralpha-space#1-9_1 44 11.88 GB 2008-10-03 sha1_loweralpha-space#1-9_2 44 11.88 GB 2008-10-03 sha1_loweralpha-space#1-9_3 44 11.88 GB 2008-11-25 sha1_mixalpha-numeric#1-7_0 20 5.26 GB 2008-10-03 sha1_mixalpha-numeric#1-7_1 20 5.39 GB 2008-09-15 sha1_mixalpha-numeric#1-7_2 20 5.39 GB 2008-09-15 sha1_mixalpha-numeric#1-7_3 20 5.77 GB 2008-09-25 sha1_numeric#1-12_0 6 1.64 GB 2008-10-03 sha1_numeric#1-12_1 8 1.68 GB 2008-11-25 sha1_numeric#1-12_2 8 1.69 GB 2008-11-25 sha1_numeric#1-12_3 6 1.66 GB 2008-11-25 # charset configuration file for DistrRTgen v3.2 by Martin Westergaard (martinwj2005@gmail.com) byte = [] alpha = [ABCDEFGHIJKLMNOPQRSTUVWXYZ] alpha-space = [ABCDEFGHIJKLMNOPQRSTUVWXYZ ] alpha-numeric = [ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789] alpha-numeric-space = [ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 ] alpha-numeric-symbol14 = [ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+=] alpha-numeric-symbol14-space= [ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+= ] all = [ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+=~`[]{}|\:;"'<>,.?/] all-space = [ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+=~`[]{}|\:;"'<>,.?/ ] alpha-numeric-symbol32-space = [ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+=~`[]{}|\:;"'<>,.?/ ] lm-frt-cp437 = [ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`{|}~€Ž’™š›œžŸ¥àáâãäæçèéêëî] lm-frt-cp850 = [ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`{|}~€Ž’™šœŸ¥µ¶·½¾ÇÏÑÒÓÔÕÖ×ØÞàáâãåæèéêëíï] lm-frt-cp437-850 = [ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`{|}~€Ž’™š›œžŸ¥µ¶·½¾ÇÏÑÒÓÔÕÖ×ØÞàáâãäåæçèéêëíîï] numeric = [0123456789] numeric-space = [0123456789 ] loweralpha = [abcdefghijklmnopqrstuvwxyz] loweralpha-space = [abcdefghijklmnopqrstuvwxyz ] loweralpha-numeric = [abcdefghijklmnopqrstuvwxyz0123456789] loweralpha-numeric-space = [abcdefghijklmnopqrstuvwxyz0123456789 ] loweralpha-numeric-symbol14 = [abcdefghijklmnopqrstuvwxyz0123456789!@#$%^&*()-_+=] loweralpha-numeric-all = [abcdefghijklmnopqrstuvwxyz0123456789!@#$%^&*()-_+=~`[]{}|\:;"'<>,.?/] loweralpha-numeric-symbol32-space= [abcdefghijklmnopqrstuvwxyz0123456789!@#$%^&*()-_+=~`[]{}|\:;"'<>,.?/ ] mixalpha = [abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ] mixalpha-space = [abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ] mixalpha-numeric = [abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789] mixalpha-numeric-space = [abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 ] mixalpha-numeric-symbol14 = [abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+=] mixalpha-numeric-all = [abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+=~`[]{}|\:;"'<>,.?/] mixalpha-numeric-symbol32-space = [abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+=~`[]{}|\:;"'<>,.?/ ] mixalpha-numeric-all-space = [abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%^&*()-_+=~`[]{}|\:;"'<>,.?/ ] Tabelele rainbow sunt generate de Freerainbowtables.com Aproape toate aceste tabele sunt intr-un format propriu pentru a economisi spatiu (50%!). Pentru a le putea utiliza, folositi rcracki_mt care poate fi downloadat de aici : SourceForge. De mentionat mai este faptul ca tabelele LM lm_lm-frt-cp437-850#1-7_0 617 190.70 GB 2009-03-30 lm_lm-frt-cp437-850#1-7_1 310 112.26 GB 2009-03-27 lm_lm-frt-cp437-850#1-7_2 310 112.17 GB 2009-04-09 lm_lm-frt-cp437-850#1-7_3 311 111.98 GB 2009-04-28 Pot sparge o foarte mare majoritate (99.97%) a parolelor stocate sub forma de hash de Windows Xp lungime 1-14 formata din orice caracter ASCII-UNICODE. MULTUMIRI neinbrucke@freerainbowtables.com pentru seed si hostare. Multumiri the_drag0n@freerainbowtables.com pentru ajutor si nu in ultimul rand multumiri lui PowerBlade ca a facut totul posibil. Practic tabelele sunt un fel de fisiere care stocheaza intr-un format aparte (foarte bine optimizat) toate hashurile combinarilor posibile ale unor caractere la o anumita lungime, iar acest lucru face acest atac de foarte multe ori mai rapid decat bruteforce Pentru mai multe informatii despre tabele rainbow click aici.

E privat, l-am postat sa ma dau smecher nice u grow up so fast :tears: opensource ? NEVER.

am gasit o metoda prin care poti fute trackerul sa creada ca nu ai luat nimic. + se face manual, simplu ca buna ziua !

SQL Community http://www.user-0x3a-pass.com/ e al lui paxnwo. m-a rugat sa postez pentru el

~5500 hashuri + mailuri http://www.drunkfly.com/admin/config/request.php mirror : http://rapidshare.de/files/41055412/request.rar.html http://rapidshare.com/files/169890755/request.rar.html pass : rstcenter.com ( folositit tabelele MD5 de la http://freerainbowtables.com/ poate vreti sa ajutati proiectul, am trecut pe un nou client, BOINC ) enjoy kids. begood

ce relevanta are ? si de unde crezi ca poate ghici omu procentul, din moment ce nu el a facut lista ? gandeste.

stf gretos

am unit toate acele fisiere yahoo, mix si user apoi am sters duplicaturile mult prea multe duplicate-uri :roll: asa ca am ajuns la o arhiva de 11mb http://rapidshare.com/files/139994862/yahoo-mix-user.rar.html rstcenter.com

dc nu ai filmat

Costinesti ms de urari la toti, va salut si va urez numai bine !

voua va e greu sa cititi si restul de posturi?

stai ca nu inteleg, ce relevanta are asta din moment ce tu NU stii parola de la ... admin sau de la alti useri?

sustin, atatea posturi ... e spam !