Cited 1 time in webofscience Cited 1 time in scopus

A Visibility-Based Upper Bound for Android Unlock Patterns

Title
A Visibility-Based Upper Bound for Android Unlock Patterns
Authors
Lee, J[Lee, Jinwoo]Seo, J[Seo, Jae Woo]Cho, K[Cho, Kookrae]Lee, PJ[Lee, Pil Joong]Kim, J[Kim, Juneyeun]Choi, SH[Choi, Seung Hoon]Yum, DH[Yum, Dae Hyun]
DGIST Authors
Cho, K[Cho, Kookrae]
Issue Date
2016-11
Citation
IEICE Transactions on Information and Systems, E99D(11), 2814-2816
Type
Article
Article Type
Article
Keywords
Android Unlock PatternsGraphical PasswordUpper BoundUser Authentication
ISSN
1745-1361
Abstract
The Android pattern unlock is a popular graphical password scheme, where a user is presented a 3 × 3 grid and required to draw a pattern on the onscreen grid. Each pattern is a sequence of at least four contact points with some restrictions. Theoretically, the security level of unlock patterns is determined by the size of the pattern space. However, the number of possible patterns is only known for 3 × 3 and 4 × 4 grids, which was computed by brute-force enumeration. The only mathematical formula for the number of possible patterns is a permutation-based upper bound. In this article, we present an improved upper bound by counting the number of "visible" points that can be directly reached by a point. © 2016 The Institute of Electronics, Information and Communication Engineers.
URI
http://hdl.handle.net/20.500.11750/2159
DOI
10.1587/transinf.2016EDL8095
Publisher
Maruzen Co., Ltd.
Related Researcher
Files:
There are no files associated with this item.
Collection:
Companion Diagnostics and Medical Technology Research Group1. Journal Articles


qrcode mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE