By Topic

Connectionist password quality tester

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Duffy, N. ; Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA ; Jagota, A.

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

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:14 ,  Issue: 4 )