How do I choose such a password in practice, and specifically: what is the entropy of pwgen or Mac Password Assistant (MPA)? For example: what if the MPA has a very small database of words and generates passwords predictably? Perhaps this is a bit pedantic on my part, but I was curious if anyone could shed some light on this. Update: Thanks for the insight on theoretical password entropy and memorability, but I was also looking for the practical aspect of generating these passwords. Mac Password Assistant - generates memorable passwords but it is unclear to me how this works.pwgen - seems ok, but passwords are not too memorable.Of course a long password should help in this case, but if the `memorable' part of the program is too predictable, your passwords are not very good in the end. Whenever a program generates a memorable password, it only uses a subset of the total password space available, and it is not clear to me how big this space is. Using The xkcd random number generator is probably pretty bad, cat /dev/random is probably pretty good, but generating memorable passwords seems a bit more tricky. Whenever I need new passwords I use some tools to generate those, preferable memorable passwords, but I've been wondering how secure this might actually be. TL DR: how secure are memorable password generators, given the fact that `memorable' passwords are a subset of total password space? How big is the entropy in memorable passwords compared to random passwords?
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |