A Visibility-Based Lower Bound for Android Unlock Patterns
- Title
- A Visibility-Based Lower Bound for Android Unlock Patterns
- Author(s)
- Lee, Jinwoo ; Seo, Jae Woo ; Cho, Kookrae ; Lee, Pil Joong ; Yum, Dae Hyun
- Issued Date
- 2017-03
- Citation
- IEICE Transactions on Information and Systems, v.E100D, no.3, pp.578 - 581
- Type
- Article
- Author Keywords
- user authentication ; graphical password ; Android unlock patterns ; lower bound
- Keywords
- Android (Operating System) ; Android Unlock Patterns ; Authentication ; Brute Force ; Connecting Points ; Draw a Secrets ; Graphical Password ; Lower Bound ; Lower Boundandroid Unlock Patterns ; Lower Bounds ; Upper Bound ; User Authentication
- ISSN
- 1745-1361
- 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 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.
- Publisher
- Maruzen Co., Ltd.
- Related Researcher
-
-
Cho, Kookrae ABB연구부
- Research Interests
-
- Files in This Item:
-
There are no files associated with this item.
- Appears in Collections:
- Division of Electronics & Information System 1. Journal Articles
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.