Персона: Борзунов, Георгий Иванович
Загружается...
Email Address
Birth Date
Научные группы
Организационные подразделения
Организационная единица
Институт интеллектуальных кибернетических систем
Цель ИИКС и стратегия развития - это подготовка кадров, способных противостоять современным угрозам и вызовам, обладающих знаниями и компетенциями в области кибернетики, информационной и финансовой безопасности для решения задач разработки базового программного обеспечения, повышения защищенности критически важных информационных систем и противодействия отмыванию денег, полученных преступным путем, и финансированию терроризма.
Статус
Фамилия
Борзунов
Имя
Георгий Иванович
Имя
3 results
Результаты поиска
Теперь показываю 1 - 3 из 3
- ПубликацияТолько метаданныеNew Approach in the Rainbow Tables Method for Human-Like Passwords(2020) Alpatskiy, M. A.; Borzunov, G. I.; Epishkina, A. V.; Kogos, K. G.; Борзунов, Георгий Иванович; Епишкина, Анна Васильевна; Когос, Константин Григорьевич© 2020 IEEE.This paper represents a new approach to rainbow tables, a method of password recovery that was originally developed by Martin E. Hellman and then improved by P. Oechslin, so most of its implementations use Oechslin's modification. An improvement represented in this work mostly lies in the reduction function, which uses character statistics to generate more human-like passwords. Though it generates passwords 5 to 10 times slower than reduction function, which uses direct dependency between hash bytes and the inserted characters, it significantly increases common efficiency in memory (8 to 30 times less memory needed to store these tables) and successful human-like passwords recovery probability, while these tables are generated by the same time as tables with the use of random reduction function.
- ПубликацияТолько метаданныеOverview of Lattice-Based Methods in Cryptanalysis(2020) Kupriyashin, M. A.; Slonkina, I. S.; Borzunov, G. I.; Куприяшин, Михаил Андреевич; Борзунов, Георгий Иванович© 2020 IEEE.In this paper, we give a short introduction to the hard lattice problems and application of corresponding methods in cryptanalysis. We provide several examples of specialized lattices we may use to solve certain instances of the related tasks, such as the Knapsack Problem or the Learning with Errors Problem. In this study, we pay special attention to using lattice-based cryptanalysis with asymmetric Knapsack-based cipher systems.
- ПубликацияТолько метаданныеStatistical Analysis of Binary Vector Enumeration Methods in Combinatorial Optimization(2020) Kupriyashina, N. A.; Kupriyashin, M. A.; Slonkina, I. S.; Borzunov, G. I.; Куприяшин, Михаил Андреевич; Борзунов, Георгий Иванович© 2020 IEEE.In this paper, we review and analyze the efficiency of several binary vector enumeration algorithms we have been using in our work on the Knapsack Problem. As we keep in mind the possibility of massively parallel computation, we are interested in algorithms that are able to start the search from any vector (identified by ordinal number). In this case, it is possible to implement static load balancing efficiently. Apart from the actual implementation performance, we study the load balancing diagrams for each of the algorithms. We assume that every bit of the binary vector is associated with some fixed amount of work a computer must do and examine the resulting complexity of subtasks obtained by splitting the vector sequences into subsequences.