Encryption Challenge
| Good [+1]Toggle ReplyLink» neoform replied on Mon Feb 16, 2009 @ 1:31am |
 Coolness: 339705 | I've created a 1000KB encrypted archive with a file in it.
If you can crack the archive and post the file, I'll give you $1000. I used AES-256 to encrypt it and Whirlpool as the hash algorithm. [ city17.ca ] yes, I encrypted it with TrueCrypt. I just gave you an assload of info. Now, try and break it. I'm sure cutterhead will have no trouble at all cracking this, and quickly. |
| I'm feeling pompous right now.. | |
| Good [+1]Toggle ReplyLink» Nuclear replied on Mon Feb 16, 2009 @ 1:41am |
 Coolness: 2604025 | TrueCrypt is my friend... |
| I'm feeling nuclear right now.. | |
| Good [+1]Toggle ReplyLink» sakado replied on Mon Feb 16, 2009 @ 1:41am |
 Coolness: 60125 | jpeut tu te scanner desfois que se serait plus simple daller cherché loriginal den ton pc? :P |
| I'm feeling relax right now.. | |
| Good [+1]Toggle ReplyLink» neoform replied on Mon Feb 16, 2009 @ 1:47am |
| Coolness: 339705 | Originally Posted By SAKADO
jpeut tu te scanner desfois que se serait plus simple daller cherché loriginal den ton pc? :P You'd have to know where I live. But yeah, that would be simpler than trying to crack AES-256 (but that's the point. Cuttertard thinks you can brute force AES-256) |
| I'm feeling pompous right now.. | |
| Good [+1]Toggle ReplyLink» sakado replied on Mon Feb 16, 2009 @ 1:48am |
| Coolness: 60125 | » thread a répondu le Lun 16 Fév, 2009 @ 1:47am de --------------216.252.73.6------------------
Certains groupes ont affirmé avoir cassé l'AES complet mais après vérification par la communauté scientifique, il s'avérait que toutes ces méthodes étaient erronées. Cependant, plusieurs chercheurs ont mis en évidence des possibilités d'attaques algébriques, notamment l'attaque XL et une version améliorée, la XSL. Ces attaques ont été le sujet de nombreuses controverses et leur efficacité n'a pas encore été pleinement démontrée, le XSL fait appel à une analyse heuristique dont la réussite n'est pas systématique. De plus, elles sont impraticables car le XSL demande au moins 287 opérations voire 2100 dans certains cas. Le principe est d'établir les équations (quadratiques / booléennes) qui lient les entrées aux sorties et de résoudre ce système qui ne comporte pas moins de 8.000 inconnues et 1.600 équations pour 128 bits. La solution de ce système reste pour l'instant impossible à déterminer. En l'absence d'une preuve formelle sur l'efficacité d'attaques similaires au XSL, l'AES est donc considéré comme sûr. On peut toutefois parier que dans les années à venir, les avancées en cryptanalyse et la relative simplicité de la structure d'AES devraient ouvrir des brèches dans l'algorithme. Si pareille découverte venait à se produire, des méthodes similaires à AES comme Camellia pourraient rapidement devenir obsolètes. Update » sakado wrote on Mon Feb 16, 2009 @ 1:51am even if i dont know where you live can i scan you? :P --------------216.252.73.6------------------ |
| I'm feeling relax right now.. | |
| Good [+1]Toggle ReplyLink» Nathan replied on Mon Feb 16, 2009 @ 1:48am |
 Coolness: 166585 | alright, i'm on it, just give me 20 minutes, a guitar tuner, and a short length of rope... |
