Slashdot Mirror


MIT Research: Encryption Less Secure Than We Thought

A group of researchers from MIT and the University of Ireland has presented a paper (PDF) showing that one of the most important assumptions behind cryptographic security is wrong. As a result, certain encryption-breaking methods will work better than previously thought. "The problem, Médard explains, is that information-theoretic analyses of secure systems have generally used the wrong notion of entropy. They relied on so-called Shannon entropy, named after the founder of information theory, Claude Shannon, who taught at MIT from 1956 to 1978. Shannon entropy is based on the average probability that a given string of bits will occur in a particular type of digital file. In a general-purpose communications system, that’s the right type of entropy to use, because the characteristics of the data traffic will quickly converge to the statistical averages. ... But in cryptography, the real concern isn't with the average case but with the worst case. A codebreaker needs only one reliable correlation between the encrypted and unencrypted versions of a file in order to begin to deduce further correlations. ... In the years since Shannon’s paper, information theorists have developed other notions of entropy, some of which give greater weight to improbable outcomes. Those, it turns out, offer a more accurate picture of the problem of codebreaking. When Médard, Duffy and their students used these alternate measures of entropy, they found that slight deviations from perfect uniformity in source files, which seemed trivial in the light of Shannon entropy, suddenly loomed much larger. The upshot is that a computer turned loose to simply guess correlations between the encrypted and unencrypted versions of a file would make headway much faster than previously expected. 'It’s still exponentially hard, but it’s exponentially easier than we thought,' Duffy says."

