STUDYING THE PROPERTIES OF PIXELS PERMUTATIONS BASED ON DISCRETIZED STANDARD MAP
| Autor: | Vitalii Vlasenko, Serhii Haliuk, Oleh Krulikovskyi |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Computer science
key space ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Encryption 01 natural sciences 010305 fluids & plasmas Image (mathematics) Permutation Brute-force attack Dimension (vector space) permutation of pixels Computer Science::Multimedia 0103 physical sciences lcsh:TA170-171 010301 acoustics lcsh:Environmental sciences Computer Science::Cryptography and Security lcsh:GE1-350 precision of computing Pixel business.industry Key space Standard map lcsh:Environmental engineering Computer Science::Computer Vision and Pattern Recognition discretized standard map business Algorithm |
| Zdroj: | Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska, Vol 10, Iss 1 (2020) |
| ISSN: | 2391-6761 2083-0157 |
| DOI: | 10.35784/iapgos.907 |
| Popis: | 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!. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|