A visibility-based lower bound for android unlock patterns
SCIE
SCOPUS
- Title
- A visibility-based lower bound for android unlock patterns
- Authors
- Lee, J.; Seo, J.; Cho, K.; Lee, P.J.; Yum, D.H.
- Date Issued
- 2017-03
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- 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.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/92125
- DOI
- 10.1587/transinf.2016EDL8196
- ISSN
- 1745-1361
- Article Type
- Article
- Citation
- Ieice Transactions on Information and Systems, vol. E100D, no. 3, page. 578 - 581, 2017-03
- Files in This Item:
-
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.