| I'm feeling you up right now.. | |
| Good [+1]Toggle ReplyLink» sakado replied on Mon Feb 16, 2009 @ 1:52am |
| Coolness: 60125 | ques quon ferait po pour 1000$ :P lol Update » sakado wrote on Mon Feb 16, 2009 @ 2:09am Side-channel attacks
Side-channel attacks do not attack the underlying cipher and so have nothing to do with its security as described here, but attack implementations of the cipher on systems which inadvertently leak data. There are several such known attacks on certain implementations of AES. In April 2005, D.J. Bernstein announced a cache-timing attack that he used to break a custom server that used OpenSSL's AES encryption.[13] The custom server was designed to give out as much timing information as possible (the server reports back the number of machine cycles taken by the encryption operation), and the attack required over 200 million chosen plaintexts. Some say the attack is not practical over the internet with a distance of one or more hops;[14] Bruce Schneier called the research a "nice timing attack."[15] In October 2005, Dag Arne Osvik, Adi Shamir and Eran Tromer presented a paper demonstrating several cache-timing attacks against AES.[16] One attack was able to obtain an entire AES key after only 800 operations triggering encryptions, in a total of 65 milliseconds. This attack requires the attacker to be able to run programs on the same system that is performing AES. Tadayoshi Kohno wrote a paper entitled "Attacking and Repairing the WinZip Encryption Scheme"[17] showing possible attacks against the WinZip implementation (the zip archive's metadata isn't encrypted). |
| I'm feeling relax right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Mon Feb 16, 2009 @ 1:21pm |
 Coolness: 131635 | 1000 is not enough. i mean come on how cheap are you. just leaking a found falid key get you 10k minimum just for sharing the info about getting to that point , and industry canada would lend me a complementary 80- k for the reasearch.
their are current work about defeating tru crypt. abouviously you never read the phrack article i posted about VHLD used to make encrytpion hacking machine. Update » cutterhead wrote on Mon Feb 16, 2009 @ 1:31pm especially like freezing down the memory with a can of freeze and retreiving the key / salt whatever out of memory, so give it time a remote exploit will be found. your like that openbsd crew " not a remote security hole for 10 years " or whatever , when they was about 20+ discovered.
whatever keep beleiving in jesus. Update » cutterhead wrote on Mon Feb 16, 2009 @ 1:43pm Ethereal – Use encryption, so that anything sniffed would be difficult or nearly impossible to break. WPA2, which uses AES, is essentially unrealistic to break by a normal hacker.
why this terminason then ? WHY DID THEY SAY TO A "NORMAL" HACKER AND JUST PLAIN IMPOSSIBLE, ANWSWER BECAUSE IN WITH COMPUTERS THERE IS NO SUCH THING AS COMPLETE SECURITY : ITS PHYSICALLY SOMEWHERE < NOT MAGIC THERE BTW. ALL ARE NUMBERS AND JUST LIKE ATOMS CAN BE SMASHED BEYON THE LIMIT OF YOUR IMAGINATION. but since you lack so much i digress. |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» neoform replied on Mon Feb 16, 2009 @ 1:44pm |
| Coolness: 339705 | lol, you just admitted that you can't crack AES-256.
You're talking about hacking a machine in order to extract the password. This is not cracking, that's hacking. Next you're going to tell me that it would could as breaking the encryption if you kidnapped me and beat me til I gave you the password. You lose. |
| I'm feeling pompous right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Mon Feb 16, 2009 @ 1:48pm |
| Coolness: 131635 | do you know why thwey removed the use of regexp from use in AWK ?
because a lexical analyser an be used to rebuild a broken archive , in a same way a RAID interface will rebuil an array or disk. Update » cutterhead wrote on Mon Feb 16, 2009 @ 1:49pm your one harrassing motherfucker , your terminology : MORON and LOSEr is all you say .
your a shit record dumbass. closed mind as well , die , you lost your life Update » cutterhead wrote on Mon Feb 16, 2009 @ 1:57pm and im right :
Other more elegant attempts involve algorithms termed quadratic sieves, a method of factoring integers, developed by Carl Pomerance, that is used to attack smaller numbers, and field sieves, algorithms that are used in attempts to determine larger integers. Advances in number theory allowed factoring of large numbers to move from procedures that, by manual manipulation, could take billions of years, to procedures that—with the use of advanced computing—can be accomplished in weeks or months. Further advances in number theory may lead to the discovery of a polynomial time factoring algorithm that can accomplish in hours what now takes months or years of computer time. Update » cutterhead wrote on Mon Feb 16, 2009 @ 1:59pm Advances in factoring techniques and the expanding availability of computing hardware (both in terms of speed and low cost) make the security of the algorithms underlying cryptologic systems increasingly vulnerable.
These threats to the security of cryptologic systems are, in some regard, offset by continuing advances in design of powerful computers that have the ability to generate larger keys by multiplying very large primes. Despite the advances in number theory, it remains easier to generate larger composite numbers than it is to factor those numbers. Other improvements related to applications of number theory involve the development of "nonreputable" transactions. Non-reputable means that parties cannot later deny involvement in authorizing certain transactions (e.g., entering into a contract or agreement). Many cryptologists and communication specialists assert that a global electronic economy is dependent on the development of verifiable and nonreputable transactions that carry the legal weight of paper contracts. Legal courts around the world are increasingly being faced with cases based on disputes regarding electronic communications. |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» neoform replied on Mon Feb 16, 2009 @ 3:50pm |
| Coolness: 339705 | So, you're saying that you can't crack the file? I win. You lose. |
| I'm feeling pompous right now.. | |
| Good [+1]Toggle ReplyLink» Luna-1 replied on Mon Feb 16, 2009 @ 3:52pm |
 Coolness: 118540 | ian wins ! |
