Did You Know This About Facebook?
| Good [+1]Toggle ReplyLink» neoform replied on Sat Feb 14, 2009 @ 4:47am |
 Coolness: 340340 | Read this, then shut the hell up, since you are talking straight out of your ass about something you obviously don't understand.
[ en.wikipedia.org ] 
Since you think you can crack such a key, here's [ rave.ca ] public key: Size: 256 Bytes / 2048 Bits 3f 7f 55 b5 2b 92 3a a2 ce b3 cd fb f0 a2 33 00 16 c4 37 e4 2b fe ed c1 07 f2 b1 a5 64 05 c1 fc e5 2e 24 12 1b 96 73 97 8c 9f 88 0d 53 25 58 9d 28 88 f6 0d 62 85 56 51 00 24 9d 64 f0 6e e1 eb ce 88 55 cb ee 17 8a 82 ef a4 18 79 80 f3 82 dc 2c 87 ef e2 cf b1 f4 42 06 2c 1b 3f cb 15 f7 ba 6a e1 67 60 ef 36 94 ef 83 e8 9e 70 82 d1 4d 7b 62 5f c5 23 36 e1 3a 51 18 ba 11 27 fc fd 8e 1b 5f ac 90 f6 85 97 db e3 74 25 2e 53 f9 48 42 19 42 95 33 c0 dc 69 dc 05 58 21 cd ed a6 c7 af f8 29 c0 56 43 e2 d4 0d 09 f0 74 90 65 d8 78 34 19 1c 89 3a 9e a3 6a 4d 31 61 ae e9 2b 81 3b b4 6b 60 67 71 1f 17 89 d9 44 0e a0 9a cf fa c5 70 c4 31 6e d2 03 4c c3 e4 18 b7 9b a1 fa 31 c0 55 55 33 c8 0d 86 c2 07 71 cc 04 8b 48 a5 64 0e d7 d6 3e f4 ea 93 7a b0 a0 8a dd b5 39 e9 00 a1 56 1b Please use one of your fantastic tools to crack it, let's see if you can give me the private key.. I'll be extra generous and give you a month to do it in. If you can do it through brute force, I'll give you $1000. It would take technology that does not yet exist (post quantum computers to brute force this key), but you'll be able to do it on your PC, right? |
| I'm feeling pompous right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Sat Feb 14, 2009 @ 11:58am |
 Coolness: 132270 | wow , shut up hun ...
you talk to your girlfriend like that ? Update » cutterhead wrote on Sat Feb 14, 2009 @ 12:08pm buy the way jackass i said on a computer farm.
TAKE YOUR ASS OUT OF YUR HEAD, CLEAN UP YOUR RICH SHIT ATTITUDE, i have ppl that pay way more than your lousy 1k. are you poor ? |
| I'm feeling 4hz even if you dont right now.. | |
| Neutral [0]Toggle ReplyLink» neoform replied on Sat Feb 14, 2009 @ 12:05pm |
| Coolness: 340340 | A) You're not my girlfriend.
B) My girlfriend knows nothing about encryption. She doesn't pretend like she does and go about lecturing others about how weak it is. |
| I'm feeling pompous right now.. | |
| Good [+2]Toggle ReplyLink» Screwhead replied on Sat Feb 14, 2009 @ 12:08pm |
 Coolness: 686265 |  |
