One Approach to Solving Tokenization Problem for Analysis of Large-Scale Collections of User-Defined Passwords
Bezopasnost informacionnyh tehnology · 2017
DOI: 10.26583/bit.2017.2.06 ↗At a glance
Journal article in Bezopasnost informacionnyh tehnology, 2017. Written by A. N. Kuznetsov and 1 co-authors.
Abstract (original language)
This paper performs an analysis of the algorithm of password tokenization introduced by R. Veras et al. [1]. We show main limitations of this approach and propose a new tokenization algorithm RGramToken, based on frequency dictionaries of English words, bigrams and trigrams. Our approach allows better utilization of information about probabilitiy distribution of words and word combinations in a natural language. The results of comparison analysis of these two algorithms on specially prepared tests with warped phrases demonstrate higher efficiency of RGramToken and its robustness on low quality dictionaries.
Cite
APA
Kuznetsov, A. N., & Vyshemirsky, D. A. (2017). One Approach to Solving Tokenization Problem for Analysis of Large-Scale Collections of User-Defined Passwords. Bezopasnost informacionnyh tehnology. https://doi.org/10.26583/bit.2017.2.06
Vancouver
Kuznetsov AN, Vyshemirsky DA. One Approach to Solving Tokenization Problem for Analysis of Large-Scale Collections of User-Defined Passwords. Bezopasnost informacionnyh tehnology. 2017. doi:10.26583/bit.2017.2.06
BibTeX
@article{Kuznetsov2017,
author = {Kuznetsov, A. N. and Vyshemirsky, D. A.},
title = {One Approach to Solving Tokenization Problem for Analysis of Large-Scale Collections of User-Defined Passwords},
journal = {Bezopasnost informacionnyh tehnology},
year = {2017},
doi = {10.26583/bit.2017.2.06}
}
EUVIMED