An algorithm for approximate membership checking with application to password security
作者： Udi Manber , Sun Wu
DOI: 10.1016/0020-0190(94)00032-8
关键词: Password cracking 、 Salt (cryptography) 、 Password 、 Computer science 、 S/KEY 、 Approximate string matching 、 Zero-knowledge password proof 、 Theoretical computer science 、 One-time password 、 Password strength 、 Algorithm
摘要: Abstract Given a large set of words W , we want to be able determine quickly whether query word q is close any in the set. A new data structure presented that allows such queries answered very even for huge sets if are not too long and quite close. The major application limiting password guessing by verifying, before approved, dictionary word. Other applications include spelling correction bibliographic files approximate matching.
acm.org
core.ac.uk
elsevier.com
sci-hub.se 参考文章(6)
Eugene H. Spafford, Refereed articles: OPUS: Preventing weak password choices Computers & Security. ,vol. 11, pp. 273- 278 ,(1992) , 10.1016/0167-4048(92)90207-8
Pavel A. Pevzner, Michael S. Waterman, A Fast Filtration Algorithm for the Substring Matching Problem combinatorial pattern matching. pp. 197- 214 ,(1993) , 10.1007/BFB0029806
Sun Wu, Udi Manber, Fast text searching: allowing errors Communications of The ACM. ,vol. 35, pp. 83- 91 ,(1992) , 10.1145/135239.135244
Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors Communications of the ACM. ,vol. 13, pp. 422- 426 ,(1970) , 10.1145/362686.362692
Robert Morris, Ken Thompson, Password security Communications of the ACM. ,vol. 22, pp. 594- 597 ,(1979) , 10.1145/359168.359172
William Feller, An introduction to probability theory and its applications ,(1950)