Name
Abstract | ||
|---|---|---|
The Android pattern unlock is a widely adopted graphical password system that requires a user to draw a secret pattern connecting points arranged in a grid. The theoretical security of pattern unlock can be defined by the number of possible patterns. However, only upper bounds of the number of patterns have been known except for 3x3 and 4x4 grids for which the exact number of patterns was found by brute-force enumeration. In this letter, we present the first lower bound by computing the minimum number of visible points from each point in various subgrids. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1587/transinf.2016EDL8196 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
user authentication, graphical password, Android unlock patterns, lower bound | Visibility,World Wide Web,Android (operating system),Upper and lower bounds,Computer security,Computer science | Journal |
Volume | Issue | ISSN |
E100D | 3 | 1745-1361 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin-Woo Lee | 1 | 226 | 31.85 |
| Jae Woo Seo | 2 | 0 | 0.34 |
| Kookrae Cho | 3 | 11 | 2.61 |
| Pil Joong Lee | 4 | 1039 | 103.09 |
| Dae Hyun Yum | 5 | 315 | 24.95 |