MadSci Network: Computer Science
Query:

Subject: why can't effective security access codes be relatively short ?

Date: Thu Apr 27 20:55:00 2000
Posted by No name entered.
Grade level: grad (non-science) School: No school entered.
City: No city entered. State/Province: No state entered. Country: No country entered.
Area of science: Computer Science
ID: 956886900.Cs
Message:

If access depends upon supplying the correct code in response to a prompt, 
why can't such codes be relatively short? If the access routine only 
permits repeat entry attempts at, say, 30 second intervals, a modest code 
that is easily breached with unlimited retries becomes effectively 
unbreakable. Processor speed would become irrelevant. Am I missing 
something here?


Re: why can't effective security access codes be relatively short ?

Current Queue | Current Queue for Computer Science | Computer Science archives

Try the links in the MadSci Library for more information on Computer Science.



MadSci Home | Information | Search | Random Knowledge Generator | MadSci Archives | Mad Library | MAD Labs | MAD FAQs | Ask a ? | Join Us! | Help Support MadSci


MadSci Network, webadmin@www.madsci.org
© 1995-2000. All rights reserved.