dc.contributor.author | Helkala, Kirsi | |
dc.contributor.author | Snekkenes, Einar | |
dc.date.accessioned | 2009-09-08T11:18:02Z | |
dc.date.issued | 2009 | |
dc.identifier.citation | Journal of Computers, 2009, vol. 4, nr. 7, 663-669 p. | en |
dc.identifier.issn | 1796-203X | |
dc.identifier.uri | http://hdl.handle.net/11250/142478 | |
dc.description | Originally published in Journal of Computers: http://www.academypublisher.com/jcp/index.html | en |
dc.description.abstract | It is easy for humans to design passwords that are easily remembered. However, such passwords may have a predictable structure, making exhaustive search feasible. We have divided human-generated passwords into three categories: Non-word passwords, Mixture passwords, and Word passwords; depending on their overall structure. Within these categories, we have analyzed the search-space reduction of several common password sub-structures. From this analysis, we have derived guidelines that yield strong passwords within in each password category. Our results contribute towards the goal of achieving both strong and memorable passwords. | en |
dc.format.extent | 483631 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | en |
dc.publisher | Academy Publisher | en |
dc.relation.uri | http://academypublisher.com/jcp/vol04/no07/jcp0407663669.pdf | en |
dc.subject | password security | en |
dc.subject | password policy | en |
dc.subject | search space reduction | en |
dc.subject | personnel authentication | en |
dc.title | Password Generation and Search Space Reduction | en |
dc.type | Journal article | en |
dc.type | Peer reviewed | en |
dc.subject.nsi | VDP::Mathematics and natural science: 400::Information and communication science: 420::Security and vulnerability: 424 | en |
dc.source.pagenumber | 663-669 | en |
dc.source.volume | 4 | en |
dc.source.journal | Journal of Computers | en |
dc.source.issue | 7 | en |