ãã¹ã¯ã¼ãããªã·ã¼ã¨Robert Morrisã¨Ken Tompson
ã¨ããè¨äºãè¦ãã
ãã®è«æãç¯ããéã¡ã¯äºã¤ããããä¸ã¤ç®ã¯è¤æ°ã®æå種ï¼å°æåã大æåãæ°åãè¨å·ï¼ãå«ãããã¨ããã¹ã¯ã¼ãã®å®å ¨æ§ãé«ããã¨ãããã¹ã¯ã¼ãã®è¤éåã®æ¨å¥¨ã§ãç¾å®ã«ã¯ãp@sswordãããPassword1ãã¨ãã£ãæ¨æ¸¬ãããããã¿ã¼ã³ã¯ã»ãã¥ãªãã£åä¸ã«ã¯ã¤ãªãããªãã£ãã
äºã¤ç®ã¯ããã¹ã¯ã¼ããããã·ã¥åãã¦ä¿åããæ¹æ³ãææ¡ãããã¨ã§ãçµæçã«ããããç ç©¶è ã«ãããã¹ã¯ã¼ãã®å®æ 調æ»ãèããå°é£ã«ãã¦ãã¾ããçµæã¨ãã¦ããã¹ã¯ã¼ãã«é¢ããç¥è¦ã®èç©ãåæ»ãã¾ã£ãã
ã¨ãããã¨ãªã®ã§ãã»ãã¨ããªã¨æã£ã¦å è¨äºãªã©ã辿ã£ã¦ã¿ãã
å ã®Stuart Schechterã®è¨äºã¯こちら
1ã¤ç®ã®ãã¹ã¯ã¼ãã®æå種ã®è¤éåã«ã¤ãã¦ã¯ä»¥ä¸ã®ããã«è¨è¼ãã¦ããã
First, was Morris and Thompsonâs confidence that their solution, a password policy, would fix the underlying problem of weak passwords. They incorrectly assumed that if they prevented the specific categories of weakness that they had noted, that the result would be something strong. After implementing a requirement that password have multiple characters sets or more total characters, they wrote:
These improvements make it exceedingly difficult to find any individual password. The user is warned of the risks and if he cooperates, he is very safe indeed.
ã¾ããStuartã®è¨äºã§ã¯total charactersã¨æå種ã ãã§ãªãæåæ°ã«ã¤ãã¦ã触ãã¦ãããããã«å è«æã辿ãã¨these improvementsã¯ä»¥ä¸ãæãã¦ããã
The password entry program was modified so as to urge the user to use more obscure passwords. If the user enters an alphabetic password (all upper-case or all lower-case) shorter than six characters, or a password from a larger character set shorter than five characters, then the program asks him to enter a longer password. This further reduces the efficacy of key search.
çããã¹ã¯ã¼ããå ¥åããããæåæ°ãé·ãããããã«ä¾é ¼ãããããªããã°ã©ã ãæ¸ãã¨ãã話ã§ãããç¾è¡ã®NIST SP 800-63ãæ¨å¥¨ãã¦ãããã¹ã¯ã¼ãã¯8æå以ä¸ã«ããã¨ããã®ã¨åãæ¹åæ§ãã¨æãããã
ãã ããè«æå ¨ä½ã¨ãã¦æåæ°ãå¤ããæå種ãå¤ãããã®ãè¯ãããã«æ¸ããã¦ããã®ã確ãã§ãããããããåºæ¬çã«æå種ããã¹ã¯ã¼ãã®é·ãã«ãã£ã¦ç·å½ããæ»æã«æéããããã¨ãã話ããã¦ãããããèªä½ã¯äºå®ã§ããããã ãæå種ãå¼·å¶ãããã¨ã§å©ä¾¿æ§ãæªããªããã¨ãè¦ããããªãã¨ãããã¡ãªããã«å¯¾ãã¦ãããä¸åã广ãããã®ãã¨ããåé¡ããããNIST SP 800-63ã§ã¯å¦å®ããã¦ããã
2ã¤ç®ã®ãã¹ã¯ã¼ãã®ããã·ã¥åã«ã¤ãã¦ã ããã¾ãStuartã®è¨äºã§ãRobertã¨Kenãããã·ã¥æ¹å¼ãçºæããããã§ã¯ãªãã¨ææãã¦ãããUNIXã«å°å ¥ãããããããæ¨å¥¨ãããã¨ãåé¡ã¨ãã¦ããããã§ããã
While Morris and Thompson did not invent password hashing, they implemented it into Unix, strongly recommended it, and their paper would be the one most cited to support the necessity of password hashing.
ãã ããè«æã®ä¸ã§ææ¡ãã¦ããã®ã¯ãã½ã«ããä»ãã¦ç·å½ããæ»æã«å¯¾ããèæ§ãã¤ããã¹ãã¨ãã話ã§ããããã®è«æèªä½ããã¹ã¯ã¼ãã®ããã·ã¥åèªä½ã¨é¢ä¿æ§ãå¼·ããã¯çåãããã
ããã·ã¥åããªãã®ãªãã°ã©ãä¿åããã®ãã¨ããç¹ã«ã¤ãã¦ã¯ãStuartã¯å ¬é鵿¹å¼ã§æå·åããæ¹æ³ãææ¡ãã¦ããããã ã
With RSA, passwords could be hashed with a function that was one-way without the private key, and the private key stored on a system detached from any network and safely behind locks, guards, and whatever other physical security measures one might dream of. When scientists needed to test if password policies were working, they could take the file with the numeric hashes into the locked room with the key, analyze them, and leave with a new set of rules to try. Alas, to my knowledge, nobody has ever used this approach, because after Morris and Thompsonâs paper storing passwords in any form that can be reversed became taboo.
1æ¡ã¨ãã¦ã¯ãããããããªããã䏿¹åæ§ãæããéçºè ãã¦ã¼ã¶ã®ãã¹ã¯ã¼ããè¦ãã¦ãã¾ãã®ã¯åé¡ã ããããã¹ã¯ã¼ãã®å©ç¨ç¶æ³ãç ç©¶ã§ããã¡ãªããã¨ããã¹ã¯ã¼ããéçºè ãç ç©¶è ã«è¦ããã¦ãã¾ããããããªããã¡ãªãããæ¯è¼ããã¨ãä¸è¬ã®äººã¯ãã¡ãªããã®æ¹ã大ããè©ä¾¡ãããã§ããã