157 comments

  1. What does this have to do with Computors? by For+a+Free+Internet · · Score: 5, Funny

    I thought this was News for Nerds, but instead we are reading about Math, which is some kind of religion, and I am an Atheist.

    --
    UNITE with the Campaign for a Free Internet because today, our future begins with tomorrow!
    1. Re:What does this have to do with Computors? by Anonymous Coward · · Score: 0

      I know this is modded into oblivion, but it made me laugh. Lighten up people!

    2. Re:What does this have to do with Computors? by Anonymous Coward · · Score: 0

      Yeah, kind of funny, the guy says is an atheist but he believes in a "Free Internet" which is almost like believing in a religion nowadays.

    3. Re:What does this have to do with Computors? by Anonymous Coward · · Score: 0

      Read some of his other posts. I like the communist screeds, but they're a little Trotskyist to be too credible today. I don't know if the guy is completely nuts or not, but he has a wonderful troll-y shtick going on. Or maybe I have twisted standards when it comes to appreciating /. comments...

    4. Re:What does this have to do with Computors? by Anonymous Coward · · Score: 0

      "The Internet is free" is a religion. "The Internet should be free" is a statement of value. "Jebus got better after his government executed him" is crazy talk. "I wish Jebus had gotten better after his government executed him" is just fine.

    5. Re:What does this have to do with Computors? by steelfood · · Score: 1

      Math is the One True System. Or for logicians, the one True system.

      --
      "If a nation expects to be ignorant and free in a state of civilization, it expects what never was and never will be."
  2. good news for NSA by minstrelmike · · Score: 5, Interesting

    According to the Wired article on the huge Utah data center, its purpose is to store encrypted messages from foreign embassies and eventually, some time in the future, decrypt them and gain insight into how the 'enemy' (any foreigner) thinks. That time is now exponentially closer.

    1. Re:good news for NSA by DigitAl56K · · Score: 4, Insightful

      I severely doubt this is news to the NSA.

    2. Re:good news for NSA by intermodal · · Score: 1

      This is hardly news at Fort Meade. If we're hearing about it now, the NSA probably has had the same knowledge for years.

      --
      In SOVIET RUSSIA... erm...NSA AMERICA, the Internet logs onto YOU!
    3. Re:good news for NSA by Bob+the+Super+Hamste · · Score: 3, Informative
      But at the same time

      It’s still exponentially hard

      .

      --
      Time to offend someone
    4. Re:good news for NSA by Anonymous Coward · · Score: 2, Insightful

      Bad news for the NSA. Known insecurity can be fixed either through patch or brute force (bigger key). The NSA, I'm sure, prefers secret insecurity.

    5. Re:good news for NSA by Anonymous Coward · · Score: 5, Interesting

      Maybe, maybe not. Consensus has shifted, and many researchers no longer believe that the NSA has the best and the brightest, or that they possess much fundamental cryptographic insight not already available to civilian researchers.

      When the NSA tried to sneak a back door into an optional random number generator specified in a recent NIST specification, they were almost immediately caught by academics. http://en.wikipedia.org/wiki/Dual_EC_DRBG

      On the other hand, operationally they're clearly second to none. Security engineering and penetration involve much more than basic mathematical insight.

    6. Re:good news for NSA by MarkvW · · Score: 3, Insightful

      And, if you let them, the NSA will be owning exponentially expensive taxpayer-funded stuff that is then used to spy on taxpayers.

    7. Re:good news for NSA by Anonymous Coward · · Score: 1

      On the other hand, operationally they're clearly second to none. Security engineering and penetration involve much more than basic mathematical insight.

      Edward Snowden proved the first point wrong and the second point right.

    8. Re:good news for NSA by freeze128 · · Score: 4, Funny

      Good! If it gets exponentially closer, that means it will never arrive!

    9. Re:good news for NSA by minstrelmike · · Score: 5, Funny

      When the NSA tried to sneak a back door into an optional random number generator specified in a recent NIST specification, they were almost immediately caught by academics. http://en.wikipedia.org/wiki/Dual_EC_DRBG

      They probably should have taken lessons from Xerox if they wanted to embed random numbers in documents.

    10. Re:good news for NSA by nospam007 · · Score: 2

      This works only if the content is only encrypted _once_.
      If you encrypt it twice, there will be no correlation, no recognizable content.

    11. Re:good news for NSA by Anonymous Coward · · Score: 0

      One more reason to like the forward thinking of truecrypt allowing you to use different ciphers at the same time.

    12. Re: good news for NSA by jd2112 · · Score: 1

      That is why I always double encrypt everything in ROT-13.

      --
      Any insufficiently advanced magic is indistinguishable from technology.
    13. Re:good news for NSA by camperdave · · Score: 2

      Um... Zeno died of an arrow wound trying to prove that.

      --
      When our name is on the back of your car, we're behind you all the way!
    14. Re:good news for NSA by BronsCon · · Score: 2, Interesting

      Shit I'm not even a crypto expert and it wasn't news to me. If you know what part of a stream of data is supposed to look like and you know where in the stream that part of the data should be, you can attack that part of the stream to determine at least a portion of the decryption key. From there, you try the partial key at set intervals within the datastream and look for anything else familiar, such as file headers or plain ol' empty space, additional patches of data you can fill in from things you already know. Lather, rinse, repeat, until you have the whole key.

      --
      APK quotes people (including myself) without context and should not be trusted. Just thought you should know.
    15. Re:good news for NSA by Shaiku · · Score: 5, Informative

      I read the article. The impression I got was that it will still take the same time today that it would have taken yesterday to break encryption, but it turns out that the metric used to demonstrate an algorithm's effectiveness at hiding information was inadequate for electronic communication. In a nutshell, the latest math explains that most encryption systems are vulnerable to side-channel attacks, even if you might not have realized it. But side-channel attacks have been employed for a long time, so those who do security already knew this anecdotally.

    16. Re:good news for NSA by doublebackslash · · Score: 5, Insightful

      I'll undo my moderation in this thread just to tell you that you are wrong. One cannot determine the key from the ciphertext. If they can this is known as a "break" in the cipher.

      A "break" in a cipher does not mean that it is practical to find the key, merely that it is more feasible than mere brute force. For example, a "break" could reduce the effective strength of a cipher from 256 bits to 212 bits under a known plaintext attack. This is a BAD break in the cipher given current standards, but it is the cipher is still completely uncrackable in human (or even geologic) timescales.

      The "weeks or months" number, by the way, has nothing to do with cracking cryptographic keys. I would surmise that is a number more geared towards cracking passwords, which is an entirely different topic. Also, for some realistic numbers on cracking encryption keys, check out Thermodynamic limits on cryptanalysis

      --
      md5sum /boot/vmlinuz
      d41d8cd98f00b204e9800998ecf8427e /boot/vmlinuz
    17. Re:good news for NSA by VortexCortex · · Score: 5, Funny

      Um... Zeno died of an arrow wound trying to prove that.

      "I used to believe in an infinitely divisible universe like you,
      then I took an arrow in the knee."
      - Zeno

    18. Re:good news for NSA by lgw · · Score: 2

      I'm not sure what the intent was with Dual_EC_DRBG! It's a bit silly to believe it was "sneaking in a backdoor" because (1) people figured it out using techniques the NSA knew were public, and more importantly (2) the dang thing is so slow there's no way anyone ever would have used it in the first place.

      The first you can argue was NSA arrogance, but the second? The second is just weird. I could believe the NSA trying to sneak in a backdoor, but one that obviously no one would use? I don't even?

      --
      Socialism: a lie told by totalitarians and believed by fools.
    19. Re:good news for NSA by blincoln · · Score: 3, Insightful

      Actually, you're both wrong.

      For certain types of encryption, you are right - a known-plaintext attack that easily reveals the key is a fatal problem for the encryption method. This is true of AES, for example. The converse is also true - currently, knowing the plaintext and encrypted values for an AES-encrypted block of data does not let an attacker determine the encryption key in a reasonable amount of time. It still requires testing every possible key to see if it produces the same encrypted block given the known plaintext.

      Other types of encryption are absolutely vulnerable to known-plaintext attacks. I'm less familiar with this area, but certain common stream ciphers (like RC4) are literally just an XOR operation, and so if you know the plaintext and ciphertext, you can obtain the keystream by XORing them together.

      --
      "...always new atoms but always doing the same dance, remembering what the dance was yesterday." -Richard Feynman
    20. Re:good news for NSA by dog77 · · Score: 1

      Hide the encryption algorithm used in the inner encrypted data and it will be even more difficult to find a correlation.

    21. Re:good news for NSA by BoberFett · · Score: 1

      I'm no cryptology expert, far from it, but that was my first thought as well. If you can analyze the data by using guesses as to what the unencrypted data looks like, then encoding twice would make that magnitudes more difficult, as you'd have to analyze the output of every conceivable key.

    22. Re:good news for NSA by shadowofwind · · Score: 2

      But at the same time

      It’s still exponentially hard

      .

      Maybe stating the obvious...."exponentially" isn't a synonym for "very". How hard it is depends on what the base and the exponent is.

    23. Re:good news for NSA by Anonymous Coward · · Score: 3, Insightful

      If the NSA was only concerned with open source cryptographic products and protocols, you would have a point. But aside from government procurement, NIST standards are in practice used to specify deliverables for corporate security products. Getting Duel_EC_DRBG into a NIST standard is the equivalent of putting a backdoor into an ISO standard for door locks.

      Once in the standard, the NSA can then lean on vendors to use the broken algorithm, and the vast majority of users of that product would be none the wiser. Most corporate security products are opaque and proprietary, and the purchasing agents are unlikely to have a clue about the problem. All they want to see is "NIST-approved".

      All we can do is conjecture, but I don't think the scenario is that outlandish. To my mind it seems more like standard operating procedure than unlikely conspiracy. The fact that the backdoor is clumsy reflects less on the carelessness of the NSA, and more on the exceptional skills of the civilian community. We're smarter now. The NSA has fewer tricks up its sleeve, but it's not like they can just quit and go home.

    24. Re:good news for NSA by cryptizard · · Score: 1

      This is a widely held misconception. Double encryption is not significantly stronger than single encryption due to the meet-in-the-middle attack.

    25. Re:good news for NSA by Mathinker · · Score: 1

      I don't understand. Maybe this is because I haven't read the paper, yet, but the distinct impression that I get is that this is a generic "weakness" against any encryption scheme, including multiple composition of simpler building blocks.

      Additionally, I had had the impression that meet-in-the-middle is only practical for small enough block or key sizes which enable the attacker to maintain a table in memory which is of the same order of size as the key/block-space. This does not seem practical for most modern block ciphers.

    26. Re:good news for NSA by mcrbids · · Score: 1

      We have no reason to believe that, despite the resources of the NSA, that they are significantly ahead of the public face of encryption technologies. In fact, it has been noted numerous times that cryptographers working for the NSA aren't paid nearly as well as the private sector positions;

      It's reasonable, then, to assume, that the NSA doesn't have any magic secrets other than gag orders alleged by affected parties.

      --
      I have no problem with your religion until you decide it's reason to deprive others of the truth.
    27. Re:good news for NSA by Anonymous Coward · · Score: 1

      Double encryption isn't suggested as some kind of slick trick to get a "free" doubling of key length. It's suggested in order to safeguard against potential weaknesses in ciphers.

      If someone uses 128-bit Twofish combined with 128-bit AES (and they're even using the same key for both!!) they still think of it as a 128-bit key, which could be brute forced like any other 128 bit cipher. It's not intended to be significantly stronger in the sense of it being a lot harder to brute force; it's intended to be stronger in the sense that it's less likely to be attacked faster-than-brute force.

    28. Re:good news for NSA by lgw · · Score: 1

      OK, but why on earth would the NSA need a backdoor into a US government-procured system? They have the key to the front door!

      And again there's the "far to slow to actually use" thing. It's 100 to 1000 times as slow as the other choices IIRC.

      --
      Socialism: a lie told by totalitarians and believed by fools.
    29. Re:good news for NSA by Anonymous Coward · · Score: 0

      It isn't news to anyone I hope.

      Years ago the wifi encryption was broken using this principle: Although all packets have a certain entropy, some packets have considerably less in some parts. So whereas in theory you'd have to try a key and decode the whole packet to see that you had the wrong key if you get "random junk" or the rigth key if you got some low-entropy plaintext, in actuality decoding the first 8 bytes or so, would give you a result you could check. So, in reality the close-to-zero entropy in the first 8 bytes is what made the attack a lot more practical. Not the average entropy over the whole packet.

    30. Re:good news for NSA by doublebackslash · · Score: 1

      Some stream ciphers are as you say, but the keystream is not the same as the underlying key. One can't guess the next character in the keystream without deriving the key. Most modern stream ciphers use internal feedback much in the same way that block ciphers use external feedback modes, like CBC, to prevent these attacks.

      In any system without feedback like this it is always considered insecure to re-use a key at all.

      --
      md5sum /boot/vmlinuz
      d41d8cd98f00b204e9800998ecf8427e /boot/vmlinuz
    31. Re:good news for NSA by Anonymous Coward · · Score: 0

      It was probably a distraction, a decoy, and the real back door actually went in somewhere else.

    32. Re:good news for NSA by RockDoctor · · Score: 1

      That time is now exponentially closer.

      I strongly suspect that you do not understand the meaning of "exponential" in the mathematical context appropriate for this subject.

      I gather that there may be a dilution of the meaning in slang to equate "exponentially" with "a lot". That is slang's problem.

      --
      Birds are not dinosaur descendants;birds are dinosaurs, for all useful meanings of "birds", "are" and "dinosaurs"
  3. Just Great by Anonymous Coward · · Score: 5, Funny

    Just great, Now instead of 100 Quintillion years, it's only going to take 100 Trillion years to decrypt my porn

    1. Re:Just Great by Anonymous Coward · · Score: 4, Funny

      I have changed my key from '1234' to '123456' to mitigate this...

    2. Re:Just Great by dgatwood · · Score: 0

      That's amazing! I've got the same combination on my luggage!

      --

      Check out my sci-fi/humor trilogy at PatriotsBooks.

    3. Re:Just Great by sinij · · Score: 0

      It must be your birthday!

    4. Re:Just Great by Anonymous Coward · · Score: 0

      Jokes on you, they just cured death.

    5. Re:Just Great by UltraZelda64 · · Score: 0

      I know, which is why I use the code 12345678: to be different and have a combination that is harder to guess because no one else would have imagined it. Ever.

    6. Re:Just Great by Anonymous Coward · · Score: 1

      you're not funny. just stop trying.

    7. Re:Just Great by Anonymous Coward · · Score: 0

      All Hail President Skroob!

    8. Re:Just Great by steelfood · · Score: 2

      Mine is hunter2. And I know it's safe because it looks like ******* to you.

      --
      "If a nation expects to be ignorant and free in a state of civilization, it expects what never was and never will be."
    9. Re:Just Great by UltraZelda64 · · Score: 0

      But, I'm not trying. You think I'd waste my time really trying to be funny here on Slashdot? That was posted in just seconds with next to no energy wasted on thinking.

  4. Huh? by Black+Parrot · · Score: 3, Insightful

    What correlation between the plaintext and cyphertext are they talking about?

    Also, I think there is a theorem about modern crypto systems that says if you can guess one bit, the rest doesn't get any easier.

    --
    Sheesh, evil *and* a jerk. -- Jade
    1. Re:Huh? by Arker · · Score: 5, Interesting

      Any correlation between plain and cipher. For instance if you can deduce that a particular string will occur at a particular point in the plaintext, then you can isolate the cipher equivelant and use that as a lever to break the rest of the ciphertext. You dont have to deduce it with certainty for this to be important, even if you have to try and discard a number of possible correlations before you find one that holds up.

      This is a pretty basic old-school cryptographic method, kind of fun to think that fancy-pants mathematicians have been missing it all these years.

      --
      =-=-=-=-=-=-=-=-=-=-=-=-=-=-
      Friends don't let friends enable ecmascript.
    2. Re:Huh? by Morpf · · Score: 1

      Well actually: If you guessed one bit correctly and you knew this, you would have made the problem half as easy. But maybe I just understood you wrong, so feel free to correct me. ;)

    3. Re:Huh? by sinij · · Score: 1

      This has to do with theoretical vs. practical attacks against algorithms. Crypto algorithms evaluated based on concept of existential forgery, meaning that adversary can establish some correlation between encrypted message and truly random message. We are talking q2^128 for most cases. This does not mean that practical attack is available, or that it can be effectively computed.

    4. Re:Huh? by Anonymous Coward · · Score: 3, Informative

      There is no "cipher equivalent", unless you're doing something stupid like using ECB mode.
      No modern encryption scheme works by simple one-to-one substitution; you use a nonce or an IV with a chaining mode so that even if the same plaintext appears several times, either in the same document or over multiple messages, it will "never" (neglible chance) encode to the same value twice.

    5. Re:Huh? by Anonymous Coward · · Score: 0

      So not quite as bad as it sounded then.

      Initially, it sounded like if they know a particular file is on your HDD (say, a funny cat GIF), and they have a copy of the unencrypted version of that file, then it becomes easier to decrypt the entire HDD. But if I understand what you are saying correctly, they would also need to know where on the HDD the encrypted version of the funny cat GIF is.

    6. Re:Huh? by sinij · · Score: 1

      Without getting into boring details, as poster above mentioned, it is ensuring correct implementation of known secure algorithms that is important. Not entropy or some other pseudo-scientific attempt to get a shortcut to tenure.

      Short of breakthrough in quantum computing modern crypto is secure. If you are using AES-256 or anything else FIPS certified - you are still going to be OK.

    7. Re:Huh? by Trepidity · · Score: 5, Informative

      As usual, the paper makes more sense than the press release, but is less grandiose in its claims.

      It's a fairly technical result that finds some appeals to the asymptotic equipartition property lead to too-strong claims, compared to a more precise analysis.

    8. Re:Huh? by Speare · · Score: 2

      If you want a visual analogy that works, think of the "WOPR guesses launch codes" scene in War Games. In that movie, it's really just eye candy to drive tension in the plot, but it works in that general way for larger texts. If WOPR could somehow compute or infer that the third digit of the launch code is A, and can't be any other letter, then it "locks" that digit down and looks for other inferences it can make. Code breaking and sudoku overlap here too.

      --
      [ .sig file not found ]
    9. Re:Huh? by Hatta · · Score: 5, Funny

      Also, I think there is a theorem about modern crypto systems that says if you can guess one bit, the rest doesn't get any easier.

      Nah, once you guess one bit, the only bit left is zero.

      --
      Give me Classic Slashdot or give me death!
    10. Re:Huh? by Anonymous Coward · · Score: 1

      The parent is absolute balderdash! Entropy is not pseudo-scientific. Short of one-time pads, there is no perfectly secure algorithm since all we do know is that no computationally simple inverse for many trapdoor functions in the open literature. For all you know, someone might have figured out a way to invert Feistel networks efficiently and is quietly stealing billions of dollars. The only known way to measure resistance against information-theoretic (but not purely theoretical) attacks is using information-theoretic tools, and entropy is the fundamental concept of information theory. Entropy is the basis on which all modern communication methods are designed, including whatever medium you are using to transport this comment from Slashdot to your device.

      And Prof. Medard does not need tenure; look up her bio.

    11. Re:Huh? by lgw · · Score: 1

      Shannon entropy and unicity distance has more to do with provably unbreakable system than practically unbreakable. Why is a one-time pad unbreakable (assuming a good RNG)? When can a shorter key be unbreakable? What's the minimum key length needed to make an ideal cypher unbreakable for a given plaintext? Why is compression before encryption so important, how exactly how important is it?

      Purely academic questions like this are mocked by engineers in every field, but it's that sort of pure research that leads to the breakthroughs that you just can't get from incremental refinement of what's proven to work.

      --
      Socialism: a lie told by totalitarians and believed by fools.
    12. Re:Huh? by Black+Parrot · · Score: 1

      True, but narrowing 2^1000 possibilities for the plaintext down to 2^999 doesn't feel like a lot of progress.

      --
      Sheesh, evil *and* a jerk. -- Jade
    13. Re:Huh? by Black+Parrot · · Score: 1

      Out of my field, but IIRC modern crypto systems aren't just substitutions that leave the cyphertext for a character in the same place as the plaintext. Everything gets scrambled all around.

      --
      Sheesh, evil *and* a jerk. -- Jade
    14. Re:Huh? by Anonymous Coward · · Score: 0

      Out of my field, too, but eliminating impossible partial decryptions is still a commonly used and effective method. The 'scrambled around' part just means different techniques for identification are used.

    15. Re:Huh? by delt0r · · Score: 1

      True, but even "valid" breaks need memory on the order of a little less than 2^128 and dito for crypto operations and often plain text/cipher text size.

      There is a world of difference between practical breaks and theoretical ones. OF course there have been plenty of practical breaks as well. But at this point, this has not lead to one, and not really sure if it would lead to better breaks.

      --
      If information wants to be free, why does my internet connection cost so much?
    16. Re:Huh? by Arker · · Score: 2

      It's not supposed to lead to better cracks. It's supposed to lead to a more accurate mathematical representation of how difficult cracks are to achieve.

      --
      =-=-=-=-=-=-=-=-=-=-=-=-=-=-
      Friends don't let friends enable ecmascript.
    17. Re:Huh? by RockDoctor · · Score: 1

      As usual, the paper makes more sense

      Thank you for the legwork.

      I shall honour your work by ... well, RTFP-ing!.

      And ... It looks like "we told you to not do that ; this is another way of saying `don't do that`". Where "that" is "using a plaintext with predictable contents.

      And that is why, back in the early 1990s, the first Zimmerman distribution of PGP included a suggestion to use an efficient compression algorithm on a message (packet, whatever) before starting encryption ; because that hammers out the redundancy from your message and leaves less for your attacker to work on.

      OK, I may have expressed it poorly (IANA-mathematician) ; but the initial compression step makes it quite hard to differentiate the plain text from random bits. So ... "poof" to known-plaintext attacks (particularly if you include, say, a time-stamp very early in the file, to reduce predictability.

      --
      Birds are not dinosaur descendants;birds are dinosaurs, for all useful meanings of "birds", "are" and "dinosaurs"
    18. Re:Huh? by Morpf · · Score: 1

      But it actually is. Even though you solve _all_ other bits, you will only get rid of as many combinations as this first bit did. I would suggest that this is a huge progress. ;)

  5. Interesting times by DigitAl56K · · Score: 3, Insightful

    There was also an article on Slashdot just over a week ago about a separate advance against RSA.
    http://it.slashdot.org/story/13/08/06/2056239/math-advance-suggest-rsa-encryption-could-fall-within-5-years

    A picture is emerging where not only are the tools available to the layman for protecting information difficult to use, their is a good chance that they also do not offer as much protection as we have long held them to provide.

    1. Re:Interesting times by DigitAl56K · · Score: 1

      their/there, before the gn's jump all over me for a typo ;)

    2. Re:Interesting times by nigelo · · Score: 3, Funny

      There, there - They're there.

      --
      *Still* negative function...
    3. Re:Interesting times by Anonymous Coward · · Score: 0

      "gn's jump all over me"

      Are the "gay niggers" back on Slashdot?

    4. Re:Interesting times by delt0r · · Score: 2

      There is a reason that government does want you to use encryption.... And not because it gives you a false sense of security

      --
      If information wants to be free, why does my internet connection cost so much?
  6. FUD by sinij · · Score: 3, Interesting

    This is well-known FUD that is making life difficult in government-facing Information Assurance circles. We are still talking ^n where to bruteforce N >>> heat death of universe. This is such unlikely cause of concern that effort currently spent on mitigating and testing is much better spent on ensuring proper implementation and validation of modern cryptographic algorithms. Instead all they care about is entropy assessment and don't care that it is for the implementation of ROT13.

    1. Re:FUD by Anonymous Coward · · Score: 0

      This isn't about brute force, this is about partial plaintext matching. What it really means is that plaintext matches are an even greater vulnerability in encryption than previously assumed. This also confirms that full-drive encryption of an OS drive is barely better than an empty admin password when it comes to security.

    2. Re:FUD by Anonymous Coward · · Score: 0

      So....your saying it's silly that government IA regulations stipulate that we need to use a 15 character passwords on all the systems we work with and requires so many special character classes to pass complexity validation that anyone short of a savant needs to write them down to remember them?

    3. Re:FUD by sinij · · Score: 2

      >>>This also confirms that full-drive encryption of an OS drive is barely better than an empty admin password when it comes to security.

      This is an absurd claim.

      There is no such thing as "plaintext matching", you probably thinking about CPA (chosen plain text attack). Things like nonce, CBC and random IV make sure that such matching impossible.

    4. Re:FUD by Anonymous Coward · · Score: 0

      Every HDD encryption program I know of uses some type of way to ensure that one sector of text that is known won't help much.

      XTS-AES in TrueCrypt is one example. If I know sector 45 is all zeroes, it means squat to decode data on sector 44 or 46.

      Yes, some encryption programs still use ECB mode, but again, some encryption programs stash the password in some obfuscated part of the machine so they can auto-encrypt files.

      Yes, the randomness is an attack, but with modern NIST algorithms, it has long since been dealt with.

    5. Re:FUD by Anonymous Coward · · Score: 3, Insightful

      With all due respect, "citation needed". The authors of the paper aren't FUDsters spewing soundbites for the media, they are presenting it at the International Symposium on Information Theory before their peers. I can't tell from the link whether the paper has been accepted by a peer-reviewed journal or whether it's still in review, so some skepticism might be called for before uncritically accepting the conclusions, but this is still a far cry from FUD.

      I'd like to see something more than just a dismissive handwave that this is "well known" old news and not new evidence of weaknesses in cryptographic methods. Even if this has been suspected for some time and the paper merely describes rigorously the nature of such weaknesses, that's still scientific progress and undeserving of the label FUD.

    6. Re:FUD by sinij · · Score: 1, Interesting

      This isn't dismissive hand wave. What they discovered is a marginal concern, especially when dealing with on-the-way-out algorithms (e.g. 3DES). Authors are FUDsters not because what they discovered is false, but because they are making huge deal out of it, and some illiterate CIOs within government circles listened and redirected resources to mitigate this non-issue.

    7. Re:FUD by Anonymous Coward · · Score: 0

      We are still talking ^n where to bruteforce N >>> heat death of universe

      You shouldn't assume the worst case for the attacker. While it's not likely to happen, it's entirely possible they guess it correctly on the first try.

      The paper is a little esoteric and hard to explain to non-math types, but essentially what it means is that there are ways to reduce the theoretical average time-to-crack in specific situations. One example they give is that by altering localized noise around an RF card reader, forcing re-transmission of the coded message, the attacker can gain a slight advantage because of how some encryption systems use entropy in their key generation.

      Another example which is much more relevant to most people, is the paper offers a mathematical proof that using any real word in a password causes a reduction in the worst-case time to crack. In layman's terms it's because an attacker can make an educated guess about what the next character in the password is based on a statistical analysis of the language the word is from.

      So if casual readers take anything away from the paper and article, it is this: Never, ever, use a real word in a password. Passphrases are plain and simple bad practice all around. Never, ever attempt to make up your own password, because humans suck at doing that.

    8. Re:FUD by c0d3g33k · · Score: 2

      This isn't dismissive hand wave. What they discovered is a marginal concern, especially when dealing with on-the-way-out algorithms (e.g. 3DES).

      "Dismissive hand wave" refers to your terse dismissal and accusations of FUD while providing nothing more than personal opinion as evidence. If there is a basis for your assertions, prove it with links to actual proof that this is nothing.

      Authors are FUDsters not because what they discovered is false, but because they are making huge deal out of it, and some illiterate CIOs within government circles listened and redirected resources to mitigate this non-issue.

      You must be in the field, then, and have inside knowledge. You come across as someone who is offended by the behavior of attention seeking scientific peers and are calling them out. Fine. But the MIT research article and the paper it describes don't support your claims - they appear to be a typical report of interesting research by MIT researchers and a fairly typical scientific paper. They don't seem to be making a huge deal out of anything. So your assertions must be based on additional information that we don't know about. If there is evidence to support your accusation of FUD and 'making a big deal', show us why you believe this is true. Otherwise you're just some /.er throwing out insulting accusations. Back those accusations up with something substantial and we might all learn something useful.

    9. Re:FUD by lgw · · Score: 1

      It's quite unlikely the authors "are making huge deal out of it". Never, ever confuse the journalist writing about science with the scientist.

      --
      Socialism: a lie told by totalitarians and believed by fools.
    10. Re:FUD by sinij · · Score: 1

      I am not. This is being made a huge deal out of right now by people who matter (but shouldn't) since about three years ago. This paper isn't even the first time academics parade this flavor of red herring, this why I find this specific instance so annoying. Insufficient entropy for random seeding my foot. We know how to seed, have done it for decades without any issues. Now they want to see formal analysis of this (and nothing else). How is that going to result in better cryptography?

    11. Re:FUD by sinij · · Score: 1

      So you think describing in incomprehensible math what boils down to a type of vocabulary attack, and then somehow concluding that our RNG isn't good enough (never mind the elephant in the room that your implementation+policy is vulnerable to such attack) is not FUD?

    12. Re:FUD by c0d3g33k · · Score: 1

      So you think describing in incomprehensible math what boils down to a type of vocabulary attack, and then somehow concluding that our RNG isn't good enough (never mind the elephant in the room that your implementation+policy is vulnerable to such attack) is not FUD?

      Yes, I don't think it is FUD. I may not think it is earth-shatteringly profound and proof that the sky is falling and cryptography is now broken forever, but reading the actual paper, they don't either.

      "Incomprehensible math"? What? It's a math paper, written by mathematicians, presented at a MATH symposium. It's comprehensible to the authors and the audience at the symposium, regardless of whether non-mathematicians can comprehend it. You act as though this were an attempt by hucksters to confuse by glibly sprinkling math in an article aimed at non-mathematicians to confuse them.

      The paper is linked above - you can go read it yourself. Whether or not you comprehend the math, the authors helpfully provided an abstract, introduction and conclusions in English. I just don't see the attempt at spreading Fear, Uncertainty and Doubt that you do - all I see is a typical research paper that shows (with math!) that it's easier to guess a word than a common approximation relying on uniform distribution might suggest, so using that approximation might be ill-advised. That's all. That's not FUD, that's research.

    13. Re:FUD by sinij · · Score: 1

      Fear = our secrets going to get hacked
      Uncertainty = we just don't know how to quantify risks, because Step 3: Entropy!
      Doubt = everything we know about cryptography is wrong, because Flawed Example!

      I stand on my point that this paper, as far as practical cryptography goes, is FUD. I am willing to consider that it might be viewed differently through the lens of theoretical science.

  7. Key Size implications by Anonymous Coward · · Score: 0

    So, can someone clarify for me exactly what the implications of this are? Is this a lowering of the relevant exponent in the exponentially hard problem, meaning you should multiply your key sizes by some factor that perhaps the paper somehow could provide, or is it a constant factor meaning you should extend your keys by a fixed amount?

    Either way, this is important news. I expect the details depend on the nature of the data in question, so there aren't easy answers. Its things like this that are the reasons we use key sizes that are significantly larger than could be practically cracked today.

    1. Re:Key Size implications by Em+Adespoton · · Score: 5, Interesting

      So, can someone clarify for me exactly what the implications of this are? Is this a lowering of the relevant exponent in the exponentially hard problem, meaning you should multiply your key sizes by some factor that perhaps the paper somehow could provide, or is it a constant factor meaning you should extend your keys by a fixed amount?

      Either way, this is important news. I expect the details depend on the nature of the data in question, so there aren't easy answers. Its things like this that are the reasons we use key sizes that are significantly larger than could be practically cracked today.

      This might be news in mathematical circles, but this has been a known issue in cryptoanalysis circles for years. It's even the basis for the smart card attacks performed by a German group in the mid-90's. Shannon entropy theory is fine for its limited domain, but as soon as you start dealing with encryption-during-transit of values known to the attacker (plus timings and order of sequence), a LOT more has to be done to ensure high entropy of the metainformation too, and Shannon entropy doesn't account for that.

      So in properly defined encryption systems, this isn't much of an issue. The problem arises when people shout "we use AES-256" or "we use SSL/TLS 2.0" (which have fine Shannon entropy) and yet handle that encrypted data in a way that exposes it to pattern analysis attack, whether encrypted or not.

      Note that this is a separate issue from that of choosing a secure encryption key/keylength in the first place. It has more to do with how you're wrapping the unencrypted data and how random separate unencrypted data sets using the same key are.

      The way I've always thought of it is: if the entropy source is truly random, then any meaningful data injected into it will impart a pattern into the randomness. This can be used to identify the data based on patterns discovered in the supposedly random data. Conversely, if the entropy source isn't truly random, it is possible to discover its pattern, extract that from the equation, and what you are left with is the data.

      You still have to deal with the secret key in either case, but this makes building that key exponentially easier, given a known cleartext source and a collection of cleartext encrypted samples. The more encrypted samples of the known cleartext you've got, the simpler the decryption becomes.

  8. Three words... by jettoblack · · Score: 1

    Cooty Rats Semen

    (If you don't get it, you need to see: http://www.imdb.com/title/tt0105435/ )

    1. Re:Three words... by Anonymous Coward · · Score: 0

      "I want peace on earth and goodwill toward men."
      "We're the United States Government! We don't do that sort of thing."

      Great movie.

  9. Lets see it by Anonymous Coward · · Score: 0

    Pics or it didnt happen

  10. Its all about buying more time! by globz · · Score: 1

    Cryptop = buying time

  11. University of Ireland is gibberish by Anonymous Coward · · Score: 3, Informative

    It is (as given on the paper) the "National University of Ireland, Maynooth" and NOT simply "University of Ireland". "The constituent universities are for all essential purposes independent universities, except that the degrees and diplomas are those of the National University of Ireland with its seat in Dublin". I'm from Ireland and had no clue WTF "University of Ireland" was going to be and had it not been for the MIT connection would have assumed it was one of those places you send a few dollars to get a "fake" degree. When and if it's truncated you might see "NUI", "NUIM" or "NUI Maynooth".

    1. Re:University of Ireland is gibberish by RockDoctor · · Score: 1

      National University of Ireland, Maynooth"

      You think it sounds confusing? Meh!

      It took me about 6 clicks to get to http://www.nuim.ie/

      Mathematical skill does note require presence at a "major university" (though there is a strong correlation, distorted by (common) mathematical geniuses who really do not give a shit about conventionality. Perelman, (sp?), the recent proposer of a proof of the Something Big Conjecture being a case in point.

      --
      Birds are not dinosaur descendants;birds are dinosaurs, for all useful meanings of "birds", "are" and "dinosaurs"
  12. Common mistake. by Hatta · · Score: 5, Interesting

    I remember reading in an ecology textbook about researchers who wanted to model reforestation after a Mt. St. Helens erupted. They used the average seed dispersion as input to their model, and found that reforestation occured much, much faster.

    Turns out the farthest flung seeds take root just as well as the average seed, and they grow and disperse seeds. And the farthest flung of those seeds grow and disperse seeds, compounding the disparity between average and extreme seed dispersion.

    Just something to keep in mind when you're working with averages.

    --
    Give me Classic Slashdot or give me death!
    1. Re:Common mistake. by Anonymous Coward · · Score: 0

      The obsession with averages and normal distributions will be remembered as a blemish on 20th century science.

    2. Re:Common mistake. by jkflying · · Score: 1

      So they forgot to take into account that the median seed had to compete with a bunch of other seeds, while the farthest seed didn't? Sounds like shoddy prediction work to me.

      --
      Help I am stuck in a signature factory!
    3. Re:Common mistake. by phantomfive · · Score: 0

      Think of that every time you read a prediction about global warming. Especially when you find someone who believes that scientists can predict everything about climate, because hey, it's Science.

      --
      "First they came for the slanderers and i said nothing."
  13. Compression first by kwerle · · Score: 1

    Isn't this (one reason) why any good encryption system compresses what it is encrypting first? To maximize the data's entropy?

    1. Re:Compression first by Anonymous Coward · · Score: 0

      Compression doesn't increase entropy.

    2. Re:Compression first by Anonymous Coward · · Score: 0

      No, it gives away the amount of "information" in the encrypted object, which has been used to extract for example the timing of pauses in VOIP and from that guess words.... if you want to do this the least you must do is then pack to set size before encryption which probably defeats the point...

    3. Re:Compression first by kwerle · · Score: 1

      http://en.wikipedia.org/wiki/Entropy_(information_theory)#Data_compression

      If a compression scheme is lossless—that is, you can always recover the entire original message by decompressing—then a compressed message has the same quantity of information as the original, but communicated in fewer characters. That is, it has more information per character, or a higher entropy. This means a compressed message is more unpredictable, because there is no redundancy. Roughly speaking, Shannon's source coding theorem says that a lossless compression scheme cannot compress messages, on average, to have more than one bit of information per bit of message. The entropy of a message multiplied by the length of that message is a measure of how much information the message contains.

    4. Re:Compression first by Anonymous Coward · · Score: 0
      No. (Properly used) modern crypto is completely safe against known/chosen plaintext attack, there are no need to hide any irregularities/known pattern/signatures in plaintext. Knowing them won't help attacker even a bit.

      Only reason to compress-before-encrypt is that compress-after-encrypt just won't work (compression algorithms won't be able to see any patterns in ciphertext). It's to save space, not to improve security.

      (FWIW, there are even cases when compression can introduce side-channel leak see recent BEAST and CRIME attacks on SSL).

    5. Re:Compression first by Anonymous Coward · · Score: 0

      In VOIP case, compress-then-pad still make sense as even after padding to largest possible frame size, it is still much smaller than original data. Well, alternatively you can switch compression to CBR mode, instead of VBR mode (and, of course, disable any silence detection); it will likely also save some CPU cycles.

  14. That's why you shouldn't use plain text by NotQuiteReal · · Score: 4, Funny

    Use Word! Those zippy-looking XML-ish .docx files are all messed up!

    --
    This issue is a bit more complicated than you think.
    1. Re:That's why you shouldn't use plain text by gmuslera · · Score: 3, Funny

      I prefer anonymous coward encryption. There should be some meaning in their posts, but not even the NSA could decrypt them.

    2. Re:That's why you shouldn't use plain text by steelfood · · Score: 1

      Even better: the old DOC format was partially binary, and partially executable.

      --
      "If a nation expects to be ignorant and free in a state of civilization, it expects what never was and never will be."
  15. Times have changed by Anonymous Coward · · Score: 3, Interesting

    I don't have insider knowledge, this is just speculation based on societal trends. Where cryptography used to be the almost exclusive realm of governments to protect their secrets, it is now quite mainstream. Encryption protects e-commerce transactions among other things that are useful for the average person and vital to our businesses. It is now a field that university researchers pay attention to (where only cryptographers under the employ of spy agencies did previously) and companies spend their own money to pursue R&D on.

    The NSA still does research, but it just doesn't seem likely they have a big edge over the academics who public in journals that everyone can read.

  16. Known or chosen plaintext by Geirzinho · · Score: 3, Informative

    How is this in principle different from the known plaintext attacks (https://en.wikipedia.org/wiki/Known-plaintext_attack)?

    These assume that the attacker knows both the encrypted version of the text and the original it was based on, and tries to glean information from their correlation.

    Modern ciphers are made resistant even to chosen plaintext attacks, where the analyst knows the key and can tailor-make pairs of plain- and ciphertext.

    1. Re:Known or chosen plaintext by cryptizard · · Score: 3, Informative

      Pretty sure what they are saying here is that having a lot of Shannon entropy in your key is not enough for security. The paper seems to be deliberately obtuse though, which is really annoying. I am a cryptographer and it doesn't make a whole lot of sense to me right away. They note that if you draw a word from some stochastic process then the difficulty in guessing that word may not be very high, even if the entropy is high. This is completely intuitive and known.

      Imagine you have an algorithm that generates an n-bit secret key. First, it flips a random bit b. If b = 0, then it just outputs a string of n zeroes as the key. If b = 1, then it outputs n random bits. The entropy of this process is n bits, which seems good, but cryptographically it is terrible because half the time it just uses a fixed key of all zeroes. Instead of Shannon entropy, cryptographers uses a different form called min entropy which is inversely proportional to the most likely event. So in the above case, the min entropy would only be one bit, which properly reflects how bad that algorithm is.

      It's late, and I might be missing something, but it doesn't seem like anything that wasn't known before. Particularly, they talk about distributions with high entropy but which are not uniform, and in cryptography you always assume you have uniform randomness. It has been known for quite a while that many things are not even possible without uniform randomness. For instance, it is known that encryption cannot be done without uniform randomness.

    2. Re:Known or chosen plaintext by Anonymous Coward · · Score: 0

      Imagine you have an algorithm that generates an n-bit secret key. First, it flips a random bit b. If b = 0, then it just outputs a string of n zeroes as the key. If b = 1, then it outputs n random bits. The entropy of this process is n bits, which seems good, but cryptographically it is terrible because half the time it just uses a fixed key of all zeroes.

      The Shannon entropy of this process is about n/2 and not n.

    3. Re:Known or chosen plaintext by cryptizard · · Score: 1

      Whoops yeah, my bad.

  17. Why make it easy? by Anonymous Coward · · Score: 0

    Still not going to stop using encryption. Just because it's not as good as previously thought, it doesn't mean we should just hand everything over to the NSA in cleartext. Even if there is a 100% chance of them hacking it, make them work a little.

  18. Damn those information therrorists by zAPPzAPP · · Score: 1

    We'd send our drones after them if they wouldn't hack them and send them back.

  19. Can't they just eliminate the non-uniformity? by Anonymous Coward · · Score: 1

    they found that slight deviations from perfect uniformity in source files, which seemed trivial in the light of Shannon entropy, suddenly loomed much larger

    Okay, but can't they simply apply an xor mask to the plaintext to make it perfectly uniform, and then encrypt the masked version?

    For example, let's say it turns out that iterating on the SHA512 function [SHA512(key), SHA512(SHA512(key)), etc.] yields an arbitrarily long xor mask that has perfect uniformity, and is statistically indistinguishable from a random sequence. You then apply that mask to the plaintext before encrypting it to destroy its non-uniformity. Wouldn't that be the fix?

    Or is the problem here that they can't find a function that can truly mask out the non-uniformities of the plaintext prior to encryption? If that's the case, I would be very surprised, and for me that failure would be far more interesting and news-worthy.

    1. Re:Can't they just eliminate the non-uniformity? by Anonymous Coward · · Score: 1

      For example, let's say it turns out that iterating on the SHA512 function [SHA512(key), SHA512(SHA512(key)), etc.] yields an arbitrarily long xor mask that has perfect uniformity, and is statistically indistinguishable from a random sequence. You then apply that mask to the plaintext before encrypting it to destroy its non-uniformity. Wouldn't that be the fix?

      The point of this paper is that iterated SHA512, or any other cryptographic operation you care to name, doesn't have perfect uniformity, and those deviations from uniformity have a far greater significance than anyone believed.

  20. Re:God says... by SleazyRidr · · Score: 1, Offtopic

    Sometimes "polite" language is not in itself sufficient to adequately convey a message. One could spend time elaborately preparing a ripost of the finer points of a religious belief which is, on it's face, ridiculous. This approach, however, would not adequately the pain, suffering and existential angst felt by the Anonymous Coward to whom you are replying or the countless other members of our community, myself included, who have been mistreated by the followers of this "imaginary friend." We are at a point in history and in society where people are using their "beliefs" to further their ends of oppressing people who are not attempting to do harm to anyone. We are at a point where we are expected to "respect" other's beliefs even when those beliefs run directly counter to what can be observed by the naked eye, even when the exercise of those beliefs would cause harm to those in the immediate vicinity. Still we cannot even read a website, purporting to relate to technology news, a completely secular subject, without finding these beliefs being forced into our eyeballs and down our throats. The level of anguish experienced at these events can not be expressed without resorting to expletives.

    tl:dr: Fuck you and your wankery.

  21. Whole-disk encryption a bad idea? by Dorianny · · Score: 2

    Can a knowledgeable party weigh in on what this research means to whole-disk encryption, where an attacker has knowledge of what significant amounts of data, specifically the operating system files, look like un-encrypted? It would seem to me that such knowledge makes the sort of attack described by the article much easier.

    1. Re:Whole-disk encryption a bad idea? by Anonymous Coward · · Score: 0

      It depends a lot on how you do the whole-disk encryption. It *has* to be very resistant to chosen-plaintext and known-plaintext attacks, and unless you screw it up, you'll be using one of the feedback modes *especially* designed for disk encription AND a proper ESSIV which will give you good enough resistance.

      Don't count on those images saving your ass by still resisting cryptanalysis 50 years down the line, though.

    2. Re:Whole-disk encryption a bad idea? by Anonymous Coward · · Score: 0

      The easy solution is to partition and only keep data encrypted.

    3. Re:Whole-disk encryption a bad idea? by Anonymous Coward · · Score: 0

      Remember, whole-disk encryption works on the block layer, not the file layer. So you don't know whether a particular block at a particular offset is in fact /bin/ls or some other bit.

  22. Re:God says... by Anonymous Coward · · Score: 1, Insightful

    People who judge others intelligence by the words they use are not all that intelligent.

    I wont even get into the self absorption involved in using one long run-on sentence to say what could have been more simply expressed in very few words.

    There is nothing at all wrong with a few short, simple obscene words if they convey exactly the meaning intended. Speech is not a Christmas tree - you dont need to decorate it.

  23. Signitures by Anonymous Coward · · Score: 0

    Does this men that by digitally signing an email I'm weakening the PGP encryption?

  24. Disregard... by Anonymous Coward · · Score: 2, Funny

    Any sentences that starts with, "What if it is we..."

  25. Re:God says... by another_twilight · · Score: 1, Interesting

    Which god? Zeus? Odin? Quetzacoatl? Given the differences between some people's definitions of what 'god' is, I am unconvinced of the 'all aspects of the one divinity' argument, so before we start playing 'what if' let's establish what you mean when you say 'God' and why we should accord that definition primacy over another.

    The thought exercise you pose is little different to any one of the form that posits a state of being where your senses are fooled so that you cannot perceive the true reality - brain-in-a-jar, plugged-into-the-Matrix, figment-of-a-dreaming-god. The answer is the same in all cases - if the environment I perceive is consistent, if the illusion is complete, then the difference that makes no difference is no difference. The 'glitches in the Matrix', the 'glimpses of the divine' are less likely to be cracks in the slightly-less-than-perfect-illusion and more likely a figment of our imperfect perception and/or cognition.

    If we are figments of a gods imagination, then it is either indifferent or malicious. The mental gymnastics required to claim that a beinn who keeps us in ignorance whilst imbuing us with reason and curiosity is benign are ridiculous.

  26. So what are you saying.... by aztektum · · Score: 1

    'Itâ(TM)s still exponentially hard, but itâ(TM)s exponentially easier than we thought,' Duffy says.

    So, what, rather than a computer taking until the heat death of the universe to crack my 4096 bit key it will only take until our Sun goes super nova?

    brb, generating 8192 bit keys.

    --
    :: aztek ::
    No sig for you!!
  27. $10,000 offer by slick7 · · Score: 1
    $10,000 to whomever can break this cypher.

    sekg 1408 drnh @$?" xxth bhg9 douche bag

    hjmp llmo 3860 ++%# jjgj mmnm muggle

    --
    The mind conceives, the body achieves, the spirit manifests.
    1. Re:$10,000 offer by Anonymous Coward · · Score: 0

      It's not a cipher, at best, it's a code. Oddly enough, the lack of entropy gives it away. (It's not "random" enough to be a cipher. "se", "dr", "nh", "mn", "hj" are all next to each other on the keyboard, plus some "real words" were thrown in.)

      I'll try my hand at decoding it:
      "I am such an incredible douche bag. I think making stuff up and saying it's encrypted will fool all of those muggles."

      Am I close?

  28. Some plaintexts can be guessed by Anonymous Coward · · Score: 0

    they would also need to know where on the HDD the encrypted version of the funny cat GIF is.

    Where on the hard drive is the partition table? Where in the partition is the superblock? Where on the hard drive, is the root directory assuming the owner used one of the most common filesystems?

  29. Easy fix by Futurepower(R) · · Score: 1

    "A codebreaker needs only one reliable correlation between the encrypted and unencrypted versions of a file in order to begin to deduce further correlations."

    It is necessary to encrypt twice, using 2 different encryption methods. Then it will be impossible to find one reliable correlation.

    1. Re:Easy fix by cryptizard · · Score: 2

      This is a widely held misconception. Double encryption is not significantly stronger than single encryption due to the meet-in-the-middle attack.

  30. Re:God says... by Anonymous Coward · · Score: 0

    Friend, calm down. tdavis, the author of these many posts (and a rather terrible operating system), is a known schizophrenic on welfare. Please understand that his is mentally diseased and be kind to him.

  31. My two cents by mearvk · · Score: 1

    RSA is the thing we should be worried about; primarily since it's used so widely. The math behind quick factorization is probably already known, add in quantum computing and you'd need like 2^1024 bit keys for RSA to make sense. So that leaves really symmetric encryption systems (don't know enough about the curve based stuff) and those are typically based on shifting, XORing with key and repeating. With respect to the article I'm not at all sure that anything can be inferred from having ciphertext and plaintext for a given key without having a quick way to do set subtraction between the set of all possible keys and the keys that could feasibly produce the ciphertext given the plaintext. Even then the key length could be increased very easily so you'd need something like a linear time method to do the set subtraction. Then, you'd just keep doing set subtraction until you had a reasonable number of keys like 1,000,000 and then go the other way and just brute force future ciphertexts to see which ones spit out coherent plaintext. But really why not just work with OTPs, steganography, multiple layers of encryption or private encryption schemes?

  32. Use 2 different encryption METHODS. by Futurepower(R) · · Score: 1

    "This is a widely held misconception. Double encryption is not significantly stronger than single encryption due to the meet-in-the-middle attack."

    I suggested using 2 different un-related encryption methods. Because the 2nd method is entirely different from the first, MITM does not function. Using 2 different un-related encryption methods protects against other attacks, also.

    Meet-in-the-middle applies to using the same encryption method two times, using different keys.

    1. Re:Use 2 different encryption METHODS. by cryptizard · · Score: 1

      Umm... no. It applies to any two encryption methods. I don't know why you would think it has to be the same cipher twice.

    2. Re:Use 2 different encryption METHODS. by cryptizard · · Score: 1

      Sorry to reply again, but I just wanted to point out that various forms of the MiTM attack have been used to attack block ciphers because you can view them as a large network of smaller components. You can come from both ends and "meet in the middle" of the cipher to gain advantage sometimes. This is how AES was first broken.

    3. Re:Use 2 different encryption METHODS. by cellocgw · · Score: 1

      It applies to any two encryption methods. I don't know why you would think it has to be the same cipher twice.

      So you're saying that, in Soviet Russia, you use ROT-26 followed with ROT-52 ?
      (OK, I'm done beating every single resident bacterial cell in a dead horse to death)

      --
      https://app.box.com/WitthoftResume Code: https://github.com/cellocgw
  33. TrueCrypt can use 2 different encryption METHODS. by Futurepower(R) · · Score: 1

    Note that the free TrueCrypt offers encryption using 2 or more different encryption methods, with different keys for each method. They call it cascade encryption. Unfortunately, that term is used also for encryption using 2 or more keys with the same encryption method.

  34. Re:God says... by Roachie · · Score: 1

    woah! wait guys... lets just see what this God fella has to say, now...

    --
    This sig is not paradoxical or ironic.
  35. Re:God says... by Anonymous Coward · · Score: 0

    His imaginary friend as you bigoted people put it, has been proven to exist more than your global warming religion.

    Really? I think I have missed the evidence. Would you be kind to put some references?

  36. Re:God says... by Anonymous Coward · · Score: 0

    Still we cannot even read a website, purporting to relate to technology news, a completely secular subject, without finding these beliefs being forced into our eyeballs and down our throats. The level of anguish experienced at these events can not be expressed without resorting to expletives.

    Oh you poor poor thing and your poor poor feefees. I'll pray for the day when you're no longer hideously oppressed by slashdot comments. We shall overcome.

  37. idiotic by slashmydots · · Score: 1

    So...it's easier to determine the encryption key if already have the unencrypted version of a file? Yeah, that's real helpful. You don't really need the key if you already have a decrypted version. Just don't ever leave a decrypted version around and even then, don't use the same key for each file. Problem solved.
    Except they figured this out just in time for quantum computers to ruin all encryption.

  38. Re:God says... by SleazyRidr · · Score: 1

    I'm glad to see you read comments the same way you read the bible: skimming through to find the bit you wanted to see, while ignoring the rest which would invalidate your point.

  39. Re:God says... by fast+turtle · · Score: 1

    You got it wrong. It's money, shopping and momma. If momma aint happy, nobody happy.

    --
    Mod me up/Mod me down: I wont frown as I've no crown
  40. Re:God says... by bkcallahan · · Score: 1

    Schizophrenic: Calls the voice in their head "Bob the Clown". We medicate them.
    Christian: Calls the voice in their head "God". We give them special rights.

  41. Re:God says... by Anonymous Coward · · Score: 0

    You assume I'm theist; that's adorable. You're a sheltered asshole who wouldn't know oppression from a hole in the ground. There are people being tortured, killed, or otherwise being denied basic human rights over religious dogma, and you're crying over that darn anonymous coward quoting some religious shit. You are the equivalent of a tumblr SJ thug crying about being fatshamed while trying to portray it as some human rights issue. Yes, there's a problem, but it's very fucking unlikely you ever came close to even vaguely experiencing it if you're whining about a troll quoting the bible (hook, line, and sinker, by the way). Go fucking cry about it on /r/atheism while countless others are actually suffering from real mental and physical abuse.

  42. Ha! Math! by Anonymous Coward · · Score: 0

    Most comment strings are hundreds long on slashdot. Nothing like a complicated word problem to filter the commentators!

    A long random encryption key is still Kryptonite to the any code breaking Superman. But what most code breakers rely on is the fact that the longer a code is... the more it needs to be predictable for human recall. Being able to narrow your work load or concentrate it in a direction that will likely bare fruit is the only way to break a long encryption key.

    But most research that is "viable" is in getting clues for keys in human behavior, in mistakes in the cryptography engine, and in sneaking in backdoors.

    If it takes 10 Billion years to crack proper AES 256 encryption... what does a 50% theoretical reduction in computation time even mean? Nothing.

    Here is where the fun begins -----> http://en.wikipedia.org/wiki/Password_psychology

    If you want an interesting take on decryption of long keys... look at the studies that predict how much energy would need to be generated to handle said computations.

    Then there is the Ethical argument on the opportunities lost by sending super computers on "encryption errands" .

  43. Re:God says... by SleazyRidr · · Score: 1

    We are at a point in history and in society where people are using their "beliefs" to further their ends of oppressing people who are not attempting to do harm to anyone. We are at a point where we are expected to "respect" other's beliefs even when those beliefs run directly counter to what can be observed by the naked eye, even when the exercise of those beliefs would cause harm to those in the immediate vicinity.

    Like I said, skimming through to find the part which agrees with the argument you wanted to make anyway.

  44. 2 METHODS makes successful attacks unlikely. by Futurepower(R) · · Score: 1

    "You can come from both ends and "meet in the middle" of the cipher to gain advantage sometimes."

    My understanding, which may be mistaken, is that MITM attacks, or any kind of attacks, on data that has been encrypted with two or more encryption methods are unlikely to be successful. Since the patterns of encryption are different, finding coincidences is unlikely.

    I was unable to find good information. Can you tell me where to find useful research?

  45. leading to the next step by KingBenny · · Score: 1

    excuse me for not rtfa
    if you include several decodable messages into one encrypted one you get another layer of security but
    im sure even kaiser wilhelm knew about this in his day and age

    --
    Free speech was meant to be free for all... how can anyone grow up in a nanny state ?