A unit for unique sequence generating employed while personal data impersonalizing

DOI: 10.34759/trd-2020-115-13

Аuthors

Spevakov A. G.^*, Kaluckiy I. V.^**

South-Western State University, 94, 50-let Oktyabrya str., Kursk, 305040, Russia

*e-mail: aspev@yandex.ru
**e-mail: kaluckiy_igor@yandex.ru

Abstract

A problem of data impersonalizing occupies special place in automated information systems while data processing. Such methods and algorithms are employed to improve the system security and reduce material costs for information security tools purchasing. One of the tasks consists in developing specialized units that will allow increasing the speed of data conversion during impersonalizing. Such units can be employed not only in large data processing centers, but also in information systems with a small number of personal data subjects, but demanding data processing speed. This allows performance improvement, as well operating costs and product weight reduction. The purpose of this work consist in the speed increase of the unit for generating a unique sequence for personal data impersonalizing by parallel computing and FPGA based implementation. The problem solution of increasing the speed of forming a unique sequence for impersonalizing personal data is achieved by implementing a method and algorithm for data impersonalizing that allows their FPGA based implementation employing parallel computing. The developed unit novelty lies in the fact that a method for introducing identifiers using hashing critical data and a private key was proposed. This allows increasing the of data privacy level, bating requirements for the security level of the information system, and increasing the of data processing speed by convolving critical data into a hash identifier by parallel computing employing the developed specialized device. The results obtained consist in the development of a unit for generating a unique sequence used for personal data impersonalizing. This unit implements the proposed method. The experiments confirming the proposed mathematical model adequacy in comparison with the software implementation were conducted. The proposed device allowed increasing the speed of hash identifiers computing by more than a thousand times, with power consumption decrease by 11.7 times. The results of the experiment allow recommending the proposed unit for implementation in automated information systems for personal data processing at the design stage or optimization of existing systems. It will reduce the information protecting system cost. The authors propose the presented solution implementation in the form of a FPGA based unit, which will allow increasing speed and reducing operation costs.

Keywords:

data impersonalizing, hashing, conversion, high-speed unit

References

1. Rodichev Yu.A. Normativnaya baza i standarty v oblasti informatsionnoi bezopasnosti (Normative base and standards in the field of information security), Saint Petersburg, Izdatel’skii dom “Piter”, 2018, 255 p.

2. Sychev Yu.V. Standarty informatsionnoi bezopasnosti. Zashchita i obrabotka konfidentsial’nykh dokumentov (Standards of information security. Protection and processing of confidential documents), Saratov, Vuzovskoe obrazovanie, 2019, 223 p.

3. Bondarenko K.O., Kozlov V.A. Izvestiya YuFU. Tekhnicheskie nauki, 2015, no. 11 (172), pp. 130 – 142.

4. Trifonova Yu.V., Zharinov R.F. Doklady TUSUR, 2014, no. 2 (32), pp. 188 – 194.

5. Azhmukhamedov I.M., Demina R.Yu., Safarov I.V. Sovremennye problemy nauki i obrazovaniya, 2015, no. 1-1. URL: https://science-education.ru/ru/article/view?id=18610

6. Eliseev S.O., Kryukov D.A. Trudy MAI, 2018, no. 101. URL: http://trudymai.ru/eng/published.php?ID=97041

7. Glebov O.I. Trudy MAI, 2005, no. 18. URL: http://trudymai.ru/eng/published.php?ID=34190

8. Bertoni G., Daemen J., Peeters M., Van G. Keccak code package. URL: https://github.com/gvanas/KeccakCodePackageeng/

9. Huang S., Xu G., Wang M. et al. Conditional cube attack on reduced-round Keccak sponge function, Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, 2017, pp. 259 – 288. DOI: 10.1007/978-3-319-56614-6_9

10. Guo J., Liu M., Song L. Linear structures: Applications to cryptanalysis of round-reduced Keccak, International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, 2016, pp. 249 – 274. DOI: 10.1007/978-3-662-53887-6_9

11. 11 .Jeethu J., Karthika R., Nandakumar R. Design and characterization of SHA 3- 256 Bit IP core, International conference on emerging trends in engineering, science and technology, 2016, vol. 24, pp. 918 – 924. DOI: 10.1016/j.protcy.2016.05.184

12. Dinur I., Morawiecki P., Pieprzyk J. et al. Cube attacks and cube-attack-like cryptanalysis on the round-reduced Keccak sponge function, Eurocrypt: Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, 2015, pp. 733 – 761. DOI: 10.1007/978-3-662-46800-5_28

13. Spevakov A.G., Spevakova S.V., Primenko D.V. Method of data depersonalization in protected automated information systems, Radio Electronics, Computer Science, Control, 2020, no. 1, pp. 162 – 168. DOI: 10.15588/1607-3274-2020-1-16

14. Primenko D.V., Spevakov A.G., Spevakova S.V. Depersonalization of Personal Data in Information Systems, International Russian Automation Conference, Springer, Cham, 2019, pp. 763 – 770. DOI: 10.1007/978-3-030-39225-3_83

15. Nozdrina A.A., Spevakov A.G., Primenko D.V. Patent RF 2636106, MPK G06F 12/14, G06F 12/14, 04.07.2016.

16. Tanygin M.O. Izvestiya Yugo-Zapadnogo gosudarstvennogo universiteta, 2020, vol. 24, no. 1, pp. 175 – 188. DOI: 10.21869/2223-1560-2020-24-1-175-188

17. Tanygin M.O. Izvestiya vysshikh uchebnykh zavedenii. Priborostroenie, 2020, vol. 63, no. 8, pp. 702 – 710. DOI: 10.17586/0021-3454-2020-63-8-702-710

18. Khmara S.A., Nazarov A.V. Radiotekhnika, 2011, no. 49, pp. 59.

19. Simonov A.S., Semenov A.S., Makagon D.V. Trudy MAI, 2019, no. 108. URL: http://trudymai.ru/eng/published.php?ID=109525

20. Matafonov D.E. Trudy MAI, 2018, no. 103. URL: http://trudymai.ru/eng/published.php?ID=100780

Download