|
I used to keep mine, hand-written, on a scrappy piece of paper in my desk drawer
|
|
|
|
|
You work for the government, don't you? 
|
|
|
|
|
Oh, yeah. Always an adventure.
|
|
|
|
|
He hasn't said what password system this is though.
|
|
|
|
|
An encrypted password is as bad as a plaintext one.
Bastard Programmer from Hell 
If you can't read my code, try converting it here[^]
|
|
|
|
|
Eddy Vluggen wrote: An encrypted password is as bad as a plaintext one.
Agreed.
Also any memorized password has an inherent weakness in that it can be (and has been) memorized by a human. Passwords should be so strong that they cannot be memorized. It's possible.
|
|
|
|
|
Without memorization, you'd need to keep a clear-text version around. I don't think it is possible to extract it from my mind, so feels rather secure there.
The fact that something can be memorized does not make it a weak password.
Bastard Programmer from Hell
If you can't read my code, try converting it here[^]
|
|
|
|
|
Hyperbole is my favorite of all inventions and must be implemented at all times.
The point is that when you use a mnemonic then it is based upon words.
Words are patterns and patterns can be more easily cracked than non-patterns.
What you need is a fully randomized pattern which is strong and less crackable than a weak pattern that you've memorized. Your password itself should be a hash which is so long you cannot memorize it. (Which is hyperbole also, since Daniel Tammet memorized 22,514 digits of pi and recited them[^]).
|
|
|
|
|
raddevus wrote: What you need is a fully randomized pattern which is strong and less crackable than a weak pattern that you've memorized.
Again, that idea is wrong. A non-memorizable password needs to be stored.
Yes, words are patterns, but that knowledge isn't going to help much in determining my password. I'll give you another clue; it is based on a single line of a poem, 33 characters.
Bastard Programmer from Hell
If you can't read my code, try converting it here[^]
|
|
|
|
|
Eddy Vluggen wrote: Again, that idea is wrong.
Brrrr....there's a cold wind a blowin'. "Wrong" is such a cold harsh word. It makes me feel like I might not be right. 
Actually, there is a way to generate a strong password without storing it and without having the user memorize a word-based mnemonic.
And, I'm guessing that your poem is Milton's Paradise Lost, right?
Here's all of Shakespeare's sonnets first lines so I'm generating your password off of these now:
Shakespeare's Sonnets- first lines[^] 
|
|
|
|
|
raddevus wrote: Actually, there is a way to generate a strong password without storing it and without having the user memorize a word-based mnemonic
You got a long string that you did not memorize and did not store - in that case, I will start to doubt your ability to produce the same string again. That is something that is kinda required to be used as a password.
raddevus wrote: Here's all of Shakespeare's sonnets first lines
Not a fan of Shakespeare.
So, you already know the length of the string, the pattern, and are assuming English language (yes, it is an English writer, but that does not mean the password has to be). How many possible combinations would there be?
xkcd: Password Strength[^]
Bastard Programmer from Hell
If you can't read my code, try converting it here[^]
|
|
|
|
|
I think this could go alongside Godwin's Law - the longer an on-line debate about passwords continues, the probability of someone linking to xkcd 936 approaches certainty.
Won't somebody think of the horses (and staples)?
|
|
|
|
|
Stewart Judson wrote: the longer an on-line debate about passwords continues, the probability of someone linking to xkcd 936 approaches certainty.
It's an absolute certainty of the most high probability. 
It really is true.
|
|
|
|
|
Stewart Judson wrote: I think this could go alongside Godwin's Law
A Godwin is not a valid argument, but the comic explains an argument in simple terms. So yes, it is bound to be referenced. Now, if any popular reference is a Godwin, then we might better stop using them, starting with the academics.
Bastard Programmer from Hell 
If you can't read my code, try converting it here[^]
|
|
|
|
|
I think this could go alongside Godwin's Law - the longer an on-line debate about passwords continues, the probability of someone linking to xkcd 936 approaches certainty.
...which of course increases the probability of someone linking to xkcd 261[^]
|
|
|
|
|
It should be stored as a hash, not encrypted. A hash is one way. I.e. Not able to be decrypted
|
|
|
|
|
LDAP has no password policy option for similarity, so it is probably an overlay and it may DO store the password in some comparable form...
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
To compare similarity between passwords means that the comparable form must be 1:1 with the plain text form, so basically a weak character-by-character encription. Scary.
GCS d--- s-/++ a- C++++ U+++ P- L- E-- W++ N++ o+ K- w+++ O? M-- V? PS+ PE- Y+ PGP t++ 5? X R++ tv-- b+ DI+++ D++ G e++>+++ h--- ++>+++ y+++* Weapons extension: ma- k++ F+2 X
If you think 'goto' is evil, try writing an Assembly program without JMP. -- TNCaver
When I was six, there were no ones and zeroes - only zeroes. And not all of them worked. -- Ravi Bhavnani
|
|
|
|
|
Couldn't it depend on the encryption? I haven't tested it, but if you encrypt two very similar passwords using the same algoritm, could it be possible that the two encrypted passwords also were quite similar (and perhaps even comparable)? 
Anything that is unrelated to elephants is irrelephant
Anonymous
-
The problem with quotes on the internet is that you can never tell if they're genuine
Winston Churchill, 1944
-
I'd just like a chance to prove that money can't make me happy.
Me, all the time
|
|
|
|
|
If an encryption would produce the same output for the same input it would be useless...(breakable in seconds)
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
Perhaps - just an idea... 
Anything that is unrelated to elephants is irrelephant
Anonymous
-
The problem with quotes on the internet is that you can never tell if they're genuine
Winston Churchill, 1944
-
I'd just like a chance to prove that money can't make me happy.
Me, all the time
|
|
|
|
|
To compare similarity between passwords you need to know:
1) The characters which are present in the password;
2) The sequence of such characters.
Whcih amounts to knowing the password itself, even if a mangled version.
GCS d--- s-/++ a- C++++ U+++ P- L- E-- W++ N++ o+ K- w+++ O? M-- V? PS+ PE- Y+ PGP t++ 5? X R++ tv-- b+ DI+++ D++ G e++>+++ h--- ++>+++ y+++* Weapons extension: ma- k++ F+2 X
If you think 'goto' is evil, try writing an Assembly program without JMP. -- TNCaver
When I was six, there were no ones and zeroes - only zeroes. And not all of them worked. -- Ravi Bhavnani
|
|
|
|
|
Well, not necessarily. If the encryption worked like this (just an example of course):
Pass1word => #¤%"AsdfY2g&Po*qQs
Pass2word => #¤%"Asdf7Xg&Po*qQs
it would still be comparable even encrypted... You only need to know how much that is changed - not WHAT EXACTLY is changed... 
Anything that is unrelated to elephants is irrelephant
Anonymous
-
The problem with quotes on the internet is that you can never tell if they're genuine
Winston Churchill, 1944
-
I'd just like a chance to prove that money can't make me happy.
Me, all the time
|
|
|
|
|
The idea you are talking about would be more of an encoding instead of an encryption.
Compare Base64 encoding to AES encryption, for example.
Any modern and accepted cryptographic algorithm will operate on bits, not bytes.
But, alas, many-a-programmer has thought s/he has written an encryption algorithm and accidentally created an encoding algorithm without noticing and marked him/herself as a genius of encryption. 
|
|
|
|
|
From OpenLDAP Software 2.4 Administrator's Guide: Security Considerations[^]:
Quote: LDAP passwords are normally stored in the userPassword attribute. RFC4519 specifies that passwords are not stored in encrypted (or hashed) form. This allows a wide range of password-based authentication mechanisms, such as DIGEST-MD5 to be used. This is also the most interoperable storage scheme.
However, it may be desirable to store a hash of password instead.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
