Data scrambler knight tour algorithm
Nowadays, data scrambling remains a vital technique to protect sensitive information by shuffling it in a way that makes it difficult to decipher or reverse-engineer while still maintaining its usability for legitimate purposes. As manipulating the usability of the scrambled data remains a challenge...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | Ukrainian |
| Published: |
Igor Sikorsky Kyiv Polytechnic Institute
2024-09-01
|
| Series: | Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï |
| Subjects: | |
| Online Access: | http://journal.iasa.kpi.ua/article/view/315142 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846114472216756224 |
|---|---|
| author | Вадим Романюк Світлана Яремко Олена Кузьміна Анна Єгошина |
| author_facet | Вадим Романюк Світлана Яремко Олена Кузьміна Анна Єгошина |
| author_sort | Вадим Романюк |
| collection | DOAJ |
| description | Nowadays, data scrambling remains a vital technique to protect sensitive information by shuffling it in a way that makes it difficult to decipher or reverse-engineer while still maintaining its usability for legitimate purposes. As manipulating the usability of the scrambled data remains a challenge on the background of risking losing data and getting them re-identified by attackers, scrambling and descrambling should be accomplished faster by not increasing data loss and re-identification risks. A scrambling algorithm must have a linear time complexity, still shuffling the data to minimize the risks further. A promising approach is based on the knight open tour problem, whose solutions appear like a random series of knight positions. Hence, a knight open tour algorithm is formalized, by which the knight seems to move chaotically across the chessboard. The formalization is presented as an indented pseudocode to implement it efficiently, whichever programming language is used. The output is a square matrix representing the knight open tour. Based on the knight tour matrix, data scrambler and descrambler algorithms are presented in the same manner. The algorithms have a linear time complexity. The knight-tour scrambling has a sufficiently low guess probability if an appropriate depth of scrambling is used, where the data is re-scrambled repetitively. The scrambling depth is determined by repetitive application of the chessboard matrix, whose size usually increases as the scrambling is deepened. Compared to the pseudorandom shuffling of the data along with storing the shuffled indices, the knight-tour descrambling key is stored and sent far simpler yet ensures proper data security. |
| format | Article |
| id | doaj-art-c4852f2e43134cfdb67cb1217e6b245e |
| institution | Kabale University |
| issn | 1681-6048 2308-8893 |
| language | Ukrainian |
| publishDate | 2024-09-01 |
| publisher | Igor Sikorsky Kyiv Polytechnic Institute |
| record_format | Article |
| series | Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï |
| spelling | doaj-art-c4852f2e43134cfdb67cb1217e6b245e2024-12-20T12:28:57ZukrIgor Sikorsky Kyiv Polytechnic InstituteSistemnì Doslìdženâ ta Informacìjnì Tehnologìï1681-60482308-88932024-09-013446310.20535/SRIT.2308-8893.2024.3.03353702Data scrambler knight tour algorithmВадим Романюк0https://orcid.org/0000-0001-9638-9572Світлана Яремко1https://orcid.org/0000-0002-0605-9324Олена Кузьміна2https://orcid.org/0000-0002-0061-9933Анна Єгошина3https://orcid.org/0000-0002-2381-1231Vinnytsia Institute of Trade and Economics of State University of Trade and Economics, VinnytsiaVinnytsia Institute of Trade and Economics of State University of Trade and Economics, VinnytsiaVinnytsia Institute of Trade and Economics of State University of Trade and Economics, VinnytsiaNorthwestern Polytechnic, Grande PrairieNowadays, data scrambling remains a vital technique to protect sensitive information by shuffling it in a way that makes it difficult to decipher or reverse-engineer while still maintaining its usability for legitimate purposes. As manipulating the usability of the scrambled data remains a challenge on the background of risking losing data and getting them re-identified by attackers, scrambling and descrambling should be accomplished faster by not increasing data loss and re-identification risks. A scrambling algorithm must have a linear time complexity, still shuffling the data to minimize the risks further. A promising approach is based on the knight open tour problem, whose solutions appear like a random series of knight positions. Hence, a knight open tour algorithm is formalized, by which the knight seems to move chaotically across the chessboard. The formalization is presented as an indented pseudocode to implement it efficiently, whichever programming language is used. The output is a square matrix representing the knight open tour. Based on the knight tour matrix, data scrambler and descrambler algorithms are presented in the same manner. The algorithms have a linear time complexity. The knight-tour scrambling has a sufficiently low guess probability if an appropriate depth of scrambling is used, where the data is re-scrambled repetitively. The scrambling depth is determined by repetitive application of the chessboard matrix, whose size usually increases as the scrambling is deepened. Compared to the pseudorandom shuffling of the data along with storing the shuffled indices, the knight-tour descrambling key is stored and sent far simpler yet ensures proper data security.http://journal.iasa.kpi.ua/article/view/315142data scramblingknight open tour problemlinear time complexityguess probabilityscrambling depth |
| spellingShingle | Вадим Романюк Світлана Яремко Олена Кузьміна Анна Єгошина Data scrambler knight tour algorithm Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï data scrambling knight open tour problem linear time complexity guess probability scrambling depth |
| title | Data scrambler knight tour algorithm |
| title_full | Data scrambler knight tour algorithm |
| title_fullStr | Data scrambler knight tour algorithm |
| title_full_unstemmed | Data scrambler knight tour algorithm |
| title_short | Data scrambler knight tour algorithm |
| title_sort | data scrambler knight tour algorithm |
| topic | data scrambling knight open tour problem linear time complexity guess probability scrambling depth |
| url | http://journal.iasa.kpi.ua/article/view/315142 |
| work_keys_str_mv | AT vadimromanûk datascramblerknighttouralgorithm AT svítlanaâremko datascramblerknighttouralgorithm AT olenakuzʹmína datascramblerknighttouralgorithm AT annaêgošina datascramblerknighttouralgorithm |