| Gong L. Attacks in Cryptographic Protocols. In: Proceedings of IEEE INFOCOM '90. IEEE Computer Security Society Press, 1990 |
....constructed in a way that can be reproduced by an adversary. As a result in case of an exhaustive key search attack the adversary can use a restricted probable password key space instead of the much larger possible key space. For this reason attacks based on this flaw category are referred to [8] as dictionary attacks or as verifiable text attacks. The user supplied passwords could be rejected if they occur in a dictionary or consist of too few characters. The smallest allowable password size P size can be calculated [9] depending on the password alphabet size A size , the required ....
Gong L. Attacks in Cryptographic Protocols. In: Proceedings of IEEE INFOCOM '90. IEEE Computer Security Society Press, 1990
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC