Stability of password authentication in infocommunication networks
The article discusses distributed infocommunication networks, in which the interaction of users, application servers and databases is carried out. When accessing an infocommunication network, the first procedure is to authenticate the agents through their authentication by password mechanism. It is...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2020-09-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/1071 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832543483813953536 |
|---|---|
| author | M. N. Bobov A. V. Kurylovich |
| author_facet | M. N. Bobov A. V. Kurylovich |
| author_sort | M. N. Bobov |
| collection | DOAJ |
| description | The article discusses distributed infocommunication networks, in which the interaction of users, application servers and databases is carried out. When accessing an infocommunication network, the first procedure is to authenticate the agents through their authentication by password mechanism. It is shown that for social networks with a large number of users, widely used assessment of the security of password systems based on the calculation of the determination probability is not sufficient. The probability of the same passwords for two users with a password length of 6, 7 and 8 characters with alphabet size of 36, 42 and 57 characters and the number of users no more than 10 million is shown. An assessment of the strength of password authentication systems for info-communication networks based on the "birthday paradox" criterion is given. It has been determined that well-known social networks with a number of users comparable to the number of passwords used are not resistant to "birthday attacks". It is shown that for such systems the resistance of the password system to cracking should be assessed by m=An/2 criterion. |
| format | Article |
| id | doaj-art-2e95ae700ff74cd2a105b806a7154ad9 |
| institution | Kabale University |
| issn | 1816-0301 |
| language | Russian |
| publishDate | 2020-09-01 |
| publisher | National Academy of Sciences of Belarus, the United Institute of Informatics Problems |
| record_format | Article |
| series | Informatika |
| spelling | doaj-art-2e95ae700ff74cd2a105b806a7154ad92025-02-03T11:40:29ZrusNational Academy of Sciences of Belarus, the United Institute of Informatics ProblemsInformatika1816-03012020-09-01173647110.37661/1816-0301-2020-17-3-64-71940Stability of password authentication in infocommunication networksM. N. Bobov0A. V. Kurylovich1Belarusian State University of Informatics and RadioelectronicsBelarusian State University of Informatics and RadioelectronicsThe article discusses distributed infocommunication networks, in which the interaction of users, application servers and databases is carried out. When accessing an infocommunication network, the first procedure is to authenticate the agents through their authentication by password mechanism. It is shown that for social networks with a large number of users, widely used assessment of the security of password systems based on the calculation of the determination probability is not sufficient. The probability of the same passwords for two users with a password length of 6, 7 and 8 characters with alphabet size of 36, 42 and 57 characters and the number of users no more than 10 million is shown. An assessment of the strength of password authentication systems for info-communication networks based on the "birthday paradox" criterion is given. It has been determined that well-known social networks with a number of users comparable to the number of passwords used are not resistant to "birthday attacks". It is shown that for such systems the resistance of the password system to cracking should be assessed by m=An/2 criterion.https://inf.grid.by/jour/article/view/1071password authenticationpassword system stabilityinfocommunication networksremote accessthe "birthday paradox"networks strength criteria of password authentication |
| spellingShingle | M. N. Bobov A. V. Kurylovich Stability of password authentication in infocommunication networks Informatika password authentication password system stability infocommunication networks remote access the "birthday paradox" networks strength criteria of password authentication |
| title | Stability of password authentication in infocommunication networks |
| title_full | Stability of password authentication in infocommunication networks |
| title_fullStr | Stability of password authentication in infocommunication networks |
| title_full_unstemmed | Stability of password authentication in infocommunication networks |
| title_short | Stability of password authentication in infocommunication networks |
| title_sort | stability of password authentication in infocommunication networks |
| topic | password authentication password system stability infocommunication networks remote access the "birthday paradox" networks strength criteria of password authentication |
| url | https://inf.grid.by/jour/article/view/1071 |
| work_keys_str_mv | AT mnbobov stabilityofpasswordauthenticationininfocommunicationnetworks AT avkurylovich stabilityofpasswordauthenticationininfocommunicationnetworks |