2013/02/11 by Ľubica Staneková, Lubica Staneková, Staneková, Lubica +3
Computer Science · Engineering · Mathematics · #Arithmetic #Artificial intelligence #Authentication (law) #Authorship Attribution and Profiling #Computer science #Computer security #Cryptography and Security (cs.CR) #Engineering #Entropy (arrow of time) #FOS: Computer and information sciences #Ideal (ethics) #Identification (biology) #Mathematics #Memorization #Natural language processing #Speech Recognition and Synthesis #Task (project management) #User Authentication and Security Systems #cs.CR
paper · pdf · doi:10.48550/arxiv.1302.2656
published in arXiv (Cornell University) (Cornell University) · 13 pages
arxiv created 2013/02/11 · openalex publication_date 2013/02/11 · arxiv updated 2013/02/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
Personal Identification Numbers (PINs) are commonly used as an authentication mechanism. An important security requirement is that PINs should be hard to guess for an attacker. On the other hand, remembering several random PINs can be difficult task for an individual. We evaluate several dictionary-based methods of choosing a PIN. We experimentally show that these methods are far from ideal with respect to expected covering of the PIN space and the entropy of PINs. We also discuss two methods for constructing easy to memorize PIN words for randomly chosen PINs.