| I'm feeling atr ! right now.. | |
| Good [+1]Toggle ReplyLink» cutterhead replied on Mon Feb 16, 2009 @ 5:16pm |
| Coolness: 131635 | no im saying your the biggest bag of shit online , and your security skills are absent :
[ accessdata.com ] Portable Office Rainbow Tables Rainbow Tables are pre-computed, brute-force attacks. In cryptography, a brute-force attack is an attempt to recover a cryptographic key or password by trying every possible combination until the correct one is found. How quickly this can be done depends on the size of the key, and the computing resources applied. A system set at 40-bit encryption has one trillion keys available. A brute-force attack of 500,000 keys per second would take approximately 25 days to exhaust the key space combinations using a single 3 Ghz Pentium 4 computer. With a Rainbow Table, you can decrypt 40-bit encrypted files in seconds or minutes rather than days or weeks. DNA and PRTK seamlessly integrate with Rainbow Tables. now this is a portable one using a small distributed load, serious uses, not like you thread, will understand the workaround. Product Features * 40-bit encrypted files decrypted in 5 minutes on average * One table available: MS Word & Excel * Completely portable, fits on your laptop * 98.6% accuracy MS Office so your can crank it up for how long you want, you havent created a security measure that need more than the size of the earth in ressource. you loose, and stop harrasing me about asking help for your puny security features your trying to emplement and that you cant master. Update » cutterhead wrote on Mon Feb 16, 2009 @ 5:20pm and stop inventing part of conversation i never said, instead read what i post instead of improvising to stand out of your pathetic life . |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» sakado replied on Mon Feb 16, 2009 @ 5:21pm |
| Coolness: 60125 | ya tjr moyen..... lerreure est humaine den ma tete c po de decripter qqchose qui est important c de savoir squi y est cripter |
| I'm feeling relax right now.. | |
| Good [+1]Toggle ReplyLink» Lone_Star replied on Mon Feb 16, 2009 @ 5:23pm |
 Coolness: 153095 | 
yup. |
| Good [+1]Toggle ReplyLink» cutterhead replied on Mon Feb 16, 2009 @ 5:23pm |
| Coolness: 131635 | encryption = integrite des donnees
si les donnees prenent une valeur integre lorsque tous sum = true oui ya possibilite dun backtrack if faut juste avoir les tables rainbow. |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» Lone_Star replied on Mon Feb 16, 2009 @ 5:25pm |
| Coolness: 153095 | it all makes sense now |
| Good [+1]Toggle ReplyLink» cutterhead replied on Mon Feb 16, 2009 @ 5:25pm |
| Coolness: 131635 | encryption = integrite des donnees
si les donnees prenent une valeur integre lorsque tous sum = true oui ya possibilite dun backtrack if faut juste avoir les tables rainbow. et je pense meme que des tables "explosives" serait mieux, moin de place sur disque, seulement les calcules des calcules des tables. |
| I'm feeling 4hz even if you dont right now.. | |
| Good [+1]Toggle ReplyLink» Lone_Star replied on Mon Feb 16, 2009 @ 5:27pm |
| Coolness: 153095 | bennnn ouiiiii sti pourquoi jai pas pensé à ça! |
| Good [+1]Toggle ReplyLink» cutterhead replied on Mon Feb 16, 2009 @ 5:38pm |
| Coolness: 131635 | and for an odd reason , jesse wants the 1k$ |
| I'm feeling 4hz even if you dont right now.. | |
Encryption Challenge
[ Top Of Page ] |
Post A Reply |
You must be logged in to post a reply.
[ Top Of Page ] |
