Jan 27 2013, 12:53 PM
mar_heave, post: 84852, member: 1302 Wrote:perhaps changing passwords regularly is the most secure way?12 different accounts..12 different passwords. how to remember them all.
mar_heave, post: 84852, member: 1302 Wrote:perhaps changing passwords regularly is the most secure way?12 different accounts..12 different passwords. how to remember them all.
Spartacus, post: 84853, member: 1060 Wrote:12 different accounts..12 different passwords. how to remember them all.
Spartacus, post: 84853, member: 1060 Wrote:12 different accounts..12 different passwords. how to remem all.Chuck Norris remembers them all.
Spartacus, post: 84853, member: 1060 Wrote:12 different accounts..12 different passwords. how to remember them all.copy them to a notepad and a paper
George Of The Jungle, post: 84862, member: 3094 Wrote:Write them down?quite true . :p
All these complicated ways of choosing/storing passwords. You're not the director of the CIA, you're not important. You can choose the password 'ape', write it on a post-it and hang it on your screen and you'll still be fine.
I probably have about 30 accounts, the passwords are just written down on a piece of paper. Come steal it.
Internet has turned our brain to pulp?
Dr. Ruplayer, post: 84830, member: 9168 Wrote:Even though I did overrate middle class Russian cryptologists, look at this from this point of view, A is your site, B is your password, C, D, E, F, etc. are any additional sites, and C1,D1,E1,F1 are any additional passwords available. We have a formula (A:B) = (C:X) (where "x" is unknown) with a single password, very hard, but not impossible to find any additional password , and (A:B) = (C:C1) = (D:X)(where "x" is unknown) with 2 passwords available, makes it relatively easy task to do. Because A to B is parity to C to C1 and is parity to D to X.
And the only way not to get all your passwords unveiled is to generate them randomly with random characters, but you already mentioned in one of your early messages, that system is used.