Перегляд за Автор "Yehoshyna, H. A."

Зараз показуємо 1 - 1 з 1
  • Ескіз
    ДокументВідкритий доступ
    Data scrambler knight tour algorithm
    (КПІ ім. Ігоря Сікорського, 2024) Romanuke, V. V.; Yaremko, S. A.; Kuzmina, O. M.; Yehoshyna, H. A.
    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 manipulat-ing 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 de-scrambling 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 lan-guage 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 pre-sented 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 scram-bling depth is determined by repetitive application of the chessboard matrix, whose size usually increases as the scrambling is deepened. Compared to the pseudoran-dom shuffling of the data along with storing the shuffled indices, the knight-tour de-scrambling key is stored and sent far simpler yet ensures proper data security.