| I'm feeling your norks right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Sat Feb 14, 2009 @ 12:09pm |
| Coolness: 132270 | troll > buy the way jackass i said on a computer farm. Update » cutterhead wrote on Sat Feb 14, 2009 @ 12:11pm keep readin the headlines, your prooved my you cant read by not jumping on anylink provided. Update » cutterhead wrote on Sat Feb 14, 2009 @ 12:21pm im picturing you typing this , listening to liimpbizkat , thinking their saying "TROLLING TROLLING TROLLING"
get of your hight horse, learn to drop facts withou asking people to shutup and telling them their full of shit while your are at the same time. |
| I'm feeling 4hz even if you dont right now.. | |
| Neutral [0]Toggle ReplyLink» neoform replied on Sat Feb 14, 2009 @ 12:18pm |
| Coolness: 340340 | Originally Posted By CUTTERHEAD
troll > buy the way jackass i said on a computer farm. A computer farm? Ok. Let me REquote what I quoted before. "The amount of time required to break a 128-bit key is also daunting. Each of the 2^128 (340,282,366,920,938,463,463,374,607,431,768,211,456) possibilities must be checked. A device that could check a billion billion keys (10^18) per second would still require about 10^13 years to exhaust the key space. This is a thousand times longer than the age of the universe, which is about 13,000,000,000 (1.3*10^10) years." But we're not talking about AES-128, we're talking about AES-256 which is a fuckload bigger. But yeah, you're of the delusion that this is possible.. on 'a computer farm'. Yup. Fred, that only works if you have access to the person and you plan on clobbering them. That's usually illegal and the people who would want to be snooping on you are unlikely to be taking that route, since it's probably the government or hackers, but hackers don't do that stuff either. |
| I'm feeling pompous right now.. | |
| Good [+2]Toggle ReplyLink» Screwhead replied on Sat Feb 14, 2009 @ 12:26pm |
| Coolness: 686265 | Originally Posted By THREAD
Fred, that only works if you have access to the person and you plan on clobbering them. That's usually illegal and the people who would want to be snooping on you are unlikely to be taking that route, since it's probably the government or hackers, but hackers don't do that stuff either. Oh, yeah, because governments NEVER do anything illegal like kidnapping, torture, holding people without charging them...Gitmo never existed! |
| I'm feeling your norks right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Sat Feb 14, 2009 @ 12:27pm |
| Coolness: 132270 | you should stop thinking your chief security in cheif and know what going everywhere.
annyways i hate your style , enjoy talking loudly silencing people overthat fact. when youll start puting your emotion out of your work and actually start reading and challenging your make beleif security , youll understand why people still work in that field. >>But we're not talking about AES-128, we're talking about AES-256 which is a fuckload bigger. But yeah, you're of the delusion that this is possible.. on 'a computer farm'. Yup. whatever Update » cutterhead wrote on Sat Feb 14, 2009 @ 11:05pm >>> IT WASNT IRRELAVENT LINKS < I SAID I PRINTED TOO MUCH VERBATIMS BUT YOU NEVR LOOKED AT THE LINK YOU CONSTIPATED MONKEY |
| I'm feeling 4hz even if you dont right now.. | |
| Neutral [0]Toggle ReplyLink» neoform replied on Sat Feb 14, 2009 @ 1:17pm |
| Coolness: 340340 | Originally Posted By SCREWHEAD
Oh, yeah, because governments NEVER do anything illegal like kidnapping, torture, holding people without charging them...Gitmo never existed! YOU'RE A TERRIST! Update » neoform wrote on Sat Feb 14, 2009 @ 1:31pm Talking loudly? Dude, I backed up everything I said with facts. You backed up what you said by linking to irrelevant pages. Deal with it. |
| I'm feeling pompous right now.. | |
| Good [+2]Toggle ReplyLink» DynV replied on Sat Feb 14, 2009 @ 6:13pm |
 Coolness: 109480 | I'm no super geek like you two but I've looked a few articles about encryption and found some cracking devices multiplying considerably the "force" like this one [ www.cl.cam.ac.uk ] multiplying its force by 8760 (24*365) Those are public findings, I'm sure there's much more efficient models hidden for commercial (monetary) or security concerns. It's crazy what they can do with mathematics.
