DocumentCode
787245
Title
Connectionist password quality tester
Author
Duffy, Nigel ; Jagota, Arun
Author_Institution
Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA
Volume
14
Issue
4
fYear
2002
Firstpage
920
Lastpage
922
Abstract
Computer security has always been an issue, more so in recent years due to global network access. In this paper, we present a simple connectionist algorithm for testing the quality of computer passwords. A popular method of evaluating password quality is to test it against a large dictionary of words and near-words. Our algorithm is an approximate realization of this method. The large dictionary of words is stored in a network in distributed form. All stored words are stable; however, spurious memories may develop. Although there is no easy way to determine exactly which non-word strings become spurious, nor even exactly how many spurious memories form, numerical simulations reveal that the network works well in distinguishing words and near-words from structureless strings. Thus, to evaluate a password, one would present it to the network and, if the network labeled it a memory, the password would be considered bad
Keywords
Hopfield neural nets; authorisation; automatic test software; dictionaries; numerical analysis; quality control; string matching; Hopfield neural networks; approximate realization; computer security; connectionist algorithm; distributed word dictionary; edit distance; global network access; memory labelling; near-words; nonword strings; numerical simulations; password quality tester; spurious memories; stable stored words; string searching; structureless strings; Computer security; Dictionaries; Hopfield neural networks; Neural network hardware; Neural networks; Numerical simulation; Testing;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/TKDE.2002.1019222
Filename
1019222
Link To Document