Tag Info

Hot answers tagged

429

I think the most important part of this comic, even if it were to get the math wrong (which it didn't), is visually emphasizing that there are two equally important aspects to selecting a strong password (or actually, a password policy, in general): Difficulty to guess Difficulty to remember Or, in other words: The computer aspect The human aspect ...


183

The two passwords, based on rumkin.com's password strength checker: Tr0ub4dor&3 Length: 11 Strength: Reasonable - This password is fairly secure cryptographically and skilled hackers may need some good computing power to crack it. (Depends greatly on implementation!) Entropy: 51.8 bits Charset Size: 72 characters and correct ...


175

Edit: there seems to lack a thorough explanation of the mathematics in this comic (at least not as detailed as it could be), so here it is. The little boxes in the comic represent entropy in a logarithmic scale, i.e. "bits". Each box means one extra bit of entropy. Entropy is a measure of the average cost of hitting the right password in a brute force ...


46

"Not considering brute force" - that's exactly what these tools measure. Obviously they dont try social engineering, or trying to discover if it's the user's first girlfriend's dog's birthday. The attacker might know that, but these tools don't. What they do measure is simply the difficulty for a bruteforcing tool to crack it. Not even the entropy of the ...


36

Microsoft already has done something like this with their product key alphabet. They selected a subset of characters that are distinctive, and excluded characters that could lead to either confusion or offensive words. The 24 used are: 2346789BCDFGHJKMPQRTVWXY The 12 unused are: 015AEILNOSUZ The hyphen character is used to separate five character groups, ...


35

I agree that length is often preferable to complexity. But I think the controversy is less around that, and more around how much entropy you want to have. The comic says that a "plausible attack" is 1000 guesses/second: "Plausible attack on a weak remote web service. Yes, cracking a stolen hash is faster, but it's not what the average user should ...


28

I think most of the answers here are missing the point. The final frame is talking about ease of memorization. correct horse battery staple (typed from memory!!) eliminates the fundamental danger of password security -- The Post-IT note. Using the first password, I've got a Post-IT note in my wallet (if I'm smart) or in my desk drawer (if I'm dumb) ...


26

Because, as LinkedIn and other recent password leakages reveal, still the most common passwords for websites are "password", "god", "123456", etc. So you can brute-force with really short list of most common passwords. Still, you can just ban those passwords, or require long password - as possible combinations grow exponentially with the length, and ...


25

I use a phrase. A proper phrase, with multiple words and spaces, but one I can easily remember. "My favourite month of the year is the 3rd!"


25

Ahem. Depending on what this password is to be used for, I would recommend a technique recommended even by crypto-great Bruce Schneier: Write it down. That's right - get yourself a REEAAAHEEELLYYY complex random password that you cannot remember, and WRITE IT DOWN. Of course, write it someplace safe, not attached to outside of your laptop that the ...


24

I like to use the Shift your fingers method. Take an easy passphrase like 'stackoverflow', move your fingers 1 character to right as you type and you get 'dysvlpbtg;pe' which is a lot harder to guess or crack. Although this works fairly well its best to add a few other twists to this like a memorable number and some special characters to make it a really ...


24

To add to Avid's excellent answer, the other key messages of the comic are: the appropriate way to calculate the entropy of a password generation algorithm is to calculate the entropy of its inputs, not to calculate the apparent entropy of its outputs (as rumkin.com, grc.com etc. do) minor algorithm variations such as "1337-5p34k" substitutions and ...


20

This XKCD comic describes a way to generate a good password. The quality of such passphrases has been discussed in : XKCD #936: Short complex password, or long dictionary passphrase?


20

No. A salt is simply supposed to be unique so that you can't use an attack (such as rainbow tables) that computes a password hash once and uses that result against multiple password hashes. If you're interested in making reversing the hash impossible without some secret knowledge, then append a site-specific password to the provided password (in addition to ...


18

I love xkcd and agree with his basic point -- passphrases are great for adding entropy, but think he low balled the entropy on the first password. Let's go through it: Random dictionary word. xkcd: 16 bits, Me: 16 bits. A random word from a dictionary with ~65000 words is lg(65000) ~ 16. Very reasonable Adding in capitalization. xkcd: 1 bit, Me: 0 ...


18

The issue is still, sadly, a human one. Will pushing users to alphanumeric + punctuation passwords be safer, or longer passwords? If you tell them to user alpha + numbers, they will write their name + birthday. If you tell them to use also use punctuation, they will replace an "a" with "@", or something similarly predictable. If you tell them "use four ...


17

Both OpenJDK and Sun read from /dev/urandom, not /dev/random, at least on the machine where I tested (OpenJDK JRE 6b27 and Sun JRE 6.26 on Debian squeeze amd64). For some reason, they both open /dev/random as well but never read from it. So the blog articles you read either were mistaken or applied to a different version from mine (and, apparently, yours). ...


16

Looking at the XKCD comic, and at examples of real world passwords, we see that most users have passwords much much weaker than the XKCD example. A bunch of users will do exactly as the first panel says - they'll take a dictionary word, capitalise the first letter, do some gentle substituting, then add a number and symbol to the end. That's quite bad, ...


16

Identical system images will generate different data when pulling from their randomness pool unless you're working a very sterile setup to move them along synchronously one clock cycle at a time. Activity in the system affects the randomness pool based on events including hardware interrupts. Reality says that disk drives, network cards, and the moment you ...


16

You wrote (emphasis mine): The higher the number of application-specific passwords the higher the chances are of a brute force attack succeeding. These passwords have a fixed length and don't contain numbers or symbols, which make them more susceptible to brute force attacks than a password with unknown length containing letters, numbers and ...


15

5 Diceware words = 77765 = 28430288029929701376 possible equiprobable passphrases. 9 random characters = 949 = 572994802228616704 possible equiprobable passwords. The 5 Diceware words are 49.617 times better than the 9 random characters. On the other hand, 10 random characters would be almost twice as good as the 5 Diceware words (but the Diceware words ...


15

"Entropy" is a measure of what some data element could have been. We say that we have n bits of entropy in a bunch of bits if those bits could have, collectively, assumed 2n distinct values with uniform probability (there is a whole lot of complexity which hides under the "uniform" term). To make a cryptographically secure PRNG, you have to: Gather enough ...


15

Reading bytes from a device can be troublesome (you have to account for syscall specificities, e.g. interrupted system calls) and can potentially be inefficient if reading many small chunks (a syscall has a non-negligible overhead). A custom software PRNG, seeded with bytes from /dev/urandom, gives more control over performance. (Also, there might be a bit ...


14

You're worried that because the passphrase uses dictionary words, it might be easier to crack than something that must be brute-forced. tl;dr: This is a valid theoretical worry, but right now it's not a practical concern. "I am going to have lunch tonight" is a five word phrase using words out of the most common 5000 in the English language. Naively, ...


14

Not sure can it be of any help to you, but once I managed to describe entropy to a child. After I said that entropy is a measure of chaos in system (to a group of people), a 12 (year more or less) year old said he doesn't understand me. I replied with - "Well, when your room is untidy, entropy is high. But when you clean your room, entropy is low - ...


14

It entirely depends on your attack model. A 16-character word is likely to resist brute-force, but might fail immediately against dictionary attacks. How do you define the strength of that password? There's no single answer. With the scheme you mentioned, a brute-force attack would be largely infeasible assuming your password is long enough. Even then, it's ...


14

Randall is mostly correct here. A few additions: Of course you have to choose the words randomly. The classic method is Diceware, which involves rolling 5d6, giving almost 13 bits of entropy per word, but the words are more obscure. There may be 2048 common words in English, but there aren't 2048 short common words in English. The Diceware list (which ...


14

Space reduction does occur, but not like that. Secure hash functions are supposed to behave like what a random function would do on average (i.e., a function chosen uniformly among the set of possible functions with the same input and output lengths). MD5 and SHA-1 are known not to be ultimately secure (because we can find collisions for them more ...


13

I take a line from a song I like, and then take the first letter from each word. This will most likely not exist in any password dictionary. Then, you can substitute special characters. For example, take Elvis Presley's Hound Dog: You ain't nothing but a hound dog, crying all the time This would become: yanbahd,catt Then, sprinkle in some special ...



Only top voted, non community-wiki answers of a minimum length are eligible