Or this with a few GPUs: [ www.elcomsoft.com ] |
| I'm feeling lucky that my countr right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Sat Feb 14, 2009 @ 10:53pm |
| Coolness: 132270 | Originally Posted By DYNV
I'm no super geek like you two but I've looked a few articles about encryption and found some cracking devices multiplying considerably the "force" like this one [ www.cl.cam.ac.uk ] multiplying its force by 8760 (24*365) Those are public findings, I'm sure there's much more efficient models hidden for commercial (monetary) or security concerns. It's crazy what they can do with mathematics. Or this with a few GPUs: [ www.elcomsoft.com ] i belive that custom coding a multiple FPGA (as processor) board , again custom builded in VHDL language would smash any numbers . and you better code assembly and have special macros again its a known fact that crypography(s) must be decypherable by mil / gov / intelligence agency. |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» neoform replied on Sat Feb 14, 2009 @ 11:40pm |
| Coolness: 340340 | Originally Posted By CUTTERHEAD
its a known fact that crypography(s) must be decypherable by mil / gov / intelligence agency. Where do you get your information from? Wanna give me a citation on that false fact? |
| I'm feeling pompous right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Sat Feb 14, 2009 @ 11:58pm |
| Coolness: 132270 | according to a state law that i wont loose my time browsing FOR you ,
require that all cryptography on homeland must be decypherable my autorities, this is why you have project like openbsd that host their cryto engine on canadian land and not the states , on top you cant rexport cryto archive out of united state if it entered their border. federal law you dont know much about pipelining on superscale right ? you understand that the numbers your giving are average computer load based on the x86 architecture ? you understand what superscalar mean right ? - then have you read about the development of super cluster / main frame parallel processor ( like blue gene ??? ) plus im sorry you have missed the whole DOD litterature that was made public, especially about seised cryptography and how to deal with content. Update » cutterhead wrote on Sun Feb 15, 2009 @ 12:01am wont find it but was one to a 3DES smash ,
your scared about a less than 20 xor round ... pathetic , people have gone deeper reverse engineering drivers and programs... Update » cutterhead wrote on Sun Feb 15, 2009 @ 12:17am here small example of a small scale and right there impressionning numbers , now use a FPGA that you can code yourself with VHDL and make yourself a custom machine for the job, somehing big like a refrigerator could probably do it in 3 days.
wow even with the vhdl reference you still dont get that simply using large numbers isnt a secure solution. while new technology are developped everyday reread my post you missed something important . Update » cutterhead wrote on Sun Feb 15, 2009 @ 12:24am i have p4 devel board that are big like a old recorder tape. now a massive array of thes wouldn be that expensive and again would smash your number for discarding useless info like what type of sound card is in your computer... the space would be used right there on a 1 for 1 comparison be a oubvious that comparing normal computer would grow to be big like the moon. but with micro kit / devel boards that would get to an acceptable size Update » cutterhead wrote on Sun Feb 15, 2009 @ 12:25am if you get multi-FPGA , youll start dealing as a contractant with the military imo |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» neoform replied on Sun Feb 15, 2009 @ 12:49am |
| Coolness: 340340 | So this is when you tell me that AES has a secret backdoor that only the government has.
Bullshit. If the government had such a backdoor, you can guaranty that it would be stolen and end up getting released publicly, but since that doesn't exist, it hasn't and wont happen. The NSA themselves use AES for encrypting their own secret documents. |
| I'm feeling pompous right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Sun Feb 15, 2009 @ 12:59am |
| Coolness: 132270 | i never said a back door ? man what the fuck , you speak french of somehting ?
you just made multiple insult to multiple engineers & writer that are currently developping cheers , read about it in 2013 Update » cutterhead wrote on Sun Feb 15, 2009 @ 1:06am your scared about this :
[ upload.wikimedia.org ] [ upload.wikimedia.org ] [ upload.wikimedia.org ] [ upload.wikimedia.org ] read more into vhdl and youll get how to code all possible path. |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» neoform replied on Sun Feb 15, 2009 @ 1:15am |
| Coolness: 340340 | You must be on drugs. You constantly show me completely irrelevant links and cite them as evidence or something. |
| I'm feeling pompous right now.. | |
| Good [+1]Toggle ReplyLink» DynV replied on Sun Feb 15, 2009 @ 1:31am |
| Coolness: 109480 | SVG ! *happy* |
| I'm feeling lucky that my countr right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Sun Feb 15, 2009 @ 2:14am |
| Coolness: 132270 | RainbowCrack tutorial
by Zhu Shuanglei <shuanglei@hotmail.com> [ www.antsight.com ] RainbowCrack is a general propose implementation of Philippe Oechslin's faster time-memory trade-off technique. In this tutorial, we will guide you through the steps to build a instant windows password cracker. You can always take Philippe Oechslin's paper as a good reference if you want some in depth understanding of the theory. 1. Some basis of Time-Memory Trade-Off There are two typical attacks in cryptanalysis of block ciphers: brute force and table precomputation. In brute force, an attacker tries all possible keys to encrypt a known plaintext for which he has the corresponding ciphertext. The idea of table precomputation is to precompute and store encryptions of a chosen plaintext and corresponding keys for all possible keys. RainbowCrack use the second method. It precompute and store all possible plaintext - hash pairs in files so called "rainbow table". Any time the plaintext of a hash is required, you just look up the precomputed tables and find the plaintext in seconds. 2. Select the configuration First of all, we will select the configuration of the attack. There ars so many parameters to be adjusted in the theory: the success rate you want, the charset to use, the hard disk space you can afford and so on. If you know the theory well, you can work on you own. If not, we have prepared some typical parameter configurations for you. They are optimized to the best of my knowledge. NOTE: All the configurations below are ready for a 666MHz CPU. If your CPU is faster, the performance will be better. configuration #0 hash algorithm lm charset alpha (ABCDEFGHIJKLMNOPQRSTUVWXYZ) plaintext length range 1 - 7 key space 26^1 + 26^2 + 26^3 + 26^4 + 26^5 + 26^6 + 26^7 = 8353082582 t 2100 m 8000000 l 5 disk usage m * 16 * l = 640000000 B = 610 MB success rate 0.9990 mean cryptanalysis time 3.7841 s mean cryptanalysis time on a low memory system (free memory size much smaller than 122MB) 8.2836 s max cryptanalysis time 31.1441 s table precomputation commands rtgen lm alpha 1 7 0 2100 8000000 all rtgen lm alpha 1 7 1 2100 8000000 all rtgen lm alpha 1 7 2 2100 8000000 all rtgen lm alpha 1 7 3 2100 8000000 all rtgen lm alpha 1 7 4 2100 8000000 all table precomputation time 2 days 18 hours Some explanations: hash algorithm we will generate rainbow tables for lanmanager hash(lm), other hash algorithms(md5, sha1 ...) are also possible charset we use alpha characters as the plaintext charset plaintext length range length range of the plaintext for example: if you use charset alpha and plaintext length range "4-6", "AAAA" and "ZZZZZZ" are among the key space; "AAA" is not because it has a length 3 key space There are 8353082582 different alpha only plaintexts. t rainbow chain length, see the paper for detail m rainbow chain count of each rainbow table, see the paper for detail l rainbow table count, see the paper for detail disk usage disk space required to store all generated rainbow tables each rainbow chain will take 16 bytes (8 bytes for a start point and 8 bytes for a end point) success rate When the rainbow tables have been generated, you will have the probability 99.9% to crack an alpha only password. Due to the nature of the theory, this is not a granted attack. mean cryptanalysis time You need 3.7841 seconds to crack an alpha password on average. It does not take into account the time spent on "false alarm". See the paper to find out what is a "false alarm". mean cryptanalysis time on a low memory system If you don't have enough free physical memory to hold one rainbow table a time, the program (rcrack.exe) will have to load the table chunk by chunk and search the table chunk by chunk. Losing the change of finding the password in early time. It does not take into account the time spent on "false alarm". max cryptanalysis time If the password you are searching is not covered by the rainbow tables. You will have to search all tables only to find nothing. It does not take into account the time spent on "false alarm". table precomputation commands Use the utility "rtgen.exe" in the distribution and these commands to generate the rainbow tables which are required to launch the attack. (see next section of the tutorial for more) table precomputation time Table precomputation is time expensive. This is the meaning of "Time-Memory Trade-Off". configuration #1 hash algorithm lm charset alpha-numeric(ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789) plaintext length range 1 - 7 key space 36^1 + 36^2 + 36^3 + 36^4 + 36^5 + 36^6 + 36^7 = 80603140212 t 2400 m 40000000 l 5 disk usage m * 16 * l = 3200000000 B = 3 GB success rate 0.9904 mean cryptanalysis time 7.6276 s mean cryptanalysis time on a low memory system (free memory size much smaller than 610MB) 13.3075 s max cryptanalysis time 40.6780 s table precomputation commands rtgen lm alpha-numeric 1 7 0 2400 40000000 all rtgen lm alpha-numeric 1 7 1 2400 40000000 all rtgen lm alpha-numeric 1 7 2 2400 40000000 all rtgen lm alpha-numeric 1 7 3 2400 40000000 all rtgen lm alpha-numeric 1 7 4 2400 40000000 all table precomputation time 15 days 17 hours Some explanations: With this configuration, you can crack an alpha-numeric password in 13.3075 seconds on a 256MB memory system with 99.04% success rate. In this tutorial we use "configuration#0". If you want the second configuration, everything is similar. 3. Precompute the rainbow tables with rtgen.exe Now the time to generate the rainbow tables. There is an utility called "rtgen.exe" (rainbow table generator) in the distribution. Now open a command prompt, switch to the directory where the rainbowcrack files are extracted, make sure there is 128 MB free disk space in place and execute the command: rtgen lm alpha 1 7 0 2100 8000000 all This will begin the generation of first rainbow table. It takes 13.2 hours to complete on a 666 MHz CPU. If you want to generate a rainbow table for md5/sha1 algorithm(used to crack md5/sha1 hashes), you can use the command like this "rtgen md5 alpha 1 7 0 2100 8000000 all" or "rtgen sha1 alpha 1 7 0 2100 8000000 all". Here "alpha" is upper case alpha, you can generate a lower case alpha table like this "rtgen md5 loweralpha 1 7 0 2100 8000000 all". Leave you computer working ... You can pause the precomputation any time by pressing Ctrl+C. Next time you run rtgen.exe with the same parameters the program will pick up where the precomputation left off and continue the generation of the rainbow table. When the generation of first rainbow table is finished. There will be a file named "lm_alpha#1-7_0_2100x8000000_all.rt" (128000000 bytes) in the directory. Don't rename the file because we store some parameters in the file title. Now the time to generate the remaining rainbow tables, make sure you have enough free disk space (128000000 bytes for each table): rtgen lm alpha 1 7 1 2100 8000000 all rtgen lm alpha 1 7 2 2100 8000000 all rtgen lm alpha 1 7 3 2100 8000000 all rtgen lm alpha 1 7 4 2100 8000000 all Replace "lm" with "md5" or "sha1" if you want. Leave you computer working ... ...... ...... When the precomputation is complete, make sure the following files are in place: 128,000,000 bytes lm_alpha#1-7_0_2100x8000000_all.rt 128,000,000 bytes lm_alpha#1-7_1_2100x8000000_all.rt 128,000,000 bytes lm_alpha#1-7_2_2100x8000000_all.rt 128,000,000 bytes lm_alpha#1-7_3_2100x8000000_all.rt 128,000,000 bytes lm_alpha#1-7_4_2100x8000000_all.rt If everything goes well, backup all files (recommended) and proceed to the next section of the tutorial. 4. Sort rainbow tables with rtsort.exe To speed up the search of rainbow table, we should sort the rainbow table with "rtsort.exe" in advance. In fact "rcrack.exe" only accept sorted rainbow tables. Use these commands: rtsort lm_alpha#1-7_0_2100x8000000_all.rt rtsort lm_alpha#1-7_1_2100x8000000_all.rt rtsort lm_alpha#1-7_2_2100x8000000_all.rt rtsort lm_alpha#1-7_3_2100x8000000_all.rt rtsort lm_alpha#1-7_4_2100x8000000_all.rt Each command will take several minutes to complete. The "rtsort.exe" utility will sort the file and write back to the original file. Notice: If free memory size is smaller than the file size, we can't load the file into memory at a time. In which case extra free disk space as large as the file to be sorted is required to apply an external sort. If everything goes well, proceed to the next section. 5. Crack the hash with rcrack.exe and the sorted rainbow tables Finally you have everything ready. Now the time to play with "rcrack.exe". Notice the file "random_lm_alpha#1-7.hash" in the distribution. It contain 10 randomly generated lanmanager hashes(charset alpha, length 1-7). We will use this file as a test vector. Launch the program by issuing the command: rcrack c:\rainbowcrack\*.rt -l random_lm_alpha#1-7.hash You should replace "c:\rainbowcrack\" with where you place the sorted rainbow tables. It seems that you will find the plaintext of all 10 lanmanager hashes. Now open the file "random_lm_alpha#1-7.plain" and validate the result of rcrack.exe. If they match, that is ok. To crack some windows password, the syntax is similar: pwdump2 > pwfile.txt rcrack c:\rainbowcrack\*.rt -f pwfile.txt The pwdump2 utility is used to dump the lanmanager hashes of windows system. If your password consists of letters only, rcrack will be able to crack it with the success rate 99.9%. Have fun! Create date: 2003/9/9 Revised: 2003/11/21 ^^ this was tought impossible not long ago, im saying your aes document structural firework style imploding exploding isnt fool proof especialy if you check for a valid md5 or whatever hash structure |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» Deadfunk replied on Sun Feb 15, 2009 @ 2:34am |
 Coolness: 153680 | seriously this is so funny!!!!!!! |
| I'm feeling hardcore right now.. | |
| Good [+1]Toggle ReplyLink» Blisss replied on Sun Feb 15, 2009 @ 4:40am |
 Coolness: 130395 | Its like a battle of the minds of something |
| I'm feeling like the good guy right now.. | |
Did You Know This About Facebook?
[ Top Of Page ] |
Post A Reply |
You must be logged in to post a reply.
[ Top Of Page ] |
