IEICE TRANSACTIONS on Information
A Visibility-Based Lower Bound for Android Unlock Patterns
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E100-D No.3 pp.578-581
- Publication Date
- 2017/03/01
- Publicized
- 2016/12/01
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2016EDL8196
- Type of Manuscript
- LETTER
- Category
- Information Network
Authors
Jinwoo LEE
POSTECH
Jae Woo SEO
Samsung Electronics Co.
Kookrae CHO
DGIST
Pil Joong LEE
POSTECH
Dae Hyun YUM
Myongji University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jinwoo LEE, Jae Woo SEO, Kookrae CHO, Pil Joong LEE, Dae Hyun YUM, "A Visibility-Based Lower Bound for Android Unlock Patterns" in IEICE TRANSACTIONS on Information,
vol. E100-D, no. 3, pp. 578-581, March 2017, doi: 10.1587/transinf.2016EDL8196.
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016EDL8196/_p
Copy
@ARTICLE{e100-d_3_578,
author={Jinwoo LEE, Jae Woo SEO, Kookrae CHO, Pil Joong LEE, Dae Hyun YUM, },
journal={IEICE TRANSACTIONS on Information},
title={A Visibility-Based Lower Bound for Android Unlock Patterns},
year={2017},
volume={E100-D},
number={3},
pages={578-581},
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.},
keywords={},
doi={10.1587/transinf.2016EDL8196},
ISSN={1745-1361},
month={March},}
Copy
TY - JOUR
TI - A Visibility-Based Lower Bound for Android Unlock Patterns
T2 - IEICE TRANSACTIONS on Information
SP - 578
EP - 581
AU - Jinwoo LEE
AU - Jae Woo SEO
AU - Kookrae CHO
AU - Pil Joong LEE
AU - Dae Hyun YUM
PY - 2017
DO - 10.1587/transinf.2016EDL8196
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E100-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2017
AB - 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.
ER -
English
