Keyspace Analysis - Incidence Matrix
These matrices show the complete keyspaces given specified character sets
and rules of character set inclusion. Keys are of length two to six, with
inclusion rules of zero, one, two, three, or four for each length. Character
sets are limited to allow easy example; a realistic password assessment would
involve lengths of eight characters with character sets A-Z, a-z, 0-9, and
all special characters.
|
Character sets
|
|
Set One | A B C D |
| Set Two | a b c d |
| Set Three | 0 1 2 |
| Set Four | % ^ & * ( ) |
- Two character key, zero member inclusion requirement
- Two character key, two member inclusion requirement
- Three character key, zero member inclusion requirement
- Three character key, two member inclusion requirement
- Three character key, three member inclusion requirement
- Four character key, zero member inclusion requirement
- Four character key, two member inclusion requirement
- Four character key, three member inclusion requirement
- Four character key, four member inclusion requirement
- Five character key, zero member inclusion requirement
- Five character key, two member inclusion requirement
- Five character key, three member inclusion requirement
- Five character key, four member inclusion requirement
- Six character key, zero member inclusion requirement
- Six character key, two member inclusion requirement
- Six character key, three member inclusion requirement
- Six character key, four member inclusion requirement
© 2003, Andrew Seely.
http://www.sonador.com/arseely/
arseely@sonador.com