Cited 0 time in
Cited 0 time in
A Visibility-Based Lower Bound for Android Unlock Patterns
- A Visibility-Based Lower Bound for Android Unlock Patterns
- Lee, Jinwoo; Seo, Jae Woo; Cho, Kookrae; Lee, Pil Joong; Yum, Dae Hyun
- DGIST Authors
- Cho, Kookrae
- Issue Date
- IEICE Transactions on Information and Systems, E100D(3), 578-581
- Article Type
- Android (Operating System); Android Unlock Patterns; Authentication; Brute Force; Connecting Points; Draw a Secrets; Graphical Password; Graphical Password; Lower Bound; Lower Boundandroid Unlock Patterns; Lower Bounds; Upper Bound; User Authentication; User Authentication
- 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 3×3 and 4×4 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. © 2017 The Institute of Electronics, Information and Communication Engineers.
- Maruzen Co., Ltd.
- Related Researcher
There are no files associated with this item.
- Companion Diagnostics and Medical Technology Research Group1. Journal Articles
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.