Vitalii Vlasenko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Vitalii Vlasenko has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Andrii Samila
Yuriy Fedkovych Chernivtsi National University
2 shared publications - Ruslan Politanskyi
Yuriy Fedkovych Chernivtsi National University
2 shared publications - Ihor Tchaikovsky
Lviv Polytechnic National University
1 shared publication - Leonid Politanskyi
Yuriy Fedkovych Chernivtsi National University
1 shared publication - Oleh Krulikovskyi
Yuriy Fedkovych Chernivtsi National University
1 shared publication - Serhii Haliuk
Yuriy Fedkovych Chernivtsi National University
1 shared publication
Latest Publications
- 30 July 2024
- Published by Springer Nature
- p. 324-336
Using of Computer Vision with Stroboscopic Imaging in 5G
- 30 July 2024
- Published by Springer Nature
- p. 324-336
Using of Computer Vision with Stroboscopic Imaging in 5G
- 3 February 2023
- Published by Springer Nature
- p. 602-614
Investigation of High-Speed Methods for Determining the Equilibrium State of a Network Based on the Principle of Maximum Entropy
- 3 February 2023
- Published by Springer Nature
- p. 602-614
Investigation of High-Speed Methods for Determining the Equilibrium State of a Network Based on the Principle of Maximum Entropy
- Open Access
- 30 March 2020
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 10 (1) , 48-51
STUDYING THE PROPERTIES OF PIXELS PERMUTATIONS BASED ON DISCRETIZED STANDARD MAP
In this article, we described specifics of pixels permutations based on the discretized, two-dimensional Chirikov standard map. Some properties of the discretized Chirikov map can be used by an attacker to recover the original images that are studied. For images with dimensions N ´ N the vulnerability of permutations allows for brute force attacks, and shown is the ability of an intruder to restore the original image without setting the value of keys permutations. Presented is also, successful cryptographic attack on the encrypted image through permutation of pixels. It is found that for images with dimension N ´ N the maximum number of combinations is equal to NN-1. A modified Chirikov map was proposed with improved permutation properties, due to the use of two nonlinearities, that increase the keys space to N2!.
- 30 March 2020
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 10 (1) , 48-51
Open AccessSTUDYING THE PROPERTIES OF PIXELS PERMUTATIONS BASED ON DISCRETIZED STANDARD MAP
In this article, we described specifics of pixels permutations based on the discretized, two-dimensional Chirikov standard map. Some properties of the discretized Chirikov map can be used by an attacker to recover the original images that are studied. For images with dimensions N ´ N the vulnerability of permutations allows for brute force attacks, and shown is the ability of an intruder to restore the original image without setting the value of keys permutations. Presented is also, successful cryptographic attack on the encrypted image through permutation of pixels. It is found that for images with dimension N ´ N the maximum number of combinations is equal to NN-1. A modified Chirikov map was proposed with improved permutation properties, due to the use of two nonlinearities, that increase the keys space to N2!.